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="Sivakumar, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Affiliation networks
Silvio Lattanzi
,
D. Sivakumar
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 427-434
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
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
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
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
On polynomial-factor approximations to the shortest lattice vector length
Ravi Kumar
,
D. Sivakumar
SIAM Journal on Discrete Mathematics
16
(3), 2003, pp. 422-425
Approximate counting of inversions in a data stream
Miklós Ajtai
,
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 370-379
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef
,
T.S. Jayram
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 209-218
Algorithmic derandomization via complexity theory
D. Sivakumar
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 619-626
A sieve algorithm for the shortest lattice vector problem
Miklós Ajtai
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 601-610
Sampling algorithms: Lower bounds and applications
Ziv Bar-Yossef
,
Ravi Kumar
,
D. Sivakumar
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 266-275
On the unique shortest lattice vector problem
S. Ravi Kumar
,
D. Sivakumar
Theoretical Computer Science
255
(1-2), 2001, pp. 641-648
A generalization of resource-bounded measure, with application to the BPP vs. EXP problem
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
SIAM Journal on Computing
30
(2), 2000, pp. 576-601
Resolution of Hartmanis' conjecture for NL-hard sparse sets
Jin-Yi Cai
,
D. Sivakumar
Theoretical Computer Science
240
(2), 2000, pp. 257-269
Self-testing without the generator bottleneck
Funda Ergün
,
S. Ravi Kumar
,
D. Sivakumar
SIAM Journal on Computing
29
(5), 2000, pp. 1630-1651
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
Jin-Yi Cai
,
Ajay Nerurkar
,
D. Sivakumar
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 726-735
On the hardness of permanent
Jin-Yi Cai
,
A. Pavan
,
D. Sivakumar
Lecture Notes in Computer Science
1563
, 1999, pp. 90-99
Sparse hard sets for
P
: Resolution of a conjecture of Hartmanis
Jin-Yi Cai
,
D. Sivakumar
Journal of Computer and System Sciences
58
(2), 1999, pp. 280-296
Proofs, codes, and polynomial-time reducibilities
Ravi Kumar
,
D. Sivakumar
Proceedings of the 14th Annual IEEE Conference on Computational Complexity (Atlanta, Georgia, May 4-6, 1999)
, 1999, pp. 46-53
A note on the shortest lattice vector problem
Ravi Kumar
,
D. Sivakumar
Proceedings of the 14th Annual IEEE Conference on Computational Complexity (Atlanta, Georgia, May 4-6, 1999)
, 1999, pp. 200-204
Roundness estimation via random sampling
Ravi Kumar
,
D. Sivakumar
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 603-612
On membership comparable sets
D. Sivakumar
Journal of Computer and System Sciences
59
(2), 1999, pp. 270-280
A generalization of resource-bounded measure, with an application
Harry Buhrman
,
Dieter van Melkebeek
,
Kenneth W. Regan
,
D. Sivakumar
,
Martin Strauss
Lecture Notes in Computer Science
1373
, 1998, pp. 161-171
Seiten 1
2
>