| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi |
A little advice can be very helpful.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Hagit Attiya, Faith Ellen, Panagiota Fatourou |
The complexity of updating snapshot objects. |
J. Parallel Distrib. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Brodsky, Faith Ellen, Philipp Woelfel |
Fully-adaptive algorithms for long-lived renaming. |
Distributed Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | James Aspnes, Faith Ellen |
Tight bounds for anonymous adopt-commit objects. |
SPAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Phong Chuong, Faith Ellen, Vijaya Ramachandran |
A universal construction for wait-free transaction friendly data structures. |
SPAA |
2010 |
DBLP DOI BibTeX RDF |
abortable data structure, transaction friendly, universal construction, wait-free, cache-efficiency |
| 1 | Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel |
Non-blocking binary search trees. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
shared memory, non-blocking, binary search tree, cas |
| 1 | Faith Ellen, Panagiota Fatourou, Eric Ruppert |
The space complexity of unbounded timestamps. |
Distributed Computing |
2008 |
DBLP DOI BibTeX RDF |
Obstruction-free, Lower bounds, Anonymous, Shared memory, Timestamps, Wait-free |
| 1 | Faith Ellen, Panagiota Fatourou, Eric Ruppert |
Time lower bounds for implementations of multi-writer snapshots. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Distributed computing, lower bound, shared memory, wait-free, snapshot, registers |
| 1 | Faith Ellen, Panagiota Fatourou, Eric Ruppert |
The Space Complexity of Unbounded Timestamps. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
lower bounds, anonymous, shared memory, timestamps |
| 1 | Hagit Attiya, Faith Ellen, Panagiota Fatourou |
The complexity of updating multi-writer snapshot objects. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
distributed computing, lower bound, shared memory, update, snapshot |
| 1 | Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir |
SNZI: scalable NonZero indicators. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
scalability, transactional memory, counters |
| 1 | Faith Ellen, Sivaramakrishnan Subramanian, Jennifer L. Welch |
Maintaining Information About Nearby Processors in a Mobile Environment. |
ICDCN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hagit Attiya, Faith Ellen, Panagiota Fatourou |
The Complexity of Updating Multi-writer Snapshot Objects. |
ICDCN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Brodsky, Faith Ellen, Philipp Woelfel |
Fully-Adaptive Algorithms for Long-Lived Renaming. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | James Aspnes, Faith Ellen Fich, Eric Ruppert |
Relationships between broadcast and shared memory in reliable anonymous distributed systems. |
Distributed Computing |
2006 |
DBLP DOI BibTeX RDF |
Simulations, Robustness, Broadcast, Anonymous, Shared memory |
| 1 | Faith Ellen Fich, Danny Hendler, Nir Shavit |
On the inherent weakness of conditional primitives. |
Distributed Computing |
2006 |
DBLP DOI BibTeX RDF |
Space lower bounds, Object implementations, Mutual exclusion, Conditionals |
| 1 | Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert |
Time-space tradeoffs for implementations of snapshots. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
anonymous processes, distributed computing, lower bound, shared memory, wait-free, snapshot, time-space tradeoff |
| 1 | Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich |
Estimating the maximum. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi |
Graph Minors and Reliable Single Message Transmission. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich |
Introduction to the special issue DISC 2003. |
Distributed Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matei David, Alex Brodsky, Faith Ellen Fich |
Restricted Stack Implementations. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit |
Obstruction-Free Algorithms Can Be Practically Wait-Free. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit |
Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich, Danny Hendler, Nir Shavit |
Linear Lower Bounds on Real-World Implementations of Concurrent Objects. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich |
How Hard Is It to Take a Snapshot?. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | James Aspnes, Faith Ellen Fich, Eric Ruppert |
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. |
DISC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan |
Lower bounds for adaptive collect and related objects. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
exclusive-write registers, sensitive objects, solo termination, weak test&set, adaptivity, contention, collect |
| 1 | Alex Brodsky, Faith Ellen Fich |
Efficient synchronous snapshots. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
multiprocessor algorithms, shared memory objects |
| 1 | Faith Ellen Fich, Danny Hendler, Nir Shavit |
On the inherent weakness of conditional synchronization primitives. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
load-linked, store-conditional, test-and-set, lower bounds, compare-and-swap, wait-freedom, synchronization primitives |
| 1 | Faith E. Fich, Eric Ruppert |
Hundreds of impossibility results for distributed computing. |
Distributed Computing |
2003 |
DBLP DOI BibTeX RDF |
Complexity lower bounds, Distributed computing, Impossibility results |
| 1 | Faith Ellen Fich (eds.) |
Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings |
DISC |
2003 |
DBLP BibTeX RDF |
|
| 1 | Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert |
A tight time lower bound for space-optimal implementations of multi-writer snapshots. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
shared-memory distributed computing, lower bounds, snapshot, space-optimal |
| 1 | Paul Beame, Faith E. Fich |
Optimal Bounds for the Predecessor Problem and Related Problems. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert |
Space-optimal multi-writer snapshot objects are slow. |
PODC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | John Watkinson, Micah Adler, Faith E. Fich |
New Protocols for Asymmetric Communication Channels. |
SIROCCO |
2001 |
DBLP BibTeX RDF |
|
| 1 | Faith E. Fich, Colette Johnen |
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. |
DISC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson |
Tight Size Bounds for Packet Headers in Narrow Meshes. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Andreas Jakoby |
Short Headers Suffice for Communication in a DAG with Link Failures. |
DISC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen Fich, Eric Ruppert |
Lower Bounds in Distributed Computing. |
DISC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Faith E. Fich |
The Complexity of End-to-End Communication in Memoryless Networks. |
PODC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Faith E. Fich |
Optimal Bounds for the Predecessor Problem. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Faith E. Fich |
On Searching Sorted Lists: A Near-Optimal Lower Bound |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Faith E. Fich |
End to End Communication. |
OPODIS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Faith Ellen Fich, Maurice Herlihy, Nir Shavit |
On the Space Complexity of Randomized Synchronization. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
lower bounds, consensus, space complexity |
| 1 | Paul Beame, Faith E. Fich, Rakesh K. Sinha |
Separating the Power of EREW and CREW PRAMs with Small Communication Width. |
Inf. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich |
Infrastructure Issues Related to Theory of Computing Research. |
ACM Comput. Surv. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo |
Pointers versus Arithmetic in PRAMs. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde |
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. |
Computational Complexity |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, J. Ian Munro, Patricio V. Poblete |
Permuting in Place. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Peter Bro Miltersen |
Tables Should Be Sorted (On Random Access Machines). |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Faith E. Fich, Kim S. Larsen |
Bounds on Certain Multiplications of Affine Combinations. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Faith E. Fich, Rakesh K. Sinha |
Separating the Power of EREW and CREW PRAMs with Small Communication Width. |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo |
Pointers versus Arithmetic in PRAMs. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Faith Ellen Fich, Maurice Herlihy, Nir Shavit |
On the Space Complexity of Randomized Synchronization. |
PODC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde |
Retrieval of scattered information by EREW, CREW and CRCW PRAMs. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Avi Wigderson |
Toward Understanding Exclusive Read. |
SIAM J. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Vijaya Ramachandran |
Lower Bounds for Parallel Computation on Linked Structures. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, J. Ian Munro, Patricio V. Poblete |
Permuting |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
array elements, polylogarithmic number of bits, permuting, permutation, linear time |
| 1 | Faith Ellen Fich |
Preface. |
Discrete Applied Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha |
On the Power of Concurrent-Write PRAMs With Read-Only Memory |
Inf. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Avi Wigderson |
Towards Understanding Exclusive Read. |
SPAA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Prabhakar Ragde, Avi Wigderson |
Simulations Among Concurrent-Write PRAMs. |
Algorithmica |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Martin Tompa |
The parallel complexity of exponentiating polynomials over finite fields. |
J. ACM |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Prabhakar Ragde, Avi Wigderson |
Relations Between Concurrent-Write Models of Parallel Computation. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson |
A Time-Space Tradeoff for Element Distinctness. |
SIAM J. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul |
Bounds for Width Two Branching Programs. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson |
A Time-Space Tradeoff for Element Distinctness. |
STACS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson |
One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Martin Tompa |
The Parallel Complexity of Exponentiating Polynomials over Finite Fields |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz A. Brzozowski, Faith E. Fich |
On generalized locally testable languages. |
Discrete Mathematics |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Prabhakar Ragde, Avi Wigderson |
Relations Between Concurrent-Write Models of Parallel Computation. |
PODC |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich |
Lower Bounds for the Cycle Detection Problem. |
J. Comput. Syst. Sci. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich |
New Bounds for Parallel Prefix Circuits |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul |
Bounds for Width Two Branching Programs |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich |
Lower Bounds for the Cycle Detection Problem |
STOC |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz A. Brzozowski, Faith E. Fich |
Languages of R-Trivial Monoids. |
J. Comput. Syst. Sci. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward A. Ashcroft, Faith E. Fich |
A Generalized Setting for Fixpoint Theory. |
Theor. Comput. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith E. Fich, Janusz A. Brzozowski |
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")