Michael D. Hirsch

Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract)

Stephen A. Vavasis, Michael D. Hirsch, 1987, FOCS.

A Robust Algorithm for Point in Polyhedron

Michael D. Hirsch, C. Bradford Barber, 1993, CCCG.

Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry

Jin-Yi Cai, Michael D. Hirsch, 1994, ISAAC.

Design and Implementation of a Multicast Audio Confrencing Tool for Collaborative Computing Framework

Injong Rhee, Shun Yan Cheung, Michael D. Hirsch, 1998, Inf. Sci..

Design and implementation of a distributed X-multiplexor

Injong Rhee, Vaidy S. Sunderam, Alan T. Krantz, 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs

Michael D. Hirsch, 2005, computational complexity.

CCF: Collaborative Computing Frameworks

Injong Rhee, Vaidy S. Sunderam, Paul A. Gray, 1998, Proceedings of the IEEE/ACM SC98 Conference.

Exponential lower bounds for finding Brouwer fixed points

Christos H. Papadimitriou, Stephen A. Vavasis, Michael D. Hirsch, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

Celebrating a decade of neuroscience databases

Stephen H. Koslow, Michael D. Hirsch, 2007, Neuroinformatics.

The Logix system user manual version 1.21

Ehud Shapiro, Avshalom Houri, William Silverman, 1988 .

A new algorithm for recognizing the unknot

Michael D. Hirsch, Joan S. Birman, 1998 .