A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. - Faith E. Fich; Janusz A. Brzozowski (ICALP, 1979)

A Generalized Setting for Fixpoint Theory. - Edward A. Ashcroft; Faith E. Fich (Theor. Comput. Sci., 1979)

Languages of R-Trivial Monoids. - Janusz A. Brzozowski; Faith E. Fich (J. Comput. Syst. Sci., 1980)

A homomorphic characterization of regular languages. - Karel Culík II; Faith E. Fich; Arto Salomaa (Discret. Appl. Math., 1982)

New Bounds for Parallel Prefix Circuits - Faith E. Fich (STOC, 1983)

Lower Bounds for the Cycle Detection Problem. - Faith E. Fich (J. Comput. Syst. Sci., 1983)

On generalized locally testable languages. - Janusz A. Brzozowski; Faith E. Fich (Discret. Math., 1984)

One, Two, Three dots Infinity: Lower Bounds for Parallel Computation - Faith E. Fich; Friedhelm Meyer auf der Heide; Prabhakar Ragde; Avi Wigderson (STOC, 1985)

Bounds for Width Two Branching Programs. - Allan Borodin; Danny Dolev; Faith E. Fich; Wolfgang J. Paul (SIAM J. Comput., 1986)

A Time-Space Tradeoff for Element Distinctness. - Allan Borodin; Faith E. Fich; Friedhelm Meyer auf der Heide; Eli Upfal; Avi Wigderson (SIAM J. Comput., 1987)

Simulations Among Concurrent-Write PRAMs. - Faith E. Fich; Prabhakar Ragde; Avi Wigderson (Algorithmica, 1988)

The parallel complexity of exponentiating polynomials over finite fields. - Faith E. Fich; Martin Tompa (J. ACM, 1988)

Relations Between Concurrent-Write Models of Parallel Computation. - Faith E. Fich; Prabhakar Ragde; Avi Wigderson (SIAM J. Comput., 1988)

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 (Theor. Comput. Sci., 1988)

Towards Understanding Exclusive Read. - Faith E. Fich; Avi Wigderson (SPAA, 1989)

On the Power of Concurrent-Write PRAMs With Read-Only Memory - Faith E. Fich; Ming Li 001; Prabhakar Ragde; Yaacov Yesha (Inf. Comput., 1989)

Permuting - Faith E. Fich; J. Ian Munro; Patricio V. Poblete (FOCS, 1990)

Lower Bounds for Parallel Computation on Linked Structures. - Faith E. Fich; Vijaya Ramachandran (SPAA, 1990)

Preface. - Faith E. Fich (Discret. Appl. Math., 1990)

Toward Understanding Exclusive Read. - Faith E. Fich; Avi Wigderson (SIAM J. Comput., 1990)

Bounds on Certain Multiplications of Affine Combinations. - Joan Boyar; Faith E. Fich; Kim S. Larsen (Discret. Appl. Math., 1994)

Tables Should Be Sorted (On Random Access Machines). - Faith E. Fich; Peter Bro Miltersen (WADS, 1995)

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. - Faith E. Fich; Miroslaw Kowaluk; Miroslaw Kutylowski; Krzysztof Lorys; Prabhakar Ragde (Comput. Complex., 1995)

Permuting in Place. - Faith E. Fich; J. Ian Munro; Patricio V. Poblete (SIAM J. Comput., 1995)

Pointers versus Arithmetic in PRAMs. - Patrick W. Dymond; Faith E. Fich; Naomi Nishimura; Prabhakar Ragde; Walter L. Ruzzo (J. Comput. Syst. Sci., 1996)

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 (J. Comput. Syst. Sci., 1996)

Separating the Power of EREW and CREW PRAMs with Small Communication Width. - Paul Beame; Faith E. Fich; Rakesh K. Sinha (Inf. Comput., 1997)

Strategic directions in research in theory of computing. - Anne Condon; Faith E. Fich; Greg N. Frederickson; Andrew V. Goldberg; David S. Johnson 001; Michael C. Loui; Steven Mahaney; Prabhakar Raghavan; John E. Savage; Alan L. Selman; David B. Shmoys (SIGACT News, 1997)

Infrastructure issues related to theory of computing research. - Faith E. Fich (SIGACT News, 1997)

End to End Communication. - Faith E. Fich (OPODIS, 1998)

