Prasad Tetali - RankMe

127 papers A* 22A 2B 3Journal 84Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	ImProver: Agent-Based Automated Proof Optimization. ICLR Riyaz Ahuja, Jeremy Avigad, Prasad Tetali, Sean Welleck
2025	J	`jnl`	Note on the number of antichains in generalizations of the boolean lattice. Comb. Theory Jinyoung Park, Michail Sarantis, Prasad Tetali
2024	J	`jnl`	Hardness and approximation of submodular minimum linear ordering problems. Math. Program. Majid Farhadi, Swati Gupta, Shengding Sun, Prasad Tetali, Michael C. Wigal
2024	J	`jnl`	ImProver: Agent-Based Automated Proof Optimization. CoRR Riyaz Ahuja, Jeremy Avigad, Prasad Tetali, Sean Welleck
2024	J	`jnl`	On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali
2023	J	`jnl`	Efficient sampling and counting algorithms for the Potts model on Random Struct. Algorithms Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
2023	J	`jnl`	On Min Sum Vertex Cover and Generalized Min Sum Set Cover. SIAM J. Comput. Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali
2022	A*	`conf`	Determinant Maximization via Matroid Intersection Algorithms. FOCS Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali
2022	J	`jnl`	Determinant Maximization via Matroid Intersection Algorithms. CoRR Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali
2022	J	`jnl`	Multi Purpose Routing: New Perspectives and Approximation Algorithms. CoRR Majid Farhadi, Jai Moondra, Prasad Tetali, Alejandro Toriello
2022	J	`jnl`	On the bipartiteness constant and expansion of Cayley graphs. Eur. J. Comb. Nina Moorman, Peter Ralli, Prasad Tetali
2022	J	`jnl`	On the number of independent sets in uniform, regular, linear hypergraphs. Eur. J. Comb. Emma Cohen, Will Perkins, Michail Sarantis, Prasad Tetali
2022	J	`jnl`	On the zeroes of hypergraph independence polynomials. CoRR David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali
2022	J	`jnl`	Toppleable permutations, excedances and acyclic orientations. Comb. Theory Arvind Ayyer, Daniel Hathcock, Prasad Tetali
2021	J	`jnl`	Hardness and Approximation of Submodular Minimum Linear Ordering Problems. CoRR Majid Farhadi, Swati Gupta, Shengding Sun, Prasad Tetali, Michael C. Wigal
2021	A*	`conf`	Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. SODA Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali
2021	—	`conf`	The Traveling Firefighter Problem. ACDA Majid Farhadi, Alejandro Toriello, Prasad Tetali
2021	J	`jnl`	The Traveling Firefighter Problem. CoRR Majid Farhadi, Alejandro Toriello, Prasad Tetali
2020	A*	`conf`	Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures. STOC Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
2020	J	`jnl`	Finding cliques using few probes. Random Struct. Algorithms Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali
2020	J	`jnl`	Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. CoRR Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali
2020	J	`jnl`	On the Bipartiteness Constant and Expansion of Cayley Graphs. CoRR Nina Moorman, Peter Ralli, Prasad Tetali
2020	J	`jnl`	On the Complexity and Approximation of λ CoRR Majid Farhadi, Anand Louis, Prasad Tetali
2019	J	`jnl`	Efficient sampling and counting algorithms for the Potts model on Z CoRR Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
2019	J	`jnl`	Phase Coexistence for the Hard-Core Model on ℤ2. Comb. Probab. Comput. Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali
2018	J	`jnl`	Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs. IEEE Trans. Netw. Sci. Eng. Sohail Bahmani, Justin Romberg, Prasad Tetali
2018	J	`jnl`	Finding cliques using few probes. CoRR Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali
2017	J	`jnl`	Approximation and online algorithms for multidimensional bin packing: A survey. Comput. Sci. Rev. Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, Prasad Tetali
2017	A	`conf`	Mutation, Sexual Reproduction and Survival in Dynamic Environments. ITCS Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani
2017	J	`jnl`	On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Comb. Probab. Comput. Emma Cohen, Will Perkins, Prasad Tetali
2017	J	`jnl`	The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. Emma Cohen, Péter Csikvári, Will Perkins, Prasad Tetali
2016	J	`jnl`	Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs. CoRR Sohail Bahmani, Justin K. Romberg, Prasad Tetali
2016	J	`jnl`	Inverse Expander Mixing for Hypergraphs. Electron. J. Comb. Emma Cohen, Dhruv Mubayi, Peter Ralli, Prasad Tetali
2016	J	`jnl`	Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$. CoRR Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali
2016	J	`jnl`	Sampling and Counting 3-Orientations of Planar Triangulations. SIAM J. Discret. Math. Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali
2015	J	`jnl`	The game of survival: Sexual evolution in dynamic environments. CoRR Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani
2013	J	`jnl`	Distributed Random Walks CoRR Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali
2013	J	`jnl`	Distributed Random Walks. J. ACM Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali
2013	—	`conf`	Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2. APPROX-RANDOM Antonio Blanca, David J. Galvin, Dana Randall, Prasad Tetali
2013	A	`conf`	Support-theoretic subgraph preconditioners for large-scale SLAM. IROS Yong-Dian Jian, Doru Balcan, Ioannis Panageas, Prasad Tetali, Frank Dellaert
2013	J	`jnl`	The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model. Internet Math. Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali
2013	J	`jnl`	The distribution of second degrees in the Buckley-Osthus random graph model. CoRR Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali
2012	J	`jnl`	Algorithms for Sampling 3-Orientations of Planar Triangulations CoRR Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali
2012	—	`conf`	Approximating Minimum Linear Ordering Problems. APPROX-RANDOM Satoru Iwata, Prasad Tetali, Pushkar Tripathi
2012	J	`jnl`	Entropy and set cardinality inequalities for partition-determined functions. Random Struct. Algorithms Mokshay M. Madiman, Adam W. Marcus, Prasad Tetali
2012	A*	`conf`	Many sparse cuts via higher eigenvalues. STOC Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala
2012	J	`jnl`	Matching with Commitments CoRR Kevin P. Costello, Prasad Tetali, Pushkar Tripathi
2012	J	`jnl`	On Mimicking Networks Representing Minimum Terminal Cuts CoRR Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh
2012	J	`jnl`	Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2 CoRR Antonio Blanca, David J. Galvin, Dana Randall, Prasad Tetali
2012	J	`jnl`	Slow mixing of Glauber Dynamics for the hard-core model on regular bipartite graphs CoRR David J. Galvin, Prasad Tetali
2012	—	`conf`	Stochastic Matching with Commitment. ICALP (1) Kevin P. Costello, Prasad Tetali, Pushkar Tripathi
2011	—	`conf`	Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. APPROX-RANDOM Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala
2011	J	`jnl`	Efficient Distributed Medium Access CoRR Devavrat Shah, Jinwoo Shin, Prasad Tetali
2011	J	`jnl`	Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets CoRR Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang
2011	A*	`conf`	Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. FOCS Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang
2011	J	`jnl`	Many Sparse Cuts via Higher Eigenvalues CoRR Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala
2011	A*	`conf`	Medium Access Using Queues. FOCS Devavrat Shah, Jinwoo Shin, Prasad Tetali
2011	A*	`conf`	Randomized greedy: new variants of some classic approximation algorithms. SODA Kevin P. Costello, Asaf Shapira, Prasad Tetali
2011	J	`jnl`	Reconstruction and Clustering in Random Constraint Satisfaction Problems. SIAM J. Discret. Math. Andrea Montanari, Ricardo Restrepo, Prasad Tetali
2011	J	`jnl`	Special Section on Constraint Satisfaction Problems and Message Passing Algorithms. SIAM J. Discret. Math. Marc Mézard, Prasad Tetali
2011	J	`jnl`	The Multistate Hard Core Model on a Regular Tree. SIAM J. Discret. Math. David J. Galvin, Fabio Martinelli, Kavita Ramanan, Prasad Tetali
2010	A*	`conf`	Approximations for the isoperimetric and spectral profile of graphs and related parameters. STOC Prasad Raghavendra, David Steurer, Prasad Tetali
2010	A*	`conf`	Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. STOC Mohsen Bayati, David Gamarnik, Prasad Tetali
2010	A*	`conf`	Efficient distributed random walks with applications. PODC Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali
2010	J	`jnl`	G-parking functions, acyclic orientations and spanning trees. Discret. Math. Brian Benson, Deeparnab Chakrabarty, Prasad Tetali
2010	J	`jnl`	Information inequalities for joint distributions, with interpretations and applications. IEEE Trans. Inf. Theory Mokshay M. Madiman, Prasad Tetali
2010	A*	`conf`	Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. SODA Prasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang
2010	J	`jnl`	Reconstruction Threshold for the Hardcore Model CoRR Nayantara Bhatnagar, Allan Sly, Prasad Tetali
2010	—	`conf`	Reconstruction Threshold for the Hardcore Model. APPROX-RANDOM Nayantara Bhatnagar, Allan Sly, Prasad Tetali
2010	J	`jnl`	Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point CoRR Christian Borgs, Jennifer T. Chayes, Prasad Tetali
2009	J	`jnl`	Concentration on the Discrete Torus Using Transportation. Comb. Probab. Comput. Marcus Sammer, Prasad Tetali
2009	J	`jnl`	Entropy and set cardinality inequalities for partition-determined functions, with applications to sumsets CoRR Mokshay M. Madiman, Adam Marcus, Prasad Tetali
2009	A*	`conf`	How long does it take to catch a wild kangaroo? STOC Ravi Montenegro, Prasad Tetali
2009	J	`jnl`	Information Inequalities for Joint Distributions, with Interpretations and Applications CoRR Mokshay M. Madiman, Prasad Tetali
2009	J	`jnl`	Matchings and independent sets of a fixed size in regular graphs. J. Comb. Theory A Teena Carroll, David J. Galvin, Prasad Tetali
2009	J	`jnl`	Near-Optimal Sublinear Time Bounds for Distributed Random Walks CoRR Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali
2009	J	`jnl`	Reconstruction and Clustering in Random Constraint Satisfaction Problems CoRR Andrea Montanari, Ricardo Restrepo, Prasad Tetali
2008	—	`conf`	A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. ANTS Jeong Han Kim, Ravi Montenegro, Yuval Peres, Prasad Tetali
2008	—	`conf`	Running Time Predictions for Factoring Algorithms. ANTS Ernie Croot, Andrew Granville, Robin Pemantle, Prasad Tetali
2007	A*	`conf`	Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. FOCS Jeong Han Kim, Ravi Montenegro, Prasad Tetali
2007	J	`jnl`	Random Walks with Lookahead on Power Law Random Graphs. Internet Math. Milena Mihail, Amin Saberi, Prasad Tetali
2007	B	`conf`	Sandwich bounds for joint entropy. ISIT Mokshay M. Madiman, Prasad Tetali
2007	A*	`conf`	Simple deterministic approximation algorithms for counting matchings. STOC Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali
2006	—	`book`	A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. Ehud Friedgut, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
2006	J	`jnl`	On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms Michael Krivelevich, Benny Sudakov, Prasad Tetali
2006	J	`jnl`	Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Random Struct. Algorithms David J. Galvin, Prasad Tetali
2005	J	`jnl`	Mathematical Aspects of Mixing Times in Markov Chains. Found. Trends Theor. Comput. Sci. Ravi Montenegro, Prasad Tetali
2004	J	`jnl`	A family of switch equivalent graphs. Discret. Math. Bertrand Guenin, Dhruv Mubayi, Prasad Tetali
2004	J	`jnl`	Approximating Min Sum Set Cover. Algorithmica Uriel Feige, László Lovász, Prasad Tetali
2004	J	`jnl`	Isoperimetric Invariants For Product Markov Chains and Graph Products. Comb. Christian Houdré, Prasad Tetali
2004	B	`conf`	On the trade-off between rate and performance of expander codes on AWGN channels. ISIT Souvik Dihidar, Steven W. McLaughlin, Prasad Tetali
2004	A*	`conf`	Slow mixing of Glauber dynamics for the hard-core model on the hypercube. SODA David J. Galvin, Prasad Tetali
2003	A*	`conf`	Modified log-sobolev inequalities, mixing and hypercontractivity. STOC Sergey G. Bobkov, Prasad Tetali
2003	J	`jnl`	On Playing Golf with Two Balls. SIAM J. Discret. Math. Ioana Dumitriu, Prasad Tetali, Peter Winkler
2003	J	`jnl`	Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
2003	J	`jnl`	The Number of Linear Extensions of the Boolean Lattice. Order Graham R. Brightwell, Prasad Tetali
2002	—	`conf`	Approximating Min-sum Set Cover. APPROX Uriel Feige, László Lovász, Prasad Tetali
2002	J	`jnl`	Two-coloring random hypergraphs. Random Struct. Algorithms Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
2001	J	`jnl`	Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities. Comb. Probab. Comput. Christian Houdré, Prasad Tetali
2001	J	`jnl`	Minimal Completely Separating Systems of k-Sets. J. Comb. Theory A André Kündgen, Dhruv Mubayi, Prasad Tetali
2001	—	`conf`	On Weighted Graph Homomorphisms. Graphs, Morphisms and Statistical Physics David J. Galvin, Prasad Tetali
2001	—	`conf`	On the Sampling Problem for H-Colorings on the Hypercubic Lattice. Graphs, Morphisms and Statistical Physics Christian Borgs, Jennifer T. Chayes, Martin E. Dyer, Prasad Tetali
2001	J	`jnl`	On the chromatic number of set systems. Random Struct. Algorithms Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali
2001	J	`jnl`	Random Sampling of Euler Tours. Algorithmica Prasad Tetali, Santosh S. Vempala
2000	J	`jnl`	Optimal linear arrangement of a rectangular grid. Discret. Math. Peter C. Fishburn, Prasad Tetali, Peter Winkler
2000	—	`conf`	Two-coloring Random Hypergraphs. ICALP Satellite Workshops Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
2000	J	`jnl`	lambda Comb. Sergey G. Bobkov, Christian Houdré, Prasad Tetali
1999	J	`jnl`	A Markov chain model for an optical shared-memory packet switch. IEEE Trans. Commun. Peter D. Bergstrom Jr., Mary Ann Ingram, Andrew J. Vernon, Joseph L. A. Hughes, Prasad Tetali
1999	J	`jnl`	Design of On-Line Algorithms Using Hitting Times. SIAM J. Comput. Prasad Tetali
1999	A*	`conf`	Limits on the Efficiency of One-Way Permutation-Based Hash Functions. FOCS Jeong Han Kim, Daniel R. Simon, Prasad Tetali
1999	J	`jnl`	Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms Ravi Kannan, Prasad Tetali, Santosh S. Vempala
1999	A*	`conf`	Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu
1998	J	`jnl`	A Characterization of Unique Tournaments. J. Comb. Theory B Prasad Tetali
1998	B	`conf`	Analyzing Glauber Dynamics by Comparison of Markov Chains. LATIN Dana Randall, Prasad Tetali
1998	J	`jnl`	Isoperimetric Inequalities for Cartesian Products of Graphs. Comb. Probab. Comput. Fan R. K. Chung, Prasad Tetali
1997	—	`conf`	On the mixing time of the triangulation walk and other Catalan structures. Randomization Methods in Algorithm Design Lisa McShine, Prasad Tetali
1997	—	`conf`	Random Sampling of Euler Tours. RANDOM Prasad Tetali, Santosh S. Vempala
1997	J	`jnl`	Score certificates for tournaments. J. Graph Theory Jeong Han Kim, Prasad Tetali, Peter C. Fishburn
1997	A*	`conf`	Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). SODA Ravi Kannan, Prasad Tetali, Santosh S. Vempala
1995	J	`jnl`	Covering with Latin Transversals. Discret. Appl. Math. Noga Alon, Joel Spencer, Prasad Tetali
1994	J	`jnl`	An Extension of Foster's Network Theorem. Comb. Probab. Comput. Prasad Tetali
1994	A*	`conf`	Design of On-line Algorithms Using Hitting Times. SODA Prasad Tetali
1993	J	`jnl`	Collisions Among Random Walks on a Graph. SIAM J. Discret. Math. Don Coppersmith, Prasad Tetali, Peter Winkler
1993	J	`jnl`	Communication Complexity and Quasi Randomness. SIAM J. Discret. Math. Fan R. K. Chung, Prasad Tetali
1991	—	`—`	Applications and Analysis of Probabilistic Techniques. Prasad Tetali
1991	A*	`conf`	On a Random Walk Problem Arising in Self-Stabilizing Token Management. PODC Prasad Tetali, Peter Winkler
1990	J	`jnl`	Representations of Integers as the Sum of k Terms. Random Struct. Algorithms Paul Erdös, Prasad Tetali