Остановите войну!
for scientists:
default search action
Frank Ruskey
- > Home > Persons > Frank Ruskey
Publications
- 2017
- [j69]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659: 1-13 (2017) - 2016
- [i9]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Prefix Normal Words and Prefix Normal Forms. CoRR abs/1611.09017 (2016) - 2014
- [c27]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CPM 2014: 60-69 - [c26]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. FUN 2014: 74-88 - [i8]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CoRR abs/1401.6346 (2014) - [i7]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. CoRR abs/1404.2824 (2014) - 2012
- [j65]Frank Ruskey, Joe Sawada, Aaron Williams:
Binary bubble languages and cool-lex order. J. Comb. Theory, Ser. A 119(1): 155-169 (2012) - [j58]Frank Ruskey, Joe Sawada, Aaron Williams:
De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discret. Math. 26(2): 605-617 (2012) - 2003
- [j45]Frank Ruskey, Joe Sawada:
Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electron. J. Comb. 10 (2003) - [j43]Joe Sawada, Frank Ruskey:
Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). J. Algorithms 46(1): 21-26 (2003) - [j42]John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson:
Euclidean strings. Theor. Comput. Sci. 301(1-3): 321-340 (2003) - [j41]L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada:
Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003) - 2001
- [j39]Frank Ruskey, C. Robert Miers, Joe Sawada:
The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discret. Math. 14(2): 240-245 (2001) - 2000
- [j38]Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers:
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). J. Algorithms 37(2): 267-282 (2000) - [c9]Frank Ruskey, Joe Sawada:
Generating Necklaces and Strings with Forbidden Substrings. COCOON 2000: 330-339 - [c8]Frank Ruskey, Joe Sawada:
A fast algorithm to generate unlabeled necklaces. SODA 2000: 256-262 - 1999
- [j36]Frank Ruskey, Joe Sawada:
An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. 29(2): 671-684 (1999) - [c6]Joe Sawada, Frank Ruskey:
An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA 1999: 752-758
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-04 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint