Edward M. Reingold , Ph.D.
Professor of Computer Science
Office: Stuart Building 228F
Phone: 312.567.3309
Fax: 312.567.5067
Email: reingold@iit.edu
Web: click here
Expertise
Education
Curriculum Vitae
Research & Major Accomplishments
Current Projects
Awards/Honors
- Fellow of the ACM, 1996
Patents
Books
Selected Publications
Books
Computer Approaches to Mathematical Problems (with J. Nievergelt and J. C. Farrar), Prentice-Hall, 1974. Translated into Japanese, Russian, Polish, and Hungarian. Out of print 1987.
Combinatorial Algorithms: Theory and Practice (with J. Nievergelt and N. Deo), Prentice-Hall, 1977. Translated into Russian and Polish. Out of print 1997.
Data Structures (with W. J. Hansen), Little, Brown, and Co., 1983. Out of print 1995.
Data Structures in Pascal (with W. J. Hansen), Little, Brown and Co., 1986. Out of print 1997.
PascAlgorithms (with R. N. Reingold), Scott, Foresman/Little, Brown and Co., 1988. Out of print 1993.
Programming with class: A C++ Introduction to Computer Science (with S. N. Kamin), McGraw-Hill Book Co., 1996. Out of print 2001.
Calendrical Calculations (with N. Dershowitz), Cambridge University Press, 1997. Millennium second edition, 2001; 2002 Choice Outstanding Academic Title Award Winner. Third edition, 2008.
An Introduction to Computer Science Using Java (with S. N. Kamin and M. D. Mikunas), McGraw-Hill Book Co., 1998. Second edition, 2002.
Calendrical Tabulations 1900-2200 (with N. Dershowitz), Cambridge University Press, 2002.
Journal Articles
"Binary Search Trees of Bounded Balance'' (with J. Nievergelt), SIAM J. on Computing, vol. 2 (1973), 33-43.
"Tidier Drawings of Trees'' (with J. S. Tilford), IEEE Trans. Software Engineering, vol. 7 (1981), 223-228.
"The Complexity of Drawing Trees Nicely'' (with K. J. Supowit), Acta Informatica, vol. 18 (1983), 377-392.
"Optimum Lopsided Binary Trees'' (with S. Kapoor), J. ACM, vol. 36 (1989), 573-590.
"Calendrical Calculations'' (with N. Dershowitz), Software---Practice and Experience, vol. 20 (1990), 899-928.
"Graph Drawing by Force-Directed Placement,'' (with T. M. J. Fruchterman), Software---Practice and Experience, vol. 21 (1991), 1129--1164. One of the most cited articles in computer science published in 1991 (as per CiteSeer).
"The Average-Case Complexity of Determining the Majority'' (with L. Alonso and R. Schott), SIAM J. on Computing, vol. 26 (1997), 1-14.
"Average-Case Analysis of Some Plurality Algorithms'' (with L. Alonso), ACM Transactions on Algorithms, vol. 5 (2009), 17-1--17-36.