Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Ehrenfeucht-Mycielski sequence

From MaRDI portal
Publication:1044039
Jump to:navigation, search

DOI10.1016/j.jda.2009.01.002zbMath1183.68443OpenAlexW2019497371MaRDI QIDQ1044039

Grzegorz Herman, Michael Soltys

Publication date: 10 December 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2009.01.002


zbMATH Keywords

pseudo-random sequencesAckermann functionEhrenfeucht-Mycielski sequenceprefix tries


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Data structures (68P05)





Cites Work

  • Unnamed Item
  • A Pseudorandom Sequence--How Random Is It?
  • The Ehrenfeucht-Mycielski Sequence
  • Fast Pattern Matching in Strings




This page was built for publication: On the Ehrenfeucht-Mycielski sequence

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1044039&oldid=13059347"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki