Frank Ruskey
From Wikipedia, the free encyclopedia
| Frank Ruskey | |
|---|---|
 Frank Ruskey at the Workshop on Theory and Practice of Graph Drawing, 2012 | |
| Fields | Combinatorics, computer science |
| Institutions | University of Victoria |
| Alma mater | University of California, San Diego |
Frank Ruskey is a combinatorialist and computer scientist, and professor at the University of Victoria. His research involves algorithms for exhaustively listing discrete structures, combinatorial Gray codes, Venn and Euler diagrams, combinatorics on words, and enumerative combinatorics.[1] Frank Ruskey is the author of the Combinatorial Object Server (COS), a website for information on and generation of combinatorial objects.[2]
Selected publications
- Lucas, J.M.; Vanbaronaigien, D.R.; Ruskey, F. (November 1993). "On Rotations and the Generation of Binary Trees". Journal of Algorithms 15 (3).
- Pruesse, Gara; Ruskey, Frank (April 1994). "Generating Linear Extensions Fast". SIAM Journal on Computing 23 (2).
- Ruskey, F.; Hu, T. C. (1977). "Generating Binary Trees Lexicographically". SIAM Journal on Computing 6 (4).
- Ruskey, Frank; Weston, Mark (June 2005). "A Survey of Venn Diagrams". The Electronic Journal of Combinatorics. Retrieved 1 October 2011.
References
- ↑ "Frank Ruskey". Department of Computer Science. University of Victoria. Retrieved 1 October 2011.
- ↑ Ruskey, Frank. "The (Combinatorial) Object Server". University of Victoria. Retrieved 1 October 2011.
External links
- Frank Ruskey's homepage
- Combinatorial Object Server
- Combinatorial Generation (Unpublished book). CiteSeerX: 10.1.1.93.5967, on combinatorics
- Frank Ruskey at the Mathematics Genealogy Project
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.