J. Maurice Rojas On the Complexity of Diophantine Geometry in Low Dimensions (Abstract). [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:3- [Conf]

Marcus Schaefer Graph Ramsey Theory and the Polynomial Hierarchy (Abstract). [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:6- [Conf]

Oded Goldreich, Salil P. Vadhan Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:54-0 [Conf]

Avi Wigderson De-Randomizing BPP: The State of the Art. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:76-0 [Conf]

László Babai, Sophie Laplante Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:98-104 [Conf]

Jin-yi Cai Some Recent Progress on the Complexity of Lattice Problems. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:158-0 [Conf]

John Watrous Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:180-187 [Conf]

Jin-yi Cai Applications of a New Transference Theorem to Ajtai's Connection Factor. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:205-214 [Conf]