BibSLEIGH — Rajeev

Travelled to:

1 × Canada
1 × Chile
1 × China
1 × Finland
1 × France
1 × Korea
1 × Poland
1 × Switzerland
1 × United Kingdom
21 × USA

Collaborated with:

T.Feder P.Indyk W.Hasan Y.Xu S.Chaudhuri G.S.Manku J.Widom V.R.Narasayya R.Panigrahy J.D.Ullman S.Brin B.Babcock M.Datar S.Babu A.Gionis C.Silverstein C.Chekuri S.U.Nabar H.Garcia-Molina M.Charikar P.Raghavan S.Khanna ∅ S.Nestorov S.Abiteboul K.Munagala S.Tsur U.Srivastava G.Aggarwal M.Bawa C.S.Subi K.Kenthapadi N.Mishra A.Korolova A.Zhu L.O'Callaghan K.Ganjam V.Ganti M.Gavrilov D.Anguelov V.A.Saraswat S.Venkatasubramanian P.Hell S.Klein S.Vempala L.E.Kavraki J.Latombe B.Marthi I.Nishizawa C.Olston M.Fang N.Shivakumar C.Clifton A.Rosenthal A.Z.Broder M.Fontoura V.Josifovski R.Kumar A.Tomkins P.Ganesan D.Thomas

Talks about:

queri (8) data (8) stream (6) graph (5) algorithm (4) parallel (4) problem (4) toward (4) random (4) optim (4)

Person: Rajeev Motwani

DBLP: Motwani:Rajeev

Contributed to:

2012

2008

2007

2006

2004

2003

2002

2000

1999

1998

1997

1996

1995

1994

1991

1989

Wrote 41 papers:

