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
[1]
Hilfe
Suche: Author="Motwani, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing shortest paths with uncertainty
T. Feder
,
R. Motwani
,
L. O'Callaghan
,
C. Olston
,
R. Panigrahy
Lecture Notes in Computer Science
2607
, 2003, pp. 367-378
Approximation techniques for average completion time scheduling
C. Chekuri
,
R. Motwani
,
B. Natarajan
,
C. Stein
SIAM Journal on Computing
31
(1), 2001, pp. 146-166
Fast estimation of diameter and shortest paths (without matrix multiplication)
D. Aingworth
,
C. Chekuri
,
P. Indyk
,
R. Motwani
SIAM Journal on Computing
28
(4), 1999, pp. 1167-1181
On certificates and lookahead in dynamic graph problems
S. Khanna
,
R. Motwani
,
R.H. Wilson
Algorithmica
21
(4), 1998, pp. 377-394
Approximation techniques for average completion time scheduling
C. Chekuri
,
R. Motwani
,
B. Natarajan
,
C. Stein
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 609-618
On approximating the longest path in a graph
D. Karger
,
R. Motwani
,
G.D.S. Ramkumar
Algorithmica
18
(1), 1997, pp. 82-98
Storage management for evolving databases
J. Kleinberg
,
R. Motwani
,
P. Raghavan
,
S. Venkatasubramanian
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 353-362
Fast estimation of diameter and shortest paths (without matrix multiplication)
D. Aingworth
,
C. Chekuri
,
R. Motwani
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 547-553
The probabilistic method yields deterministic parallel algorithms
R. Motwani
,
J. Naor
,
M. Naor
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 8-13
Constructive results from graph minors: Linkless embeddings
R. Motwani
,
A. Raghunathan
,
H. Saran
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 398-409