The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Sipser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Merrick L. Furst, James B. Saxe, Michael Sipser
    Parity, Circuits, and the Polynomial-Time Hierarchy. [Citation Graph (3, 0)][DBLP]
    Mathematical Systems Theory, 1984, v:17, n:1, pp:13-27 [Journal]
  2. Merrick L. Furst, James B. Saxe, Michael Sipser
    Parity, Circuits, and the Polynomial-Time Hierarchy [Citation Graph (2, 0)][DBLP]
    FOCS, 1981, pp:260-270 [Conf]
  3. Lance Fortnow, John Rompel, Michael Sipser
    Errata for On the Power of Multi-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:318-319 [Conf]
  4. Michelangelo Grigni, Michael Sipser
    Monotone Separation of Logspace from NC. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:294-298 [Conf]
  5. Michael Sipser
    Expanders, Randomness, or Time versus Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:325-329 [Conf]
  6. David Gillman, Michael Sipser
    Inference and Minimization of Hidden Markov Chains. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:147-158 [Conf]
  7. Baruch Awerbuch, Michael Sipser
    Dynamic Networks Are as Fast as Static Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:206-220 [Conf]
  8. Thang Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser
    Graph Bisection Algorithms with Good Average Case Behavior [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:181-192 [Conf]
  9. Oded Goldreich, Yishay Mansour, Michael Sipser
    Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:449-461 [Conf]
  10. Richard M. Karp, Michael Sipser
    Maximum Matchings in Sparse Random Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:364-375 [Conf]
  11. Howard P. Katseff, Michael Sipser
    Several Results in Program Size Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:82-89 [Conf]
  12. David Lichtenstein, Michael Sipser
    GO Is PSPACE Hard [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:48-54 [Conf]
  13. Michael Sipser
    Halting Space-Bounded Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:73-74 [Conf]
  14. Michael Sipser, Daniel A. Spielman
    Expander Codes [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:566-576 [Conf]
  15. Michael Sipser
    On Relativization and the Existence of Complete Sets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:523-531 [Conf]
  16. Michael Sipser
    A Topological View of Some Problems in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:567-572 [Conf]
  17. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
    Optimal Constructions of Hybrid Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:372-381 [Conf]
  18. Lance Fortnow, Michael Sipser
    Probabilistic Computation and Linear Time [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:148-156 [Conf]
  19. Lance Fortnow, Michael Sipser
    Retraction of Probabilistic Computation and Linear Time. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:750- [Conf]
  20. Andrew V. Goldberg, Michael Sipser
    Compression and Ranking [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:440-448 [Conf]
  21. Shafi Goldwasser, Michael Sipser
    Private Coins versus Public Coins in Interactive Proof Systems [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:59-68 [Conf]
  22. Christos H. Papadimitriou, Michael Sipser
    Communication Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:196-200 [Conf]
  23. William J. Sakoda, Michael Sipser
    Nondeterminism and the Size of Two Way Finite Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:275-286 [Conf]
  24. Michael Sipser
    A Complexity Theoretic Approach to Randomness [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:330-335 [Conf]
  25. Michael Sipser
    The History and Status of the P versus NP Question [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:603-618 [Conf]
  26. Michael Sipser
    Lower Bounds on the Size of Sweeping Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:360-364 [Conf]
  27. Michael Sipser
    Borel Sets and Circuit Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:61-69 [Conf]
  28. Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser
    Graph bisection algorithms with good average case behavior. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:2, pp:171-191 [Journal]
  29. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
    Optimal Constructions of Hybrid Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  30. Lance Fortnow, Michael Sipser
    Are There Interactive Protocols for CO-NP Languages? [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:5, pp:249-251 [Journal]
  31. David Lichtenstein, Michael Sipser
    GO Is Polynomial-Space Hard. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:2, pp:393-401 [Journal]
  32. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
    Optimal Constructions of Hybrid Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:142-164 [Journal]
  33. Michelangelo Grigni, Michael Sipser
    Monotone Separation of Logarithmic Space from Logarithmic Depth. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:433-437 [Journal]
  34. Christos H. Papadimitriou, Michael Sipser
    Communication Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:2, pp:260-269 [Journal]
  35. Michael Sipser
    Lower Bounds on the Size of Sweeping Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:195-202 [Journal]
  36. Michael Sipser
    Expanders, Randomness, or Time versus Space. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:3, pp:379-383 [Journal]
  37. Andrew V. Goldberg, Michael Sipser
    Compression and Ranking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:524-536 [Journal]
  38. Lance Fortnow, John Rompel, Michael Sipser
    On the Power of Multi-Prover Interactive Protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:545-557 [Journal]
  39. Howard P. Katseff, Michael Sipser
    Several Results in Program Size Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:291-309 [Journal]
  40. Michael Sipser
    Halting Space-Bounded Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:335-338 [Journal]
  41. Michael Sipser, Daniel A. Spielman
    Expander codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1710-1722 [Journal]

Search in 0.046secs, Finished in 0.047secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002