Edward Reingold

Edward M. Reingold (born 1945) is a computer scientist active in the fields of algorithms, data structures, graph drawing, and calendrical calculations.

In 1996 he was inducted as a Fellow of the Association for Computing Machinery.[1]

In 2000 he retired from University of Illinois at Urbana-Champaign and since then is a professor of computer science and applied mathematics at the Illinois Institute of Technology.[2]

Works

He has co-authored the standard text on calendrical calculations, Calendrical Calculations, with Nachum Dershowitz. [3] [4][5][6]

In 1981 he was the co-author, with John Tilford, of the canonical paper "Tidier Drawings of Trees" which described a method, now known as the Reingold-Tilford algorithm, to produce more aesthetically pleasing drawing of binary (and by extension, m-ary) trees .

gollark: > Which is exactly what they wanted here!Not necessarily, this actually does sound like a case where they might want each task to run in its own coroutines (or would, if their pathfinding did yields).
gollark: I mean, it's great for very simple situations where you want to run two things at once in the simplest case, but often projects want to run a listener "thread" and temporarily spawn tasks to handle them or something and this ends up being constantly reinvented.
gollark: > Thanks for that gollark :/.You're welcome! It would be useful if there was an API for this! Perhaps I could simplify some of my stuff and make a PR!
gollark: Parallel isn't great because you can't add an extra task after it starts.
gollark: They CLAIM to be running the latest version from the git repo.

References
  1. ACM Fellow Award Citation, accessed 2011-09-19.
  2. Faculty listing, Computer Science Dept., Illinois Institute of Technology, accessed 2015-08-23.
  3. Edward M. Reingold and Nachum Dershowitz. Calendrical Calculations. Cambridge University Press; 3 edition (December 10, 2007). ISBN 978-0-521-88540-9
  4. Review of Calendrical Calculations by E. G. Richards (1998), Nature 391: 33–34, doi:10.1038/34083.
  5. Review of Calendrical Calculations by Robert Poole (1999), The British Journal for the History of Science 32 (1): 116–118, JSTOR 4027975.
  6. Review of Calendrical Calculations by N. M. Swerdlow (1998), IEEE Annals of the History of Computing 20 (3): 78, doi:10.1109/MAHC.1998.707580.



This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.