On Searching Sorted Lists: A Near-Optimal Lower Bound - Paul Beame; Faith E. Fich (Electron. Colloquium Comput. Complex., 1998)

On the Space Complexity of Randomized Synchronization. - Faith E. Fich; Maurice Herlihy; Nir Shavit (J. ACM, 1998)

The Complexity of End-to-End Communication in Memoryless Networks. - Micah Adler; Faith E. Fich (PODC, 1999)

Optimal Bounds for the Predecessor Problem. - Paul Beame; Faith E. Fich (STOC, 1999)

Tight Size Bounds for Packet Headers in Narrow Meshes. - Micah Adler; Faith E. Fich; Leslie Ann Goldberg; Mike Paterson (ICALP, 2000)

Short Headers Suffice for Communication in a DAG with Link Failures. - Faith E. Fich; Andreas Jakoby (DISC, 2000)

Lower Bounds in Distributed Computing. - Faith E. Fich; Eric Ruppert (DISC, 2000)

New Protocols for Asymmetric Communication Channels. - John Watkinson; Micah Adler; Faith E. Fich (SIROCCO, 2001)

A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. - Faith E. Fich; Colette Johnen (DISC, 2001)

Space-optimal multi-writer snapshot objects are slow. - Panagiota Fatourou; Faith E. Fich; Eric Ruppert (PODC, 2002)

Optimal Bounds for the Predecessor Problem and Related Problems. - Paul Beame; Faith E. Fich (J. Comput. Syst. Sci., 2002)

A tight time lower bound for space-optimal implementations of multi-writer snapshots. - Panagiota Fatourou; Faith E. Fich; Eric Ruppert (STOC, 2003)

Hundreds of impossibility results for distributed computing. - Faith E. Fich; Eric Ruppert (Distributed Comput., 2003)

Lower bounds for adaptive collect and related objects. - Hagit Attiya; Faith Ellen Fich; Yaniv Kaplan (PODC, 2004)

Efficient synchronous snapshots. - Alex Brodsky; Faith Ellen Fich (PODC, 2004)

On the inherent weakness of conditional synchronization primitives. - Faith E. Fich; Danny Hendler; Nir Shavit (PODC, 2004)

Linear Lower Bounds on Real-World Implementations of Concurrent Objects. - Faith Ellen Fich; Danny Hendler; Nir Shavit (FOCS, 2005)

How Hard Is It to Take a Snapshot?. - Faith Ellen Fich (SOFSEM, 2005)

Restricted Stack Implementations. - Matei David; Alex Brodsky; Faith Ellen Fich (DISC, 2005)

Obstruction-Free Algorithms Can Be Practically Wait-Free. - Faith Ellen Fich; Victor Luchangco; Mark Moir; Nir Shavit (DISC, 2005)

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. - Faith Ellen Fich; Victor Luchangco; Mark Moir; Nir Shavit (DISC, 2005)

Introduction to the special issue DISC 2003. - Faith Ellen Fich (Distributed Comput., 2005)

Estimating the maximum. - Ben Gum; Richard J. Lipton; Andrea S. LaPaugh; Faith E. Fich (J. Algorithms, 2005)

Graph Minors and Reliable Single Message Transmission. - Faith Ellen Fich; André Kündgen; Michael J. Pelsmajer; Radhika Ramamurthi (SIAM J. Discret. Math., 2005)

The Complexity of Updating Multi-writer Snapshot Objects. - Hagit Attiya; Faith Ellen; Panagiota Fatourou (ICDCN, 2006)

Maintaining Information About Nearby Processors in a Mobile Environment. - Faith Ellen; Sivaramakrishnan Subramanian; Jennifer L. Welch (ICDCN, 2006)

Time-space tradeoffs for implementations of snapshots. - Panagiota Fatourou; Faith Ellen Fich; Eric Ruppert (STOC, 2006)

Relationships between broadcast and shared memory in reliable anonymous distributed systems. - James Aspnes; Faith Ellen Fich; Eric Ruppert (Distributed Comput., 2006)

On the inherent weakness of conditional primitives. - Faith Ellen Fich; Danny Hendler; Nir Shavit (Distributed Comput., 2006)

SNZI: scalable NonZero indicators. - Faith Ellen; Yossi Lev; Victor Luchangco; Mark Moir (PODC, 2007)

