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="Furst, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The expressive power of voting polynomials
J. Aspnes
,
R. Beigel
,
M. Furst
,
S. Rudich
Combinatorica
14
(2), 1994, pp. 135-148
PSPACE survives three-bit bottlenecks
J.-Y. Cai
,
M.L. Furst
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 94-102
Computing short generator sequences
J.R. Driscoll
,
M.L. Furst
Information and Computation
72
(2), 1987, pp. 117-132
Pseudorandom number generation and space complexity
M. Furst
,
R. Lipton
,
L. Stockmeyer
Information and Control
64
(1-3), 1985, pp. 43-51
Multi-party protocols
A.K. Chandra
,
M.L. Furst
,
R.J. Lipton
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 94-99
On the diameter of permutation groups
J.R. Driscoll
,
M.L. Furst
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 152-160
Parity, circuits, and the polynomial-time hierarchy
M. Furst
,
J.B. Saxe
,
M. Sipser
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 260-270
Polynomial-time algorithms for permutation groups
M. Furst
,
J. Hopcroft
,
E. Luks
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 36-41