Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Frank Ruskey
Observed names:
F. Ruskey,
Frank Ruskey A,
Ruskey, Frank,
Ruskey, Frank, joint author.
Institution:
University of Victoria
Observed institutions:
Rutgers, The State University of New Jersey,
Microsoft (United States),
North Carolina State University,
Duke University,
University of Oregon,
University of Toronto,
University of Victoria,
University of California San Diego,
San Jose State University,
University of Palermo
show all 10
ORCID:
0000-0001-5523-7185
Observed ORCID:
0000-0001-5523-7185
OpenAlex ID:
A5048017151
Generating Binary Trees Lexicographically
1977
·
F. Ruskey
, T. C. Hu
·
SIAM Journal on Computing
·
134
Ranking and unranking permutations in linear time
2001
·
Wendy Myrvold
, Frank Ruskey
·
Information Processing Letters
·
126
Generating Linear Extensions Fast
1994
·
Gara Pruesse
, Frank Ruskey
·
SIAM Journal on Computing
·
125
On Rotations and the Generation of Binary Trees
1993
·
J.M. Lucas
, D.R. Vanbaronaigien
, et al.
·
Journal of Algorithms
·
103
Drawing Area-Proportional Venn and Euler Diagrams
2004
·
Stirling Chow
, Frank Ruskey
·
Lecture notes in computer science
·
102
Generating necklaces
1992
·
Frank Ruskey
, Carla Savage
, et al.
·
Journal of Algorithms
·
89
Algorithms and complexity for annotated sequence analysis
1999
·
Michael R. Fellows
, Frank Ruskey
, et al.
·
88
Three-dimensional graph drawing
1997
·
R. F. Cohen
, P. Eades
, et al.
·
Algorithmica
·
87
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
2000
·
Kevin Cattell
, Frank Ruskey
, et al.
·
Journal of Algorithms
·
79
An Efficient Algorithm for Generating Necklaces with Fixed Density
1999
·
Frank Ruskey
, Joe Sawada
·
SIAM Journal on Computing
·
76
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
1993
·
Frank Ruskey
, Carla Savage
·
SIAM Journal on Discrete Mathematics
·
57
The coolest way to generate combinations
2008
·
Frank Ruskey
, Aaron Williams
·
Discrete Mathematics
·
56
Generating binary trees by transpositions
1990
·
Frank Ruskey
, Andrzej Proskurowski
·
Journal of Algorithms
·
56
Generating t -Ary Trees Lexicographically
1978
·
Frank Ruskey
·
SIAM Journal on Computing
·
54
Adjacent interchange generation of combinations
1988
·
Frank Ruskey
·
Journal of Algorithms
·
52
Simple combinatorial Gray codes constructed by reversing sublists
1993
·
Frank Ruskey
·
Lecture notes in computer science
·
51
Three-dimensional graph drawing
1995
·
Robert F. Cohen
, Peter Eades
, et al.
·
Lecture notes in computer science
·
48
Binary bubble languages and cool-lex order
2011
·
Frank Ruskey
, Joe Sawada
, et al.
·
Journal of Combinatorial Theory Series A
·
44
An explicit universal cycle for the ( n -1)-permutations of an n -set
2010
·
Frank Ruskey
, Aaron Williams
·
ACM Transactions on Algorithms
·
43
The advantages of forward thinking in generating rooted and free trees
1999
·
Gang Li
, Frank Ruskey
·
Symposium on Discrete Algorithms
·
43
Generating t-ary trees in A-order
1988
·
D.Roelants van Baronaigien
, Frank Ruskey
·
Information Processing Letters
·
43
Shorthand Universal Cycles for Permutations
2011
·
Alexander E. Holroyd
, Frank Ruskey
, et al.
·
Algorithmica
·
41
Generating linear extensions of posets by transpositions
1992
·
Frank Ruskey
·
Journal of Combinatorial Theory Series B
·
41
PDF
De Bruijn Sequences for Fixed-Weight Binary Strings
2012
·
Frank Ruskey
, Joe Sawada
, et al.
·
SIAM Journal on Discrete Mathematics
·
40
State generation and automated class testing
2000
·
Thomas Ball
, Daniel Hoffman
, et al.
·
Software Testing Verification and Reliability
·
37
Show more works
View as search
Works count:
173
Citation count:
2,767
H-index:
31
I10-index:
65
Year
Topic
Type
