Shiva Prasad Kasiviswanathan

2008
19	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Approximately Counting Embeddings into Random Graphs. APPROX-RANDOM 2008: 416-429
18	EE	Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? FOCS 2008: 531-540
17	EE	Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith: Composition attacks and auxiliary information in data privacy. KDD 2008: 265-273
16	EE	Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith: Composition Attacks and Auxiliary Information in Data Privacy CoRR abs/0803.0032: (2008)
15	EE	Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? CoRR abs/0803.0924: (2008)
14	EE	Shiva Prasad Kasiviswanathan, Adam Smith: A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information CoRR abs/0803.3946: (2008)
13	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Approximately Counting Embeddings into Random Graphs CoRR abs/0806.2287: (2008)
2007
12	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Algorithms for Counting 2-SatSolutions and Colorings with Applications. AAIM 2007: 47-57
11	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Exact Max 2-Sat: Easier and Faster. SOFSEM (1) 2007: 272-283
10	EE	Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar: Packing to angles and sectors. SPAA 2007: 171-180
9	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Spanners for Geometric Intersection Graphs. WADS 2007: 312-324
8	EE	Piotr Berman, Shiva Prasad Kasiviswanathan: Faster Approximation of Distances in Graphs. WADS 2007: 541-552
2006
7	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Approximate Distance Queries in Disk Graphs. WAOA 2006: 174-187
6	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Spanners for Geometric Intersection Graphs CoRR abs/cs/0605029: (2006)
5	EE	Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar: Packing to angles and sectors. Electronic Colloquium on Computational Complexity (ECCC) 13(030): (2006)
4	EE	Anders Hansson, Gabriel Istrate, Shiva Prasad Kasiviswanathan: Combinatorics of TCP reordering. J. Comb. Optim. 12(1-2): 57-70 (2006)
2005
3	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Approximately Counting Perfect Matchings in General Graphs. ALENEX/ANALCO 2005: 263-272
2	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: Algorithms for Counting 2-SAT Solutions and Colorings with Applications Electronic Colloquium on Computational Complexity (ECCC)(033): (2005)
2004
1	EE	Martin Fürer, Shiva Prasad Kasiviswanathan: An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix. FSTTCS 2004: 263-274

Coauthor Index

1	Piotr Berman	[5] [8] [10]
2	Martin Fürer	[1] [2] [3] [6] [7] [9] [11] [12] [13] [19]
3	Srivatsava Ranjit Ganta	[16] [17]
4	Anders Hansson	[4]
5	Gabriel Istrate	[4]
6	Jieun K. Jeong	[5] [10]
7	Homin K. Lee	[15] [18]
8	Kobbi Nissim	[15] [18]
9	Sofya Raskhodnikova	[15] [18]
10	Adam Smith	[14] [15] [16] [17] [18]
11	Bhuvan Urgaonkar	[5] [10]

Colors in the list of coauthors