default search action
Michael Sipser
Refine list
refinements active!
zoomed in on ?? of ?? records
showing all ?? records
2010 – today
- 2013
[i2]Zachary Remscrim, Michael Sipser:
AC0 Pseudorandomness of Natural Operations. Electronic Colloquium on Computational Complexity (ECCC) 20: 88 (2013)
2000 – 2009
- 2008
- [e1]Zoran Majkic, Michael Sipser, R. Radha, Daming Wei:
International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS-08, Orlando, Florida, USA, July 7-10, 2008. ISRST 2008, ISBN 978-1-60651-006-3 [contents] - 2001
- [i1]Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. CoRR cs.DM/0101028 (2001)
1990 – 1999
- 1998
- [j16]Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. J. Algorithms 29(1): 142-164 (1998) - 1997
- [b1]Michael Sipser:
Introduction to the theory of computation. PWS Publishing Company 1997, ISBN 978-0-534-94728-6, pp. I-XV, 1-396 - [c27]Lance Fortnow, Michael Sipser:
Retraction of Probabilistic Computation and Linear Time. STOC 1997: 750 - 1996
- [j15]
- [j14]Christos H. Papadimitriou, Oded Goldreich, Avi Wigderson, Alexander A. Razborov, Michael Sipser:
The future of computational complexity theory: part I. SIGACT News 27(3): 6-12 (1996) - [j13]Michael Sipser, Daniel A. Spielman:
Expander codes. IEEE Transactions on Information Theory 42(6): 1710-1722 (1996) - 1995
- [j12]Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logarithmic Space from Logarithmic Depth. J. Comput. Syst. Sci. 50(3): 433-437 (1995) - 1994
- [j11]Lance Fortnow, John Rompel, Michael Sipser:
On the Power of Multi-Prover Interactive Protocols. Theor. Comput. Sci. 134(2): 545-557 (1994) - [c26]David Gillman, Michael Sipser:
Inference and Minimization of Hidden Markov Chains. COLT 1994: 147-158 - [c25]
- [c24]Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. SODA 1994: 372-381 - 1992
- [c23]
- 1991
- [j10]
- [c22]Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logspace from NC. Structure in Complexity Theory Conference 1991: 294-298 - 1990
- [c21]Lance Fortnow, John Rompel, Michael Sipser:
Errata for On the Power of Multi-Prover Interactive Protocols. Structure in Complexity Theory Conference 1990: 318-319 - [p1]Ravi B. Boppana, Michael Sipser:
The Complexity of Finite Functions. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 757-804
1980 – 1989
- 1989
- [c20]
- 1988
- [j9]Lance Fortnow, Michael Sipser:
Are There Interactive Protocols for CO-NP Languages? Inf. Process. Lett. 28(5): 249-251 (1988) - [j8]Michael Sipser:
Expanders, Randomness, or Time versus Space. J. Comput. Syst. Sci. 36(3): 379-383 (1988) - [c19]Lance Fortnow, John Rompel, Michael Sipser:
On the power of multi-power interactive protocols. Structure in Complexity Theory Conference 1988: 156-161 - [c18]Baruch Awerbuch, Michael Sipser:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version). FOCS 1988: 206-220 - 1987
- [j7]Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph bisection algorithms with good average case behavior. Combinatorica 7(2): 171-191 (1987) - [c17]Oded Goldreich, Yishay Mansour, Michael Sipser:
Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract). FOCS 1987: 449-461 - 1986
- [c16]Michael Sipser:
Expanders, Randomness, or Time versus Space. Structure in Complexity Theory Conference 1986: 325-329 - [c15]Shafi Goldwasser, Michael Sipser:
Private Coins versus Public Coins in Interactive Proof Systems. STOC 1986: 59-68 - 1985
- [c14]
- 1984
- [j6]Christos H. Papadimitriou, Michael Sipser:
Communication Complexity. J. Comput. Syst. Sci. 28(2): 260-269 (1984) - [j5]Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory 17(1): 13-27 (1984) - [c13]Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph Bisection Algorithms with Good Average Case Behavior. FOCS 1984: 181-192 - [c12]
- 1983
- [c11]
- [c10]
- 1982
- [c9]
- [c8]
- 1981
- [j4]Howard P. Katseff, Michael Sipser:
Several Results in Program Size Complexity. Theor. Comput. Sci. 15: 291-309 (1981) - [c7]Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. FOCS 1981: 260-270 - [c6]
- 1980
- [j3]
- [j2]Michael Sipser:
Lower Bounds on the Size of Sweeping Automata. J. Comput. Syst. Sci. 21(2): 195-202 (1980) - [j1]
1970 – 1979
- 1979
- [c5]
- 1978
- [c4]
- [c3]
- [c2]William J. Sakoda, Michael Sipser:
Nondeterminism and the Size of Two Way Finite Automata. STOC 1978: 275-286 - 1977
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2015-02-03 17:43 CET by the dblp team