Balanced matroids

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	D. Aldous, "On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing," Probability in Eng. and inf. Sci. 1, 1987, pp 33-46.
	2	David J. Aldous, The random walk construction of uniform spanning trees and uniform labelled trees, SIAM Journal on Discrete Mathematics, v.3 n.4, p.450-465, November 1990 [doi>10.1137/0403039]
	3	A Z Broder, How hard is it to marry at random? (On the approximation of the permanent), Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.50-58, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12136]
	4	A.Z. Broder, "Generating random spanning trees," FOCS 1989, pp 442-447.
	5	R.L. Brooks, C.A.B. Smith, A.H. Stone, and W.T. Tutte, "The dissection of rectangles into squares," Duke Math. J. 7, 1940, 312-340.
	6	Paul Dagum , Michael Luby, Approximating the permanent of graphs with large factors, Theoretical Computer Science, v.102 n.2, p.283-305, 10 Aug. 1992 [doi>10.1016/0304-3975(92)90234-7]
	7	P. Diaconis and D. Strock, "Geometric bounds for eigenvalues of Markov chains," Annals of Applied Probability, Vol. 1, 36-61, 1991.
	8	M. Dyer and A. Frieze, "Random walks, totally unimodular zonotopes, and randor#dzed dual simplex algorithm", LPCO 1992, Carnegie Mellon, to appear.
	9	M. Dyer , A. Frieze, A random polynomial time algorithm for approximating the volume of convex bodies, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.375-381, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73043]
	10	J. Edmonds, "Submodular functions, matroids and certain polyhedra," Combinatorial structures and their applications, Proc. Calgary International Conference, 1969.
	11	Greg N. Frederickson, Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees, Proceedings of the 32nd annual symposium on Foundations of computer science, p.632-641, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185429]
	12	C. Holtzmann, and F. Harary, On the tree graph of a matroid, SIAM Y. Applied Math. 25, pp 187- 193.
	13	F. Jaeger, D.L. Vertigan, and D.J.A. Welsh, "On the computational complexity of Jones and Tutte polynomials," Math. Proc. Camb. Phil. Soc. 1990, 108, pp 35-53.
	14	Mark Jerrum , Alistair Sinclair, Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.235-244, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62234]
	15	M R Jerrum , L G Valiant , V V Vazirani, Random generation of combinatorial structures from a uniform, Theoretical Computer Science, v.43 n.2-3, p.169-188, July 1986
	16	L. Lov~sz and M. Simonovis, "The mixing rate of M arkov chains, An isoperimetric inequality, and computing the volume," FOCS 1990, pp 346- 354.
	17	M. Mihail, "Conductance and convergence of Markov chains (A combinatorial Treatmeat of expanders)," FOCS 1989, pp 526-531.
	18	Milena Mihail , Madhu Sudan, Connectivity Properties of Matroids, University of California at Berkeley, Berkeley, CA, 1992
	19	M. Mihail, and U. Vazirani, "On the expansion of 0-1 polytopes," Journal of Combinatorial Theory, Series B, to appear.
	20	D. Naddef and W. Pulleybla#, "Hamiltonic. ity in 0-1 polyhedra," Journal of Combinatorial Theory, Series B 37, 1984, pp 41-52.
	21	Alistair Sinclair, Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow, Proceedings of the 1st Latin American Symposium on Theoretical Informatics, p.474-487, April 06-10, 1992
	22	P. Seymour, personal communication.
	23	P. Seymour and D.J.A. Welsh, "Combinatorial applications of an inequality from statistical mechanics," Math. Proc. Camb. Phil. Soc. 1975, 77, pp 485-495.
	24	P. Seymour and P. Winkler, personal commun#- cation.
	25	A. Sincla#. and M.R. Jerrum, "Approximate counting, uniform generation and rapidly mixing Markov chains," Information and Computing, to appear.
	26	M. Sudan, personal communication.
	27	L.G. Valiant, "The complexity of enumeration and reliability problems," SIAM Journal on Computing 8, 1979, pp 410-421.
	28	D. Welsh, Matroid Theory, Academic Press, 1976.
	29	D.J.A Welsh, "On the Tutte map," Lecture Notes, DIMACS May 91/Dagstutfl June 91.