The following pages link to Martin Tompa (Q675048):
Displaying 28 items.
- Time-space tradeoffs for undirected graph traversal by graph automata (Q675049) (← links)
- Space-bounded hierarchies and probabilistic computations (Q1062759) (← links)
- Decreasing the nesting depth of expressions involving square roots (Q1063633) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- How to share a secret with cheaters (Q1112786) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- An extension of Savitch's theorem to small space bounds (Q1151259) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits'' (Q1154806) (← links)
- An optimal solution to a wire-routing problem (Q1156772) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Lower bounds on the length of universal traversal sequences (Q1201151) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- A direct version of Shamir and Snir's lower bounds on monotone circuit depth (Q1318755) (← links)
- Parallel graph algorithms that are efficients on average (Q1825648) (← links)
- Lower bounds on universal traversal sequences based on chains of length five (Q1898471) (← links)
- Equireplicate Balanced Binary Codes for Oligo Arrays (Q2753539) (← links)
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (Q3323288) (← links)
- The complexity of problems on probabilistic, nondeterministic, and alternating decision trees (Q3768402) (← links)
- The parallel complexity of exponentiating polynomials over finite fields (Q3798223) (← links)
- Two Applications of Inductive Counting for Complementation Problems (Q3835019) (← links)
- A New Pebble Game that Characterizes Parallel Complexity Classes (Q3835026) (← links)
- Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations (Q3936198) (← links)
- Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs (Q4027857) (← links)
- A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata (Q4229423) (← links)
- Communication-Space Tradeoffs for Unrestricted Protocols (Q4302289) (← links)
- (Q5203712) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q5402558) (← links)