Time lower bounds for implementations of multi-writer snapshots. - Faith Ellen; Panagiota Fatourou; Eric Ruppert (J. ACM, 2007)

The space complexity of unbounded timestamps. - Faith Ellen; Panagiota Fatourou; Eric Ruppert (Distributed Comput., 2008)

Non-blocking binary search trees. - Faith Ellen; Panagiota Fatourou; Eric Ruppert; Franck van Breugel (PODC, 2010)

A universal construction for wait-free transaction friendly data structures. - Phong Chuong; Faith Ellen; Vijaya Ramachandran (SPAA, 2010)

Tight bounds for anonymous adopt-commit objects. - James Aspnes; Faith Ellen (SPAA, 2011)

Fully-adaptive algorithms for long-lived renaming. - Alex Brodsky; Faith Ellen; Philipp Woelfel (Distributed Comput., 2011)

The complexity of updating snapshot objects. - Hagit Attiya; Faith Ellen; Panagiota Fatourou (J. Parallel Distributed Comput., 2011)

Faster than optimal snapshots (for a while): preliminary version. - James Aspnes; Hagit Attiya; Keren Censor-Hillel; Faith Ellen (PODC, 2012)

A little advice can be very helpful. - Arkadev Chattopadhyay; Jeff Edmonds; Faith Ellen; Toniann Pitassi (SODA, 2012)

Efficient Fetch-and-Increment. - Faith Ellen; Vijaya Ramachandran; Philipp Woelfel (DISC, 2012)

On the Inherent Sequentiality of Concurrent Objects. - Faith Ellen; Danny Hendler; Nir Shavit (SIAM J. Comput., 2012)

Bounds for Scheduling Jobs on Grid Processors. - Joan Boyar; Faith Ellen (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

A Tight Bound for Set Disjointness in the Message-Passing Model. - Mark Braverman; Faith Ellen; Rotem Oshman; Toniann Pitassi; Vinod Vaikuntanathan (FOCS, 2013)

Pragmatic primitives for non-blocking data structures. - Trevor Brown 001; Faith Ellen; Eric Ruppert (PODC, 2013)

An Optimal Implementation of Fetch-and-Increment. - Faith Ellen; Philipp Woelfel (DISC, 2013)

Tight Bounds for Set Disjointness in the Message Passing Model - Mark Braverman; Faith Ellen; Rotem Oshman; Toniann Pitassi; Vinod Vaikuntanathan (CoRR, 2013)

The amortized complexity of non-blocking binary search trees. - Faith Ellen; Panagiota Fatourou; Joanna Helga; Eric Ruppert (PODC, 2014)

A general technique for non-blocking trees. - Trevor Brown 001; Faith Ellen; Eric Ruppert (PPoPP, 2014)

Tight Bounds for an Online Bin Packing Problem. - Joan Boyar; Faith Ellen (CoRR, 2014)

Tight Bounds for Adopt-Commit Objects. - James Aspnes; Faith Ellen (Theory Comput. Syst., 2014)

Impossibility Results for Distributed Computing - Hagit Attiya; Faith Ellen (Morgan & Claypool Publishers, 2014)

Atomic Snapshots from Small Registers. - Leqi Zhu; Faith Ellen (OPODIS, 2015)

Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract). - Hagit Attiya; Hyun Chul Chung; Faith Ellen; Saptaparni Kumar; Jennifer L. Welch (DISC, 2015)

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. - James Aspnes; Hagit Attiya; Keren Censor-Hillel; Faith Ellen (J. ACM, 2015)

Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract). - Faith Ellen (OPODIS, 2016)

Deterministic Objects: Life Beyond Consensus. - Yehuda Afek; Faith Ellen; Eli Gafni (PODC, 2016)

Concurrent Data Structures. - Faith Ellen; Trevor Brown 001 (PODC, 2016)

A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. - Faith Ellen; Rati Gelashvili; Nir Shavit; Leqi Zhu (PODC, 2016)

A Complexity-Based Hierarchy for Multiprocessor Synchronization. - Faith Ellen; Rati Gelashvili; Nir Shavit; Leqi Zhu (CoRR, 2016)

Universal constructions that ensure disjoint-access parallelism and wait-freedom. - Faith Ellen; Panagiota Fatourou; Eleftherios Kosmas; Alessia Milani; Corentin Travers (Distributed Comput., 2016)

