default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 10
Volume 10, Number 1, 12 February 1980
- Michael J. C. Gordon:
The Denotational Semantics of Sequential Machines. 1-3 - Henk Olivié:
On the Relationship Between SonTtrees and Symmetric Binary B-Trees. 4-8 - Victor J. Rayward-Smith, R. N. Rolph:
Finding Linear and Circular Sequences of Minimal and Maximal Total Adjacency. 9-13 - Peter Honeyman, Richard E. Ladner
, Mihalis Yannakakis:
Testing the Universal Instance Assumption. 14-19 - Ashoke Deb:
Conflict-Free Access of Arrays - A Counter Example. 20 - Miroslaw Truszczynski:
Once More on Storage for Consecutive Retrieval. 21-24 - Leslie M. Goldschlager:
A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem. 25-27 - Errol L. Lloyd:
List Scheduling Bounds for UET Systems With Resources. 28-31 - Carlo Zaniolo:
Mixed Transitivity for Functional and Multivalued Dependencies in Database Relations. 32-34 - Thang Nguyen Bui:
A Note on an Improved Bisection Algorithm. 35-36 - Daniel Dominic Sleator:
A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. 37-40 - Dilip V. Sarwate:
A Note on Universal Classes of Hash Functions. 41-45
Volume 10, Number 2, 18 March 1980
- Bruce Anderson:
Encoded pointers - An Interesting DataSstructure for Modern Sil's. 47-50 - Jan van Leeuwen, Derick Wood:
Dynamization of Decomposable Searching Problems. 51-56 - Viktor K. Sabelfeld:
The Logic-Termal Equivalence is Polynomial-Time Decidable. 57-62 - Solomon Passy:
Structured Programs for Turing Machines. 63-67 - Thomas C. Wilson, Joseph Shortt:
An O(log n) Algorithm for Computing General Order-k Fibonacci Numbers. 68-75 - Frank M. Liang:
A Lower Bound for On-Line Bin Packing. 76-79 - Manuel Blum, Ashok K. Chandra, Mark N. Wegman:
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. 80-82 - Paul M. B. Vitányi:
Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations. 83-86 - Nicola Santoro:
Extending the Four Russians' Bound to General Matrix Multiplication. 87-88 - Hanan Samet, Leo Marcus:
Purging in an Equality Data Base. 89-95 - Mordechai Ben-Ari:
A Simplified Proof That Regular Resolution is Exponential. 96-98 - Alexandre Brandwajn, René Joly:
A Scheme for Fault-Tolerant Virtual Memory. 99-103 - Frank G. Pagan:
On the Generation of Compilers from Language Definitions. 104-107 - Mehdi Jazayeri:
An Improvement in the Iterative Data Flow Analysis Algorithm. 108-110
Volume 10, Number 3, 18 April 1980
- R. K. Arora, S. P. Rana:
Analysis of the Module Assignment Problem in Distributed Computing Systems with Limited Storage. 111-115 - Osamu Watanabe:
Another Application of Recursion Introduction. 116-119 - Peter J. L. Wallis, Bernard W. Silverman:
Efficient Implementation of the Ada Overloading Rules. 120-123 - C. Hemerik:
Formal Derivation of a List Processing Program. 124-126 - David G. Kirkpatrick:
A Note on Delaunay and Optimal Triangulations. 127-128 - Patrick Shen-Pei Wang:
Some New Results on Isotonic Array Grammars. 129-131 - Peter van Emde Boas:
On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination. 132-136 - Wojciech Cellary, Daniel Mayer:
A Simple Model of Query Scheduling in Distributed Data Base Systems. 137-147 - John A. Barnden:
A Characterization of Systems Derived From Terminating Concurrent Histories. 148-152 - Ludwik Czaja:
Parallel System Schemas and Their Relation to Automata. 153-158 - Joep L. W. Kessels:
The Readers and Writers Problem Avoided. 159-162 - M. van der Nat:
A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting. 163-167 - Selim G. Akl:
Corrigendum on Convex Hull Algorithms. Inf. Process. Lett. 10(3): 168 (1980)
Volume 10, Number 4/5, 5 July 1980
- Robert Melville, David Gries:
Controlled Density Sorting. 169-172 - Alan A. Bertossi:
On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs. 173-177 - Aviezri S. Fraenkel, Yaacov Yesha:
Complexity of Solving Algebraic Equations. 178-179 - Fabrizio Luccio, S. Mazzone:
A Cryptosystem for Multiple Communication. 180-183 - Thomas Lengauer, Robert Endre Tarjan:
The Space Complexity of Pebble Games on Trees. 184-188 - Arthur M. Farley:
Levelling Terrain Trees: A Transshipment Problem. 189-192 - Manfred Broy, Martin Wirsing:
Program Development: From Enumeration to Backtracking. 193-197 - F. Warren Burton, Gilbert N. Lewis:
A Robust Variation of Interpolation Search. 198-201 - Carla D. Savage:
Maximum Matchings and Trees. 202-205 - Robert W. Doran, L. K. Thomas:
Variants of the Software Solution to Mutual Exclusion. 206-208 - Mark H. Overmars, Jan van Leeuwen:
Further Comments on Bykat's Convex Hull Algorithm. 209-212 - Henk Meijer, Selim G. Akl:
The Design and Analysis of a New Hybrid Sorting Algorithm. 213-218 - Akira Nakamura, Katsushi Inoue:
A Remark on Two-Dimensional Finite Automata. 219-222 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Emptiness of the Intersection of Two D0S Languages Problem. 223-225 - Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
A New Permutation Algorithm for Bubble Memories. 226-230 - Corrado Böhm, Antonio Machi, Giovanna Sontacchi:
Complexity Bounds for Equivalence and Isomorphism of Latin Squares. 231-233 - Ludwik Czaja:
Deadlock and Fairness in Parallel Schemas: A Set-Theoretic Characterization and Decision Problems. 234-239 - Kellogg S. Booth:
Lexicographically Least Circular Substrings. 240-242 - Peter Buneman, Leon S. Levy:
The Towers of Hanoi Problem. 243-244 - Katsushi Inoue, Itsuo Takanami:
A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata. 245-248
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 2024-11-08 20:19 CET 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:
