| 2004 | PODC | On the inherent weakness of conditional synchronization primitives. | Faith E. Fich, Danny Hendler, Nir Shavit |
| 2003 | STOC | A tight time lower bound for space-optimal implementations of multi-writer snapshots. | Panagiota Fatourou, Faith E. Fich, Eric Ruppert |
| 2002 | PODC | Space-optimal multi-writer snapshot objects are slow. | Panagiota Fatourou, Faith E. Fich, Eric Ruppert |
| 2001 | SIROCCO | New Protocols for Asymmetric Communication Channels. | John Watkinson, Micah Adler, Faith E. Fich |
| 2000 | ICALP | Tight Size Bounds for Packet Headers in Narrow Meshes. | Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson |
| 1999 | PODC | The Complexity of End-to-End Communication in Memoryless Networks. | Micah Adler, Faith E. Fich |
| 1999 | STOC | Optimal Bounds for the Predecessor Problem. | Paul Beame, Faith E. Fich |
| 1998 | OPODIS | End to End Communication. | Faith E. Fich |
| 1995 | WADS | Tables Should Be Sorted (On Random Access Machines). | Faith E. Fich, Peter Bro Miltersen |
| 1993 | PODC | On the Space Complexity of Randomized Synchronization. | Faith E. Fich, Maurice Herlihy, Nir Shavit |
| 1993 | STACS | Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. | Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski |
| 1993 | WADS | Separating the Power of EREW and CREW PRAMs with Small Communication Width. | Paul Beame, Faith E. Fich, Rakesh K. Sinha |
| 1990 | FOCS | Permuting | Faith E. Fich, J. Ian Munro, Patricio V. Poblete |
| 1990 | SPAA | Lower Bounds for Parallel Computation on Linked Structures. | Faith E. Fich, Vijaya Ramachandran |
| 1989 | SPAA | Towards Understanding Exclusive Read. | Faith E. Fich, Avi Wigderson |
| 1986 | ICALP | 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 |
| 1986 | STACS | A Time-Space Tradeoff for Element Distinctness. | Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson |
| 1985 | STOC | One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation | Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson |
| 1985 | STOC | The Parallel Complexity of Exponentiating Polynomials over Finite Fields | Faith E. Fich, Martin Tompa |
| 1984 | PODC | Relations Between Concurrent-Write Models of Parallel Computation. | Faith E. Fich, Prabhakar Ragde, Avi Wigderson |
| 1983 | STOC | Bounds for Width Two Branching Programs | Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul |
| 1983 | STOC | New Bounds for Parallel Prefix Circuits | Faith E. Fich |
| 1981 | STOC | Lower Bounds for the Cycle Detection Problem | Faith E. Fich |
| 1979 | ICALP | A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. | Faith E. Fich, Janusz A. Brzozowski |