default search action
Information Processing Letters, Volume 25
Volume 25, Number 1, April 1987
- Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman:
Some Observations Concerning Alternating Turing Machines Using Small Space. 1-9 - Avraham A. Melkman
:
On-Line Construction of the Convex Hull of a Simple Polyline. 11-12 - Bernd Kirsig, Klaus-Jörn Lange:
Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n). 13-15 - Richard G. Hamlet:
Probable Correctness Theory. 17-25 - Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems. 27-33 - George Cybenko, David W. Krumme, K. N. Venkataraman:
Fixed Hypercube Embedding. 35-39 - Jean-Paul Laumond:
Obstacle Growing in a Nonpolygonal World. 41-50 - Joseph Naor:
A Fast Parallel Coloring of Planar Graphs with Five Colors. 51-53 - Cao An Wang, Yung H. Tsin:
An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane. 55-60 - Gary A. Hyslop, Edmund A. Lamagna:
Performance of Distributive Partitioned Sort in a Demand Paging Environment. 61-64 - John H. Reif:
A Topological Approach to Dynamic Graph Connectivity. 65-70
Volume 25, Number 2, May 1987
- C. A. R. Hoare, Jifeng He, Jeff W. Sanders:
Prespecification in Data Refinement. 71-76 - Jyrki Katajainen, Olli Nevalainen, Jukka Teuhola:
A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs. 77-86 - Mikhail J. Atallah, Chandrajit L. Bajaj:
Efficient Algorithms for Common Transversals. 87-91 - Manfred Broy:
Predicative Specifications for Functional Programs Describing Communication Networks. 93-101 - K. B. Lakshmanan, N. Meenakshi, Krishnaiyan Thulasiraman:
A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search. 103-109 - Alan M. Frieze
Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. 111-117 - F. Miller Maley:
An Observation Concerning Constraint-Based Compaction. 119-122 - Victor J. Rayward-Smith:
The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays. 123-125 - Ravi B. Boppana, Johan Håstad
Does co-NP Have Short Interactive Proofs? 127-132 - Robert D. Tennent:
Quantification in Algol-Like Languages. 133-137 - Grigori Mints, Enn Tyugu:
Corrigendum: Semantics of a Declarative Language. Inf. Process. Lett. 25(2): 139 (1987)
Volume 25, Number 3, May 1987
- Yoshihito Toyama:
Counterexamples to Termination for the Direct Sum of Term Rewriting Systems. 141-143 - Jean-Pierre Verjus:
On the Proof of a Distributed Algorithm. 145-147 - Michael B. Dillencourt:
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation. 149-151 - Ten-Hwang Lai, Tao H. Yang:
On Distributed Snapshots. 153-158 - Andrew Klapper:
A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. 159-161 - Özalp Babaoglu
Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis. 163-169 - Satoru Kawai:
Local Authentication in Insecure Environments. 171-174 - Michael J. Fischer, Neil Immerman:
Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. 175-181 - Tae-Choong Chung, Jung Wan Cho:
History Sensitive String for Multiple Alphabets. 183-188 - T. H. Tse
On the Detection of Unstructuredness in Flowgraphs. 189-193 - Dieter Zöbel:
Transformations for Communication Fairness in CSP. 195-198 - Nikitas A. Alexandridis, P. D. Tsanakas:
An Encoding Scheme for the Efficient Representation of Hierarchical Structures. 199-206 - Joseph M. Morris:
Varieties of Weakest Liberal Preconditions. 207-210
Volume 25, Number 4, June 1987
- Jean-Michel Autebert, Philippe Flajolet, Joaquim Gabarró:
Prefixes of Infinite Words and Ambiguous Context-Free Languages. 211-216 - Bettina Brustmann, Ingo Wegener:
The Complexity of Symmetric Functions in Bounded-Depth Circuits. 217-219 - Edward Ochmanski:
Inevitability in Concurrent Systems. 221-225 - Rainer Kemp:
A Note on the Number of Leftist Trees. 227-232 - J. G. Wiltink:
A Deficiency of Natural Deduction. 233-234 - Alberto Apostolico:
Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem. 235-236 - David Gries
Horner's Rule and the Computation of Linear Recurrences. 237-240 - Andrew V. Goldberg, Serge A. Plotkin:
Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. 241-245 - Christos Levcopoulos:
An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation. 247-251 - Matthias Reichling:
A Simplified Solution of the n Queens Problem. 253-255 - Anatoliy O. Buda:
Multiprocessor Automata. 257-261 - Sandeep N. Bhatt, Stavros S. Cosmadakis
The Complexity of Minimizing Wire Lengths in VLSI Layouts. 263-267 - Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis:
A log log n Data Structure for Three-Sided Range Queries. 269-273 - Andrew W. Appel
Garbage Collection can be Faster than Stack Allocation. 275-279
Volume 25, Number 5, July 1987
- Vijay Raghavan, Shankar M. Venkatesan:
On Bounds for a Board Covering Problem. 281-284 - Jeffrey S. Salowe, William L. Steiger:
Stable Unmerging in Linear Time and Constant Space. 285-294 - K. Venkatesh, Thiruvengadam Radhakrishnan, Hon Fung Li:
Optimal Checkpointing and Local Recording for Domino-Free Rollback Recovery. 295-304 - Jerzy R. Nawrocki, J. Martinek:
A Storage Allocation Method with Invalidating Dangling References. 305-310 - Cristian Calude
Super-Exponentials Nonprimitive Recursive, but Rudimentary. 311-316 - S. S. Ravi, Harry B. Hunt III:
An Application of the Planar Separator Theorem to Counting Problems. 317-322 - David Gries
A Note on Graham's Convex Hull Algorithm. 323-328 - Yun-zhou Zhu, To-Yat Cheung:
A New Distributed Breadth-First-Search Algorithm. 329-334 - Rina Suros, Eurípides Montagne:
Fitted Diagonals for Reducing I/O Bandwidth in Systolic Systems. 335-342 - Stuart A. Friedberg, Gary L. Peterson:
An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores. 343-348
Volume 25, Number 6, July 1987
- Kadri Krause, Lawrence L. Larmore, Dennis J. Volper:
Packing Items from a Triangular Distribution. 351-362 - Joanna Jedrzejowicz
Nesting of Shuffle Closure is Important. 363-368 - Jean Marcel Pallo:
On the Rotation Distance in the Lattice of Binary Trees. 369-374 - Ricardo A. Baeza-Yates
Some Average Measures in m-ary Search Trees. 375-382 - Shlomo Moran:
Generalized Lower Bounds Derived from Hastad's Main Lemma. 383-388 - Manfred Kunde, Horst Steppat:
On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm. 389-396 - Imrich Vrto:
The Area-Time Complexity of the VLSI Counter. 397-400 - F. Peper:
Determining Connected Components in Linear Time by a linear Number of Processors. 401-406 - Udo Kelter:
The Complexity of Strict Serializability Revisited. 407-412 - Youichi Kobuchi:
A Note on Symmetrical Cellular Spaces. 413-416
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-01-06 21:32 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: