Publications*
- What Can We Learn Privately? (H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith). Proceedings of FOCS 2008.
- Approximately Counting Embeddings into Random Graphs (M. Furer). Proceedings of RANDOM 2008.
- Composition Attacks and Auxiliary Information in Data Privacy (S. R. Ganta and A. Smith). Proceedings of ACM SIGKDD 2008.
- Packing to Angles and Sectors (P. Berman, J. Jeong, and B. Urgaonkar). Proceedings of ACM SPAA 2007.
- Spanners for Geometric Intersection Graphs (M. Furer). Proceedings of WADS 2007.
- Faster Approximation of Distances in Graphs (P. Berman). Proceedings of WADS 2007.
- Algorithms for Counting 2-SAT Solutions and Colorings with Applications (M. Furer). ECCC TR05-033. Also in AAIM 2007.
- Exact Max 2-SAT: Easier and Faster (M. Furer). Proceedings of SOFSEM 2007. Winner of best paper award.
- Approximate Distance Queries in Disk Graphs (M. Furer). Proceedings of WAOA 2006.
- Combinatorics of TCP Reordering (A. Hansson and G. Istrate). Journal of Combinatorial Optimization 2006.
- Approximately Counting Perfect Matchings in General Graphs (M. Furer). Proceedings of SIAM ALENEX/ANLACO 2005.
- An Almost Linear Time Approximation Algorithm for the Permanent of Random (0-1) Matrix (M. Furer). Proceedings of FSTTCS 2004.
Notes
Contact Information
346D IST Building
University Park, PA, 16802
kasivisw[at]cse[dot]psu[dot]edu
Useful Links