Todd Ebert: List of Publications with preprints

T. Ebert, D. Goldstein.
A `Go With the Winners’approach to finding frequent patterns.
To appear in the 20^th ACM Symposium on Applied Computing, Sante Fe New Mexico, March 2005

T. Ebert, W. Merkle, H. Vollmer
On the autoreducibility of random sequences.
Electronic Colloquium on Computational Complexity TR02-056, 2002
Preprint of journal version that appeared in SIAM Journal on Computing , 
Vol. 32, No. 6, pages 1542-1569, 2003

T. Ebert, W.Merkle.
On the autoreducibility of random sets: a sharp bound on the density of guessed bits .
Mathematical Foundations of Computer Science 2002, 27th International Symposium,
Lecture Notes in Computer Science, Vol. 2420, pages 231-232, Springer-Verlag, 2002

T. Ebert, H. Vollmer.
On the autoreducibility of random sequences.
In: M. Nielsen, B. Rovan (eds.), Mathematical Foundations of Computer Science 2000, 25th International Symposium,
MFCS 2000, Lecture Notes in Computer Science 1893, pages 333-342, Springer-Verlag, 2000

T. Ebert.
Applications of recursive operators to randomness and complexity.
Ph.D. Thesis, University of California at Santa Barbara, 1998.