


default search action
Prasad Tetali
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j53]David J. Galvin, Gwen McKinley, Will Perkins
, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. 33(1): 65-84 (2024) - [j52]Majid Farhadi, Swati Gupta
, Shengding Sun, Prasad Tetali, Michael C. Wigal:
Hardness and approximation of submodular minimum linear ordering problems. Math. Program. 208(1): 277-318 (2024) - [i30]Riyaz Ahuja, Jeremy Avigad, Prasad Tetali, Sean Welleck:
ImProver: Agent-Based Automated Proof Optimization. CoRR abs/2410.04753 (2024) - 2023
- [j51]Christian Borgs
, Jennifer T. Chayes
, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures. Random Struct. Algorithms 63(1): 130-170 (2023) - [j50]Nikhil Bansal, Jatin Batra
, Majid Farhadi, Prasad Tetali:
On Min Sum Vertex Cover and Generalized Min Sum Set Cover. SIAM J. Comput. 52(2): 327-357 (2023) - 2022
- [j49]Arvind Ayyer, Daniel Hathcock
, Prasad Tetali:
Toppleable permutations, excedances and acyclic orientations. Comb. Theory 2(1) (2022) - [j48]Emma Cohen, Will Perkins, Michail Sarantis, Prasad Tetali:
On the number of independent sets in uniform, regular, linear hypergraphs. Eur. J. Comb. 99: 103401 (2022) - [j47]Nina Moorman, Peter Ralli, Prasad Tetali:
On the bipartiteness constant and expansion of Cayley graphs. Eur. J. Comb. 102: 103481 (2022) - [c40]Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali:
Determinant Maximization via Matroid Intersection Algorithms. FOCS 2022: 255-266 - [i29]Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali:
Determinant Maximization via Matroid Intersection Algorithms. CoRR abs/2207.04318 (2022) - [i28]Majid Farhadi, Jai Moondra, Prasad Tetali, Alejandro Toriello:
Multi Purpose Routing: New Perspectives and Approximation Algorithms. CoRR abs/2208.04410 (2022) - [i27]David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. CoRR abs/2211.00464 (2022) - 2021
- [c39]Majid Farhadi, Alejandro Toriello
, Prasad Tetali:
The Traveling Firefighter Problem. ACDA 2021: 205-216 - [c38]Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. SODA 2021: 998-1005 - [i26]Majid Farhadi, Alejandro Toriello, Prasad Tetali:
The Traveling Firefighter Problem. CoRR abs/2107.10454 (2021) - [i25]Majid Farhadi, Swati Gupta, Shengding Sun, Prasad Tetali, Michael C. Wigal:
Hardness and Approximation of Submodular Minimum Linear Ordering Problems. CoRR abs/2108.00914 (2021) - 2020
- [j46]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. Random Struct. Algorithms 56(1): 142-153 (2020) - [c37]Christian Borgs
, Jennifer T. Chayes
, Tyler Helmuth, Will Perkins
, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures. STOC 2020: 738-751 - [i24]Majid Farhadi, Anand Louis, Prasad Tetali:
On the Complexity and Approximation of λ∞ Spread Constant and Maximum Variance Embedding. CoRR abs/2003.05582 (2020) - [i23]Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. CoRR abs/2007.09172 (2020) - [i22]Nina Moorman, Peter Ralli, Prasad Tetali:
On the Bipartiteness Constant and Expansion of Cayley Graphs. CoRR abs/2008.05911 (2020)
2010 – 2019
- 2019
- [j45]Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence for the Hard-Core Model on ℤ2. Comb. Probab. Comput. 28(1): 1-22 (2019) - [i21]Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on Zd at all temperatures. CoRR abs/1909.09298 (2019) - 2018
- [j44]Sohail Bahmani
, Justin Romberg, Prasad Tetali:
Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs. IEEE Trans. Netw. Sci. Eng. 5(2): 86-91 (2018) - [i20]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. CoRR abs/1809.06950 (2018) - 2017
- [j43]Emma Cohen, Will Perkins
, Prasad Tetali:
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Comb. Probab. Comput. 26(2): 183-194 (2017) - [j42]Henrik I. Christensen
, Arindam Khan
, Sebastian Pokutta, Prasad Tetali:
Approximation and online algorithms for multidimensional bin packing: A survey. Comput. Sci. Rev. 24: 63-79 (2017) - [j41]Emma Cohen, Péter Csikvári, Will Perkins
, Prasad Tetali:
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. 62: 70-76 (2017) - [c36]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
Mutation, Sexual Reproduction and Survival in Dynamic Environments. ITCS 2017: 16:1-16:29 - 2016
- [j40]Emma Cohen, Dhruv Mubayi, Peter Ralli, Prasad Tetali:
Inverse Expander Mixing for Hypergraphs. Electron. J. Comb. 23(2): 2 (2016) - [j39]Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali:
Sampling and Counting 3-Orientations of Planar Triangulations. SIAM J. Discret. Math. 30(2): 801-831 (2016) - [i19]Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$. CoRR abs/1611.01115 (2016) - [i18]Sohail Bahmani, Justin K. Romberg, Prasad Tetali:
Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs. CoRR abs/1612.05986 (2016) - 2015
- [i17]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
The game of survival: Sexual evolution in dynamic environments. CoRR abs/1511.01409 (2015) - 2013
- [j38]Andrey Kupavskii, Liudmila Ostroumova
, Dmitry A. Shabanov
, Prasad Tetali:
The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model. Internet Math. 9(4): 297-335 (2013) - [j37]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan
, Prasad Tetali:
Distributed Random Walks. J. ACM 60(1): 2:1-2:31 (2013) - [c35]Antonio Blanca, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2. APPROX-RANDOM 2013: 379-394 - [c34]Yong-Dian Jian, Doru Balcan, Ioannis Panageas, Prasad Tetali, Frank Dellaert:
Support-theoretic subgraph preconditioners for large-scale SLAM. IROS 2013: 9-16 - [i16]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (2013) - [i15]Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali:
The distribution of second degrees in the Buckley-Osthus random graph model. CoRR abs/1304.5715 (2013) - 2012
- [j36]Mokshay M. Madiman, Adam W. Marcus, Prasad Tetali:
Entropy and set cardinality inequalities for partition-determined functions. Random Struct. Algorithms 40(4): 399-424 (2012) - [c33]Satoru Iwata, Prasad Tetali, Pushkar Tripathi:
Approximating Minimum Linear Ordering Problems. APPROX-RANDOM 2012: 206-217 - [c32]Kevin P. Costello
, Prasad Tetali, Pushkar Tripathi:
Stochastic Matching with Commitment. ICALP (1) 2012: 822-833 - [c31]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala:
Many sparse cuts via higher eigenvalues. STOC 2012: 1131-1140 - [i14]Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali:
Algorithms for Sampling 3-Orientations of Planar Triangulations. CoRR abs/1202.4945 (2012) - [i13]Kevin P. Costello, Prasad Tetali, Pushkar Tripathi:
Matching with Commitments. CoRR abs/1205.1721 (2012) - [i12]David J. Galvin, Prasad Tetali:
Slow mixing of Glauber Dynamics for the hard-core model on regular bipartite graphs. CoRR abs/1206.3165 (2012) - [i11]Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh:
On Mimicking Networks Representing Minimum Terminal Cuts. CoRR abs/1207.6371 (2012) - [i10]Antonio Blanca, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2. CoRR abs/1211.6182 (2012) - 2011
- [j35]Marc Mézard, Prasad Tetali:
Special Section on Constraint Satisfaction Problems and Message Passing Algorithms. SIAM J. Discret. Math. 25(2): 733-735 (2011) - [j34]Andrea Montanari, Ricardo Restrepo, Prasad Tetali:
Reconstruction and Clustering in Random Constraint Satisfaction Problems. SIAM J. Discret. Math. 25(2): 771-808 (2011) - [j33]David J. Galvin, Fabio Martinelli
, Kavita Ramanan, Prasad Tetali:
The Multistate Hard Core Model on a Regular Tree. SIAM J. Discret. Math. 25(2): 894-915 (2011) - [c30]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala:
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. APPROX-RANDOM 2011: 315-326 - [c29]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. FOCS 2011: 140-149 - [c28]Devavrat Shah, Jinwoo Shin, Prasad Tetali:
Medium Access Using Queues. FOCS 2011: 698-707 - [c27]Kevin P. Costello
, Asaf Shapira, Prasad Tetali:
Randomized greedy: new variants of some classic approximation algorithms. SODA 2011: 647-655 - [i9]Devavrat Shah, Jinwoo Shin, Prasad Tetali:
Efficient Distributed Medium Access. CoRR abs/1104.2380 (2011) - [i8]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. CoRR abs/1105.0914 (2011) - [i7]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala:
Many Sparse Cuts via Higher Eigenvalues. CoRR abs/1111.0965 (2011) - 2010
- [j32]Brian Benson, Deeparnab Chakrabarty, Prasad Tetali:
G-parking functions, acyclic orientations and spanning trees. Discret. Math. 310(8): 1340-1353 (2010) - [j31]Mokshay M. Madiman, Prasad Tetali:
Information inequalities for joint distributions, with interpretations and applications. IEEE Trans. Inf. Theory 56(6): 2699-2713 (2010) - [c26]Nayantara Bhatnagar, Allan Sly, Prasad Tetali:
Reconstruction Threshold for the Hardcore Model. APPROX-RANDOM 2010: 434-447 - [c25]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan
, Prasad Tetali:
Efficient distributed random walks with applications. PODC 2010: 201-210 - [c24]Prasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. SODA 2010: 1646-1656 - [c23]Mohsen Bayati, David Gamarnik, Prasad Tetali:
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. STOC 2010: 105-114 - [c22]Prasad Raghavendra, David Steurer
, Prasad Tetali:
Approximations for the isoperimetric and spectral profile of graphs and related parameters. STOC 2010: 631-640 - [i6]Nayantara Bhatnagar, Allan Sly, Prasad Tetali:
Reconstruction Threshold for the Hardcore Model. CoRR abs/1004.3531 (2010) - [i5]Christian Borgs, Jennifer T. Chayes, Prasad Tetali:
Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point. CoRR abs/1011.3058 (2010)
2000 – 2009
- 2009
- [j30]Marcus Sammer, Prasad Tetali:
Concentration on the Discrete Torus Using Transportation. Comb. Probab. Comput. 18(5): 835-860 (2009) - [j29]Teena Carroll, David J. Galvin, Prasad Tetali:
Matchings and independent sets of a fixed size in regular graphs. J. Comb. Theory A 116(7): 1219-1227 (2009) - [c21]Ravi Montenegro, Prasad Tetali:
How long does it take to catch a wild kangaroo? STOC 2009: 553-560 - [i4]Mokshay M. Madiman, Prasad Tetali:
Information Inequalities for Joint Distributions, with Interpretations and Applications. CoRR abs/0901.0044 (2009) - [i3]Mokshay M. Madiman, Adam Marcus, Prasad Tetali:
Entropy and set cardinality inequalities for partition-determined functions, with applications to sumsets. CoRR abs/0901.0055 (2009) - [i2]Andrea Montanari, Ricardo Restrepo, Prasad Tetali:
Reconstruction and Clustering in Random Constraint Satisfaction Problems. CoRR abs/0904.2751 (2009) - [i1]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009) - 2008
- [c20]Ernie Croot, Andrew Granville
, Robin Pemantle, Prasad Tetali:
Running Time Predictions for Factoring Algorithms. ANTS 2008: 1-36 - [c19]Jeong Han Kim, Ravi Montenegro, Yuval Peres, Prasad Tetali:
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. ANTS 2008: 402-415 - 2007
- [j28]Milena Mihail, Amin Saberi, Prasad Tetali:
Random Walks with Lookahead on Power Law Random Graphs. Internet Math. 3(2): 147-152 (2007) - [c18]Jeong Han Kim, Ravi Montenegro, Prasad Tetali:
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. FOCS 2007: 215-223 - [c17]Mokshay M. Madiman, Prasad Tetali:
Sandwich bounds for joint entropy. ISIT 2007: 511-515 - [c16]Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali:
Simple deterministic approximation algorithms for counting matchings. STOC 2007: 122-127 - 2006
- [b2]Ehud Friedgut, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. Memoirs of the American Mathematical Society 845, American Mathematical Society 2006, ISBN 978-0-8218-3825-9, pp. 1-66 - [j27]David J. Galvin, Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Random Struct. Algorithms 28(4): 427-443 (2006) - [j26]Michael Krivelevich, Benny Sudakov, Prasad Tetali:
On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2): 180-193 (2006) - 2005
- [j25]Ravi Montenegro, Prasad Tetali:
Mathematical Aspects of Mixing Times in Markov Chains. Found. Trends Theor. Comput. Sci. 1(3) (2005) - 2004
- [j24]Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min Sum Set Cover. Algorithmica 40(4): 219-234 (2004) - [j23]Christian Houdré, Prasad Tetali:
Isoperimetric Invariants For Product Markov Chains and Graph Products. Comb. 24(3): 359-388 (2004) - [j22]Bertrand Guenin, Dhruv Mubayi, Prasad Tetali:
A family of switch equivalent graphs. Discret. Math. 288(1-3): 29-35 (2004) - [c15]Souvik Dihidar, Steven W. McLaughlin, Prasad Tetali:
On the trade-off between rate and performance of expander codes on AWGN channels. ISIT 2004: 6 - [c14]David J. Galvin, Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on the hypercube. SODA 2004: 466-467 - 2003
- [j21]Ehud Friedgut, Yoshiharu Kohayakawa
, Vojtech Rödl, Andrzej Rucinski
, Prasad Tetali:
Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. 12(5-6): 515-545 (2003) - [j20]Graham R. Brightwell, Prasad Tetali:
The Number of Linear Extensions of the Boolean Lattice. Order 20(4): 333-345 (2003) - [j19]Ioana Dumitriu, Prasad Tetali, Peter Winkler
:
On Playing Golf with Two Balls. SIAM J. Discret. Math. 16(4): 604-615 (2003) - [c13]Sergey G. Bobkov, Prasad Tetali:
Modified log-sobolev inequalities, mixing and hypercontractivity. STOC 2003: 287-296 - 2002
- [j18]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring random hypergraphs. Random Struct. Algorithms 20(2): 249-259 (2002) - [c12]Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min-sum Set Cover. APPROX 2002: 94-107 - 2001
- [j17]Prasad Tetali, Santosh S. Vempala:
Random Sampling of Euler Tours. Algorithmica 30(3): 376-385 (2001) - [j16]Christian Houdré, Prasad Tetali:
Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities. Comb. Probab. Comput. 10(1): 1-28 (2001) - [j15]André Kündgen
, Dhruv Mubayi, Prasad Tetali:
Minimal Completely Separating Systems of k-Sets. J. Comb. Theory A 93(1): 192-198 (2001) - [j14]Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali:
On the chromatic number of set systems. Random Struct. Algorithms 19(2): 87-98 (2001) - [c11]Christian Borgs, Jennifer T. Chayes, Martin E. Dyer, Prasad Tetali:
On the Sampling Problem for H-Colorings on the Hypercubic Lattice. Graphs, Morphisms and Statistical Physics 2001: 13-28 - [c10]David J. Galvin, Prasad Tetali:
On Weighted Graph Homomorphisms. Graphs, Morphisms and Statistical Physics 2001: 97-104 - 2000
- [j13]Sergey G. Bobkov, Christian Houdré, Prasad Tetali:
lambdainfty Vertex Isoperimetry and Concentration. Comb. 20(2): 153-172 (2000) - [j12]Peter C. Fishburn, Prasad Tetali, Peter Winkler:
Optimal linear arrangement of a rectangular grid. Discret. Math. 213(1-3): 123-139 (2000) - [c9]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring Random Hypergraphs. ICALP Satellite Workshops 2000: 85-96
1990 – 1999
- 1999
- [j11]Ravi Kannan, Prasad Tetali, Santosh S. Vempala:
Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14(4): 293-308 (1999) - [j10]Prasad Tetali:
Design of On-Line Algorithms Using Hitting Times. SIAM J. Comput. 28(4): 1232-1246 (1999) - [j9]Peter D. Bergstrom Jr., Mary Ann Ingram, Andrew J. Vernon, Joseph L. A. Hughes, Prasad Tetali:
A Markov chain model for an optical shared-memory packet switch. IEEE Trans. Commun. 47(10): 1593-1603 (1999) - [c8]Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu:
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS 1999: 218-229 - [c7]Jeong Han Kim, Daniel R. Simon, Prasad Tetali:
Limits on the Efficiency of One-Way Permutation-Based Hash Functions. FOCS 1999: 535-542 - 1998
- [j8]Fan R. K. Chung, Prasad Tetali:
Isoperimetric Inequalities for Cartesian Products of Graphs. Comb. Probab. Comput. 7(2): 141-148 (1998) - [j7]Prasad Tetali:
A Characterization of Unique Tournaments. J. Comb. Theory B 72(1): 157-159 (1998) - [c6]Dana Randall, Prasad Tetali:
Analyzing Glauber Dynamics by Comparison of Markov Chains. LATIN 1998: 292-304 - 1997
- [j6]Jeong Han Kim, Prasad Tetali, Peter C. Fishburn:
Score certificates for tournaments. J. Graph Theory 24(2): 117-138 (1997) - [c5]Lisa McShine, Prasad Tetali:
On the mixing time of the triangulation walk and other Catalan structures. Randomization Methods in Algorithm Design 1997: 147-160 - [c4]Prasad Tetali, Santosh S. Vempala:
Random Sampling of Euler Tours. RANDOM 1997: 57-66 - [c3]Ravi Kannan, Prasad Tetali, Santosh S. Vempala:
Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). SODA 1997: 193-200 - 1995
- [j5]Noga Alon, Joel Spencer, Prasad Tetali:
Covering with Latin Transversals. Discret. Appl. Math. 57(1): 1-10 (1995) - 1994
- [j4]Prasad Tetali:
An Extension of Foster's Network Theorem. Comb. Probab. Comput. 3: 421-427 (1994) - [c2]Prasad Tetali:
Design of On-line Algorithms Using Hitting Times. SODA 1994: 402-411 - 1993
- [j3]Fan R. K. Chung, Prasad Tetali:
Communication Complexity and Quasi Randomness. SIAM J. Discret. Math. 6(1): 110-123 (1993) - [j2]Don Coppersmith, Prasad Tetali, Peter Winkler:
Collisions Among Random Walks on a Graph. SIAM J. Discret. Math. 6(3): 363-374 (1993) - 1991
- [b1]Prasad Tetali:
Applications and Analysis of Probabilistic Techniques. New York University, USA, 1991 - [c1]Prasad Tetali, Peter Winkler:
On a Random Walk Problem Arising in Self-Stabilizing Token Management. PODC 1991: 273-280 - 1990
- [j1]