Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Tetali, Prasad
18  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Determinant Maximization via Matroid Intersection Algorithm:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Brown, Adam ; Laddha, Aditi ; Pittu, Madhusudhan.. - p. 255-266 , 2022
Link: https://doi.org/10.1109/..
 
?
2

Improved Approximations for Min Sum Vertex Cover and Genera..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Bansal, Nikhil ; Batra, Jatin ; Farhadi, Majid. - p. 998-1005 , 2021
Link: https://doi.org/10.1137/..
 
?
3

Improved approximations for min sum vertex cover and genera..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Bansal, Nikhil ; Batra, Jatin ; Farhadi, Majid. - p. 986-1005 , 2021
Link: https://dl.acm.org/doi/1..
 
?
4

Efficient sampling and counting algorithms for the Potts mo..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Borgs, Christian ; Chayes, Jennifer ; Helmuth, Tyler.. - p. 738-751 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Concentration Properties of Restricted Measures with Applic..:

, In: Lecture Notes in Mathematics; Geometric Aspects of Functional Analysis,
Bobkov, Sergey G. ; Nayar, Piotr ; Tetali, Prasad - p. 25-53 , 2017
Link: https://doi.org/10.1007/..
 
?
6

Many sparse cuts via higher eigenvalues:

, In: Proceedings of the forty-fourth annual ACM symposium on Theory of computing,
Louis, Anand ; Raghavendra, Prasad ; Tetali, Prasad. - p. 1131-1140 , 2012
Link: https://dl.acm.org/doi/1..
 
?
7

Randomized greedy : new variants of some classic approxi..:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,
Costello, Kevin P. ; Shapira, Asaf ; Tetali, Prasad - p. 647-655 , 2011
Link: https://dl.acm.org/doi/1..
 
?
8

Phase transition for the mixing time of the Glauber dynamic..:

, In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms,
Tetali, Prasad ; Vera, Juan C. ; Vigoda, Eric. - p. 1646-1656 , 2010
Link: https://dl.acm.org/doi/1..
 
?
9

Approximations for the isoperimetric and spectral profile o..:

, In: Proceedings of the forty-second ACM symposium on Theory of computing,
Raghavendra, Prasad ; Steurer, David ; Tetali, Prasad - p. 631-640 , 2010
Link: https://dl.acm.org/doi/1..
 
?
10

Efficient distributed random walks with applications:

, In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing,
Das Sarma, Atish ; Nanongkai, Danupon ; Pandurangan, Gopal. - p. 201-210 , 2010
Link: https://dl.acm.org/doi/1..
 
?
11

Combinatorial approach to the interpolation method and scal..:

, In: Proceedings of the forty-second ACM symposium on Theory of computing,
Bayati, Mohsen ; Gamarnik, David ; Tetali, Prasad - p. 105-114 , 2010
Link: https://dl.acm.org/doi/1..
 
?
12

How long does it take to catch a wild kangaroo?:

, In: Proceedings of the forty-first annual ACM symposium on Theory of computing,
Montenegro, Ravi ; Tetali, Prasad - p. 553-560 , 2009
Link: https://dl.acm.org/doi/1..
 
?
13

Simple deterministic approximation algorithms for counting ..:

, In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing,
Bayati, Mohsen ; Gamarnik, David ; Katz, Dimitriy.. - p. 122-127 , 2007
Link: https://dl.acm.org/doi/1..
 
?
14

Slow mixing of Glauber dynamics for the hard-core model on ..:

, In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms,
Galvin, David ; Tetali, Prasad - p. 466-467 , 2004
Link: https://dl.acm.org/doi/1..
 
?
15

Modified log-sobolev inequalities, mixing and hypercontract..:

, In: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing,
Bobkov, Sergey ; Tetali, Prasad - p. 287-296 , 2003
Link: https://dl.acm.org/doi/1..
 
1-15