Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Dagum, P.
Luby, M.
Mihail, M.
and
Vazirani, U.
1988.
Polytopes, permanents and graphs with large factors.
p.
412.
Sinclair, Alistair
and
Jerrum, Mark
1989.
Approximate counting, uniform generation and rapidly mixing Markov chains.
Information and Computation,
Vol. 82,
Issue. 1,
p.
93.
Jerrum, Mark
and
Sinclair, Alistair
1989.
Approximating the Permanent.
SIAM Journal on Computing,
Vol. 18,
Issue. 6,
p.
1149.
Mihail, M.
1989.
Conductance and convergence of Markov chains-a combinatorial treatment of expanders.
p.
526.
Mihail, Milena
1989.
On coupling and the approximation of the permanent.
Information Processing Letters,
Vol. 30,
Issue. 2,
p.
91.
Desai, M.P.
and
Rao, V.B.
1990.
A new eigenvalue bound for reversible Markov chains with applications to the temperature-asymptotics of simulated annealing.
p.
1211.
Babai, L.
Fortnow, L.
and
Lund, C.
1990.
Nondeterministic exponential time has two-prover interactive protocols.
p.
16.
Babai, L.
and
Friedl, K.
1991.
Approximate representation theory of finite groups.
p.
733.
Babai, L�szl�
Fortnow, Lance
and
Lund, Carsten
1991.
Non-deterministic exponential time has two-prover interactive protocols.
Computational Complexity,
Vol. 1,
Issue. 1,
p.
3.
Duffy, Diane E.
and
Quiroz, adolfo J.
1991.
A permutation-based algorithm for block clustering.
Journal of Classification,
Vol. 8,
Issue. 1,
p.
65.
Troutman, Brent M.
and
Karlinger, Michael R.
1992.
Gibbs' Distribution on drainage networks.
Water Resources Research,
Vol. 28,
Issue. 2,
p.
563.
Sinclair, Alistair
1992.
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow.
Combinatorics, Probability and Computing,
Vol. 1,
Issue. 4,
p.
351.
Babai, László
and
Szegedy, Mario
1992.
Local Expansion of Symmetrical Graphs.
Combinatorics, Probability and Computing,
Vol. 1,
Issue. 1,
p.
1.
Dagum, Paul
and
Luby, Michael
1992.
Approximating the permanent of graphs with large factors.
Theoretical Computer Science,
Vol. 102,
Issue. 2,
p.
283.
Sinclair, Alistair
1992.
LATIN '92.
Vol. 583,
Issue. ,
p.
474.
Desai, Madhav P.
and
Rao, Vasant B.
1993.
On the Convergence of Reversible Markov Chains.
SIAM Journal on Matrix Analysis and Applications,
Vol. 14,
Issue. 4,
p.
950.
Gillman, D.
1993.
A Chernoff bound for random walks on expander graphs.
p.
680.
Desai, Madhav
and
Rao, Vasant
1994.
A characterization of the smallest eigenvalue of a graph.
Journal of Graph Theory,
Vol. 18,
Issue. 2,
p.
181.
Shahrokhi, Farhad
and
Székely, László A.
1994.
On Canonical Concurrent Flows, Crossing Number and Graph Expansion.
Combinatorics, Probability and Computing,
Vol. 3,
Issue. 4,
p.
523.
Troutman, Brent M.
and
Karlinger, Michael R.
1994.
Inference for a generaliaed gibbsian distribution channel networks.
Water Resources Research,
Vol. 30,
Issue. 7,
p.
2325.