Volume 30, Number 1, March 1999

• 
  William I. Gasarch: The Book Review Column. 2
• 
  Timothy H. McNicholl: Book Review: Stable Marriage and its Relation to Other Combinatorial Problems: An Introduction to Algorithm Analysis by Donald E. Knuth (American Mathematical Society 1996). 2-4
• 
  Vladimir Tasic: Book Review: The Limits of Mathematics by G.J. Chaitin (Springer Verlag 1998). 5
• 
  Joseph Maklevitch: Book review: Privacy on the Line by Whitfield Diffie and Susan Landau (MIT Press 1998). 6-8
• 
  Brian Postow: Book review: A Theory of Objects by Martin Abadi and Luca Cardelli (Springer-Verlag, 1996): Series--Monographs in Computer Science. 9-11
• 
  Joel I. Seiferas: Reprints from Computing Reviews. 12-13
• 
  Heribert Vollmer: Uniform characterizations of complexity classes. 17-27
• 
  Jon G. Riecke: Report on POPL 1999. 28-29
• 
  Rocky Ross: Eudcation forum: Taking the Pulse: Assessing Student Perception of Learning. 30-32
• 
  Donald L. Kreher, Douglas R. Stinson: Combinatorial algorithms: generation, enumeration, and search. 33-35
• 
  Paul Cull: Table-automata/ finite co-finite languages. 41

Volume 30, Number 2, June 1999

Book reviews

• 
  William I. Gasarch: The book review column. 2
• 
  William I. Gasarch: Review of Alogrithms and Theory of Computation Handbook: edited by Mikhail Atallah. 3
• 
  William I. Gasarch: Review of Handbook of Combinatorics (in two Volumes): edited by R. L. Graham, M. Grötschel, L. Lovász. 7
• 
  Danny Krizanc: Review of Probabilistic Combinatorics and Its Applications: editor: Béla Bollobás. 12-14
• 
  Jacob Lurie: Review of Spectral Graph Theory: by Fan R. K. Chung. 14-16

Regular features

• 
  Joel I. Seiferas: Reprints from Computing Reviews. 17-18

Complexity theory column 24

• 
  Lane A. Hemaspaandra: Biomolecular computing: recent theoretical and experimental advances. 22-30

Computational geometry column 35

• 
  Joseph O'Rourke: Computational geometry column 35. 31-32

Logic column 8

• 
  Hayo Thielecke: Continuations, functions and jumps. 33-42

Education forum

• 
  Ricky Ross: Education forum. 43-46

Articles

• 
  Tomi Pasanen: In-place algorithms for sorting problems. 61

Volume 30, Number 3, September 1999

• 
  William I. Gasarch, Samir Khuller: The Book Review Column. 8
• 
  Michael I. Dekhtyar: Book review: Computational geometry in C Second Edition by Joseph O'Rourke (Cambridge University Press 1988). 8-13
• 
  Lance Fortnow: Book review: of Bounded Queries in Recursion Theory by William A. Gasarch and Georgia A. Martin (Birkhauser. Boston, Basel, Berlin, 1999). 13-15
• 
  Alexander Dekhtyar: Book review: Logic For Applications, Second Edition by Anil Nerode and Richard A. Shore (Springer Verlag 1997). 15-18
• 
  Colin Stirling: Decidability of bisimulation equivalence for normed pushdown processes. 19-21
• 
  Amnon Ta-Shma: Classical versus quantum communication complexity. 25-34
• 
  Joseph O'Rourke: Computational geometry column 36. 35-38
• 
  Erik D. Demaine, Joseph O'Rourke: Computational geometry column 37. 39-42
• 
  Tao Jiang, Paul E. Kearney, Ming Li: Some open problems in computational molecular biology. 43-49
• 
  Steven Skiena: Who is interested in algorithms and why?: lessons from the Stony Brook algorithms repository. 65-74
• 
  Carl Smith: On the importance of refereeing. 75-76

Volume 30, Number 4, December 1999

• 
  William I. Gasarch: The Book Review Column. 3
• 
  Chrystopher L. Nehaniv: Review of Mathematical Support for Molecular Biology edited by Martin Farach-Colton , Fred S. Roberts, Martin Vingron, and Michael Waterman. 4-7
• 
  Mitsunori Ogihara, Animesh Ray: Review of DNA Based Computers II edited by Lauara F. Lnndweber and Eric K. Baum. 7-9
• 
  Martyn Amos: Review of DNA Based Computers III edited by Harvey Rubin and David Harlan Wood. 10-12
• 
  Neal E. Young: Review of Online Computation and Competitive Analysis by Allan Borodin and Ran EI-Yaniv. 13-17
• 
  Zeke Zalcstein: NSF report: theory of computing program. 20-21
• 
  David J. Haglin: Technical report column. 22-24
• 
  Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe: One-way functions in worst-case cryptography: algebraic and security properties are on the house. 25-40
• 
  Leonid Libkin: Query languages with arithmetic and constraint databases. 41-50
• 
  Rocky Ross: Education Forum. 51-52
• 
  Susan H. Rodger: Teaching automata theory with JFLAP. 53-56
• 
  Catherine C. McGeoch, Bernard M. E. Moret: How to present a paper on experimental work with algorithms. 85-90
• 
  Suresh Venkatasubramanian: A theory repository on the Web: a proposal. 91-95