Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Sipser, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal constructions of hybrid algorithms
Ming-Yang Kao
,
Yuan Ma
,
Michael Sipser
,
Yiqun Yin
Journal of Algorithms
29
(1), 1998, pp. 142-164
Monotone separation of logarithmic space from logarithmic depth
Michelangelo Grigni
,
Michael Sipser
Journal of Computer and System Sciences
50
(3), 1995, pp. 433-437
On the power of multi-prover interactive protocols
Lance Fortnow
,
John Rompel
,
Michael Sipser
Theoretical Computer Science
134
(2), 1994, pp. 545-557
Optimal constructions of hybrid algorithms
Ming-Yang Kao
,
Yuan Ma
,
Michael Sipser
,
Yiqun Yin
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 372-381
Expander codes
Michael Sipser
,
Daniel A. Spielman
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 566-576
Monotone complexity
Michelangelo Grigni
,
Michael Sipser
Boolean function complexity
London Mathematical Society Lecture Note Series 169
, 1992, pp. 57-75
The history and status of the P versus NP question
Michael Sipser
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 603-618
Compression and ranking
Andrew V. Goldberg
,
Michael Sipser
SIAM Journal on Computing
20
(3), 1991, June, pp. 524-536
Monotone separation of Logspace from
NC^1
Michelangelo Grigni
,
Michael Sipser
Proceedings of the 6th Annual Conference on Structure in Complexity Theory, CSCT'91 (Chicago, Illinois, June 30-July 3, 1991)
, 1991, pp. 294-298
The complexity of finite functions
Ravi B. Boppana
,
Michael Sipser
Technical Report (MIT/LCS/TM-405), 1989, August
Probabilistic computation and linear time
Lance Fortnow
,
Michael Sipser
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 148-156
Expanders, randomness, or time versus space
Michael Sipser
Journal of Computer and System Sciences
36
, 1988, pp. 379-383
Parity, circuits, and the polynomial-time hierarchy
Merrick Furst
,
James B. Saxe
,
Michael Sipser
Math. Systems Theory
17
, 1984, pp. 13-27
A topological view of some problems in complexity theory
Michael Sipser
Lecture Notes in Computer Science
176
, 1984, pp. 567-572