Suresh Chari
- Adl78.L. Adleman. Two theorems on random polynomial time. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 75-83, 1978.Google Scholar
Digital Library
- CGM92.P. Camerini and G. Galbiati and F. Maflioli. Random pseudopolynomial algorithms for exact matroid problems. Journal of Algorithms, 13(2)'258-273, 1992. Google ScholarDigital Library
- CG89.B. Chor and O. Goldreich. On the power of two-point sampling. Journal of Complexity, 5:96-106, 1989. Google ScholarDigital Library
- CH90.J-Y. Cai and L. Hemachandra. On the Power of Parity Polynomial Time. Math. Systems Theory, 23(2):95-106, 1990.Google ScholarCross Ref
- Csa76.L. Csanky. Fast parallel matrix inversion algorithms. SIAM J. Comput., 5:618-623, 1976.Google ScholarDigital Library
- CW79.J.L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143- 154, 1979.Google Scholar
- dB51.N. de Bruijn. On the number of positive integers _< x and free of prime factors > y. Proc. Kon. Ned. Akad. Wet.(Indag. Math. 13), A54:50-60, 1951.Google Scholar
- DK86.E. Dahlhaus and M. Karpinski. The matching problem for strongly chordal graphs is in NC. Technical Report 855-CS, University of Bonn, 1986. Google Scholar
- GK87.D. Yu. Grigoriev and M. Karpinski. The matching problem for bipartite graphs with polynomially bounded permanents is in N C. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 166-172, 1987. See also D. Yu. Grigoriev, M. Karpinski and M. F. Singer, "Fast parallel algorithms for multivariate polynomial interpolation over finite fields," SIAM J. Comput., Vol. 19, 1990, 1059- 1063. Google ScholarDigital Library
- GPST92.A. V. Goldberg, S. A. Plotkin, D. B. Shmoys, and }#. Tardos. Using interiorpoint methods for fast parallel algorithms for bipartite matching and related problems. SIAM J. Comput., 21(1):140-150, 1992. Google ScholarDigital Library
- GPV93.A.V. Goldberg, S. A. Plotkin, and P. M. Valdya. Sublinear-time parallel algorithms for matching and related problems. Journal of Algorithms, 14(2):180-213, 1993. Google ScholarDigital Library
- Gro92.L.K. Grover. Fast parallel algorithms for bipartite matching. In Proceedings o/ the Integer Programming and Combinatorial Optimization Conference, pages 367- 384, 1992.Google Scholar
- Kar86.H.J. Karloff. ALas Vegas RNC algorithm for maximum matching. Combinatorica, 6(4):387-391, 1986. Google ScholarDigital Library
- Kas67.P.W. Kastelyn. Graph theory and crystal physics. In F. Harary, editor, Graph Theory and Theoretical Physics, pages 43-110. Academic Press, New York, 1967.Google Scholar
- KSTT89.J. KSbler, U. SchSning, S. Toda, and J. Torah. Turing machines with few accepting computations and low sets for PP. In Proceedings of the IEEE Symposium on Structure in Complexity Theory, pages 208-215, 1989.Google Scholar
- KUW86.R. M. Karp, E. Upfal, and A. Wigderson. Constructing a maximum matching is in Random NC. Combinatorica, 6(1):35-48, 1986. Google ScholarDigital Library
- KVV85.D. Kozen, U. V. Vazirani, and V. V. Vazirani. ArC` algorithms for comparabii. graphs, interval graphs, and testing for unique perfect matching. In Proceedings, FST # TCS Conference, Lecture Notes in Computer Science # 206, pages 496-503. Springer-Verlag, Berlin, 1985. Google ScholarDigital Library
- LP86.L. Lov,4sz and M. Plummer. Matching Theory. North-Holland, Amsterdam, 1986.Google Scholar
- MN89.G.L. Miller and J. Naor. Flow in planar graphs with multiple sources and sinks. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 112-117, 1989.Google ScholarDigital Library
- MVV87.K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1)'105-113, 1987. Google ScholarDigital Library
- NSV92.H. Narayanan, H. Saran, and V. V. Vazirani. Randomized parallel algorithms for matroid union and intersection, with applications to arborescences and edge-disjoint spanning trees. In Proceedings of the A CM/SIAM Symposium on Discrete Algorithms, pages 357-366, 1992. Google ScholarDigital Library
- PY82.C.H. Papadimitriou and M. Yannakakis. The complexity of restricted spanning tree problems. J. Assoc. Comput. Mach., 29(2)'285-309, 1982. Google ScholarDigital Library
- Rab82.M.O. Rabin. N-process mutual exclusion with bounded waiting by 4log2 N-valued shared variable. Journal of Computer and System Sciences, 25(1):66-75, 1982.Google ScholarCross Ref
- Tar91.J. Tarui. Randomized polynomials, Threshold circuits and the Polynomial hierarchy. In Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science #480, pages 238-250, 1991. Google ScholarDigital Library
- Thr93.W. Thrash. A Note on the Least Common Multiples of Dense Sets of Integers. Technical Report #93-02-04, Department of Computer Science & Engineering, University of Washington, Seattle, Feb. 199.3.Google Scholar
- Tiw87.P. Tiwari Parallel algorithms for instances of linear matroid parity with small number of solutions. Technical Report RC 127(;6, IBM T.J. Watson Research Center, May 1987.Google Scholar
- Tod91.S. Toda. PP is as hard as the Polynomialtime Hierarchy. SIAM Journal of Computing, 20(5):865-877, 1991. Google ScholarDigital Library
- Tom91.M. Tompa. Lecture notes on probabilistic algorithms and pseudorandom generators. Technical Report #91-07-05, Department of Computer Science & Engineering, University of Washington, Seattle, July 1991.Google Scholar
- Vai90.P.M. Vaidya. Reducing the parallel complexity of certain linear programming problems, in Proceedings of the IEEE Symposium on Foundations o# Computer Science, pages 583-589, 1990.Google ScholarDigital Library
- Vaz89.V.V. Vazirani. NC algorithms for computing the number of perfect matchings in Ka,a-free graphs and related problems. Information and Computation, 80:152-164, 1989. Google ScholarDigital Library
- VV86.L.G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(1):85- 93, 1986. Google ScholarDigital Library
Index Terms
- Randomness-optimal unique element isolation, with applications to perfect matching and related problems
Recommendations
Randomness-Optimal Unique Element Isolation withApplications to Perfect Matching and Related Problems
In this paper, we precisely characterize the randomness complexity of the unique element isolation problem, a crucial step in the $RNC$ algorithm for perfect matching due to Mulmuley, Vazirani, and Vazirani [Combinatorica, 7 (1987), pp. 105--113] and in ...
Repeated matching pennies with limited randomness
EC '11: Proceedings of the 12th ACM conference on Electronic commerceWe consider a repeated Matching Pennies game in which players have limited access to randomness. Playing the (unique) Nash equilibrium in this n-stage game requires n random bits. Can there be Nash equilibria (or epsilon-Nash equilibria) that use less ...
Comments