default search action
Information Processing Letters, Volume 21
Volume 21, Number 1, 10 July 1985
- Hanan Samet:
Bidirectional Coroutines. 1-6 - Juraj Hromkovic:
Alternating Multicounter Machines with Constant Number of Reversals. 7-9 - Mauro Negri
, Giuseppe Pelagatti:
Join During Merge: An Improved Sort Based Algorithm. 11-16 - Gerald Guralnik, Charles Zemach, Tony Warnock:
An Algorithm for Uniform Random Sampling of Points In and On a Hypersphere. 17-21 - Linda Pagli
Self-Adjusting Hash Tables. 23-25 - Deepak Kapur, Mukkai S. Krishnamoorthy:
Worst-Case Choice for the Stable Marriage Problem. 27-30 - Se Man Oh, Joseph C. H. Park:
A Note on Removing Loops from Table-Driven Code Generators. 31-34 - Mordechai M. Yung:
A Secure and Useful 'Keyless Cryptosystem'. 35-38 - Herbert Edelsbrunner, Hermann A. Maurer:
Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane. 39-47 - Ingo Wegener:
Optimal Search With Positive Switch Cost is NP-Hard. 49-52
Volume 21, Number 2, 16 August 1985
- Vladimir J. Lumelsky:
On Fast Computation of Distance Between Line Segments. 55-61 - Thomas Räuchle, Sam Toueg:
Exposure to Deadlock for Communicating Processes is Hard to Detect. 63-68 - Anne Kaldewaij:
On the Decomposition of Sequences into Ascending Subsequences. 69 - Juraj Hromkovic:
Linear Lower Bounds on Unbounded Fan-In Boolean Circuits. 71-74 - Ladislav Janiga, Václav Koubek:
A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations. 75-78 - Dario Bini, Victor Y. Pan:
Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power. 79-81 - Dietmar Wätjen:
Feedback Automata and Their Languages. 83-86 - Paul M. B. Vitányi:
Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit. 87-91 - Van Nguyen:
The Incompleteness of Misra and Chandy's Proof Systems. 93-96 - Alain J. Martin, Jerry R. Burch:
Fair Mutual Exclusion with Unfair P and V Operations. 97-100 - Clemens Lautemann, Friedhelm Meyer auf der Heide:
Lower Time Bounds for Integer Programming with Two Variables. 101-105
Volume 21, Number 3, 5 September 1985
- Clark D. Thompson
VLSI Design With Multiple Active Layers. 109-111 - Suresh C. Kothari, K. V. S. Ramarao:
General Algorithms for the Address Calculation of Lexicographically Ordered Tuples. 113-116 - D. T. Lee, Y. T. Ching:
The Power of Geometric Duality Revisited. 117-122 - Joseph F. JáJá, Jean Takche
Improved Lower Bounds for Some Matrix Multiplication Problems. 123-127 - Ted Herman, K. Mani Chandy:
On Distributed Search. 129-133 - Matthias Jantzen:
A Note on a Special One-Rule Semi-Thue System. 135-140 - Timothy A. Budd:
Creation and Reflexive Rights in Grammatical Protection Systems. 141-145 - Paul M. B. Vitányi:
An n1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape. 147-152 - Chae Woo Yoo:
An Approach to the Transportation of Computer Software. 153-157 - Bruno Codenotti, Francesco Romani
VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix. 159-163
Volume 21, Number 4, 7 October 1985
- Ralf Hartmut Güting:
Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments. 165-171 - Jean-Paul Laumond:
Enumeration of Articulation Pairs of a Planar Graph. 173-179 - Bowen Alpern, Fred B. Schneider:
Defining Liveness. 181-185 - Malcolm D. Atkinson:
On Zigzag Permutations and Comparisons of Adjacent Elements. 187-189 - Yves Robert
A Systolic Array for the Longest Common Subsequence Problem. 191-198 - James Leslie Keedy, Bernd Freisleben
On the Efficient Use of Semaphore Primitives. 199-205 - Ching C. Hsiao, Nien-Tsu Shen:
k-Fold Bitonic Sort on a Mesh-Connected Parallel Computer. 207-212 - Alberto Marchetti-Spaccamela
On Different Approximation Criteria for Subset Product Problems. 213-218
Volume 21, Number 5, 18 November 1985
- Bertrand Meyer:
Incremental String Matching. 219-227 - Jan Magott:
Performance Evaluation of Dystems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets. 229-232 - A. J. Kfoury:
The Unwind Property for Programs with Bounded Memory. 233-238 - Wlodzimierz Dobosiewicz:
A Note on Natural Selection. 239-243 - Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson
Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. 245-247 - Kenneth J. Supowit:
Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs. 249-252 - Ulrich Derigs:
An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths. 253-258 - Ingrid J. M. Birkhoff:
A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange Network. 259-268 - Heikki Mannila, Kurt Mehlhorn:
A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. 269-272
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-03-11 20:08 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: