Abstract is missing.
- Effect of Operators on Straight Line ComplexityDan Boneh, Richard J. Lipton. 1-5 [doi]
- A Comparison of Resource-Bounded Molecular Computation ModelsBin Fu, Richard Beigel. 6-11 [doi]
- An Exact Quantum Polynomial-Time Algorithm for Simon s ProblemGilles Brassard, Peter Høyer. 12-23 [doi]
- Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-WilliamsonTakao Asano. 24-37 [doi]
- Minimax relations for T-join packing problemsJaime Cohen, Claudio L. Lucchesi. 38-44 [doi]
- Learning with Queries Corrupted by Classification NoiseJeffrey C. Jackson, Eli Shamir, Clara Shwartzman. 45-53 [doi]
- A Modular Analysis of Network Transmission ProtocolsMicah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz. 54-62 [doi]
- Optimal point-to-point broadcast algorithms via lopsided treesMordecai J. Golin, Assaf Schuster. 63-73 [doi]
- Local StabilizerYehuda Afek, Shlomi Dolev. 74-84 [doi]
- Stereoscopic families of permutations, and their applicationsUriel Feige, Robert Krauthgamer. 85-95 [doi]
- On the total::k::-diameter of connection networksYefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks. 96-106 [doi]
- On-Line Load Balancing of Temporary Tasks on Identical MachinesYossi Azar, Leah Epstein. 119-125 [doi]
- Faster subtree isomorphismRon Shamir, Dekel Tsur. 126-131 [doi]
- Graph decompositions and factorizing permutationsChristian Capelle, Michel Habib. 132-143 [doi]
- Weak Alternating Automata Are Not That WeakOrna Kupferman, Moshe Y. Vardi. 147-158 [doi]
- Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete GraphsVladimir Grebinski, Gregory Kucherov. 166-173 [doi]
- Private Simultaneous Messages Protocols with ApplicationsYuval Ishai, Eyal Kushilevitz. 174-184 [doi]