A Survey of Combinatorial Gray Codes - Savage (ResearchIndex)

See this document in CiteSeerX!

A Survey of Combinatorial Gray Codes (1996) (Make Corrections) (26 citations)
Carla SavageSIAM Review

View or download:
ncsu.edu/faculty/savage/AVA...survey.ps
Cached: PS.gz PS PDF Image Update Help

From: ncsu.edu/faculty/savage/ (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: The term combinatorial Gray code was introduced in 1980 to refer to any method for generating combinatorial objects so that successive objects differ in some pre-specified, small way. This notion generalizes the classical binary reflected Gray code scheme for listing n-bit binary numbers so that successive numbers differ in exactly one bit position, as well as work in the 1960's and 70's on minimal change listings for other combinatorial families, including permutations and combinations.... (Update)

Similar documents based on text: More All
0.7: Near Optimal Single-Track Gray Codes - Etzion, Paterson (1996) (Correct)
0.7: Transition Restricted Gray Codes - Bultena, Ruskey (1996) (Correct)
0.6: Antipodal Gray Codes - Killian, Savage (2002) (Correct)

BibTeX entry: (Update)

C. Savage. A survey of combinatorial gray codes. SIAM Review, 39(4):605--629, Dec. 1997. http://citeseer.ist.psu.edu/savage96survey.html More

@article{ savage97survey,
    author = "Carla Savage",
    title = "A survey of combinatorial {Gray} codes",
    journal = "SIAM Review",
    volume = "39",
    number = "4",
    pages = "605--629",
    year = "1997",
    url = "citeseer.ist.psu.edu/savage96survey.html" }

Citations (may not include all citations):
686 a Guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
48 Group action graphs and parallel architectures (context) - Annexstein, Baumslag et al. - 1990
39 Gray codes and paths on the n-cube (context) - Gilbert - 1958
36 and hyperbolic geometry (context) - Sleator, Tarjan et al. - 1988
31 Constructive Combinatorics (context) - Stanton, White - 1986
28 A survey of full length nonlinear shift register cycle algor.. (context) - Fredricksen - 1982
28 A combinatorial problem (context) - de Bruijn - 1946
26 Gray codes for partial match and range queries (context) - Faloutsos - 1988
25 Efficient generation of the binary reflected Gray code (context) - Bitner, Ehrlich et al. - 1976
23 Generating linear extensions fast - Pruesse, Ruskey - 1994
23 Generation of permutations by adjacent transpositions (context) - Johnson - 1963
20 Combinatorial Algorithms for Computers and Calculators (context) - Nijenhuis, Wilf - 1978
18 Gray codes with optimized run lengths (context) - Goddyn, Lawrence et al. - 1988
18 Combinatorial Algorithms: An Update (context) - Wilf - 1989
17 Subcube allocation and task migration in hypercube machines (context) - Chen, Shin - 1990

[Article contains additional citations not shown here]

The graph only includes citing articles where the year of publication is known.

Documents on the same site (http://www.csc.ncsu.edu/faculty/savage/): More
On multi-color partitions and the generalized.. - Jing, Misra, Savage (1999) (Correct)
On the Multiplicity of Parts in a Random Partition - Corteel, Pittel, al. (1998) (Correct)
A Lattice Path Approach to Counting Partitions With Minimum Rank - Burstein, Corteel (Correct)

Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback

CiteSeer.IST - Copyright Penn State and NEC