Journal of the ACM Bibliography
Shlomo Moran, Marc Snir, and Udi Manber. Applications of Ramsey's
theorem to decision tree complexity. Journal of the ACM,
32(4):938-949, October 1985.
[BibTeX entry]
Selected papers that cite this one
- Yosi Ben-Asher and Ilan Newman. Decision trees with
Boolean threshold queries. Journal of Computer and System
Sciences, 51(3):495-502, December 1995.
- Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer
auf der Heide. Transforming
comparison model lower bounds to the parallel-random-access-machine.
Information Processing Letters, 62(2):103-110, 28 April
1997.
- Nader H. Bshouty. On the
complexity of functions for random access machines. Journal of
the ACM, 40(2):211-223, April 1993.
- Yishay Mansour, Baruch Schieber, and Prasoon Tiwari. A lower bound for integer
greatest common divisor computations. Journal of the
ACM, 38(2):453-471, April 1991.
- Moni Naor and Larry Stockmeyer. What can be computed
locally? SIAM Journal on Computing, 24(6):1259-1277,
December 1995.
Shortcuts: