Abstract is missing.
- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov ComplexityEric Allender. 1-15 [doi]
- Approximation Schemes for Geometric NP-Hard Problems: A SurveySanjeev Arora. 16-17 [doi]
- On Clustering Using Random WalksDavid Harel, Yehuda Koren. 18-41 [doi]
- An Introduction to Decidability of DPDA EquivalenceColin Stirling. 42-56 [doi]
- Semidefinite Programming Based Approximation AlgorithmsUri Zwick. 57 [doi]
- Hard Sets and Pseudo-random Generators for Constant Depth CircuitsManindra Agrawal. 58-69 [doi]
- The First-Order Isomorphism TheoremManindra Agrawal. 70-82 [doi]
- Thresholds and Optimal Binary Comparison Search TreesRichard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner. 83-95 [doi]
- Distributed LTL Model Checking Based on Negative Cycle DetectionLubos Brim, Ivana Cerná, Pavel Krcál, Radek Pelánek. 96-107 [doi]
- Computability and Complexity Results for a Spatial Assertion Language for Data StructuresCristiano Calcagno, Hongseok Yang, Peter W. O Hearn. 108-119 [doi]
- Using Nondeterminism to Design Deterministic AlgorithmsJianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj. 120-131 [doi]
- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free CounterZhe Dang, Oscar H. Ibarra, Pierluigi San Pietro. 132-143 [doi]
- A Mechanically Verified Compiling Specification for a Lisp CompilerAxel Dold, Vincent Vialard. 144-155 [doi]
- Beyond Regular Model CheckingDana Fisman, Amir Pnueli. 156-170 [doi]
- Relations Between Communication Complexity, Linear Arrangements, and Computational ComplexityJürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon. 171-182 [doi]
- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in ParallelNeelima Gupta, Sumit Chopra, Sandeep Sen. 183-194 [doi]
- List Decoding from Erasures: Bounds and Code ConstructionsVenkatesan Guruswami. 195-206 [doi]
- Verification of a Leader Election Algorithm in Timed Asynchronous SystemsNeeraj Jaggi, K. Gopinath. 207-218 [doi]
- Efficient Addition on Field Programmable Gate ArraysAndreas Jakoby, Christian Schindelhauer. 219-231 [doi]
- The Directed Minimum-Degree Spanning Tree ProblemRadha Krishnan, Balaji Raghavachari. 232-243 [doi]
- I/O-Efficient Batched Range Counting and Its Applications to Proximity ProblemsTamás Lukovszki, Anil Maheshwari, Norbert Zeh. 244-255 [doi]
- Beyond Message Sequence GraphsP. Madhusudan, B. Meenakshi. 256-267 [doi]
- Grouping Techniques for One Machine Scheduling Subject to Precedence ConstraintsMonaldo Mastrolilli. 268-279 [doi]
- Properties of Distributed Timed-Arc Petri NetsMogens Nielsen, Vladimiro Sassone, Jirí Srba. 280-291 [doi]
- From Falsification to VerificationDoron Peled, Amir Pnueli, Lenore D. Zuck. 292-304 [doi]
- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic ProblemsErion Plaku, Igor Shparlinski. 305-316 [doi]
- Range Allocation for Equivalence LogicAmir Pnueli, Yoav Rodeh, Ofer Strichman. 317-333 [doi]
- Rewrite Closure for Ground and Cancellative AC TheoriesAshish Tiwari. 334-346 [doi]