Author of the publication

Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract)

, , and . STOC, page 562-573. ACM, (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Undirected s-t Connectivity in Polynomial Time and Sublinear Space., and . Comput. Complex., 6 (1): 1-28 (1997)Pointers versus Arithmetic in PRAMs., , , , and . J. Comput. Syst. Sci., 53 (2): 218-232 (1996)Improved Time and Space Bounds for Boolean Matrix Multiplication., , , and . Acta Inf., (1978)Validating clustering for gene expression data., , and . Bioinform., 17 (4): 309-318 (2001)CMfinder - a covariance model based RNA motif finding algorithm., , and . Bioinform., 22 (4): 445-452 (2006)Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract), , and . STOC, page 562-573. ACM, (1989)Two applications of complementation via inductive counting., , , , and . SCT, page 116-125. IEEE Computer Society, (1988)A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity, , , and . SCT, page 27-33. IEEE Computer Society, (1992)Finding Non-coding RNAs Through Genome-Scale Clustering., , , , and . APBC, volume 6 of Advances in Bioinformatics and Computational Biology, page 199-210. Imperial College Press, (2008)Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)., and . ICALP, volume 226 of Lecture Notes in Computer Science, page 95-104. Springer, (1986)