The following pages link to Shiva Prasad Kasiviswanathan (Q392017):
Displayed 16 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- Spanners for geometric intersection graphs with applications (Q2968085) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- Matrix Interdiction Problem (Q3569932) (← links)
- Spanners for Geometric Intersection Graphs (Q3603536) (← links)
- Faster Approximation of Distances in Graphs (Q3603556) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Spectral Norm of Random Kernel Matrices with Applications to Privacy (Q5351942) (← links)
- The rigidity transition in random graphs (Q5365113) (← links)
- Algorithms for Counting 2-Sat Solutions and Colorings with Applications (Q5434422) (← links)
- Approximate Distance Queries in Disk Graphs (Q5443518) (← links)
- Exact Max 2-Sat: Easier and Faster (Q5448778) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465859) (← links)
- Approximately Counting Embeddings into Random Graphs (Q5891884) (← links)
- Approximately Counting Embeddings into Random Graphs (Q5900477) (← links)