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="Fich, Faith E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal bounds for the predecessor problem and related problems
Paul Beame
,
Faith E. Fich
Journal of Computer and System Sciences
65
(1), 2002, pp. 38-72
Optimal bounds for the predecessor problem
Paul Beame
,
Faith E. Fich
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 295-304
Separating the power of EREW and CREW PRAMs with small communication width
Paul Beame
,
Faith E. Fich
,
Rakesh K. Sinha
Information and Computation
138
(1), 1997, pp. 89-99
Pointers versus arithmetic in PRAMs
Patrick W. Dymond
,
Faith E. Fich
,
Naomi Nishimura
,
Prabhakar Ragde
,
Walter L. Ruzzo
Journal of Computer and System Sciences
53
(2), 1996, pp. 218-232
Limits on the power of parallel random access machines with weak forms of write conflict resolution
Faith E. Fich
,
Russell Impagliazzo
,
Bruce Kapron
,
Valerie King
,
Mirosƚaw Kutyƚowski
Journal of Computer and System Sciences
53
(1), 1996, pp. 104-111
Permuting in place
Faith E. Fich
,
J. Ian Munro
,
Patricio V. Poblete
SIAM Journal on Computing
24
(2), 1995, pp. 266-278
Separating the power of EREW and CREW PRAMs with small communication width
Paul Beame
,
Faith E. Fich
,
Rakesh K. Sinha
Proceedings of the 3rd Workshop on Algorithms and Data Structures. WADS '93 (Montréal, Canada, August 1993)
LNCS 709
, 1993, pp. 163-174
Pointers versus arithmetic in PRAMs
Patrick W. Dymond
,
Faith E. Fich
,
Naomi Nishimura
,
Prabhakar Ragde
,
Walter L. Ruzzo
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 239-252
Limits on the power of parallel random access machines with weak forms of write conflict resolution
Faith E. Fich
,
Russell Impagliazzo
,
Bruce Kapron
,
Valerie King
,
Mirosƚaw Kutyƚowski
Lecture Notes in Computer Science
665
, 1993, pp. 386-397
The complexity of computation on the parallel random access machine
Faith E. Fich
Synthesis of Parallel Algorithms, 1993, pp. 843-899
Toward understanding exclusive read
Faith E. Fich
,
Avi Wigderson
SIAM Journal on Computing
19
, 1990, pp. 718-727
A tradeoff between search and update time for the implicit dictionary problem
Allan Borodin
,
Faith E. Fich
,
Friedhelm Meyer auf der Heide
,
Eli Upfal
,
Avi Wigderson
Theoretical Computer Science
58
, 1988, pp. 57-68
Simulations among concurrent-write PRAMs
Faith E. Fich
,
Prabhakar Ragde
,
Avi Wigderson
Algorithmica
3
(1), 1988, pp. 43-51
Relations between concurrent-write models of parallel computation
Faith E. Fich
,
Prabhakar Ragde
,
Avi Wigderson
SIAM Journal on Computing
17
, 1988, pp. 606-627
The parallel complexity of exponentiating polynomials over finite fields
Faith E. Fich
,
Martin Tompa
Journal of the ACM
35
(3), 1988, pp. 651-667
Lower bounds for parallel random-access machines with unbounded shared memory
Faith E. Fich
,
Friedhelm Meyer auf der Heide
,
Avi Wigderson
Advances in Computing Research; Parallel and Distributed Computing
4
, 1987, pp. 1-15
A homomorphic characterization of regular languages
Karel Culik II
,
Faith E. Fich
,
Arto Salomaa
Discrete Applied Mathematics
4
, 1982, pp. 149-152