Faith E. Fich

Publication Activity (10 Years)

Years Active: 1979-2005
Publications (10 Years): 0

Publications

Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich
Estimating the maximum. J. Algorithms 54 (1) (2005)
James Aspnes, Faith E. Fich, Eric Ruppert
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC (2004)
Faith E. Fich, Danny Hendler, Nir Shavit
On the inherent weakness of conditional synchronization primitives. PODC (2004)
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC (2003)
Faith E. Fich, Eric Ruppert
Hundreds of impossibility results for distributed computing. Distributed Comput. 16 (2-3) (2003)
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
Space-optimal multi-writer snapshot objects are slow. PODC (2002)
Paul Beame, Faith E. Fich
Optimal Bounds for the Predecessor Problem and Related Problems. J. Comput. Syst. Sci. 65 (1) (2002)
John Watkinson, Micah Adler, Faith E. Fich
New Protocols for Asymmetric Communication Channels. SIROCCO (2001)
Faith E. Fich, Colette Johnen
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. DISC (2001)
Faith E. Fich, Andreas Jakoby
Short Headers Suffice for Communication in a DAG with Link Failures. DISC (2000)
Faith E. Fich, Eric Ruppert
Lower Bounds in Distributed Computing. DISC (2000)
Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson
Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP (2000)
Micah Adler, Faith E. Fich
The Complexity of End-to-End Communication in Memoryless Networks. PODC (1999)
Paul Beame, Faith E. Fich
Optimal Bounds for the Predecessor Problem. STOC (1999)
Faith E. Fich
End to End Communication. OPODIS (1998)
Faith E. Fich, Maurice Herlihy, Nir Shavit
On the Space Complexity of Randomized Synchronization. J. ACM 45 (5) (1998)
Paul Beame, Faith E. Fich
On Searching Sorted Lists: A Near-Optimal Lower Bound Electron. Colloquium Comput. Complex. 5 (28) (1998)
Paul Beame, Faith E. Fich, Rakesh K. Sinha
Separating the Power of EREW and CREW PRAMs with Small Communication Width. Inf. Comput. 138 (1) (1997)
Faith E. Fich
Infrastructure issues related to theory of computing research. SIGACT News 28 (3) (1997)
Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
Strategic directions in research in theory of computing. SIGACT News 28 (3) (1997)
Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. J. Comput. Syst. Sci. 53 (1) (1996)
Faith E. Fich
Infrastructure Issues Related to Theory of Computing Research. ACM Comput. Surv. 28 (4es) (1996)
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53 (2) (1996)
Faith E. Fich, J. Ian Munro, Patricio V. Poblete
Permuting in Place. SIAM J. Comput. 24 (2) (1995)
Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Comput. Complex. 5 (2) (1995)
Faith E. Fich, Peter Bro Miltersen
Tables Should Be Sorted (On Random Access Machines). WADS (1995)
Joan Boyar, Faith E. Fich, Kim S. Larsen
Bounds on Certain Multiplications of Affine Combinations. Discret. Appl. Math. 52 (2) (1994)
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. Computational Complexity Conference (1993)
Faith E. Fich, Maurice Herlihy, Nir Shavit
On the Space Complexity of Randomized Synchronization. PODC (1993)
Paul Beame, Faith E. Fich, Rakesh K. Sinha
Separating the Power of EREW and CREW PRAMs with Small Communication Width. WADS (1993)
Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. STACS (1993)
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT (1992)
Faith E. Fich, J. Ian Munro, Patricio V. Poblete
Permuting FOCS (1990)
Faith E. Fich, Vijaya Ramachandran
Lower Bounds for Parallel Computation on Linked Structures. SPAA (1990)
Faith E. Fich, Avi Wigderson
Toward Understanding Exclusive Read. SIAM J. Comput. 19 (4) (1990)
Faith E. Fich
Preface. Discret. Appl. Math. 29 (1) (1990)
Faith E. Fich, Avi Wigderson
Towards Understanding Exclusive Read. SPAA (1989)
Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha
On the Power of Concurrent-Write PRAMs With Read-Only Memory Inf. Comput. 83 (2) (1989)
Faith E. Fich, Prabhakar Ragde, Avi Wigderson
Simulations Among Concurrent-Write PRAMs. Algorithmica 3 (1988)
Faith E. Fich, Prabhakar Ragde, Avi Wigderson
Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17 (3) (1988)
Faith E. Fich, Martin Tompa
The parallel complexity of exponentiating polynomials over finite fields. J. ACM 35 (3) (1988)
Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci. 58 (1988)
Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 16 (1) (1987)
Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
A Time-Space Tradeoff for Element Distinctness. STACS (1986)
Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
Bounds for Width Two Branching Programs. SIAM J. Comput. 15 (2) (1986)
Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP (1986)
Faith E. Fich, Martin Tompa
The Parallel Complexity of Exponentiating Polynomials over Finite Fields STOC (1985)
Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation STOC (1985)
Janusz A. Brzozowski, Faith E. Fich
On generalized locally testable languages. Discret. Math. 50 (1984)
Faith E. Fich, Prabhakar Ragde, Avi Wigderson
Relations Between Concurrent-Write Models of Parallel Computation. PODC (1984)
Faith E. Fich
Lower Bounds for the Cycle Detection Problem. J. Comput. Syst. Sci. 26 (3) (1983)
Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
Bounds for Width Two Branching Programs STOC (1983)
Faith E. Fich
New Bounds for Parallel Prefix Circuits STOC (1983)
Karel Culík II, Faith E. Fich, Arto Salomaa
A homomorphic characterization of regular languages. Discret. Appl. Math. 4 (2) (1982)
Faith E. Fich
Lower Bounds for the Cycle Detection Problem STOC (1981)
Janusz A. Brzozowski, Faith E. Fich
Languages of R-Trivial Monoids. J. Comput. Syst. Sci. 20 (1) (1980)
Faith E. Fich, Janusz A. Brzozowski
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. ICALP (1979)
Edward A. Ashcroft, Faith E. Fich
A Generalized Setting for Fixpoint Theory. Theor. Comput. Sci. 9 (1979)