1

R. C. Holt and E. M. Reingold, On the time required to detect cycles and connectivity in graphs. <u>Math. Systems Theory 6</u> (1972) 103--106.

Valerie King, Lower bounds on the complexity of graph properties, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.468-476, May 02-04, 1988, Chicago, Illinois, United States

Ronald L. Rivest , Jean Vuillemin, A generalization and proof of the Aanderaa-Rosenberg conjecture, Proceedings of seventh annual ACM symposium on Theory of computing, p.6-11, May 05-07, 1975, Albuquerque, New Mexico, United States

N. Nisan, CREW PRAMS and decision trees, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.327-335, May 14-17, 1989, Seattle, Washington, United States

Bruce Weide, A Survey of Analysis Techniques for Discrete Algorithms, ACM Computing Surveys (CSUR), v.9 n.4, p.291-313, Dec. 1977

David Peleg , Avishai Wool, How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract), Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.290-299, May 23-26, 1996, Philadelphia, Pennsylvania, United States

David Kirkpatrick, Determining graph properties from matrix representations, Proceedings of the sixth annual ACM symposium on Theory of computing, p.84-90, April 30-May 02, 1974, Seattle, Washington, United States

Oded Goldreich , Shari Goldwasser , Dana Ron, Property testing and its connection to learning and approximation, Journal of the ACM (JACM), v.45 n.4, p.653-750, July 1998

Frédéric Magniez , Miklos Santha , Mario Szegedy, Quantum algorithms for the triangle problem, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia

Oded Goldreich, Property testing in massive graphs, Handbook of massive data sets, Kluwer Academic Publishers, Norwell, MA, 2002

Ariel D. Procaccia, A note on the query complexity of the Condorcet winner problem, Information Processing Letters, v.108 n.6, p.390-393, November, 2008

Arnold L. Rosenberg: colleagues