5. ISTCS 1997: Ramat-Gan, Israel

• Dan Boneh, Richard J. Lipton:
  Effect of Operators on Straight Line Complexity. 1-5
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Bin Fu, Richard Beigel:
  A Comparison of Resource-Bounded Molecular Computation Models. 6-11
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Gilles Brassard, Peter Høyer:
  An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. 12-23
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Takao Asano:
  Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. 24-37
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Jaime Cohen, Claudio L. Lucchesi:
  Minimax relations for T-join packing problems. 38-44
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman:
  Learning with Queries Corrupted by Classification Noise. 45-53
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz:
  A Modular Analysis of Network Transmission Protocols. 54-62
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Mordecai J. Golin, Assaf Schuster:
  Optimal point-to-point broadcast algorithms via lopsided trees. 63-73
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Yehuda Afek, Shlomi Dolev:
  Local Stabilizer. 74-84
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Uriel Feige, Robert Krauthgamer:
  Stereoscopic families of permutations, and their applications. 85-95
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks:
  On the total_k-diameter of connection networks. 96-106
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Pat Frankel:
  Exact Analysis of Exact Change. 107-118
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Yossi Azar, Leah Epstein:
  On-Line Load Balancing of Temporary Tasks on Identical Machines. 119-125
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Ron Shamir, Dekel Tsur:
  Faster subtree isomorphism. 126-131
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Christian Capelle, Michel Habib:
  Graph decompositions and factorizing permutations. 132-143
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Richard Beigel:
  Closure Properties of GapP and #P. 144-146
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Orna Kupferman, Moshe Y. Vardi:
  Weak Alternating Automata Are Not That Weak. 147-158
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Richard Beigel, Richard Chang:
  Commutative Queries. 159-165
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Vladimir Grebinski, Gregory Kucherov:
  Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. 166-173
  Electronic Edition (IEEE Computer Society DL) BibTeX
• Yuval Ishai, Eyal Kushilevitz:
  Private Simultaneous Messages Protocols with Applications. 174-184
  Electronic Edition (IEEE Computer Society DL) BibTeX