1. Quantum algorithms for matching and network flows;A Ambainis;STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science,2006
2. Polynomial-time t-depth optimization of clifford+t circuits via matroid partitioning;M Amy;IEEE Trans. Comput. Aided Des. Integr. Circuits Syst,2014
3. Network coding theory: A survey;R Bassoli;IEEE Commun. Surv. Tutorials,2013
4. Quantum lower bounds by polynomials;R Beals;39th Annual Symposium on Foundations of Computer Science, FOCS '98,1998
5. Matroids, graphs, and 3-connectivity;R E Bixby;Graph theory and related topics (Proc. Conf., Univ. Waterloo,1977