Kevin Cattell, et al.  Home/Search
Context
Related
| cis.uoguelph.ca/~sawada/papers...un.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cis.uoguelph.ca/~sawada/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper ## Sawada 23 developed an algorithm to generate k-ary bracelets in constant ## amortized time. Proskurowski et al. 17 show that the orbits of the ' Z. Z. Z . composition of b and d can be generated in amortized Oktime, which is CAT if k is fixed. It remains an interesting challenge to develop efficient algorithms for the other compositions (Update)
Similar documents (at the sentence level):
21.3%: Generating Unlabeled Necklaces and Irreducible.. - Cattell, Ruskey.. (1998) (Correct)
Active bibliography (related documents): More All
0.5: A Fast Algorithm for Generating Non-Isomorphic Chord Diagrams - Sawada (Correct)
0.3: An Efficient Algorithm for Generating Necklaces with Fixed.. - Ruskey, Sawada (1999) (Correct)
0.2: Generating Bracelets in Constant Amortized Time - Sawada (2001) (Correct)
Similar documents based on text: More All
0.5: Generating Lyndon brackets. An addendum to: Fast algorithms.. - Sawada, Ruskey (2002) (Correct)
0.2: Generating Necklaces - Ruskey, Savage, Wang (1992) (Correct)
0.2: A Gray Code for Necklaces of Fixed Density - Wang, Savage (1997) (Correct)
BibTeX entry: (Update)
@article{ cattell00fast,
author = "Kevin Cattell and Frank Ruskey and Joe Sawada and Micaela Serra and C. Robert Miers",
title = "Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over {GF}(2)",
journal = "J. Algorithms",
volume = "37",
number = "2",
pages = "267-282",
year = "2000",
url = "citeseer.ist.psu.edu/cattell00fast.html" }
Citations (may not include all citations):442 Concrete Mathematics (context) - Graham, Knuth et al. - 1976
170 Shift Register Sequences (context) - Golomb - 1967
145 Introduction to Finite Fields and Their Applications (context) - Lidl, Niederreiter - 1994
135 Combinatorics on Words (context) - Lothaire - 1983
80 Free Lie Algebras (context) - Reutenauer - 1993
18 Axioms and Hulls (context) - Knuth - 1992
11 Symmetry types of periodic sequences (context) - Gilbert, Riordan - 1961
10 Average cost of Duval's algorithm for generating Lyndon Z - Berstel, Pocchiola - 1983
7 Arithmetic and Factorization of Polynomials over F - Gathen, Gerhard - 1996
7 Generation d'une section des classes de conjugaison et arbre.. (context) - Duval - 1988
5 Generating necklaces and strings with forbidden substrings - Ruskey, Sawada - 2000
2 Tools and Fundamental Constructions of Combinatorial Mathema.. (context) - Luneburg - 1989
2 Generating bracelets in constant amortized time - Sawada - 1999
1 An algorithm for generating necklaces of beads in two Z (context) - Fredricksen, Kessler - 1986
1 Necklaces of beads in k colors and k-ary de Bruijn Z (context) - Fredricksen, Maiorana - 1978
1 course notes for CSC (context) - Ruskey, generation - 1992
1 An efficient algorithm for generating necklaces with fixed Z - Ruskey, Sawada - 1999
1 Analysis of algorithms for listing equivalence Z (context) - Proskurowski, Ruskey et al. - 1998
1 Irreducible Polynomials, Synchronization Codes, Primitive Ne.. (context) - Golomb - 1967
1 Proc. ISSAC 96 (context) - Gathen, Gerhard et al. - 1996
Documents on the same site (http://www.cis.uoguelph.ca/~sawada/pub.html): More
Generating and Characterizing the Perfect.. - Chandran, Ibarra.. (2003) (Correct)
An Efficient Algorithm for Generating Necklaces with Fixed.. - Ruskey, Sawada (1999) (Correct)
Bent Hamilton Cycles in d-Dimensional Grid Graphs - Ruskey University Of (2003) (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