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, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Statistics of local multiple alignments
Amol Prakash
,
Martin Tompa
Bioinformatics
21
(S1), 2005, pp. 344-350
Construction of optimal quality control for oligo arrays
Charles J. Colbourn
,
Alan C.H. Ling
,
Martin Tompa
Bioinformatics
18
(4), 2002, pp. 529-535
Equireplicate balanced binary codes for oligo arrays
Noga Alon
,
Charles J. Colbourn
,
Alan C.H. Ling
,
Martin Tompa
SIAM Journal on Discrete Mathematics
14
(4), 2001, pp. 481-497
An exact algorithm to identify motifs in orthologous sequences from multiple species
Mathieu Blanchette
,
Benno Schwikowski
,
Martin Tompa
Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, ISMB'2000 (La Jolla, California, August 16-23, 2000)
, 2000, pp. 37-45
A statistical method for finding transcription factor binding sites
Saurabh Sinha
,
Martin Tompa
Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, ISMB'2000 (La Jolla, California, August 16-23, 2000)
, 2000, pp. 344-354
A linear time algorithm for finding all maximal scoring subsequences
Walter L. Ruzzo
,
Martin Tompa
Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology, ISMB'99 (Heidelberg, Germany, August 6-10, 1999)
, 1999, pp. 234-241
An exact method for finding short motifs in sequences, with application to the ribosome binding site problem
Martin Tompa
Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology, ISMB'99 (Heidelberg, Germany, August 6-10, 1999)
, 1999, pp. 262-271
A time-space tradeoff for undirected graph traversal by walking automata
Paul Beame
,
Allan Borodin
,
Prabhakar Raghavan
,
Walter L. Ruzzo
,
Martin Tompa
SIAM Journal on Computing
28
(3), 1998-1999, pp. 1051-1072
An algorithm for finding novel gapped motifs in DNA sequences
Emily Rocke
,
Martin Tompa
Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, RECOMB'98 (New York, New York, March 22-25, 1998)
, 1998, pp. 228-233
Time-space tradeoffs for undirected graph traversal by graph automata
Paul Beame
,
Allan Borodin
,
Prabhakar Raghavan
,
Walter L. Ruzzo
,
Martin Tompa
Information and Computation
130
(2), 1996, pp. 101-129
Minimal adaptive routing on the mesh with bounded queue size
Donald D. Chinn
,
Tom Leighton
,
Martin Tompa
Journal Parallel Distributed Computing
34
(2), 1996, pp. 154-170
Lower bounds on universal traversal sequences based on chains of length five
Jonathan Buss
,
Martin Tompa
Information and Computation
120
(2), 1995, pp. 326-329
Communication-space tradeoffs for unrestricted protocols
Paul Beame
,
Martin Tompa
,
Peiyuan Yan
SIAM Journal on Computing
23
(3), 1994, June, pp. 652-661
Minimal adaptive routing on the mesh with bounded queue size
Donald D. Chinn
,
Tom Leighton
,
Martin Tompa
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 354-363
A direct version of Shamir and Snir's lower bounds on monotone circuit depth
Prasoon Tiwari
,
Martin Tompa
Information Processing Letters
49
, 1994, pp. 243-248
Lecture notes on message routing in parallel machines
Martin Tompa
Technical Report (94-06-05), 1994, June
Lower bounds on the length of universal traversal sequences
Allan Borodin
,
Walter L. Ruzzo
,
Martin Tompa
Journal of Computer and System Sciences
45
, 1992, pp. 180-203
Trade-offs between communication and space
Tak Lam
,
Prasoon Tiwari
,
Martin Tompa
Journal of Computer and System Sciences
45
, 1992, pp. 296-315
Lower bounds on universal traversal sequences for cycles and other low degree graphs
Martin Tompa
SIAM Journal on Computing
21
(6), 1992, December, pp. 1153-1160
Lecture notes on probabilistic algorithms and pseudorandom generators
Martin Tompa
Technical Report (91-07-05), 1991, July
The complexity of short two-person games
Ashok K. Chandra
,
Martin Tompa
Discrete Applied Mathematics
29
, 1990, pp. 21-33
Two applications of inductive counting for complementation problems
Allan Borodin
,
Stephen A. Cook
,
Patrick W. Dymond
,
Walter L. Ruzzo
,
Martin Tompa
SIAM Journal on Computing
18
, 1989, pp. 559-578
Lower bounds on the length of universal traversal sequences
Allan Borodin
,
Walter L. Ruzzo
,
Martin Tompa
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 562-573
Parallel graph algorithms that are efficient on average
Don Coppersmith
,
Prabhakar Raghavan
,
Martin Tompa
Information and Computation
81
(3), 1989, pp. 318-333
Tradeoffs between communication and space
Tak Lam
,
Prasoon Tiwari
,
Martin Tompa
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 217-226
Seiten 1
2
>