ask others

Michael Sipser

> Home > Persons

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

showing all ?? records

2010 – today

see FAQ

What is the meaning of the colors in the publication lists?

2013
[i2]
- view
  - electronic edition @ hpi-web.de
- export record
  dblp key:
  - journals/eccc/RemscrimS13
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/eccc/RemscrimS13
Zachary Remscrim, Michael Sipser:
AC⁰ Pseudorandomness of Natural Operations. Electronic Colloquium on Computational Complexity (ECCC) 20: 88 (2013)

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2008
[e1]
- view
  - table of contents in dblp
- export record
  dblp key:
  - conf/tmfcs/2008
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/tmfcs/2008
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]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/cs-DM-0101028
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/cs-DM-0101028
Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. CoRR cs.DM/0101028 (2001)

1990 – 1999

see FAQ

What is the meaning of the colors in the publication lists?

1998
[j19]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jal/KaoMSY98
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jal/KaoMSY98
Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. J. Algorithms 29(1): 142-164 (1998)
1997
[b1]
- no documents available
- export record
  dblp key:
  - books/daglib/0086373
- ask others
- share record
  short URL:
  - https://dblp.org/rec/books/daglib/0086373
Michael Sipser:
Introduction to the theory of computation. PWS Publishing Company 1997, ISBN 978-0-534-94728-6, pp. I-XV, 1-396
[c27]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/FortnowS97
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/FortnowS97
Lance Fortnow, Michael Sipser:
Retraction of Probabilistic Computation and Linear Time. STOC 1997: 750
1996
[j18]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - journals/sigact/Sipser96
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/sigact/Sipser96
Michael Sipser:
Introduction to the Theory of Computation. SIGACT News 27(1): 27-29 (1996)
[j17]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - journals/sigact/PapadimitriouGWRS96
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/sigact/PapadimitriouGWRS96
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tit/SipserS96
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tit/SipserS96
Michael Sipser, Daniel A. Spielman:
Expander codes. IEEE Trans. Information Theory 42(6): 1710-1722 (1996)
1995
[j15]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jcss/GrigniS95
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jcss/GrigniS95
Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logarithmic Space from Logarithmic Depth. J. Comput. Syst. Sci. 50(3): 433-437 (1995)
1994
[j14]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/FortnowRS94
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/FortnowRS94
Lance Fortnow, John Rompel, Michael Sipser:
On the Power of Multi-Prover Interactive Protocols. Theor. Comput. Sci. 134(2): 545-557 (1994)
[c26]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/colt/GillmanS94
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/colt/GillmanS94
David Gillman, Michael Sipser:
Inference and Minimization of Hidden Markov Chains. COLT 1994: 147-158
[c25]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/SipserS94
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/SipserS94
Michael Sipser, Daniel A. Spielman:
Expander Codes. FOCS 1994: 566-576
[c24]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/KaoMSY94
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/soda/KaoMSY94
Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. SODA 1994: 372-381
1992
[c23]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/Sipser92
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/Sipser92
Michael Sipser:
The History and Status of the P versus NP Question. STOC 1992: 603-618
1991
[j13]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/siamcomp/GoldbergS91
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/siamcomp/GoldbergS91
Andrew V. Goldberg, Michael Sipser:
Compression and Ranking. SIAM J. Comput. 20(3): 524-536 (1991)
[c22]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/coco/GrigniS91
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/coco/GrigniS91
Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logspace from NC. Structure in Complexity Theory Conference 1991: 294-298
1990
[c21]
- no documents available
- export record
  dblp key:
  - conf/coco/FortnowRS90
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/coco/FortnowRS90
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]
- no documents available
- export record
  dblp key:
  - books/el/leeuwen90/BoppanaS90
- ask others
- share record
  short URL:
  - https://dblp.org/rec/books/el/leeuwen90/BoppanaS90
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

see FAQ

What is the meaning of the colors in the publication lists?

1989
[j12]
- no documents available
- export record
  dblp key:
  - journals/acr/GoldwasserS89
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/acr/GoldwasserS89
Shafi Goldwasser, Michael Sipser:
Private Coins versus Public Coins in Interactive Proof Systems. Advances in Computing Research 5: 73-90 (1989)
[j11]
- no documents available
- export record
  dblp key:
  - journals/acr/FurerGMSZ89
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/acr/FurerGMSZ89
Martin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos:
On Completeness and Soundness in Interactive Proof Systems. Advances in Computing Research 5: 429-442 (1989)
[c20]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/FortnowS89
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/FortnowS89
Lance Fortnow, Michael Sipser:
Probabilistic Computation and Linear Time. STOC 1989: 148-156
1988
[j10]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/ipl/FortnowS88
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/ipl/FortnowS88
Lance Fortnow, Michael Sipser:
Are There Interactive Protocols for CO-NP Languages? Inf. Process. Lett. 28(5): 249-251 (1988)
[j9]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jcss/Sipser88
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jcss/Sipser88
Michael Sipser:
Expanders, Randomness, or Time versus Space. J. Comput. Syst. Sci. 36(3): 379-383 (1988)
[c19]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/coco/FortnowRS88
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/coco/FortnowRS88
Lance Fortnow, John Rompel, Michael Sipser:
On the power of multi-power interactive protocols. Structure in Complexity Theory Conference 1988: 156-161
[c18]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/AwerbuchS88
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/AwerbuchS88
Baruch Awerbuch, Michael Sipser:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version). FOCS 1988: 206-220
1987
[j8]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/combinatorica/BuiCLS87
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/combinatorica/BuiCLS87
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]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/GoldreichMS87
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/GoldreichMS87
Oded Goldreich, Yishay Mansour, Michael Sipser:
Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract). FOCS 1987: 449-461
1986
[c16]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/coco/Sipser86
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/coco/Sipser86
Michael Sipser:
Expanders, Randomness, or Time versus Space. Structure in Complexity Theory Conference 1986: 325-329
[c15]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/GoldwasserS86
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/GoldwasserS86
Shafi Goldwasser, Michael Sipser:
Private Coins versus Public Coins in Interactive Proof Systems. STOC 1986: 59-68
1985
[c14]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/GoldbergS85
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/GoldbergS85
Andrew V. Goldberg, Michael Sipser:
Compression and Ranking. STOC 1985: 440-448
1984
[j7]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/ior/SimonsS84
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/ior/SimonsS84
Barbara Simons, Michael Sipser:
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals. Operations Research 32(1): 80-88 (1984)
[j6]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jcss/PapadimitriouS84
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jcss/PapadimitriouS84
Christos H. Papadimitriou, Michael Sipser:
Communication Complexity. J. Comput. Syst. Sci. 28(2): 260-269 (1984)
[j5]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/mst/FurstSS84
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/mst/FurstSS84
Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory 17(1): 13-27 (1984)
[c13]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/BuiCLS84
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/BuiCLS84
Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph Bisection Algorithms with Good Average Case Behavior. FOCS 1984: 181-192
[c12]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/mfcs/Sipser84
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/mfcs/Sipser84
Michael Sipser:
A Topological View of Some Problems in Complexity Theory. MFCS 1984: 567-572
1983
[c11]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/Sipser83
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/Sipser83
Michael Sipser:
Borel Sets and Circuit Complexity. STOC 1983: 61-69
[c10]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/Sipser83a
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/Sipser83a
Michael Sipser:
A Complexity Theoretic Approach to Randomness. STOC 1983: 330-335
1982
[c9]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/Sipser82
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/Sipser82
Michael Sipser:
On Relativization and the Existence of Complete Sets. ICALP 1982: 523-531
[c8]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/PapadimitriouS82
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/PapadimitriouS82
Christos H. Papadimitriou, Michael Sipser:
Communication Complexity. STOC 1982: 196-200
1981
[j4]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/KatseffS81
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/KatseffS81
Howard P. Katseff, Michael Sipser:
Several Results in Program Size Complexity. Theor. Comput. Sci. 15: 291-309 (1981)
[c7]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/FurstSS81
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/FurstSS81
Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. FOCS 1981: 260-270
[c6]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/KarpS81
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/KarpS81
Richard M. Karp, Michael Sipser:
Maximum Matchings in Sparse Random Graphs. FOCS 1981: 364-375
1980
[j3]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - journals/jacm/LichtensteinS80
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jacm/LichtensteinS80
David Lichtenstein, Michael Sipser:
GO Is Polynomial-Space Hard. J. ACM 27(2): 393-401 (1980)
[j2]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jcss/Sipser80
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jcss/Sipser80
Michael Sipser:
Lower Bounds on the Size of Sweeping Automata. J. Comput. Syst. Sci. 21(2): 195-202 (1980)
[j1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/Sipser80
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/Sipser80
Michael Sipser:
Halting Space-Bounded Computations. Theor. Comput. Sci. 10: 335-338 (1980)

1970 – 1979

see FAQ

What is the meaning of the colors in the publication lists?

1979
[c5]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/Sipser79
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/Sipser79
Michael Sipser:
Lower Bounds on the Size of Sweeping Automata. STOC 1979: 360-364
1978
[c4]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/LichtensteinS78
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/LichtensteinS78
David Lichtenstein, Michael Sipser:
GO Is PSPACE Hard. FOCS 1978: 48-54
[c3]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/Sipser78
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/Sipser78
Michael Sipser:
Halting Space-Bounded Computations. FOCS 1978: 73-74
[c2]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/stoc/SakodaS78
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/SakodaS78
William J. Sakoda, Michael Sipser:
Nondeterminism and the Size of Two Way Finite Automata. STOC 1978: 275-286
1977
[c1]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/KatseffS77
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/KatseffS77
Howard P. Katseff, Michael Sipser:
Several Results in Program Size Complexity. FOCS 1977: 82-89

Coauthor Index

see FAQ

maintained by

at