Frank Ruskey

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Frank Ruskey
Frank Ruskey WTPGD.jpg
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[edit]

  • 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). doi:10.1137/s0097539791202647. 
  • Ruskey, F.; Hu, T. C. (1977). "Generating Binary Trees Lexicographically". SIAM Journal on Computing 6 (4). doi:10.1137/0206055. 
  • Ruskey, Frank; Weston, Mark (June 2005). "A Survey of Venn Diagrams". The Electronic Journal of Combinatorics. Retrieved 1 October 2011. 

References[edit]

  1. ^ "Frank Ruskey". Department of Computer Science. University of Victoria. Retrieved 1 October 2011. 
  2. ^ Ruskey, Frank. "The (Combinatorial) Object Server". University of Victoria. Retrieved 1 October 2011. 

External links[edit]