BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
6 × USA
Collaborated with:
W.L.Ruzzo F.E.Fich P.W.Dymond U.Manber A.Borodin T.W.Lam P.Tiwari J.Simon
Talks about:
space (4) probabilist (2) tradeoff (2) polynomi (2) parallel (2) machin (2) comput (2) bound (2) time (2) nondeterminist (1)

Person: Martin Tompa

DBLP DBLP: Tompa:Martin

Contributed to:

STOC 19891989
STOC 19851985
STOC 19831983
STOC 19821982
STOC 19801980
STOC 19781978

Wrote 9 papers:

STOC-1989-BorodinRT #bound #sequence #traversal
Lower Bounds on the Length of Universal Traversal Sequences (AB, WLR, MT), pp. 562–573.
STOC-1989-LamTT #communication #trade-off
Tradeoffs Between Communication and Space (TWL, PT, MT), pp. 217–226.
STOC-1985-FichT #complexity #finite #parallel
The Parallel Complexity of Exponentiating Polynomials over Finite Fields (FEF, MT), pp. 38–47.
STOC-1983-DymondT #parallel
Speedups of Deterministic Machines by Synchronous Parallel Machines (PWD, MT), pp. 336–343.
STOC-1982-ManberT #nondeterminism #probability
Probabilistic, Nondeterministic, and Alternating Decision Trees (UM, MT), pp. 234–244.
STOC-1982-RuzzoST #bound #probability
Space-Bounded Hierarchies and Probabilistic Computations (WLR, JS, MT), pp. 215–223.
STOC-1980-Tompa #problem
An Optimal Solution to a Wire-Routing Problem (MT), pp. 161–176.
STOC-1980-Tompa80a #algorithm #implementation #polynomial #sublinear #transitive
Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations (MT), pp. 333–338.
STOC-1978-Tompa #trade-off #using
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits (MT), pp. 196–204.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.