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="Kumar, Ravi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of LSH feasibility
Flavio Chierichetti
,
Ravi Kumar
,
Mohammad Mahdian
Theoretical Computer Science
530
, 2014, pp. 89-101
Models for the compressible web
Flavio Chierichetti
,
Ravi Kumar
,
Silvio Lattanzi
,
Alessandro Panconesi
,
Prabhakar Raghavan
SIAM Journal on Computing
42
(5), 2013, pp. 1777-1802
Fast greedy algorithms in MapReduce and streaming
Ravi Kumar
,
Benjamin Moseley
,
Sergei Vassilvitskii
,
Andrea Vattani
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013)
, 2013, pp. 1-10
Sorting and selection on dynamic data
Aris Anagnostopoulos
,
Ravi Kumar
,
Mohammad Mahdian
,
Eli Upfal
Theoretical Computer Science
412
(24), 2011, pp. 2564-2576
On scheduling in Map-reduce and flow-shops
Benjamin Moseley
,
Anirban Dasgupta
,
Ravi Kumar
,
Tamás Sarlós
Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011)
, 2011, pp. 289-298
A sparse Johnson-Lindenstrauss transform
Anirban Dasgupta
,
Ravi Kumar
,
Tamás Sarlós
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 341-350
Sort me if you can: How to sort dynamic data
Aris Anagnostopoulos
,
Ravi Kumar
,
Mohammad Mahdian
,
Eli Upfal
Lecture Notes in Computer Science
5556
, 2009, pp. 339-350
The hiring problem and Lake Wobegon strategies
Andrei Z. Broder
,
Adam Kirsch
,
Ravi Kumar
,
Michael Mitzenmacher
,
Eli Upfal
,
Sergei Vassilvitskii
SIAM Journal on Computing
39
(4), 2009-2010, pp. 1233-1255
Modeling and algorithmic challenges in online social networks
Ravi Kumar
Lecture Notes in Computer Science
5577
, 2009, pp. 180-180
Sampling algorithms and coresets for
\l_p
regression
Anirban Dasgupta
,
Petros Drineas
,
Boulos Harb
,
Ravi Kumar
,
Michael W. Mahoney
SIAM Journal on Computing
38
(5), 2008-2009, pp. 2060-2078
On completing Latin squares
Iman Hajirasouliha
,
Hossein Jowhari
,
Ravi Kumar
,
Ravi Sundaram
Lecture Notes in Computer Science
4393
, 2007, pp. 524-535
Communication lower bounds via the chromatic number
Ravi Kumar
,
D. Sivakumar
Lecture Notes in Computer Science
4855
, 2007, pp. 228-240
Comparing partial rankings
Ronald Fagin
,
Ravi Kumar
,
Mohammad Mahdian
,
D. Sivakumar
,
Erik Vee
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 628-648
Navigating low-dimensional and hierarchical population networks
Ravi Kumar
,
David Liben-Nowell
,
Andrew Tomkins
Lecture Notes in Computer Science
4168
, 2006, pp. 480-491
The complexity of approximating the entropy
Tug̑kan Batu
,
Sanjoy Dasgupta
,
Ravi Kumar
,
Ronitt Rubinfeld
SIAM Journal on Computing
35
(1), 2005, pp. 132-150
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef
,
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Journal of Computer and System Sciences
68
(4), 2004, pp. 702-732
Sublinear algorithms for testing monotone and unimodal distributions
Tug̑kan Batu
,
Ravi Kumar
,
Ronitt Rubinfeld
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 381-390
Minimizing wirelength in zero and bounded skew clock trees
Moses Charikar
,
Jon Kleinberg
,
Ravi Kumar
,
Sridhar Rajagopalan
,
Amit Sahai
,
Andrew Tomkins
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 582-595
Fast approximate probabilistically checkable proofs
Funda Ergün
,
Ravi Kumar
,
Ronitt Rubinfeld
Information and Computation
189
(2), 2004, pp. 135-159
Cell-probe lower bounds for the partial match problem
T.S. Jayram
,
Subhash Khot
,
Ravi Kumar
,
Yuval Rabani
Journal of Computer and System Sciences
69
(3), 2004, pp. 435-447
Comparing top
k
lists
Ronald Fagin
,
Ravi Kumar
,
D. Sivakumar
SIAM Journal on Discrete Mathematics
17
(1), 2003, pp. 134-160
Erratum to ''Comparing top
k
lists''
Ronald Fagin
,
Ravi Kumar
,
D. Sivakumar
SIAM Journal on Discrete Mathematics
17
(2), 2003, pp. vii-vii
Cell-probe lower bounds for the partial match problem
T.S. Jayram
,
Subhash Khot
,
Ravi Kumar
,
Yuval Rabani
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 667-672
Two applications of information complexity
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 673-682
Sublinear time algorithms
Ravi Kumar
,
Ronitt Rubinfeld
ACM SIGACT News
34
(4), 2003, December, pp. 57-67
Seiten 1
2
>