Volume 31,
Number 1,
January/February 1998
- Daniel Hammer, Alexander Shen:
A Strange Application of Kolmogorov Complexity.
1-4 BibTeX
- Fabrizio Luccio, Linda Pagli:
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up.
5-26 BibTeX
- Sanjay Gupta:
Isolating an Odd Number of Elements and Applications in Complexity Theory.
27-40 BibTeX
- Amir Ben-Dor, Shai Halevi, Assaf Schuster:
Potential Function Analysis of Greedy Hot-Potato Routing.
41-61 BibTeX
- Frank K. Hwang, Y. C. Yao:
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube.
63-66 BibTeX
- Jin-yi Cai:
Frobenius's Degree Formula and Toda's Polynomials.
67-75 BibTeX
- Harry Buhrman, Jim Kadin, Thomas Thierauf:
Functions Computable with Nonadaptive Queries to NP.
77-92 BibTeX
- K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
The Chain Method to Separate Counting Classes.
93-108 BibTeX
Volume 31,
Number 2,
March/April 1998
Volume 31,
Number 3,
May/June 1998
Volume 31,
Number 4,
July/August 1998
Special Issue:
ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996)
- S. Muthukrishnan, Bhaskar Ghosh, Martin H. Schultz:
First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing.
331-354
Electronic Edition (Springer LINK) BibTeX
- Seungjoon Park, David L. Dill:
Verification of Cache Coherence Protocols by Aggregation of Distributed Transactions.
355-376
Electronic Edition (Springer LINK) BibTeX
- Micah Adler:
Asynchronous Shared Memory Search Structures.
377-401
Electronic Edition (Springer LINK) BibTeX
- Nir Shavit, Eli Upfal, Asaph Zemach:
A Steady State Analysis of Diffracting Trees.
403-423
Electronic Edition (Springer LINK) BibTeX
- Christian Scheideler, Berthold Vöcking:
Universal Continuous Routing Strategies.
425-449
Electronic Edition (Springer LINK) BibTeX
- Liviu Iftode, Jaswinder Pal Singh, Kai Li:
Scope Consistency: A Bridge between Release Consistency and Entry Consistency.
451-473
Electronic Edition (Springer LINK) BibTeX
- Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network.
475-488
Electronic Edition (Springer LINK) BibTeX
Volume 31,
Number 5,
September/October 1998
Special Issue:
Seventh International Symposium on Algorithms and Computation
- Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen:
Competitive Analysis of On-Line Disk Scheduling.
491-506
Electronic Edition (Springer LINK) BibTeX
- Andrzej Lingas, V. Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions.
507-538
Electronic Edition (Springer LINK) BibTeX
- Eric Allender, Klaus-Jörn Lange:
RUSPACE(log n) $\subseteq$ DSPACE (log2 n / log log n).
539-550
Electronic Edition (Springer LINK) BibTeX
- Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff:
Periodic Merging Networks.
551-578
Electronic Edition (Springer LINK) BibTeX
- Kazuyoshi Hayase, Hiroshi Imai:
OBDDs of a Monotone Function and Its Prime Implicants.
570-591
Electronic Edition (Springer LINK) BibTeX
- Tatsuya Hayashi, Koji Nakano, Stephan Olariu:
Efficient List Ranking on the Reconfigurable Mesh with Applications.
593-611
Electronic Edition (Springer LINK) BibTeX
- Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons under Translations.
613-628
Electronic Edition (Springer LINK) BibTeX
Volume 31,
Number 6,
1998
Copyright © Sun May 17 00:14:26 2009
by Michael Ley (ley@uni-trier.de)
