Travelled to:1 × Hungary
1 × Spain
2 × Denmark
4 × USA
Collaborated with:Z.Galil J.Hromkovic G.Schnitger T.Jurdzinski M.Kutylowski K.Lorys W.J.Paul R.Reischuk
Talks about:bound (4) two (4) pushdown (3) automata (3) machin (3) one (3) multihead (2) counter (2) better (2) store (2)
Person: Pavol Duris
DBLP: Duris:Pavol
Contributed to:
199819951991
19841983198219821981Wrote 9 papers:
- ICALP-1998-DurisJKL #finite #multi #power of
- Power of Cooperation and Multihead Finite Systems (PD, TJ, MK, KL), pp. 896–907.
- ICALP-1995-DurisG #automaton
- Sensing Versus Nonsensing Automata (PD, ZG), pp. 455–463.
- ICALP-1991-DurisG #multi #on the #power of
- On the Power of Multiple Reads in a Chip (PD, ZG), pp. 697–706.
- STOC-1984-DurisGS #bound #communication #complexity
- Lower Bounds on Communication Complexity (PD, ZG, GS), pp. 81–91.
- STOC-1983-DurisGPR #bound
- Two Nonlinear Lower Bounds (PD, ZG, WJP, RR), pp. 127–132.
- ICALP-1982-DurisG #automaton #bound #on the
- On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store (PD, ZG), pp. 166–175.
- ICALP-1982-DurisH #automaton #finite #multi
- Multihead Finite State Automata and Concatenation (PD, JH), pp. 176–186.
- STOC-1982-DurisG #nondeterminism
- Two Tapes are Better than One for Nondeterministic Machines (PD, ZG), pp. 1–7.
- STOC-1981-DurisG #automaton
- Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (PD, ZG), pp. 177–188.