The following pages link to Pavol Ďuriš (Q596323):
Displayed 38 items.
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Multiparty communication complexity and very hard functions (Q598239) (← links)
- Semelectivity is not sufficient (Q751288) (← links)
- Item:Q596323 (redirect page) (← links)
- Two lower bounds in asynchronous distributed computation (Q808249) (← links)
- One-way simple multihead finite automata are not closed under concatenation (Q1056554) (← links)
- Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations (Q1071504) (← links)
- A minimum-area circuit for \(\ell\)-selection (Q1092661) (← links)
- Lower bounds on communication complexity (Q1097691) (← links)
- Fooling a two way automaton or one pushdown store is better than one counter for two way machines (Q1165027) (← links)
- Lower bounds on the multiparty communication complexity (Q1267715) (← links)
- A note on the density of oracle decreasing time-space complexity (Q1334680) (← links)
- On the computational complexity of infinite words. (Q1401236) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Tight hierarchy of data-independent multi-head automata (Q2194865) (← links)
- On the power of multiple reads in a chip (Q2366566) (← links)
- Flip-pushdown automata with \(k\) pushdown reversals and E0L systems are incomparable (Q2448114) (← links)
- (Q2762506) (← links)
- On Computational Power of Partially Blind Automata (Q2867275) (← links)
- A time-space tradeoff for language recognition (Q3316594) (← links)
- Two Tapes are Better than One for Nondeterministic Machines (Q3347301) (← links)
- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store (Q3674059) (← links)
- (Q3711746) (← links)
- Two nonlinear lower bounds for on-line computations (Q3718158) (← links)
- (Q3756527) (← links)
- (Q3945613) (← links)
- (Q3945614) (← links)
- (Q3974862) (← links)
- (Q4036605) (← links)
- Optimal lower bounds on the multiparty communication complexity (Q4596635) (← links)
- Sensing versus nonsensing automata (Q4645200) (← links)
- (Q4732118) (← links)
- (Q4779155) (← links)
- CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED (Q4853331) (← links)
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164) (← links)
- (Q5089196) (← links)
- E-complete sets do not have optimal polynomial time approximations (Q5096868) (← links)
- Determinism and Nondeterminism in Finite Automata with Advice (Q6163614) (← links)