Journal of the ACM Bibliography

Selected papers that cite this one

• Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.

• Sanjeev Arora and Madhu Sudan. Improved low degree testing and its applications. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 485-495, El Paso, Texas, 4-6 May 1997.

• Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, and Stefano Varricchio. On the applications of multiplicity automata in learning. In 37th Annual Symposium on Foundations of Computer Science, pages 349-358, Burlington, Vermont, 14-16 October 1996. IEEE.

• Nader H. Bshouty. On the complexity of functions for random access machines. Journal of the ACM, 40(2):211-223, April 1993.

• Daoud Bshouty and Nader H. Bshouty. On interpolating arithmetic read-once formulas with exponentiation. Journal of Computer and System Sciences, 56(1):112-124, February 1998.

• Nader H. Bshouty and Richard Cleve. Interpolating arithmetic read-once formulas in parallel. SIAM Journal on Computing, 27(2):401-413, March 1998.

• Nader H. Bshouty, Thomas R. Hancock, and Lisa Hellerstein. Learning arithmetic read-once formulas. SIAM Journal on Computing, 24(4):706-735, August 1995.

• Zhi-Zhong Chen and Ming-Yang Kao. Reducing randomness via irrational numbers. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 200-209, El Paso, Texas, 4-6 May 1997.

• Joseph Cheriyan. Randomized \tilde{O}(M(|V|)) algorithms for problems in matching theory. SIAM Journal on Computing, 26(6):1635-1655, December 1997.

• Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, and Kai Werther. On real Turing machines that toss coins. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 335-342, Las Vegas, Nevada, 29 May-1 June 1995.

• Ioannis Z. Emiris and John F. Canny. A general approach to removing degeneracies. SIAM Journal on Computing, 24(3):650-664, June 1995.

• Mark J. Encarnación. Black-box polynomial resultants. Information Processing Letters, 61(4):201-204, 28 February 1997.

• Hillel Gazit and John H. Reif. A randomized parallel algorithm for planar graph isomorphism. Journal of Algorithms, 28(2):290-314, August 1998.

• Mark Giesbrecht. Nearly optimal algorithms for canonical matrix forms. SIAM Journal on Computing, 24(5):948-969, October 1995.

• D. Grigoriev. Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. Theoretical Computer Science, 180(1-2):217-228, 10 June 1997.

• Pascal Koiran. Randomized and deterministic algorithms for the dimension of algebraic varieties. In 38th Annual Symposium on Foundations of Computer Science, pages 36-45, Miami Beach, Florida, 20-22 October 1997. IEEE.

• H. Narayanan, Huzur Saran, and Vijay V. Vazirani. Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees. SIAM Journal on Computing, 23(2):387-397, April 1994.

• Noam Nisan and Avi Wigderson. On the complexity of bilinear forms. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 723-732, Las Vegas, Nevada, 29 May-1 June 1995.

• Victor Y. Pan. Parallel computation of polynomial GCD and some related parallel computations over abstract fields. Theoretical Computer Science, 162(2):173-223, 20 August 1996.

• V. Y. Pan. New resultant inequalities and complex polynomial factorization. SIAM Journal on Computing, 23(5):934-950, October 1994.

• Victor Y. Pan, Isdor Sobze, and Antoine Atinkpahoun. On parallel computations with banded matrices. Information and Computation, 120(2):237-250, 1 August 1995.

• Sridhar Rajagopalan and Leonard J. Schulman. Verifying identities (extended abstract). In 37th Annual Symposium on Foundations of Computer Science, pages 612-616, Burlington, Vermont, 14-16 October 1996. IEEE.

• Hal Wasserman and Manuel Blum. Software reliability via run-time result-checking. Journal of the ACM, 44(6):826-849, November 1997.

• Richard Zippel. Zero testing of algebraic functions. Information Processing Letters, 61(2):63-67, 28 January 1997.

Shortcuts: