Generating De Bruijn Sequences: An Efficient Implementation. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/tc/Annexstein97>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Fred_S._Annexstein>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2F12.565596>
foaf:homepage	<https://doi.org/10.1109/12.565596>
dc:identifier	DBLP journals/tc/Annexstein97 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2F12.565596 (xsd:string)
dcterms:issued	1997 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label	Generating De Bruijn Sequences: An Efficient Implementation. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Fred_S._Annexstein>
swrc:number	2 (xsd:string)
swrc:pages	198-200 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/tc/Annexstein97/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/tc/Annexstein97>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/tc/tc46.html#Annexstein97>
rdfs:seeAlso	<https://doi.org/10.1109/12.565596>
dc:subject	Shift register sequences, De Bruijn graphs, computational complexity, recursive algorithms, NESL programming language. (xsd:string)
dc:title	Generating De Bruijn Sequences: An Efficient Implementation. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	46 (xsd:string)