F
Faith E. Fich
Researcher at University of Toronto
Publications - 66
Citations - 1984
Faith E. Fich is an academic researcher from University of Toronto. The author has contributed to research in topics: Shared memory & Upper and lower bounds. The author has an hindex of 24, co-authored 66 publications receiving 1949 citations. Previous affiliations of Faith E. Fich include University of Waterloo & University of California, Berkeley.
Papers
More filters
Journal ArticleDOI
Optimal bounds for the predecessor problem and related problems
Paul Beame,Faith E. Fich +1 more
TL;DR: The lower bounds are proved for a large class of problems, including both static and dynamic predecessor problems, in a much stronger communication game model, but they apply to the cell probe and RAM models.
Journal ArticleDOI
Hundreds of impossibility results for distributed computing
Faith E. Fich,Eric Ruppert +1 more
TL;DR: Survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models are surveyed.
Journal ArticleDOI
Relations between concurrent-write models of parallel computation
TL;DR: This work extensively study the relationship between four shared memory models of parallel computation that allow simultaneous read/write access, and proves nontrivial separations and simulation results among them.
Proceedings ArticleDOI
Relations between concurrent-write models of parallel computation
TL;DR: By fixing the number of processors and parametrizing theNumber of shared memory cells, tight separation results between the models are obtained, thereby partially answering open questions of Vishkin [V].
Proceedings ArticleDOI
Optimal bounds for the predecessor problem
Paul Beame,Faith E. Fich +1 more
TL;DR: The upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed efficiently stored set are obtained and apply to the cell probe and RAM models and to both static and dynamic predecessor problems.