Searching for authors named "Pavol Duris" – sorted by Relevance.
-
On the Computational Complexity of Infinite Words
- under a common grant No. 864524. Pavol Duris Dept. of Computer Science I (Algorithms and Complexity
- Add To MetaCart
-
On Multipartition Communication Complexity (Extended Abstract)
- On Multipartition Communication Complexity # (Extended Abstract) Pavol Duri s 1,2 , Juraj
- Add To MetaCart
-
On Multi-Partition Communication Complexity
- On Multi-Partition Communication Complexity Pavol ˇ Duriˇs Juraj Hromkovič Stasys Jukna Martin
- Add To MetaCart
-
On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations
- , and Polynomial-time Computations Pavol Duris 1 and Juraj Hromkovic 2y and Jos'e D. P. Rolim 3 and Georg
- Cited by 1 (0 self) – Add To MetaCart

