Abstract is missing.
- Efficient Interactive Proofs and Applications to ApproximationShafi Goldwasser. 1-2
- One-Way Fuctions are Essential for Non-Trivial Zero-KnowledgeRafail Ostrovsky, Avi Wigderson. 3-17
- Deterministic Approximate Counting of Depth-2 CircuitsMichael Luby, Boban Velickovic, Avi Wigderson. 18-24
- A Lower Bound for Linear Approximate CompactionShiva Chaudhuri. 25-32
- Finding the Neighborhood of a Query in a DictionaryDanny Dolev, Yuval Harari, Michal Parnas. 33-42
- The Minimum Reservation Rate Problem in Digital Audio/Video SystemsNimrod Megiddo, Moni Naor, David P. Anderson. 43-48
- Subpixel Image Registration Using Circular FiducialsAlon Efrat, Craig Gotsman. 49-58
- Which Patterns are Hard to Find?Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick. 59-68
- Approximating Bounded 0-1 Integer Linear ProgramsDavid Peleg, Gideon Schechtman, Avishai Wool. 69-77
- Using Selective Path-Doubling for Parallel Shortest-Path ComputationsEdith Cohen. 78-87
- Maintaining the 4-Edge-Connected Components of a Graph On-LineYefim Dinitz. 88-97
- Analog Computation Via Neural NetworksHava T. Siegelmann, Eduardo D. Sontag. 98-107
- Zero-One Permanent is ::::#P::::-Complete, A Simpler ProofAmir Ben-Dor, Shai Halevi. 108-117
- Practical Cryptography - Recent Trends and ResultsAdi Shamir. 127
- Optimal Speedup of Las Vegas AlgorithmsMichael Luby, Alistair Sinclair, David Zuckerman. 128-133
- Random Walks on Colored GraphsAnne Condon, Diane Hernek. 134-140
- Sphere Packing and Local Majorities in GraphsNathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks. 141-149
- The Las-Vegas Processor Identity Problem (How and When to Be Unique)Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir. 150-159
- On the Complexity of Global Computation in the Presence of Link Failures: The General CaseYehuda Afek, Danny Hendler. 160-166
- Structured Design of Self-Stabilizing ProgramsFrank A. Stomp. 167-176
- Feasible Offset an Optimal Offset for Single-Layer Channel RoutingRonald I. Greenberg, Jau-Der Shih. 193-201
- Hot-Potato Worm Routing is Almost as Easy as Store-and-Forward Packet RoutingIlan Newman, Assaf Schuster. 202-211
- Adaptive Source Routing in High-Speed NetworksAlon Itai, Hadas Shachnai. 212-221
- A Formalization of Superposition RefinementKaisa Sere. 222-230
- Divergence Models for Atomized Statements and Parallel ChoiceJoost N. Kok, Peter M. W. Knijnenburg. 231-239
- On the Equivalence of Persistent Term Rewriting Systems and Recursive Program SchemesZurab Khasidashvili. 240-249
- On the Hardness of Approximating the Chromatic NumberSanjeev Khanna, Nathan Linial, Shmuel Safra. 250-260
- A Well-Characterized Approximation ProblemJohan Håstad, Steven Phillips, Shmuel Safra. 261-265
- The Hardness of Approximation: Gap LocationErez Petrank. 275-284
- Efficient On-Line Call Control AlgorithmsJuan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung. 285-293
- Competitive Algorithms for the Weighted Server ProblemAmos Fiat, Moty Ricklin. 294-303
- The Mortgage ProblemRan El-Yaniv, Richard M. Karp. 304-312