Abstract is missing.
- Merging and Splitting Priority Queues and Deques in ParallelJingsen Chen. 1-11
- Lower Bounds for the Complexity of Functions in a Realistic RAM ModelNader H. Bshouty. 12-23
- On Boolean Decision Trees with Faulty NodesClaire Kenyon, Valerie King. 24-31
- Interval Graphs, Interval Orders and the Consistency of Temporal EventsMartin Charles Golumbic, Ron Shamir. 32-42
- Higher Order Functions in First Order TheoryAndrei Voronkov. 43-54
- Reduction Relations in Strict Applicative LanguageWalter Dosch. 55-66
- Approximation Algorithms for Minimum Time BroadcastGuy Kortsarz, David Peleg. 67-78
- The Complexity of Reconfiguring Network ModelsYosi Ben-Asher, David Peleg, Assaf Schuster. 79-90
- Optimal Mapping in Direct Mapped Cache EnvironmentsShmuel Gal, Yona Hollander, Alon Itai. 91-102
- New Algorithms for Generalized Network FlowsEdith Cohen, Nimrod Megiddo. 103-114
- Factoring Polynomials via Relation-FindingVictor S. Miller. 115-121
- New Resultant Inequalities and Complex Polynomial FactorizationVictor Y. Pan. 122-136
- Can Symmetric Toeplitz Solvers be Strongly Stable?Elliot L. Linzer. 137-146
- Bounds on Parallel Computation of Multivariate PolynomialsIlan Sadeh, Amir Averbuch. 147-153
- Time-Lapse SnapshotsCynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts. 154-170
- Concurrent Timestamping Made SimpleRainer Gawlick, Nancy A. Lynch, Nir Shavit. 171-183
- Distributed Evaluation: A Tool for Constructing Distributed Detection ProgramsJean-Michel Hélary, Michel Raynal. 184-194
- Foundations of Asymptotical Theory of Determinate Compact TestingEvgeny V. Luk-Silberman. 195-206
- Optimal K-Coloring and K-Nesting of IntervalsIrith Ben-Arroyo Hartman. 207-220