Abstract is missing.
- On the Borowsky-Gafni Simulation AlgorithmNancy A. Lynch, Sergio Rajsbaum. 4-15
- Symmetry Breaking in Anonymous Networks: CharacterizationsPaolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon. 16-26
- Baked Potato RoutingShlomi Dolev, Evangelos Kranakis, Danny Krizanc. 27-36
- Packet Routing via Min-Cost Circuit RoutingBaruch Awerbuch, Yossi Azar, Amos Fiat. 37-42
- Arrangements of Curves and Surfaces in Computational GeometryMicha Sharir. 44-50
- On Advances in Optical Computational Models and Problems which They Help to SolveY. B. Karasik. 52-60
- On the Hardness of Approximating Max k-Cut and Its DualViggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi. 61-67
- To Weight or Not to Weight: Where is the Question?Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan. 68-77
- Approximating Minimum Subset Feedback Sets in Undirected Graphs with ApplicationsGuy Even, Joseph Naor, Baruch Schieber, Leonid Zosin. 78-88
- Visual Object RecognitionShimon Ullman. 90
- Making the Original Scoreboard Mechanism Deadlock FreeSilvia M. Müller, Wolfgang J. Paul. 92-99
- Feasibility and Unfeasibility of Off-Line ProcessingMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf. 100-109
- Generalized Submodular Cover Problems and ApplicationsJudit Bar-Ilan, Guy Kortsarz, David Peleg. 110-118
- On Chromatic Sums and Distributed Resource AllocationAmotz Bar-Noy, Hadas Shachnai, Tami Tamir. 119-128
- On the Indecomposibility of Certain Language ClassesStuart W. Margolis, Mark V. Sapir, Pascal Weil. 129-134
- Type Dependencies for Logic Programs Using ACI-UnificationMichael Codish, Vitaly Lagoon. 136-145
- Reduction-Free Normalisation for a Polymorphic SystemThorsten Altenkirch, Martin Hofmann, Thomas Streicher. 146
- Updating Nonmonotonic DatabasesCees Witteveen, Wiebe van der Hoek. 147-153
- On the Parallel Computation of Boolean Functions on Unrelated inputsAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. 155-161
- On SatisfiabilityRichard Zippel. 162-169
- On the Decisional Complexity of Problems Over the RealsMoni Naor, Sitvanit Ruah. 176-187
- The Airline Crew Pairing Optimization ProblemWilliam R. Pulleyblank. 189
- On Privacy and Partition ArgumentsBenny Chor, Yuval Ishai. 191-194
- Physical Maps and Interval Sandwich Problems: Bounded Degrees HelpHaim Kaplan, Ron Shamir. 195-201
- A New ::::NC::::Algorithm for Perfect Matching in Bipartite Cubic GraphsRoded Sharan, Avi Wigderson. 202-207
- Deterministic Approximation of the Cover TimeUriel Feige, Yuri Rabinovich. 208-218
- Smell as a Computational Resource - A Lesson We Can Learn from the AntIsrael A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein. 219-230