Upper and Lower Bounds on the Power of Advice. - Arkadev Chattopadhyay; Jeff Edmonds; Faith Ellen; Toniann Pitassi (SIAM J. Comput., 2016)

Simulating a Shared Register in a System that Never Stops Changing. - Hagit Attiya; Hyun Chul Chung; Faith Ellen; Saptaparni Kumar; Jennifer L. Welch (CoRR, 2017)

Limitations of Highly-Available Eventually-Consistent Data Stores. - Hagit Attiya; Faith Ellen; Adam Morrison 001 (IEEE Trans. Parallel Distributed Syst., 2017)

The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. - Joan Boyar; Faith Ellen; Kim S. Larsen (CoRR, 2018)

Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. - James Aspnes; Hagit Attiya; Keren Censor-Hillel; Faith Ellen (J. ACM, 2018)

2019 Edsger W. Dijkstra Prize in Distributed Computing. - Lorenzo Alvisi; Shlomi Dolev; Faith Ellen; Idit Keidar; Fabian Kuhn; Jukka Suomela (PODC, 2019)

Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations. - Lorenzo Alvisi; Shlomi Dolev; Faith Ellen; Idit Keidar; Fabian Kuhn; Jukka Suomela (Bull. EATCS, 2019)

Tight Bounds for Restricted Grid Scheduling. - Joan Boyar; Faith Ellen (Int. J. Found. Comput. Sci., 2019)

Emulating a Shared Register in a System That Never Stops Changing. - Hagit Attiya; Hyun Chul Chung; Faith Ellen; Saptaparni Kumar; Jennifer L. Welch (IEEE Trans. Parallel Distributed Syst., 2019)

Brief Announcement: Why Extension-Based Proofs Fail. - Dan Alistarh; James Aspnes; Faith Ellen; Rati Gelashvili; Leqi Zhu (PODC, 2020)

Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast. - Faith Ellen; Seth Gilbert (SPAA, 2020)

Preface. - Faith Ellen; Jörg-Rüdiger Sack (Comput. Geom., 2020)

A complexity-based classification for multiprocessor synchronization. - Faith Ellen; Rati Gelashvili; Nir Shavit; Leqi Zhu (Distributed Comput., 2020)

Randomized distributed online algorithms against adaptive offline adversaries. - Joan Boyar; Faith Ellen; Kim S. Larsen (Inf. Process. Lett., 2020)

Preface. - Faith Ellen; Luís Rodrigues 001 (Theor. Comput. Sci., 2020)

Reductions and Extension-Based Proofs. - Kayman Brusse; Faith Ellen (PODC, 2021)

Extension-Based Proofs for Synchronous Message Passing. - Yilun Sheng; Faith Ellen (DISC, 2021)

Space Lower Bounds for the Signal Detection Problem. - Faith Ellen; Rati Gelashvili; Philipp Woelfel; Leqi Zhu (Theory Comput. Syst., 2021)

Constant-Length Labeling Schemes for Deterministic Radio Broadcast. - Faith Ellen; Barun Gorain; Avery Miller; Andrzej Pelc (ACM Trans. Parallel Comput., 2021)

The Step Complexity of Multidimensional Approximate Agreement. - Hagit Attiya; Faith Ellen (OPODIS, 2022)

Wait-free approximate agreement on graphs. - Dan Alistarh; Faith Ellen; Joel Rybicki (Theor. Comput. Sci., 2023)

Why Extension-Based Proofs Fail. - Dan Alistarh; James Aspnes; Faith Ellen; Rati Gelashvili; Leqi Zhu (SIAM J. Comput., 2023)

Strongly-Linearizable Bags. - Faith Ellen; Gal Sela 001 (CoRR, 2024)

Revisionist Simulations: A New Approach to Proving Space Lower Bounds. - Faith Ellen; Rati Gelashvili; Leqi Zhu (SIAM J. Comput., 2024)

Byzantine Agreement with Predictions. - Naama Ben-David; Muhammad Ayaz Dzulfikar; Faith Ellen; Seth Gilbert (PODC, 2025)

Brief Announcement: Distributed Graph Algorithms with Predictions. - Joan Boyar; Faith Ellen; Kim S. Larsen (PODC, 2025)

Distributed Graph Algorithms with Predictions. - Joan Boyar; Faith Ellen; Kim S. Larsen (CoRR, 2025)