Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Tompa, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-space tradeoffs for undirected graph traversal
P. Beame
,
A. Borodin
,
P. Raghavan
,
W.L. Ruzzo
,
M. Tompa
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 429-438
Communication-space tradeoffs for unrestricted protocols
P. Beame
,
M. Tompa
,
P. Yan
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 420-428
Two applications of complementation via inductive counting
A. Borodin
,
S.A. Cook
,
P.W. Dymond
,
W.L. Ruzzo
,
M. Tompa
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 116-125
Parallel graph algorithms that are efficient on average
D. Coppersmith
,
R. Raghavan
,
M. Tompa
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 260-269
Random self-reducibility and zero knowledge interactive proofs of possession of information
M. Tompa
,
H. Woll
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 472-482
A new pebble game that characterizes parallel complexity classes
H. Venkateswaran
,
M. Tompa
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 348-360
Speedups of deterministic machines by synchronous parallel machines
P.W. Dymond
,
M. Tompa
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 149-161
The parallel complexity of exponentiating polynomials over finite fields
F.E. Fich
,
M. Tompa
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 38-47
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
U. Manber
,
M. Tompa
Journal of the ACM
32
(3), 1985, pp. 720-732
Decreasing the nesting depth of expressions involving square roots
A. Borodin
,
R. Fagin
,
J. Hopcroft
,
M. Tompa
Technical Report (84-07-02), 1984, July
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem
U. Manber
,
M. Tompa
SIAM Journal on Computing
13
(1), 1984, February, pp. 109-115
Space-bounded hierarchies and probabilistic computations
W.L. Ruzzo
,
J. Simon
,
M. Tompa
Journal of Computer and System Sciences
28
(2), 1984, April, pp. 216-230
Speedups of deterministic machines by synchronous parallel machines
P.W. Dymond
,
M. Tompa
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 336-343
Probabilistic, nondeterministic, and alternating decision trees
U. Manber
,
M. Tompa
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 234-244
Space-bounded hierarchies and probabilistic computations
W.L. Ruzzo
,
J. Simon
,
M. Tompa
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 215-223
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations
M. Tompa
SIAM Journal on Computing
11
(1), 1982, February, pp. 130-137
A time-space tradeoff for sorting on non-oblivious machines
A. Borodin
,
M.J. Fischer
,
D.G. Kirkpatrick
,
N.A. Lynch
,
M. Tompa
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 351-364
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem
U. Manber
,
M. Tompa
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 220-227
An extension of Savitch's theorem to small space bounds
M. Tompa
Information Processing Letters
12
(2), 1981, April, pp. 106-108
An optimal solution to a wire-routing problem
M. Tompa
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 127-150
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
M. Tompa
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 118-132
An optimal solution to a wire-routing problem
M. Tompa
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 161-176
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations
M. Tompa
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 333-338
A time-space tradeoff for sorting on non-oblivious machines
A. Borodin
,
M.J. Fischer
,
D.G. Kirkpatrick
,
N.A. Lynch
,
M. Tompa
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 319-327
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
M. Tompa
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78 (San Diego, CA, May 1-3, 1978)
, 1978, pp. 196-204