default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 15
Volume 15, Number 1, 19 August 1982
- Fabrizio Luccio, Linda Pagli
:
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. 1-4 - Wojciech Rytter:
A Note on Two-Way Nondeterministic Pushdown Automata. 5-9 - Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Tables of Large Graphs with Given Degree and Diameter. 10-13 - Larry J. Stockmeyer, Vijay V. Vazirani:
NP-Completeness of Some Generalizations of the Maximum Matching Problem. 14-19 - Coenraad Bron, E. J. Dijkstra, S. Doaitse Swierstra:
A Memory-Management Unit for the Optimal Exploitation of a Small Address Space. 20-22 - Clement H. C. Leung:
Optimal Database Reorganisation: Some Practical Difficulties. 23-27 - Maciej M. Syslo:
A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph. 28-30 - Albert G. Greenberg, Richard E. Ladner, Mike Paterson, Zvi Galil:
Efficient Parallel Algorithms for Linear Recurrence Computation. 31-35 - Peter M. Winkler:
On Computability of the Mean Deviation. 36-38 - Karel Culík II, Derick Wood:
A Note on Some Tree Similarity Measures. 39-42 - Leon S. Levy:
An Improved List-Searching Algorithm. 43-45
Volume 15, Number 2, 16 September 1982
- Glenn K. Manacher:
Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM. 47-52 - Caroline M. Eastman, Maria Zemankova:
Partially Specified Nearest Neighbor Searches Using k-d Trees. 53-56 - Jean-Pierre Jouannaud, Pierre Lescanne:
On Multiset Orderings. 57-63 - Timothy R. Walsh:
The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves. 64-67 - Michael G. Main:
Permutations Are Not Context-Free: An Application of the Interchange Lemma. 68-71 - Allen Goldberg, Paul Walton Purdom Jr., Cynthia A. Brown:
Average Time Analyses of Simplified Davis-Putnam Procedures. 72-75 - Leon Lukaszewicz:
Universal Grammars. 76-80 - Ingo Wegener:
Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic. 81-83 - José L. Balcázar, Josep Díaz:
A Note on a Theorem by Ladner. 84-86 - Amir Schorr:
Fast Algorithm for Sparse Matrix Multiplication. 87-89
Volume 15, Number 3, 11 October 1982
- Michael Spyratos:
A Homomorphism Theorem for Data Base Mappings. 91-96 - Anton Nijholt:
On the Relationship Between the LL(k) and LR(k) Grammars. 97-101 - Wojciech Rytter:
Time Complexity of Unambiguous Path Systems. 102-104 - P. G. Reddy, Subhash Bhalla, Bandreddi E. Prasad:
Robust, Centralized Certifier Based Concurrency Control for Distributed Databases. 105-110 - Waldemar Korczynski, Józef Winkowski:
A Communication Concept for Distributed Systems. 111-114 - To-Yat Cheung:
A Statistical Model for Estimating the Number of Records in a Relational Database. 115-118 - Teofilo F. Gonzalez, Donald B. Johnson:
Sorting Numbers in Linear Expected Time and Optimal Extra Space. 119-124 - Hiroshi Imai:
Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. 125-128 - Edsger W. Dijkstra, A. J. M. van Gasteren:
An Introduction to Three Algorithms for Sorting in Situ. 129-134 - Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter:
A Probabilistic Algorithm for Vertex Connectivity of Graphs. 135-136
Volume 15, Number 4, 31 October 1982
- F. Lockwood Morris:
Another Compacting Garbage Collector. 139-142 - Jan A. Bergstra, John V. Tucker:
Two Theorems About the Completeness of Hoare's Logic. 143-149 - Jan Maluszynski, Jørgen Fischer Nilsson:
Grammatical Unification. 150-158 - Andrzej Wlodzimierz Mostowski:
Determinancy of Sinking Automata on Infinite Trees and Inequalities Between Various Rabin's Pair Indices. 159-163 - Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
A Note on Alternating On-Line Turing Machines. 164-168 - Mamoru Hoshi, Toshitsugu Yuba:
A Counter Example to a Monotonicity Property of k-d Trees. 169-173 - Stefano Ceri, Giuseppe Pelagatti:
A Solution Method for the Non-Additive Resource Allocation Problem in Distributed System Design. 174-178 - L. Goh, Doron Rotem:
Recognition of Perfect Elimination Bipartite Graphs. 179-182 - Micha Sharir:
Fast Composition of Sparse Maps. 183-185 - Peter J. Slater:
A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree. 186-188
Volume 15, Number 5, 10 December 1982
- Timo Leipälä:
On Optimal Multilevel Indexed Sequential Files. 191-195 - Peter T. Highnam:
The Aars of a Polygon. 196-198 - Andrzej Szepietowski:
A Finite 5-Pebble-Automaton Can Search Every Maze. 199-204 - Lutz M. Wegner:
Sorting a Linked List with Equal Keys. 205-208 - George S. Lueker, Dan E. Willard:
A Data Structure for Dynamic Range Queries. 209-213 - Tatsuya Motoki:
A Note on Upper Bounds for the Selection Problem. 214-219 - Harry R. Lewis, Richard Statman:
Unifiability is Complete for co-NLogSpace. 220-222 - Patrick Shen-Pei Wang:
A New Hierarchy of Two-Dimensional Array Languages. 223-226 - Markku Tamminen:
Extendible Hashing with Overflow. 227-232 - Quentin F. Stout:
Drawing Straight Lines with a Pyramid Cellular Automaton. 233-237 - Arthur M. Farley, Andrzej Proskurowski:
Directed Maximal-Cut Problems. 238-241
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-03 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