VLDB-2012-MankuM #approximate #data type: Approximate Frequency Counts over Data Streams (GSM, RM), p. 1699.
CIKM-2008-KorolovaMNX #network #privacy #social: Link privacy in social networks (AK, RM, SUN, YX), pp. 289–298.
ICALP-2007-MotwaniPX: Estimating Sum by Weighted Sampling (RM, RP, YX), pp. 53–64.
CIKM-2006-BroderFJKMNPTX #corpus #query: Estimating corpus size via queries (AZB, MF, VJ, RK, RM, SUN, RP, AT, YX), pp. 594–603.
PODS-2006-MotwaniX #evolution #graph #modelling #random #web: Evolution of page popularity under random web graph models (RM, YX), pp. 134–142.
VLDB-2006-NabarMKMM #query #robust #towards: Towards Robustness in Query Auditing (SUN, BM, KK, NM, RM), pp. 151–162.
VLDB-2006-SrivastavaMWM #optimisation #query #web #web service: Query Optimization over Web Services (US, KM, JW, RM), pp. 355–366.
ICALP-2004-AggarwalFMZ #algorithm #multi: Algorithms for Multi-product Pricing (GA, TF, RM, AZ), pp. 72–83.
SIGMOD-2004-BabuMMNW #adaptation #pipes and filters: Adaptive Ordering of Pipelined Stream Filters (SB, RM, KM, IN, JW), pp. 407–418.
SIGMOD-2004-BawaGGM #network: The Price of Validity in Dynamic Networks (MB, AG, HGM, RM), pp. 515–526.
VLDB-2004-AggarwalBGGKMMSTW #privacy: Vision Paper: Enabling Privacy for the Paranoids (GA, MB, PG, HGM, KK, NM, RM, US, DT, JW, YX), pp. 708–719.
PODS-2003-BabcockDMO #data type #maintenance: Maintaining variance and k-medians over data stream windows (BB, MD, RM, LO), pp. 234–243.
SIGMOD-2003-BabcockBDM #data type #memory management #scheduling: Chain : Operator Scheduling for Memory Minimization in Data Stream Systems (BB, SB, MD, RM), pp. 253–264.
SIGMOD-2003-ChaudhuriGGM #fuzzy #online #performance #robust: Robust and Efficient Fuzzy Match for Online Data Cleaning (SC, KG, VG, RM), pp. 313–324.
PODS-2002-BabcockBDMW #data type #modelling: Models and Issues in Data Stream Systems (BB, SB, MD, RM, JW), pp. 1–16.
VLDB-2002-MankuM #approximate #data type: Approximate Frequency Counts over Data Streams (GSM, RM), pp. 346–357.
KDD-2000-GavrilovAIM #mining #question: Mining the stock market (extended abstract): which measure is best? (MG, DA, PI, RM), pp. 487–496.
PODS-2000-CharikarCMN #estimation #fault #towards: Towards Estimation Error Guarantees for Distinct Values (MC, SC, RM, VRN), pp. 268–279.
STOC-2000-FederMPOW #nondeterminism: Computing the median with uncertainty (TF, RM, RP, CO, JW), pp. 602–607.
STOC-2000-FederMS #graph: Finding long paths and cycles in sparse Hamiltonian graphs (TF, RM, CSS), pp. 524–529.
STOC-2000-MotwaniPSV #decidability #on the #problem: On the decidability of accessibility problems (RM, RP, VAS, SV), pp. 306–315.
SIGMOD-1999-ChaudhuriMN #on the #random: On Random Sampling over Joins (SC, RM, VRN), pp. 263–274.
STOC-1999-FederHKM #complexity #graph #problem: Complexity of Graph Partition Problems (TF, PH, SK, RM), pp. 464–472.
VLDB-1999-GionisIM #similarity: Similarity Search in High Dimensions via Hashing (AG, PI, RM), pp. 518–529.
SIGMOD-1998-ChaudhuriMN #how #question #random: Random Sampling for Histogram Construction: How much is enough? (SC, RM, VRN), pp. 436–447.
SIGMOD-1998-NestorovAM #semistructured data: Extracting Schema from Semistructured Data (SN, SA, RM), pp. 295–306.
SIGMOD-1998-TsurUACMNR #mining #query: Query Flocks: A Generalization of Association-Rule Mining (ST, JDU, SA, CC, RM, SN, AR), pp. 1–12.
STOC-1998-IndykM #approximate #nearest neighbour #towards: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality (PI, RM), pp. 604–613.
VLDB-1998-FangSGMU #query: Computing Iceberg Queries Efficiently (MF, NS, HGM, RM, JDU), pp. 299–310.
VLDB-1998-SilversteinBMU #mining #scalability: Scalable Techniques for Mining Causal Structures (CS, SB, RM, JDU), pp. 594–605.
SIGMOD-1997-BrinMS #correlation: Beyond Market Baskets: Generalizing Association Rules to Correlations (SB, RM, CS), pp. 265–276.
SIGMOD-1997-BrinMUT: Dynamic Itemset Counting and Implication Rules for Market Basket Data (SB, RM, JDU, ST), pp. 255–264.
STOC-1997-CharikarCFM #clustering #incremental #information management #information retrieval: Incremental Clustering and Dynamic Information Retrieval (MC, CC, TF, RM), pp. 626–635.
STOC-1997-IndykMRV #multi: Locality-Preserving Hashing in Multidimensional Spaces (PI, RM, PR, SV), pp. 618–625.
STOC-1996-KhannaM #towards: Towards a Syntactic Characterization of PTAS (SK, RM), pp. 329–337.
PODS-1995-ChekuriHM #optimisation #parallel #problem #query #scheduling: Scheduling Problems in Parallel Query Optimization (CC, WH, RM), pp. 255–265.
STOC-1995-KavrakiLMR #query #random: Randomized query processing in robot path planning (LEK, JCL, RM, PR), pp. 353–362.
VLDB-1995-HasanM #communication #optimisation #parallel #query: Coloring Away Communication in Parallel Query Optimization (WH, RM), pp. 239–250.
VLDB-1994-HasanM #algorithm #optimisation #parallel #pipes and filters #trade-off: Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism (WH, RM), pp. 36–47.
STOC-1991-FederM #algorithm #clique #graph: Clique Partitions, Graph Compression, and Speeding-Up Algorithms (TF, RM), pp. 123–133.
STOC-1989-Motwani #algorithm #analysis #graph #problem: Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems (RM), pp. 550–561.