#### Filter Results:

- Full text PDF available (78)

#### Publication Year

1990

2018

- This year (2)
- Last 5 years (26)
- Last 10 years (66)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Uriel Feige, LÃ¡szlÃ³ LovÃ¡sz, Prasad Tetali
- Algorithmica
- 2002

The input to the min sum set cover problem is a collection of n sets that jointly cover m elements. The output is a linear order on the sets, namely, in every time step from 1 to n exactly one set isâ€¦ (More)

- Ravi Kannan, Prasad Tetali, Santosh Vempala
- SODA
- 1997

We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markovâ€¦ (More)

- Mokshay M. Madiman, Prasad Tetali
- IEEE Transactions on Information Theory
- 2010

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon'sâ€¦ (More)

We construct a deterministic fully polynomial time approximationscheme (FPTAS) for computing the total number of matchings in abounded degree graph. Additionally, for an arbitrary graph, weconstructâ€¦ (More)

- Dana Randall, Prasad Tetali
- LATIN
- 1998

A popular technique for studying random properties of a combinatorial set is to design a Markov chain Monte Carlo algorithm. For many problems there are natural Markov chains connecting the set ofâ€¦ (More)

- David Galvin, Prasad Tetali
- Graphs, Morphisms and Statistical Physics
- 2001

For given graphs G and H, let |Hom(G,H)| denote the set of graph homomorphisms from G to H. We show that for any finite, n-regular, bipartite graph G and any finite graph H (perhaps with loops),â€¦ (More)

- Paul ErdÃ¶s, Prasad Tetali
- Random Struct. Algorithms
- 1990

On complete, non-compact manifolds and infinite graphs, FaberKrahn inequalities have been used to estimate the rate of decay of the heat kernel. We develop this technique in the setting of finiteâ€¦ (More)

- Ioana Dumitriu, Prasad Tetali, Peter Winkler
- SIAM J. Discrete Math.
- 2003

We analyze and solve a game in which a player chooses which of several Markov chains to advance, with the object of minimizing the expected time (or cost) for one of the chains to reach a targetâ€¦ (More)

- Christian Borgs, Jennifer T. Chayes, +4 authors Van H. Vu
- FOCS
- 1999

We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice Z. We prove that under certain circumstances, the mixing timeâ€¦ (More)