Search the dblp DataBase

Publications of Author

1. Martin Fürer, Shiva Prasad Kasiviswanathan
   Approximately Counting Perfect Matchings in General Graphs. [Citation Graph (0, 0)][DBLP]
   ALENEX/ANALCO, 2005, pp:263-272 [Conf]
   
2. Martin Fürer, Shiva Prasad Kasiviswanathan
   An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2004, pp:263-274 [Conf]
   
3. Martin Fürer, Shiva Prasad Kasiviswanathan
   Approximate Distance Queries in Disk Graphs. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:174-187 [Conf]
   
4. Martin Fürer, Shiva Prasad Kasiviswanathan
   Algorithms for Counting 2-SAT Solutions and Colorings with Applications [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:033, pp:- [Journal]
   
5. Anders Hansson, Gabriel Istrate, Shiva Prasad Kasiviswanathan
   Combinatorics of TCP reordering. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2006, v:12, n:1-2, pp:57-70 [Journal]
   
6. Martin Fürer, Shiva Prasad Kasiviswanathan
   Algorithms for Counting 2-SatSolutions and Colorings with Applications. [Citation Graph (0, 0)][DBLP]
   AAIM, 2007, pp:47-57 [Conf]
   
7. Martin Fürer, Shiva Prasad Kasiviswanathan
   Exact Max 2-Sat: Easier and Faster. [Citation Graph (0, 0)][DBLP]
   SOFSEM (1), 2007, pp:272-283 [Conf]
   
8. Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar
   Packing to angles and sectors. [Citation Graph (0, 0)][DBLP]
   SPAA, 2007, pp:171-180 [Conf]
   
9. Martin Fürer, Shiva Prasad Kasiviswanathan
   Spanners for Geometric Intersection Graphs. [Citation Graph (0, 0)][DBLP]
   WADS, 2007, pp:312-324 [Conf]
   
10. Piotr Berman, Shiva Prasad Kasiviswanathan
    Faster Approximation of Distances in Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:541-552 [Conf]
    
11. Martin Fürer, Shiva Prasad Kasiviswanathan
    Spanners for Geometric Intersection Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
12. 
    Approximately Counting Embeddings into Random Graphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Matrix Interdiction Problem. [Citation Graph (, )][DBLP]
    
    
14. 
    What Can We Learn Privately? [Citation Graph (, )][DBLP]
    
    
15. 
    An Exponential Time 2-Approximation Algorithm for Bandwidth. [Citation Graph (, )][DBLP]
    
    
16. 
    Composition attacks and auxiliary information in data privacy. [Citation Graph (, )][DBLP]
    
    
17. 
    The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. [Citation Graph (, )][DBLP]
    
    
18. 
    Bounds on the Sample Complexity for Private Learning and Private Data Release. [Citation Graph (, )][DBLP]
    
    
19. 
    Bandwidth Provisioning in Infrastructure-Based Wireless Networks Employing Directional Antennas. [Citation Graph (, )][DBLP]
    
    
20. 
    Composition Attacks and Auxiliary Information in Data Privacy [Citation Graph (, )][DBLP]
    
    
21. 
    What Can We Learn Privately? [Citation Graph (, )][DBLP]
    
    
22. 
    A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information [Citation Graph (, )][DBLP]
    
    
23. 
    Approximately Counting Embeddings into Random Graphs [Citation Graph (, )][DBLP]
    
    
24. 
    An Exponential Time 2-Approximation Algorithm for Bandwidth [Citation Graph (, )][DBLP]
    
    
25. 
    Packing to angles and sectors. [Citation Graph (, )][DBLP]