Volume 56, Number 1, 13 October 1995
- Stephen Thomas:
Garbage Collection in shared-environment Closure Reducers: Space-Efficient Depth First Copying Using a Tailored Approach.
1-7
- Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu:
Illumination of Polygons with Vertex Lights.
9-13
- Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino:
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions.
15-17
- Garrison W. Greenwood:
On the Equity of Mutual Exclusion Algorithms in Distributed Systems.
19-22
- Ian Parberry:
A Real-Time Algorithm for the (n²-1)-Puzzle.
23-28
- Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs.
29-35
- Sanjeev Saxena, N. Malahal Rao:
Parallel Algorithms for Connectivity Problems on Interval Graphs.
37-44
- Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger:
Counting Convex Polygons in Planar Point Sets.
45-49
- Joseph Y.-T. Leung, W.-D. Wei:
Tighter Bounds on a Heuristic for a Partition Problem.
51-57
- Torben Hagerup:
The Parallel Complexity of Integer Prefix Summation.
59-64
- Rossella Petreschi, Andrea Sterbini:
Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time.
65, (see: Inf. Process. Lett. 54(4): 193-198(1995))
Volume 56, Number 2, 27 October 1995
- Sven Oliver Krumke:
On a Generalization of the p-Center Problem.
67-71
- Thomas W. Cusick:
Cryptanalysis of a Public Key System Based on Diophantine Equations.
73-75
- Uday Kumar Chakraborty:
A Simpler Derivation of Schema Hazard in Genetic Algorithms.
77-78
- Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal:
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height.
79-81
- Yue-Li Wang, Hon-Chan Chen, Chen-Yu Lee:
An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs.
83-87
- Eugene L. Lawler, Sergei Sarkissian:
An Algorithm for ``Ulam's Game'' and its Application to Error Correcting Codes.
89-93
- Luc Devroye, Paul Kruszewski:
A Note on the Horton-Strahler Number for Random Trees.
95-99
- Y. Daniel Liang:
Steiner Set and Connected Domination in Trapezoid Graphs.
101-108
- Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Reductions to Sets that Avoid EXPSPACE.
109-114
- Bengt Aspvall:
Minimizing Elimination Tree Height Can Increase Fill More Than Linearly.
115-120
- Ferruccio Barsi, Maria Cristina Pinotti:
Addendum to "A Fully Parallel Algorithm for Residue to Binary Conversion".
121, (see: Inf. Process. Lett. 55(1): 25-26(1995))
Volume 56, Number 3, 10 November 1995
- Helmut Prodinger:
Multiple Quickselect - Hoare's Find Algorithm for Several Elements.
123-129
- Gavin Lowe:
An Attack on the Needham-Schroeder Public-Key Authentication Protocol.
131-133
- Susanne Albers, Bernhard von Stengel, Ralph Werchner:
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.
135-139
- Dennis M. Volpano, Geoffrey Smith:
A Type Soundness Proof for Variables in LCF ML.
141-146
- Stasys Jukna:
Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates.
147-150
- John A. Clark, Jeremy Jacob:
On the Security of Recent Protocols.
151-155
- Olivier Devillers, Mordecai J. Golin:
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas.
157-164
- Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang:
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.
165-171
- Andrew Tomkins:
Lower Bounds for Two Call Control Problems.
173-178
- Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello:
A Linear-Time Algorithm for Proper Interval Graph Recognition.
179-184
Volume 56, Number 4, 24 November 1995
Volume 56, Number 5, 5 December 1995
Volume 56, Number 6, 22 December 1995
Last update Thu May 23 19:00:31 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
