 |











|
Online DBLP entries are available for Rajeev Motwani and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
Dick Tsur
,
Jeffrey D. Ullman
,
Serge Abiteboul
,
Chris Clifton
,
Rajeev Motwani,
Svetlozar Nestorov
,
Arnon Rosenthal
:
Query Flocks: A Generalization of Association-Rule Mining.
SIGMOD Conference 1998
: 1-12
-
Svetlozar Nestorov
,
Serge Abiteboul
,
Rajeev Motwani:
Extracting Schema from Semistructured Data.
SIGMOD Conference 1998
: 295-306
-
Surajit Chaudhuri
,
Rajeev Motwani,
Vivek R. Narasayya
:
Random Sampling for Histogram Construction: How much is enough?
SIGMOD Conference 1998
: 436-447
-
Piotr Indyk
,
Rajeev Motwani:
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality.
STOC 1998
: 604-613
-
Min Fang
,
Narayanan Shivakumar
,
Hector Garcia-Molina
,
Rajeev Motwani,
Jeffrey D. Ullman
:
Computing Iceberg Queries Efficiently.
VLDB 1998
: 299-310
-
Craig Silverstein
,
Sergey Brin
,
Rajeev Motwani,
Jeffrey D. Ullman
:
Scalable Techniques for Mining Causal Structures.
VLDB 1998
: 594-605
-
Sanjeev Khanna
,
Rajeev Motwani,
Randall H. Wilson
:
On Certificates and Lookahead in Dynamic Graph Problems.
Algorithmica 21
(4): 377-394 (1998)
-
Sergey Brin
,
Rajeev Motwani,
Lawrence Page
,
Terry Winograd
:
What can you do with a Web in your Pocket?
Data Engineering Bulletin 21
(2): 37-47 (1998)
-
Sanjeev Arora
,
Carsten Lund
,
Rajeev Motwani,
Madhu Sudan
,
Mario Szegedy.
:
Proof verification and the hardness of approximation problems.
Electronic Colloquium on Computational Complexity (ECCC)
(008): (1998)
- Rajeev Motwani:
Realization of Matrices and Directed Graphs.
J. Algorithms 27
(1): 61-74 (1998)
-
David R. Karger
,
Rajeev Motwani,
Madhu Sudan
:
Approximate Graph Coloring by Semidefinite Programming.
JACM 45
(2): 246-265 (1998)
-
Lydia E. Kavraki
,
Jean-Claude Latombe
,
Rajeev Motwani,
Prabhakar Raghavan
:
Randomized Query Processing in Robot Path Planning.
JCSS 57
(1): 50-66 (1998)
-
Sergey Brin
,
Rajeev Motwani,
Jeffrey D. Ullman
,
Shalom Tsur
:
Dynamic Itemset Counting and Implication Rules for Market Basket Data.
SIGMOD Conference 1997
: 255-264
-
Sergey Brin
,
Rajeev Motwani,
Craig Silverstein
:
Beyond Market Baskets: Generalizing Association Rules to Correlations.
SIGMOD Conference 1997
: 265-276
-
Piotr Indyk
,
Rajeev Motwani,
Prabhakar Raghavan
,
Santosh Vempala
:
Locality-Preserving Hashing in Multidimensional Spaces.
STOC 1997
: 618-625
-
Moses Charikar
,
Chandra Chekuri
,
Tomás Feder
,
Rajeev Motwani:
Incremental Clustering and Dynamic Information Retrieval.
STOC 1997
: 626-635
-
P. W. Finn
,
Lydia E. Kavraki
,
Jean-Claude Latombe
,
Rajeev Motwani,
Christian R. Shelton
,
S. Venkatasubramanian
,
A. Yao
:
RAPID: Randomized Pharmacophore Identification for Drug Design.
Symposium on Computational Geometry 1997
: 324-333
- Rajeev Motwani,
Prabhakar Raghavan
:
Randomized Algorithms.
The Computer Science and Engineering Handbook 1997
: 141-161
-
Moses Charikar
,
Rajeev Motwani,
Prabhakar Raghavan
,
Craig Silverstein
:
Constrained TSP and Low-Power Computing.
WADS 1997
: 104-115
-
Leonidas J. Guibas
,
Jean-Claude Latombe
,
Steven M. LaValle
,
David Lin
,
Rajeev Motwani:
Visibility-Based Pursuit-Evasion in a Polygonal Environment.
WADS 1997
: 17-30
-
Michael Goldwasser
,
Rajeev Motwani:
Intractability of Assembly Sequencing: Unit Disks in the Plane.
WADS 1997
: 307-320
-
David R. Karger
,
Rajeev Motwani,
G. D. S. Ramkumar
:
On Approximating the Longest Path in a Graph.
Algorithmica 18
(1): 82-98 (1997)
-
David R. Karger
,
Rajeev Motwani:
An NC Algorithm for Minimum Cuts.
SIAM J. Comput. 26
(1): 255-272 (1997)
-
Leonidas J. Guibas
,
Rajeev Motwani,
Prabhakar Raghavan
:
The Robot Localization Problem.
SIAM J. Comput. 26
(4): 1120-1138 (1997)
-
Svetlozar Nestorov
,
Serge Abiteboul
,
Rajeev Motwani:
Infering Structure in Semistructured Data.
SIGMOD Record 26
(4): 39-43 (1997)
-
Sanjeev Khanna
,
Rajeev Motwani,
Randall H. Wilson
:
On Certificates and Lookahead in Dynamic Graph Problems.
SODA 1996
: 222-231
-
D. Aingworth
,
Chandra Chekuri
,
Rajeev Motwani:
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication).
SODA 1996
: 547-553
-
Sanjeev Khanna
,
Rajeev Motwani:
Towards a Syntactic Characterization of PTAS.
STOC 1996
: 329-337
- Rajeev Motwani,
Prabhakar Raghavan
:
Randomized Algorithms.
Computing Surveys 28
(1): 33-37 (1996)
-
Chandra Chekuri
,
Waqar Hasan
,
Rajeev Motwani:
Scheduling Problems in Parallel Query Optimization.
PODS 1995
: 255-265
-
Lydia E. Kavraki
,
Jean-Claude Latombe
,
Rajeev Motwani,
Prabhakar Raghavan
:
Randomized Query Processing in Robot Motion Planning (Extended Abstract).
STOC 1995
: 353-362
-
Waqar Hasan
,
Rajeev Motwani:
Coloring Away Communication in Parallel Query Optimization.
VLDB 1995
: 239-250
-
Sanjeev Khanna
,
Rajeev Motwani,
Madhu Sudan
,
Umesh V. Vazirani
:
On Syntactic versus Computational views of Approximability.
Electronic Colloquium on Computational Complexity (ECCC)
(023): (1995)
-
Tomás Feder
,
Rajeev Motwani:
Clique Partitions, Graph Compression and Speeding-Up Algorithms.
JCSS 51
(2): 261-272 (1995)
-
David R. Karger
,
Rajeev Motwani,
Madhu Sudan
:
Approximate Graph Coloring by Semidefinite Programming.
FOCS 1994
: 2-13
-
Anil Kamath
,
Rajeev Motwani,
Krishna V. Palem
,
Paul G. Spirakis
:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture.
FOCS 1994
: 592-603
-
Sanjeev Khanna
,
Rajeev Motwani,
Madhu Sudan
,
Umesh V. Vazirani
:
On Syntactic versus Computational Views of Approximability.
FOCS 1994
: 819-830
-
David R. Karger
,
Rajeev Motwani:
Derandomization through Approximation: An \calNC Algorithm for Minimum Cuts.
STOC 1994
: 497-506
-
Waqar Hasan
,
Rajeev Motwani:
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism.
VLDB 1994
: 36-47
- Rajeev Motwani:
Average-Case Analysis of Algorithms for Matchings and Related Problems.
JACM 41
(6): 1329-1356 (1994)
- Rajeev Motwani,
Joseph Naor
,
Moni Naor
:
The Probabilistic Method Yields Deterministic Parallel Algorithms.
JCSS 49
(3): 478-516 (1994)
- Rajeev Motwani,
Steven Phillips
,
Eric Torng
:
Non-Clairvoyant Scheduling.
TCS 130
(1): 17-47 (1994)
-
David R. Karger
,
Rajeev Motwani,
G. D. S. Ramkumar
:
On Approximating the Longest Path in a Graph (Preliminary Version).
WADS 1993
: 421-432
-
Sanjeev Arora
,
Carsten Lund
,
Rajeev Motwani,
Madhu Sudan
,
Mario Szegedy
:
Proof Verification and Hardness of Approximation Problems.
FOCS 1992
: 14-23
-
Amotz Bar-Noy
,
Rajeev Motwani,
Joseph Naor
:
The Greedy Algorithm is Optimal for On-Line Edge Coloring.
IPL 44
(5): 251-253 (1992)
-
Tomás Feder
,
Rajeev Motwani:
Clique Partitions, Graph Compression, and Speeding-Up Algorithms.
STOC 1991
: 123-133
-
Donald E. Knuth
,
Rajeev Motwani,
Boris Pittel
:
Stable Husbands.
SODA 1990
: 397-404
- Rajeev Motwani,
Arvind Raghunathan
,
Huzur Saran
:
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.
JCSS 40
(1): 19-48 (1990)
- Rajeev Motwani,
Joseph Naor
,
Moni Naor
:
The Probabilistic Method Yields Deterministic Parallel Algorithms.
FOCS 1989
: 8-13
- Rajeev Motwani:
Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems.
STOC 1989
: 550-561
- Rajeev Motwani,
Arvind Raghunathan
,
Huzur Saran
:
Constructive Results from Graph Minors: Linkless Embeddings.
FOCS 1988
: 398-409
- Rajeev Motwani,
Arvind Raghunathan
,
Huzur Saran
:
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.
Symposium on Computational Geometry 1988
: 211-223
-
Richard M. Karp
,
Rajeev Motwani,
Prabhakar Raghavan
:
Deferred Data Structuring.
SIAM J. Comput. 17
(5): 883-902 (1988)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|