#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1981

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Pavol Duris, Zvi Galil, Georg Schnitger
- Inf. Comput.
- 1984

We prove the following four results on communication complexity:
1) For every k ≥ 2, the language L<subscrpt>k</subscrpt> of encodings of directed graphs of out degree one that contain a path of length k+1 from the first vertex to the last vertex and can be recognized by exchanging O(k log n) bits using a simple k-round protocol requires exchanging… (More)

- Pavol Duris, José D. P. Rolim
- MFCS
- 1994

- Pavol Duris, Zvi Galil
- Theor. Comput. Sci.
- 1982

- Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
- STACS
- 1997

K e y w o r d s : c o m p u t a t i o n a l and s t r u c t u r a l complexi ty , Las Vegas, d e t e r m i n ism, c o m m u n i c a t i o n complexi ty , a u t o m a t a * The work of this author has been supported by DFG Project HR 14/3-1. Reischuk, Morvan (Eds.): STACS'97 Proceedings, LNCS 1200 (~) Sprlnger-Verlag Berlin Heidelberg 1997 118 P. Duri~, J.… (More)

- Pavol Duris, Zvi Galil
- 28th Annual Symposium on Foundations of Computer…
- 1987

We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. These techniques combine the choice of specific patterns of communication delays and crossing sequence arguments with consideration of the speed of propagation of messages, together with careful counting of messages in different parts of… (More)

- Pavol Duris, José D. P. Rolim
- J. Comput. Syst. Sci.
- 1998

- Pavol Duris, Zvi Galil
- Inf. Comput.
- 1991

- Pavol Duris, Zvi Galil
- Mathematical systems theory
- 1981

We define a languageL and show that its time and space complexitiesT andS must satisfyT 2 S ≥cn 3 even allowing machines with multiple (non random) access to the input.

- Pavol Duris, Zvi Galil
- ICALP
- 1982

- Pavol Duris, Zvi Galil
- SIAM J. Comput.
- 1982

It is known that k tapes are no better than two tapes for nondeterministic machines. We show here that two tapes are better than one. In fact, we show that two pushdown stores are better than one tape. Also, k tapes are no better than two for nondeterministic reversal-bounded machines. We show here that two tapes are better than one for such machines. In… (More)