The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Faith Ellen Fich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Faith Ellen Fich, Danny Hendler, Nir Shavit
    Linear Lower Bounds on Real-World Implementations of Concurrent Objects. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:165-173 [Conf]
  2. Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan
    Lower bounds for adaptive collect and related objects. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:60-69 [Conf]
  3. Alex Brodsky, Faith Ellen Fich
    Efficient synchronous snapshots. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:70-79 [Conf]
  4. Faith Ellen Fich, Danny Hendler, Nir Shavit
    On the inherent weakness of conditional synchronization primitives. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:80-87 [Conf]
  5. Faith Ellen Fich, Maurice Herlihy, Nir Shavit
    On the Space Complexity of Randomized Synchronization. [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:241-249 [Conf]
  6. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    Space-optimal multi-writer snapshot objects are slow. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:13-20 [Conf]
  7. Faith Ellen Fich
    How Hard Is It to Take a Snapshot?. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:28-37 [Conf]
  8. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    A tight time lower bound for space-optimal implementations of multi-writer snapshots. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:259-268 [Conf]
  9. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    Time-space tradeoffs for implementations of snapshots. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:169-178 [Conf]
  10. James Aspnes, Faith Ellen Fich, Eric Ruppert
    Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:260-274 [Conf]
  11. Matei David, Alex Brodsky, Faith Ellen Fich
    Restricted Stack Implementations. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:137-151 [Conf]
  12. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Algorithms Can Be Practically Wait-Free. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:78-92 [Conf]
  13. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:493-494 [Conf]
  14. Faith Ellen Fich, Eric Ruppert
    Lower Bounds in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:1-28 [Conf]
  15. James Aspnes, Faith Ellen Fich, Eric Ruppert
    Relationships between broadcast and shared memory in reliable anonymous distributed systems. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:209-219 [Journal]
  16. Faith Ellen Fich
    Introduction to the special issue DISC 2003. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:18, n:2, pp:111-111 [Journal]
  17. Faith Ellen Fich, Danny Hendler, Nir Shavit
    On the inherent weakness of conditional primitives. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:4, pp:267-277 [Journal]
  18. Faith Ellen Fich, Maurice Herlihy, Nir Shavit
    On the Space Complexity of Randomized Synchronization. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:5, pp:843-862 [Journal]
  19. Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich
    Estimating the maximum. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:1, pp:105-114 [Journal]
  20. Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
    Graph Minors and Reliable Single Message Transmission. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:815-847 [Journal]

  21. Preface. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002