CJTCS Volume 1999

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
1999 Abstracts

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