Frank Ruskey

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]

Frank Ruskey
Frank Ruskey at the Workshop on Theory and Practice of Graph Drawing, 2012
Alma materUniversity of California, San Diego
Scientific career
FieldsCombinatorics, computer science
InstitutionsUniversity of Victoria

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): 343–366. CiteSeerX 10.1.1.51.8866. doi:10.1006/jagm.1993.1045.
  • Pruesse, Gara; Ruskey, Frank (April 1994). "Generating Linear Extensions Fast". SIAM Journal on Computing. 23 (2): 373–386. CiteSeerX 10.1.1.52.3057. doi:10.1137/s0097539791202647.
  • Ruskey, F.; Hu, T. C. (1977). "Generating Binary Trees Lexicographically". SIAM Journal on Computing. 6 (4): 745–758. doi:10.1137/0206055.
  • Ruskey, Frank; Weston, Mark (June 2005). "A Survey of Venn Diagrams". The Electronic Journal of Combinatorics. Archived from the original on 11 October 2011. Retrieved 1 October 2011.
gollark: Because something something environments.
gollark: You might think "ah yes, I will just `term.redirect` it", but that doesn't work either.
gollark: As Luca said, you can't see what number it prints. If it was that easy someone would have done it.
gollark: <@151391317740486657> Actually, you can't.
gollark: Yes, but don't use the "potato" name and it's a really bad idea because it's not a good robot detection mechanism.

References
  1. "Frank Ruskey". Department of Computer Science. University of Victoria. Retrieved 15 February 2019.
  2. "The Combinatorial Object Server++". combos.org. Retrieved 2019-05-30.


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