 | 2012 |
| 33 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Spanners for geometric intersection graphs with applications.
JoCG 3(1): 31-64 (2012) |
| 2011 |
| 32 |  | Shiva Prasad Kasiviswanathan,
Prem Melville,
Arindam Banerjee,
Vikas Sindhwani:
Emerging topic detection using dictionary learning.
CIKM 2011: 745-754 |
| 31 |  | Shiva Prasad Kasiviswanathan,
Stephan Eidenbenz,
Guanhua Yan:
Geography-based analysis of the Internet infrastructure.
INFOCOM 2011: 131-135 |
| 30 |  | Shiva Prasad Kasiviswanathan,
Cristopher Moore,
Louis Theran:
The Rigidity Transition in Random Graphs.
SODA 2011: 1237-1252 |
| 29 |  | Shiva Prasad Kasiviswanathan,
Bo Zhao,
Sudarshan Vasudevan,
Bhuvan Urgaonkar:
Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas.
Pervasive and Mobile Computing 7(1): 114-127 (2011) |
| 28 |  | Shiva Prasad Kasiviswanathan,
Homin K. Lee,
Kobbi Nissim,
Sofya Raskhodnikova,
Adam Smith:
What Can We Learn Privately?
SIAM J. Comput. 40(3): 793-826 (2011) |
| 2010 |
| 27 |  | Shiva Prasad Kasiviswanathan,
Feng Pan:
Matrix Interdiction Problem.
CPAIOR 2010: 219-231 |
| 26 |  | Shiva Prasad Kasiviswanathan,
Bo Zhao,
Sudarshan Vasudevan,
Bhuvan Urgaonkar:
Bandwidth Provisioning in Infrastructure-Based Wireless Networks Employing Directional Antennas.
ICDCN 2010: 295-306 |
| 25 |  | Shiva Prasad Kasiviswanathan,
Mark Rudelson,
Adam Smith,
Jonathan Ullman:
The price of privately releasing contingency tables and the spectra of random matrices with correlated rows.
STOC 2010: 775-784 |
| 24 |  | Amos Beimel,
Shiva Prasad Kasiviswanathan,
Kobbi Nissim:
Bounds on the Sample Complexity for Private Learning and Private Data Release.
TCC 2010: 437-454 |
| 2009 |
| 23 |  | Sunil Thulasidasan,
Shiva Prasad Kasiviswanathan,
Stephan Eidenbenz,
Emanuele Galli,
Susan M. Mniszewski,
Philip Romero:
Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator.
HiPC 2009: 428-437 |
| 22 |  | Martin Fürer,
Serge Gaspers,
Shiva Prasad Kasiviswanathan:
An Exponential Time 2-Approximation Algorithm for Bandwidth.
IWPEC 2009: 173-184 |
| 21 |  | Martin Fürer,
Serge Gaspers,
Shiva Prasad Kasiviswanathan:
An Exponential Time 2-Approximation Algorithm for Bandwidth
CoRR abs/0906.1953: (2009) |
| 2008 |
| 20 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs.
APPROX-RANDOM 2008: 416-429 |
| 19 |  | Shiva Prasad Kasiviswanathan,
Homin K. Lee,
Kobbi Nissim,
Sofya Raskhodnikova,
Adam Smith:
What Can We Learn Privately?
FOCS 2008: 531-540 |
| 18 |  | Srivatsava Ranjit Ganta,
Shiva Prasad Kasiviswanathan,
Adam Smith:
Composition attacks and auxiliary information in data privacy.
KDD 2008: 265-273 |
| 17 |  | Srivatsava Ranjit Ganta,
Shiva Prasad Kasiviswanathan,
Adam Smith:
Composition Attacks and Auxiliary Information in Data Privacy
CoRR abs/0803.0032: (2008) |
| 16 |  | Shiva Prasad Kasiviswanathan,
Homin K. Lee,
Kobbi Nissim,
Sofya Raskhodnikova,
Adam Smith:
What Can We Learn Privately?
CoRR abs/0803.0924: (2008) |
| 15 |  | Shiva Prasad Kasiviswanathan,
Adam Smith:
A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information
CoRR abs/0803.3946: (2008) |
| 14 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs
CoRR abs/0806.2287: (2008) |
| 13 |  | Shiva Prasad Kasiviswanathan,
Adam Smith:
A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information.
IACR Cryptology ePrint Archive 2008: 144 (2008) |
| 2007 |
| 12 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Algorithms for Counting 2-SatSolutions and Colorings with Applications.
AAIM 2007: 47-57 |
| 11 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Exact Max 2-Sat: Easier and Faster.
SOFSEM (1) 2007: 272-283 |
| 10 |  | Piotr Berman,
Jieun K. Jeong,
Shiva Prasad Kasiviswanathan,
Bhuvan Urgaonkar:
Packing to angles and sectors.
SPAA 2007: 171-180 |
| 9 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Spanners for Geometric Intersection Graphs.
WADS 2007: 312-324 |
| 8 |  | Piotr Berman,
Shiva Prasad Kasiviswanathan:
Faster Approximation of Distances in Graphs.
WADS 2007: 541-552 |
| 2006 |
| 7 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximate Distance Queries in Disk Graphs.
WAOA 2006: 174-187 |
| 6 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Spanners for Geometric Intersection Graphs
CoRR abs/cs/0605029: (2006) |
| 5 |  | 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 |  | Anders Hansson,
Gabriel Istrate,
Shiva Prasad Kasiviswanathan:
Combinatorics of TCP reordering.
J. Comb. Optim. 12(1-2): 57-70 (2006) |
| 2005 |
| 3 |  | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximately Counting Perfect Matchings in General Graphs.
ALENEX/ANALCO 2005: 263-272 |
| 2 |  | 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 |  | 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 |