default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 35
Volume 35, Number 1, 15 June 1990
- Mitchell Wand:
A Short Proof of the Lexical Addressing Algorithm. 1-5 - Mohan Ahuja, Yahui Zhu:
An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube. 7-11 - Alok Aggarwal, Subhash Suri:
Computing the Longest Diagonal of a Simple Polygon. 13-18 - Jeremy Jacob:
A Model of Reconfiguration in Communicating Sequential Processes. 19-22 - Chandrajit L. Bajaj, Tamal K. Dey:
Polygon Nesting and Robustness. 23-32 - Rani Siromoney, Lisa Mathew
:
A Public Key Cryptosystem Based on Lyndon Words. 33-36 - Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid:
Dynamic Deferred Data Structuring. 37-40 - Elena Lodi, Fabrizio Luccio, Linda Pagli:
Routing in Times Square Mode. 41-48 - Ronitt Rubinfeld:
The Cover Time of a Regular Expander is O(n log n). 49-51 - Laurence Boxer:
Corrigenda: Common Intersections of Polygons. 53 - Devendra Kumar, S. Sitharama Iyengar, Mohan B. Sharma:
Corrigenda: Corrections to a Distributed Depth-First Search Algorithm. 55-56
Volume 35, Number 2, 29 June 1990
- Anna Lubiw:
Counterexample to a Conjecture of Szymanski on Hypercube Routing. 57-61 - Ted Herman:
Probabilistic Self-Stabilization. 63-67 - Grant R. Guenther:
Efficient Expansion of Factored Expressions. 69-72 - Maurice Maes:
On a Cyclic String-To-String Correction Problem. 73-78 - David T. Barnard, David B. Skillicorn:
Pipelining Tree-Structured Algorithms on Simd Architectures. 79-84 - Khun Yee Fung, Tina M. Nicholl, Robert Endre Tarjan, Christopher J. Van Wyk:
Simplified Linear-Time Jordan Sorting and Polygon Clipping. 85-92 - Ching-Lin Wang:
Obtaining Lazy Evaluation with Continuations in Scheme. 93-97 - Ingo Wegener:
Efficient Simulation of Circuits by Erew Prams. 99-102 - Martha Sideri:
On Attribute Grammars Without Atribute Synthesis. 103-109
Volume 35, Number 3, 20 July 1990
- Tom Altman, George Logothetis:
A Note on Ambiguity in Context-Free Grammars. 111-114 - Erik Lambrichts, Peter Nees, Jan Paredaens, Peter Peelman, Letizia Tanca:
Checking Functional Consistency in Deductive Databases. 115-120 - Maxime Crochemore, Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata. 121-128 - Marta Z. Kwiatkowska:
A Metric for Traces. 129-135 - Kurt Mehlhorn, Stefan Näher, Christian Uhrig:
Hidden Line Elimination for Isooriented Rectangels. 137-143 - Moshe Y. Vardi:
Endmarkers can Make a Difference. 145-148 - Srinivasa Rao Arikati, C. Pandu Rangan:
Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. 149-153 - John Launchbury:
Strictness Analysis Aids Inductive Proofs. 155-159 - Jerzy A. Piotrowski:
A Functional Model of a Simplified Sequential Machine. 161-166
Volume 35, Number 4, 7 August 1990
- Chau-Jy Lin:
Parallel Algorithm for Generating Permutations on Linear Array. 167-170 - Mohamed G. Gouda, Ted Herman:
Stabilizing Unison. 171-175 - Shyan-Ming Yuan:
The Communication Complexity for Decentralized Evaluation of Functions. 177-182 - Kurt Mehlhorn, Stefan Näher:
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. 183-189 - Paola Inverardi, Monica Nesi:
A Rewriting Strategy to Verify Observational Congruence. 191-199 - Noga Alon:
Generating Pseudo-Random Permutations and Maximum Flow Algorithms. 201-204 - Glenn K. Manacher, Terrance A. Mankus, Carol Joan Smith:
An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. 205-211 - Xiaotie Deng:
An Optimal Parallel Algorithm for Linear Programming in the Plane. 213-217
Volume 35, Number 5, 28 August 1990
- Kenneth Block, Tai-Kuo Woo:
A More Efficient Generalization of Petersons's Mutual Exclusion Algorithm. 219-222 - Michael C. Loui, Milind A. Sohoni:
An Algorithm for Load Balancing in Multiprocessor Systems. 223-228 - Seinosuke Toda:
On the Complexity of Topological Sorting. 229-233 - Erich Grädel:
Simple Interpretations Among Complicated Theories. 235-238 - Ken Grigg, Serge Miguet, Yves Robert:
Symmetric Matrix-Vector Product on a Ring of Processors. 239-248 - Robert J. Cimikowski:
Finding Hamiltonian Cycles in Certain Planar Graphs. 249-254 - Maw-Shang Chang, Nen-Fu Huang, Chuan Yi Tang:
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs. 255-260 - Lisa Hellerstein, Philip N. Klein, Robert Wilber:
On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. 261-267 - Matthew Dickerson, Robert L. (Scot) Drysdale III:
Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. 269-273 - Nissim Francez:
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. 275
Volume 35, Number 6, 15 September 1990
- A. J. M. van Gasteren, Gerard Tel:
Comments on "On the Proof of a Distributed Algorithm": Always-Tru is not Invariant. 277-279 - David B. Shmoys, David P. Williamson:
Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application. 281-285 - Andrzej Wlodzimierz Mostowski:
Alternating Automata with Start Formulas. 287-290 - Georg Karner:
A Note on Terminal Balancing of Algebraic Systems. 291-293 - Chain-Chin Yen, Richard C. T. Lee:
The Weighted Perfect Domination Problem. 295-299 - Alok Aggarwal, Frank Thomson Leighton:
A Tight Lower Bound for the Train Reversal Problem. 301-304 - Chwan-Hwa John Wu, Chia-Jiu Wang, Heng-Ming Tai:
Application of Exponential Hetero-Associative Memory on Frequency Classifier. 305-311 - Jang-Ping Sheu, Jyh-Shyan Tang:
Efficient Parallel k Selection Algorithm. 313-316 - Sun Wu, Udi Manber, Gene Myers, Webb Miller:
An O(NP) Sequence Comparison Algorithm. 317-323 - Andrew Chin:
On the Depth Complexity of the Counting Functions. 325-328
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-11-18 22: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:
