Michael Sipser

Available identifiers

zbMath Open sipser.michaelDBLPs/MichaelSipserWikidataQ93104 ScholiaQ93104MaRDI QIDQ1069700

List of research outcomes

Publication	Date of Publication	Type
Nondeterminism and the size of two way finite automata	2014-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q3588115	2010-09-10	Paper
https://portal.mardi4nfdi.de/entity/Q3392275	2009-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q3392273	2009-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4527045	2001-01-31	Paper
Expander codes	2000-08-28	Paper
On the power of multi-prover interactive protocols	2000-06-15	Paper
Optimal Constructions of Hybrid Algorithms	1999-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4385519	1998-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q3128898	1997-11-18	Paper
Monotone separation of logarithmic space from logarithmic depth	1995-07-24	Paper
https://portal.mardi4nfdi.de/entity/Q4036700	1993-05-18	Paper
Compression and Ranking	1992-06-25	Paper
Are there interactive protocols for co-NP languages?	1988-01-01	Paper
Expanders, randomness, or time versus space	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3754606	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3745279	1986-01-01	Paper
Parity, circuits, and the polynomial-time hierarchy	1984-01-01	Paper
Communication complexity	1984-01-01	Paper
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3709896	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3662618	1982-01-01	Paper
Several results in program size complexity	1981-01-01	Paper
Halting space-bounded computations	1980-01-01	Paper
GO Is Polynomial-Space Hard	1980-01-01	Paper
Lower bounds on the size of sweeping automata	1980-01-01	Paper

Research outcomes over time

This page was built for person: Michael Sipser