Frank Ruskey
Encyclopedia
Frank Ruskey is a combinatorialist
Combinatorics
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size , deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria ,...

 and computer scientist
Computer science
Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...

, and professor at the University of Victoria
University of Victoria
The University of Victoria, often referred to as UVic, is the second oldest public research university in British Columbia, Canada. It is a research intensive university located in Saanich and Oak Bay, about northeast of downtown Victoria. The University's annual enrollment is about 20,000 students...

. His research involves algorithms for exhaustively listing discrete structures, combinatorial Gray code
Gray code
The reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only one bit. It is a non-weighted code....

s, Venn
Venn diagram
Venn diagrams or set diagrams are diagrams that show all possible logical relations between a finite collection of sets . Venn diagrams were conceived around 1880 by John Venn...

 and Euler diagram
Euler diagram
An Euler diagram is a diagrammatic means of representing sets and their relationships. The first use of "Eulerian circles" is commonly attributed to Swiss mathematician Leonhard Euler . They are closely related to Venn diagrams....

s, combinatorics on words
Combinatorics on words
Combinatorics on words is a branch of mathematics which applies combinatorics to words and formal languages. The study of combinatorics on words arose independently within several branches of mathematics, e.g. number theory, group theory and probability...

, and enumerative combinatorics
Enumerative combinatorics
Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations...

. Frank Ruskey is the author of the Combinatorial Object Server (COS), a website for information on and generation of combinatorial objects.

External links

The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK