Michael Sipser - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 50 from 50

2013

$AC^0$ Pseudorandomness of Natural OperationsZachary Remscrim, Michael Sipser. eccc, 20:88, 2013. [doi]

2012

Introduction to the Theory of ComputationMichael Sipser. Cengage Learning, 2012.

1998

Optimal Constructions of Hybrid AlgorithmsMing-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin. jal, 29(1):142-164, 1998.

1997

Retraction of Probabilistic Computation and Linear TimeLance Fortnow, Michael Sipser. stoc 1997: 750 [doi]

Introduction to the theory of computationMichael Sipser. PWS Publishing Company, 1997.

1996

The future of computational complexity theory: part IChristos H. Papadimitriou, Oded Goldreich, Avi Wigderson, Alexander A. Razborov, Michael Sipser. sigact, 27(3):6-12, 1996. [doi]

Introduction to the Theory of ComputationMichael Sipser. sigact, 27(1):27-29, 1996. [doi]

Expander codesMichael Sipser, Daniel A. Spielman. TIT, 42(6):1710-1722, 1996.

1995

Monotone Separation of Logarithmic Space from Logarithmic DepthMichelangelo Grigni, Michael Sipser. jcss, 50(3):433-437, 1995.

1994

1992

The History and Status of the P versus NP QuestionMichael Sipser. stoc 1992: 603-618

1991

Compression and RankingAndrew V. Goldberg, Michael Sipser. SICOMP, 20(3):524-536, 1991.

Monotone Separation of Logspace from NCMichelangelo Grigni, Michael Sipser. cocoon 1991: 294-298

1990

The Complexity of Finite FunctionsRavi B. Boppana, Michael Sipser. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). pages 757-804, 1990.

Errata for On the Power of Multi-Prover Interactive ProtocolsLance Fortnow, John Rompel, Michael Sipser. cocoon 1990: 318-319

1989

Probabilistic Computation and Linear TimeLance Fortnow, Michael Sipser. stoc 1989: 148-156

On Completeness and Soundness in Interactive Proof SystemsMartin Fürer, Oded Goldreich, Yishay Mansour, Michael Sipser, Stathis Zachos. acr, 5:429-442, 1989.

Private Coins versus Public Coins in Interactive Proof SystemsShafi Goldwasser, Michael Sipser. acr, 5:73-90, 1989.

1988

Dynamic Networks Are as Fast as Static Networks (Preliminary Version)Baruch Awerbuch, Michael Sipser. focs 1988: 206-220

Are There Interactive Protocols for CO-NP Languages?Lance Fortnow, Michael Sipser. ipl, 28(5):249-251, 1988.

On the power of multi-power interactive protocolsLance Fortnow, John Rompel, Michael Sipser. coco 1988: 156-161 [doi]

Expanders, Randomness, or Time versus SpaceMichael Sipser. jcss, 36(3):379-383, 1988.

1987

Graph bisection algorithms with good average case behaviorThang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser. combinatorica, 7(2):171-191, 1987.

Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract)Oded Goldreich, Yishay Mansour, Michael Sipser. focs 1987: 449-461

1986

Private Coins versus Public Coins in Interactive Proof SystemsShafi Goldwasser, Michael Sipser. stoc 1986: 59-68

Expanders, Randomness, or Time versus SpaceMichael Sipser. cocoon 1986: 325-329

1985

Compression and RankingAndrew V. Goldberg, Michael Sipser. stoc 1985: 440-448

1984

1983

Borel Sets and Circuit ComplexityMichael Sipser. stoc 1983: 61-69

A Complexity Theoretic Approach to RandomnessMichael Sipser. stoc 1983: 330-335

1982

Communication ComplexityChristos H. Papadimitriou, Michael Sipser. stoc 1982: 196-200

On Relativization and the Existence of Complete SetsMichael Sipser. icalp 1982: 523-531

1981

Parity, Circuits, and the Polynomial-Time HierarchyMerrick L. Furst, James B. Saxe, Michael Sipser. focs 1981: 260-270

Maximum Matchings in Sparse Random GraphsRichard M. Karp, Michael Sipser. focs 1981: 364-375

Several Results in Program Size ComplexityHoward P. Katseff, Michael Sipser. TCS, 15:291-309, 1981.

1980

GO Is Polynomial-Space HardDavid Lichtenstein, Michael Sipser. JACM, 27(2):393-401, 1980. [doi]

Lower Bounds on the Size of Sweeping AutomataMichael Sipser. jcss, 21(2):195-202, 1980.

Halting Space-Bounded ComputationsMichael Sipser. TCS, 10:335-338, 1980.

1979

Lower Bounds on the Size of Sweeping AutomataMichael Sipser. stoc 1979: 360-364

1978

GO Is PSPACE HardDavid Lichtenstein, Michael Sipser. focs 1978: 48-54

Nondeterminism and the Size of Two Way Finite AutomataWilliam J. Sakoda, Michael Sipser. stoc 1978: 275-286

Halting Space-Bounded ComputationsMichael Sipser. focs 1978: 73-74

1977

Several Results in Program Size ComplexityHoward P. Katseff, Michael Sipser. focs 1977: 82-89

Sign in or sign up to see more results.

runs on WebDSL