• 1999 Articles
  1. On Finding the Number of Graph Automorphisms by Robert Beals, Richard Chang, William Gasarch, and Jacobo Torán, 10 February 1999
  2. Randomized Reductions and Isomorphisms by Jie Wang (Special Issue on Computational Complexity, results from Dagstuhl-Seminar 1996, Eric Allender editor), 24 February 1999
  3. Complements of Multivalued Functions by Stephen Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, and Heribert Vollmer, 19 March 1999
  4. The Complexity of Generating Test Instances by Christoph Karg, Johannes Köbler, and Rainer Schuler (Special Issue on Computational Complexity, results from Dagstuhl-Seminar 1996, Eric Allender editor), 22 April 1999
  5. The Complexity of Problems on Graphs Represented as OBDDs by Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, and Mahesh Viswanathan, 6 August 1999
  6. Hopfield Neural Networks and Self-Stabilization by Arun Jagota, 6 August 1999
  7. The Permanent Requires Large Uniform Threshold Circuits by Eric Allender, 6 August 1999
  8. Bounds for Linear Satisfiability Problems by Jeff Erickson, 6 August 1999
  9. Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types by Martha J. Kosa, 6 August 1999
  10. Self-Stabilizing Distributed Constraint Satisfaction by Zeev Collin, Rina Dechter, and Shmuel Katz, 31 December 1999
  11. Satisfiability Coding Lemma by Ramamohan Paturi, Pavel Pudlak, and Francis Zane, 31 December 1999
  12. Equivalences for Fair Kripke Structures by Adnan Aziz, Felice Balarin, Vigyan Singhal, Robert Brayton, and Alberto Sangiovanni-Vincentelli 31 December 1999
• 1999 Abstracts

Volume 1998

Volume 2000

Published articles

Last modified: Fri Mar 19 16:13:47 CST 1999