( en | de | ru )

 

Disambiguation of "Duris, Pavol"

Author of the publication

copydeleteadd this publication to your clipboard
A Note on the Density of Oracle Decreasing Time-Space Complexity.

, and . Theor. Comput. Sci., 132 (2): 435-444 (1994)

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.

Étienne Duris

Martin Durisin

Peter Durisch

Pavol Hanus

Pavol Svaba

 

Other publications of authors with the same name

On the Power of Multiple Reads in a Chip., and . ICALP, volume 510 of Lecture Notes in Computer Science, page 697-706. Springer, (1991)On Computational Power of Partially Blind Automata.. Electron. Colloquium Comput. Complex., (2011)A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition., , and . CCC, page 214-228. IEEE Computer Society, (2000)Determinism and Nondeterminism in Finite Automata with Advice., , , and . Adventures Between Lower Bounds and Higher Altitudes, volume 11011 of Lecture Notes in Computer Science, page 3-16. Springer, (2018)On the Communication Complexity of Planarity., and . FCT, volume 380 of Lecture Notes in Computer Science, page 145-147. Springer, (1989)Semelectivity is not Sufficient., and . Inf. Process. Lett., 37 (3): 137-141 (1991)Multihead Finite State Automata and Concatenation., and . ICALP, volume 140 of Lecture Notes in Computer Science, page 176-186. Springer, (1982)Sensing Versus Nonsensing Automata., and . ICALP, volume 944 of Lecture Notes in Computer Science, page 455-463. Springer, (1995)Two Tapes are Better than One for Nondeterministic Machines., and . SIAM J. Comput., 13 (2): 219-227 (1984)Optimal Lower Bounds on the Multiparty Communication Complexity., and . STACS, volume 900 of Lecture Notes in Computer Science, page 350-360. Springer, (1995)