Alex Brodsky, Faith Ellen, and Philipp Woelfel,
Fully Adaptive Algorithms for Long-Lived Renaming,
Proceedings of the 20th International Symposium on Distributed Computing (DISC),
September 2006, to appear.
Panagiota Fatourou, Faith Ellen Fich, and Eric Ruppert,
Time-Space Tradeoffs for Implementations of Snapshots,
38th Annual ACM Symposium on Theory of Computing (STOC),
May 2006, pages 169--178.
Faith Ellen Fich, Danny Hendler, and Nir Shavit,
Linear Lower Bounds on Real-World Implementations of
Concurrent Objects,
Proceedings of the 46th Annual Symposium on Foundations of Computer
Science (FOCS),
October 2005, pages 165--173.
Matei David, Alex Brodsky, and Faith Ellen Fich,
Restricted Stack Implementations,
Proceedings of the 19th International Symposium on Distributed Computing (DISC),
September 2005, pages 137--151.
Faith Ellen Fich, Victor Luchangco, Mark Moir, and Nir Shavit,
Obstruction-free Algorithms Can Be Practically Wait-free,
Proceedings of the 19th International Symposium on Distributed Computing (DISC),
September 2005, pages 78--92.
Faith Ellen Fich, Victor Luchangco, Mark Moir, and Nir Shavit,
Brief Announcement: Obstruction-Free Step Complexity:
Lock-free DCAS as an Example,
Proceedings of the 19th International Symposium on Distributed Computing (DISC),
September 2005, pages 493--494.
Faith Ellen Fich,
How Hard is it to Take a Snapshot?,
Proceedings of 31st Annual Conference on Current Trends in
Theory and Practice of Informatics (SOFSEM),
Lecture Notes in Computer Science, volume 3381, January 2005, pages 27--35.
James Aspnes, Faith Ellen Fich, and Eric Ruppert,
Relationships Between Broadcast and Shared Memory in Reliable Anonymous
Distributed Systems,
18th International Symposium on Distributed Computing (DISC),
Lecture Notes in Computer Science, volume 3274,
October 2004, pages 207--217.
Alex Brodsky and Faith Ellen Fich,
Efficient Synchronous Snapshots,
23rd Annual ACM Symposium on Principles of Distributed Computing (PODC),
July 2004, pages 70--79.
Hagit Attiya, Faith Ellen Fich, and Yaniv Kaplan,
Lower Bounds for Adaptive Collect and Related Objects,
23rd Annual ACM Symposium on Principles of Distributed Computing (PODC),
July 2004, pages 60--69.
Faith Ellen Fich, Danny Hendler, and Nir Shavit,
On the Inherent Weakness of Conditional Synchronization Primitives,
23rd Annual ACM Symposium on Principles of Distributed Computing (PODC),
July 2004, pages 80--87.
Panagiota Fatourou, Faith E. Fich, and Eric Ruppert,
A Tight Time Lower Bound for Space-Optimal Implementations
of Multi-Writer Snapshots,
35th Annual ACM Symposium on Theory of Computing (STOC),
June 2003, pages 259--268.
Panagiota Fatourou, Faith E. Fich, and Eric Ruppert,
Space-Optimal Multi-Writer Snapshot Objects Are Slow,
21st Annual ACM Symposium on Principles of
Distributed Computing (PODC),
July 2002, pages 13--20.
Faith E. Fich and Colette Johnen,
Faith E. Fich and Eric Ruppert,
Faith E. Fich and Andreas Jakoby,
Micah Adler, Faith E. Fich, Leslie Goldberg, and Michael Paterson,
Paul Beame and Faith E. Fich,
Micah Adler and Faith E. Fich,
Faith E. Fich,
Faith Fich and Peter Bro Miltersen,
Faith Fich, Maurice Herlihy, and Nir Shavit,
Paul Beame, Faith Fich, and Rakesh Sinha,
Patrick Dymond, Faith Fich, Naomi Nishimura,
Faith Fich, Russell Impagliazzo, Bruce Kapron, Valerie King, and
Miroslaw Kutylowski,
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys,
Faith Fich, Ian Munro, and Patricio Poblete,
Faith Fich and Vijaya Ramachandran,
Faith Fich and Avi Wigderson, Towards Understanding Exclusive Read,
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson,
Faith E. Fich, Prabhakar Ragde, and Avi Wigderson,
Faith E. Fich and Martin Tompa,
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson,
F. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson,
Allan Borodin, Faith E. Fich, Danny Dolev, and Wolfgang Paul,
Faith E. Fich,
Faith E. Fich,
Faith E. Fich and John A. Brzozowski,
A Linear Space Self-Stabilizing Leader Election Algorithm
on a Unidirectional Ring,
15th International Symposium on Distributed Computing
(DISC),
New Protocols for Asymmetric Communication Channels,
Eighth International Colloquium on Structural
Information and Communication Complexity (SIROCCO),
June 2001, pages 337--350.
Lower Bounds in Distributed Computing,
14th International Symposium on Distributed Computing (DISC),
Lecture Notes in Computer Science, volume 1914, Springer-Verlag,
September 2000, pages 1--28.
Short Headers Suffice for Communication in a DAG with Link Failures,
14th International Symposium on Distributed Computing (DISC),
Lecture Notes in Computer Science, volume 1914, Springer-Verlag,
September 2000, pages 360--373.
Tight Size Bounds for Packet Headers in Narrow Meshes,
Twenty Seventh International Colloquium on Automata,
Languages and Programming (ICALP),
Lecture Notes in Computer Science, volume 1853, Springer-Verlag, July 2000,
pages 756--767.
Optimal Bounds for the Predecessor Problem,
31st Annual ACM Symposium on Theory of Computing (STOC),
May 1999, pages 295--304.
The Complexity of End-to-End Communication in Memoryless Networks,
18th Annual ACM Symposium on Principles of Distributed Computing (PODC),
May 1999, pages 239--248.
End-to-End Communication,
Second International Conference On Principles Of Distributed
Systems (OPODIS),
December 16, 1998, pages 37--43.
Tables Should be Sorted (on Random Access Machines),
Proceedings of the Fourth Workshop on Algorithms and Data Structures (WADS),
Lecture Notes in Computer Science, volume 955, Springer-Verlag,
August 1995, pages 482--494.
On the Space Complexity of Randomized Synchronization,
Proceedings of the 12th ACM Symposium on Principles of Distributed Computing
(PODC),
August 1993, pages 241--249.
Separating the Power of CREW and EREW
PRAMs with Small Communication Width,
Proceedings of the Third Workshop on Algorithms and Data Structures (WADS),
Lecture Notes in Computer Science, volume 709, Springer-Verlag,
August 1993, pages 163--174.
Prabhakar Ragde, and Walter Ruzzo,
Pointers versus Arithmetic in PRAMs,
8th Annual Conference on Structure in Complexity Theory,
May 1993, pages 239--252.
Limits on the Power of Parallel Random Access Machines with Weak Forms
of Write Conflict Resolution,
Proceeding of the Tenth Annual
Symposium on Theoretical Aspects of Computing (STACS),
Lecture Notes in Computer Science, volume 665, Springer-Verlag,
February 1993, pages 386--397.
Miroslaw Kutylowski, and Prabhakar Ragde,
Retrieval of scattered information by EREW, CREW and CRCW PRAMs,
Third Scandinavian Workshop on Algorithm Theory (SWAT),
Finland, July 1992,
Lecture Notes in Computer Science, volume 621, Springer-Verlag,
pages 30--41.
Permuting,
Proceedings of the 31st Annual Symposium on Foundations of Computer
Science (FOCS), 1990, pages 372--381.
Lower Bounds for Parallel Computation on Linked Structures,
Proceedings of the 2nd ACM Symposium on Parallel Algorithms and
Architectures (SPAA),
July 1990, pages 109--116.
Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures
(SPAA),
Santa Fe, New Mexico, June 1989, pages 76--82.
A Tradeoff Between Search and Update Time for the
Implicit Dictionary Problem,
Proceedings of the Thirteenth International Colloquium on Automata, Languages,
and Programming (ICALP), Lecture Notes in Computer Science, volume 226,
Springer-Verlag, Berlin, 1986, pages 50--59.
Relations Between Concurrent-Write Models of Parallel Computation,
Proceedings of the Third ACM Symposium on Principles of Distributed
Computing (PODC), 1984, pages 179--189.
The Parallel Complexity of Exponentiating Polynomials over Finite Fields,
Proceedings of the Seventeenth Annual ACM Symposium on Theory of
Computing (STOC),
May 1985, pages 38--47.
A Time-Space Tradeoff for Element Distinctness,
Proceedings of the Third Annual Symposium on Theoretical Aspects of
Computer Science (STACS),
January 1986, pages 353--358.
One, Two, Three . . . Infinity: Lower Bounds for Parallel Communication,
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
(STOC),
May 1985, pages 48--58.
Bounds for Width Two Branching Programs,
Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC),
April 1983, pages 87--93.
New Bounds for Parallel Prefix Circuits,
Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC),
April 1983, pages 100--109.
Lower Bounds for the Cycle Detection Problem,
Proceedings of the Thirteenth Annual ACM
Symposium on Theory of Computing (STOC),
May 1981, pages 96--105.
A Characterization of a Dot-Depth Two Analogue of Generalized Definite
Languages,
Proceedings of the Sixth International Colloquium on Automata, Languages,
and Programming (ICALP), Lecture Notes in Computer Science, volume 71,
Springer-Verlag, Berlin, 1979, pages 230--244.