Author of the publication

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

, , , and . SCT, page 27-33. IEEE Computer Society, (1992)

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

Vertex Types in Book-Embeddings., , and . SIAM J. Discret. Math., 2 (2): 156-175 (1989)The Computational Complexity of Some Problems of Linear Algebra., , and . J. Comput. Syst. Sci., 58 (3): 572-596 (1999)Sharply Bounded Alternation within P, , and . Electron. Colloquium Comput. Complex., (1996)Sharply Bounded Alternation and Quasilinear Time., , and . Theory Comput. Syst., 31 (2): 187-214 (1998)Number of Variables Is Equivalent to Space., , and . J. Symb. Log., 66 (3): 1217-1230 (2001)The complexity of fixed-parameter problems: guest column., and . SIGACT News, 39 (1): 33-46 (2008)On the Pagenumber of Planar Graphs, and . STOC, page 98-100. ACM, (1984)Pattern Matching for Permutations., , and . Inf. Process. Lett., 65 (5): 277-283 (1998)Pattern Matching for Permutations., , and . WADS, volume 709 of Lecture Notes in Computer Science, page 200-209. Springer, (1993)A theory of oracle machines.. SCT, page 175-181. IEEE Computer Society, (1987)