default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Sipser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[i2]Zachary Remscrim, Michael Sipser:
AC0 Pseudorandomness of Natural Operations. Electron. Colloquium Comput. Complex. TR13 (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
- [j19]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 - [c26]Lance Fortnow, Michael Sipser:
Retraction of Probabilistic Computation and Linear Time. STOC 1997: 750 - 1996
- [j18]Michael Sipser:
Introduction to the Theory of Computation. SIGACT News 27(1): 27-29 (1996) - [j17]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) - [j16]Michael Sipser, Daniel A. Spielman
:
Expander codes. IEEE Trans. Inf. Theory 42(6): 1710-1722 (1996) - 1995
- [j15]Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logarithmic Space from Logarithmic Depth. J. Comput. Syst. Sci. 50(3): 433-437 (1995) - 1994
- [j14]Lance Fortnow, John Rompel, Michael Sipser:
On the Power of Multi-Prover Interactive Protocols. Theor. Comput. Sci. 134(2): 545-557 (1994) - [c25]David Gillman, Michael Sipser:
Inference and Minimization of Hidden Markov Chains. COLT 1994: 147-158 - [c24]Michael Sipser, Daniel A. Spielman:
Expander Codes. FOCS 1994: 566-576 - [c23]Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. SODA 1994: 372-381 - 1992
- [c22]Michael Sipser:
The History and Status of the P versus NP Question. STOC 1992: 603-618 - 1991
- [j13]Andrew V. Goldberg, Michael Sipser:
Compression and Ranking. SIAM J. Comput. 20(3): 524-536 (1991) - [c21]Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logspace from NC. SCT 1991: 294-298 - 1990
- [c20]Lance Fortnow, John Rompel, Michael Sipser:
Errata for On the Power of Multi-Prover Interactive Protocols. SCT 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
- [j12]Shafi Goldwasser, Michael Sipser:
Private Coins versus Public Coins in Interactive Proof Systems. Adv. Comput. Res. 5: 73-90 (1989) - [j11]Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos:
On Completeness and Soundness in Interactive Proof Systems. Adv. Comput. Res. 5: 429-442 (1989) - 1988
- [j10]Lance Fortnow, Michael Sipser:
Are There Interactive Protocols for CO-NP Languages? Inf. Process. Lett. 28(5): 249-251 (1988) - [j9]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. SCT 1988: 156-161 - [c18]Baruch Awerbuch, Michael Sipser:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version). FOCS 1988: 206-220 - 1987
- [j8]Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph bisection algorithms with good average case behavior. Comb. 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. SCT 1986: 325-329 - [c15]Shafi Goldwasser, Michael Sipser:
Private Coins versus Public Coins in Interactive Proof Systems. STOC 1986: 59-68 - 1985
- [c14]Andrew V. Goldberg, Michael Sipser:
Compression and Ranking. STOC 1985: 440-448 - 1984
- [j7]Barbara Simons, Michael Sipser:
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals. Oper. Res. 32(1): 80-88 (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. Math. Syst. 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]Michael Sipser:
A Topological View of Some Problems in Complexity Theory. MFCS 1984: 567-572 - 1983
- [c11]Michael Sipser:
Borel Sets and Circuit Complexity. STOC 1983: 61-69 - [c10]Michael Sipser:
A Complexity Theoretic Approach to Randomness. STOC 1983: 330-335 - 1982
- [c9]Michael Sipser:
On Relativization and the Existence of Complete Sets. ICALP 1982: 523-531 - [c8]Christos H. Papadimitriou, Michael Sipser:
Communication Complexity. STOC 1982: 196-200 - 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]Richard M. Karp, Michael Sipser:
Maximum Matchings in Sparse Random Graphs. FOCS 1981: 364-375 - 1980
- [j3]David Lichtenstein, Michael Sipser:
GO Is Polynomial-Space Hard. J. ACM 27(2): 393-401 (1980) - [j2]Michael Sipser:
Lower Bounds on the Size of Sweeping Automata. J. Comput. Syst. Sci. 21(2): 195-202 (1980) - [j1]Michael Sipser:
Halting Space-Bounded Computations. Theor. Comput. Sci. 10: 335-338 (1980)
1970 – 1979
- 1979
- [c5]Michael Sipser:
Lower Bounds on the Size of Sweeping Automata. STOC 1979: 360-364 - 1978
- [c4]David Lichtenstein, Michael Sipser:
GO Is PSPACE Hard. FOCS 1978: 48-54 - [c3]Michael Sipser:
Halting Space-Bounded Computations. FOCS 1978: 73-74 - [c2]William J. Sakoda, Michael Sipser:
Nondeterminism and the Size of Two Way Finite Automata. STOC 1978: 275-286 - 1977
- [c1]Howard P. Katseff, Michael Sipser:
Several Results in Program Size Complexity. FOCS 1977: 82-89
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
