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="Tarjan, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal parallel verification of minimum spanning trees in logarithmic time
B. Dixon
,
R.E. Tarjan
Algorithmica
17
(1), 1997, pp. 11-18
Models of parallel computation: A survey and synthesis
B.M. Maggs
,
L.R. Matheson
,
R.E. Tarjan
Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, HICSS-28. Vol.~II: Software Technology (Kihei, Hawaii, January 3-6, 1995)
, 1995, pp. 61-70
A faster deterministic maximum flow algorithm
V. King
,
S. Rao
,
R. Tarjan
Journal of Algorithms
17
(3), 1994, pp. 447-474
More efficient bottom-up multi-pattern matching in trees
J. Cai
,
R. Paige
,
R. Tarjan
Theoretical Computer Science
106
, 1992, pp. 21-60
A faster deterministic maximum flow algorithm
V. King
,
S. Rao
,
R. Tarjan
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 157-164
A linear-time algorithm for finding an ambitus
B. Mishra
,
R.E. Tarjan
Algorithmica
7
, 1992, pp. 521-554
Faster algorithms for the shortest path problem
R.K. Ahuja
,
K. Mehlhorn
,
J.B. Orlin
,
R.E. Tarjan
Journal of the ACM
37
(2), 1990, April, pp. 213-223
Unique binary search tree representations and equality-testing of sets and sequences
R. Sundar
,
R.E. Tarjan
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 18-25
Finding minimum-cost circulations by canceling negative cycles
A.V. Goldberg
,
R.E. Tarjan
Journal of the ACM
36
(4), 1989, October, pp. 873-886
Dynamic perfect hashing: Upper and lower bounds
M. Dietzfelbinger
,
A. Karlin
,
K. Mehlhorn
,
F. Meyer auf der Heide
,
H. Rohnert
,
R.E. Tarjan
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 524-531
A linear-time algorithm for finding a minimum spanning pseudoforest
H.N. Gabow
,
R.E. Tarjan
Information Processing Letters
27
(5), 1988, April, pp. 259-263
An
O(n \log\log n)
-time algorithm for triangulating a simple polygon
R.E. Tarjan
,
C.J. van Wyk
SIAM Journal on Computing
17
(1), 1988, February, pp. 143-178
Faster scaling algorithms for graph matching
H.N. Gabow
,
R.E. Tarjan
misc, 1987
A fast parametric maximum flow algorithm
G. Gallo
,
M.D. Grigoriadis
,
R.E. Tarjan
Technical Report (LCSR-TR-95), 1987, July
Solving minimum-cost flow problems by successive approximations
A. Goldberg
,
R. Tarjan
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 7-18
Three partition refinement algorithms
R. Paige
,
R.E. Tarjan
SIAM Journal on Computing
16
(6), 1987, December, pp. 973-989
Making data structures persistent
J.R. Driscoll
,
N. Sarnak
,
D.D. Sleator
,
R.E. Tarjan
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 109-121
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
H.N. Gabow
,
Z. Galil
,
T. Spencer
,
R.E. Tarjan
Combinatorica
6
(2), 1986, pp. 109-122
Deques with heap order
H. Gajewska
,
R.E. Tarjan
Information Processing Letters
22
(4), 1986, April, pp. 197-200
A new approach to the maximum flow problem
A.V. Goldberg
,
R.E. Tarjan
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 136-146
Sorting Jordan sequences in linear time using level-linked search trees
K. Hoffmann
,
K. Mehlhorn
,
P. Rosenstiehl
,
R.E. Tarjan
Information and Control
68
(1-3), 1986, pp. 170-184
Rotation distance, triangulations, and hyperbolic geometry
D.D. Sleator
,
R.E. Tarjan
,
W.P. Thurston
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 122-135
Self-adjusting heaps
D.D. Sleator
,
R.E. Tarjan
SIAM Journal on Computing
15
(1), 1986, February, pp. 52-69
A linear-time algorithm for triangulating simple polygons
R.E. Tarjan
,
C.J. van Wyk
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 380-388
Sensitivity analysis of minimum spanning trees and shortest path trees
R.E. Tarjan
Information Processing Letters
23
(4), 1986, November, pp. 219
Seiten 1
2
3
4
5
>