Volume 54,
Number 1,
14 April 1995
Volume 54,
Number 2,
28 April 1995
- Cliff B. Jones:
Partial Functions and Logics: A Warning.
65-67
Electronic Edition (link) BibTeX
- Chui-Cheng Chen, Rong-Jaye Chen:
Compact Embedding of Binary Trees Into Hyperacubes.
69-72
Electronic Edition (link) BibTeX
- Giorgio Ausiello, Marco Protasi:
Local Search, Reducibility and Approximability of NP-Optimization Problems.
73-79
Electronic Edition (link) BibTeX
- Luis Barriga, Rassul Ayani:
Lazy Update: An Efficient Implementation of LRU Stacks.
81-84
Electronic Edition (link) BibTeX
- Gene Myers:
Approximately Matching Context-Free Languages.
85-92
Electronic Edition (link) BibTeX
- Horst Bunke, János Csirik:
An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings.
93-96
Electronic Edition (link) BibTeX
- Richa Agarwala, David Fernández-Baca:
Weighted Search in the Plane.
97-100
Electronic Edition (link) BibTeX
- Dennis Moore, William F. Smyth:
A Correction to ``An Optimal Algorithm to Compute all the Covers of a String''.
101-103
Electronic Edition (link) BibTeX
- Guozhu Dong:
On the Index of Positive Programmed Formal Languages.
105-110
Electronic Edition (link) BibTeX
- Israel Cidon, Yuval Shavitt:
Message Terminating Algorithms for Anonymous Rings of Unknown Size.
111-119
Electronic Edition (link) BibTeX
- George Varghese, Roger D. Chamberlain, William E. Weihl:
Deriving Global Virtual Time Algorithms from Conservative Simulation Protocols.
121-126
Electronic Edition (link) BibTeX
- Mark Allen Weiss:
A Note on Construction of Treaps and Cartesian Trees.
127
Electronic Edition (link) BibTeX
Volume 54,
Number 3,
12 May 1995
Volume 54,
Number 4,
26 May 1995
Volume 54,
Number 5,
9 June 1995
- Klaus Simon:
A Note on Lexicographic Breadt First Search for Chordal Graphs.
249-251
Electronic Edition (link) BibTeX
- Derek G. Corneil, Stephan Olariu, Lorna Stewart:
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.
253-257
Electronic Edition (link) BibTeX
- Ted Herman, Sukumar Ghosh:
Stabilizing Phase-Clocks.
259-265
Electronic Edition (link) BibTeX
- Eddy Fromentin, Claude Jard, Guy-Vincent Jourdan, Michel Raynal:
On-The-Fly Analysis of Distributed Computations.
267-274
Electronic Edition (link) BibTeX
- Kokichi Sugihara, Hiroshi Inagaki:
Why is the 3D Delaunay Triangulation Difficult to Construct.
275-280
Electronic Edition (link) BibTeX
- Stéphane Demri:
3-SAT=SAT for a Class of Normal Modal Logics.
281-287
Electronic Edition (link) BibTeX
- Kazuo Iwama, Toniann Pitassi:
Exponential Lower Bounds for the Tree-Like Hajós Calculus.
289-294
Electronic Edition (link) BibTeX
- Akihiro Fujiwara, Toshimitsu Masuzawa, Hideo Fujiwara:
An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images.
295-300
Electronic Edition (link) BibTeX
- Aart Blokhuis, Ton Kloks:
On the Equivalence Covering Number of Splitgraphs.
301-304
Electronic Edition (link) BibTeX
- G. Sajith, Sanjeev Saxena:
Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
305
Electronic Edition (link) BibTeX
,
->Inf. Process. Lett. 49(6): 303-308(1994) BibTeX
Volume 54,
Number 6,
23 June 1995
Copyright © Sun May 17 00:04:03 2009
by Michael Ley (ley@uni-trier.de)
