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
[2]
Hilfe
Suche: Author="Fich, F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Permuting
F.E. Fich
,
J.I. Munro
,
P.V. Poblete
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 372-379
Lower bounds for parallel computation on linked structures
F. Fich
,
V. Ramachandran
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 109-116
On the power of concurrent-write PRAMs with read-only memory
F.E. Fich
,
M. Li
,
P. Ragde
,
Y. Yesha
Information and Computation
83
(2), 1989, November, pp. 234-244
Towards understanding exclusive read
F.E. Fich
,
A. Wigderson
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 76-82
A time-space tradeoff for element distinctness
A. Borodin
,
F. Fich
,
F. Meyer auf der Heide
,
E. Upfal
,
A. Wigderson
SIAM Journal on Computing
16
(1), 1987, February, pp. 97-99
Bounds for width two branching programs
A. Borodin
,
D. Dolev
,
F.E. Fich
,
W. Paul
SIAM Journal on Computing
15
(2), 1986, May, pp. 549-560
A time-space tradeoff for element distinctness
A. Borodin
,
F. Fich
,
F. Meyer auf der Heide
,
E. Upfal
,
A. Wigderson
Lecture Notes in Computer Science
210
, 1986, pp. 353-358
A time-space tradeoff for element distinctness
A. Borodin
,
F. Fich
,
F. Meyer auf der Heide
,
E. Upfal
,
A. Wigderson
Technical Report (RJ 4915), 1985
One, two, three \ldots\ infinity: Lower bounds for parallel computation
F.E. Fich
,
F. Meyer auf der Heide
,
P. Ragde
,
A. Wigderson
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 48-58
The parallel complexity of exponentiating polynomials over finite fields
F.E. Fich
,
M. Tompa
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 38-47
Bounds for width two branching programs
A. Borodin
,
D. Dolev
,
F.E. Fich
,
W. Paul
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 87-93
New bounds for parallel prefix circuits
F.E. Fich
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 100-109
Lower bounds for the cycle detection problem
F.E. Fich
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 392-409
Lower bounds for the cycle detection problem
F.E. Fich
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 96-105
Languages of r-trivial monoids
J.A. Brzozowski
,
F.E. Fich
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 32-49
A generalized setting for fixpoint theory
E.A. Ashcroft
,
F.E. Fich
Theoretical Computer Science
9
(2), 1979, pp. 243-256
A characterization of a dot-depth two analogue of generalized definite languages
F.E. Fich
,
J.A. Brzozowski
Lecture Notes in Computer Science
71
, 1979, pp. 230-244