Martin Tompa

Available identifiers

zbMath Open tompa.martinMaRDI QIDQ675048

List of research outcomes

Publication	Date of Publication	Type
Time-space tradeoffs for computing functions, using connectivity properties of their circuits	2014-03-14	Paper
Equireplicate Balanced Binary Codes for Oligo Arrays	2001-11-11	Paper
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata	1999-02-22	Paper
Time-space tradeoffs for undirected graph traversal by graph automata	1997-10-13	Paper
Lower bounds on universal traversal sequences based on chains of length five	1995-09-17	Paper
Communication-Space Tradeoffs for Unrestricted Protocols	1994-08-14	Paper
A direct version of Shamir and Snir's lower bounds on monotone circuit depth	1994-04-05	Paper
Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs	1993-03-09	Paper
Lower bounds on the length of universal traversal sequences	1993-01-17	Paper
Trade-offs between communication and space	1993-01-17	Paper
The complexity of short two-person games	1992-06-25	Paper
Parallel graph algorithms that are efficients on average	1989-01-01	Paper
Two Applications of Inductive Counting for Complementation Problems	1989-01-01	Paper
A New Pebble Game that Characterizes Parallel Complexity Classes	1989-01-01	Paper
How to share a secret with cheaters	1988-01-01	Paper
The parallel complexity of exponentiating polynomials over finite fields	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5203712	1988-01-01	Paper
Decreasing the nesting depth of expressions involving square roots	1985-01-01	Paper
Speedups of deterministic machines by synchronous parallel machines	1985-01-01	Paper
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees	1985-01-01	Paper
Space-bounded hierarchies and probabilistic computations	1984-01-01	Paper
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem	1984-01-01	Paper
Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations	1982-01-01	Paper
An extension of Savitch's theorem to small space bounds	1981-01-01	Paper
A time-space tradeoff for sorting on non-oblivious machines	1981-01-01	Paper
Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits	1981-01-01	Paper
An optimal solution to a wire-routing problem	1981-01-01	Paper
Time-space tradeoffs for computing functions, using connectivity properties of their circuits	1980-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Martin Tompa