The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

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

Publications of Author

  1. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
    Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:239-252 [Conf]
  2. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:372-379 [Conf]
  3. Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson
    Tight Size Bounds for Packet Headers in Narrow Meshes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:756-767 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:50-59 [Conf]
  5. Faith E. Fich, Janusz A. Brzozowski
    A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:230-244 [Conf]
  6. Faith E. Fich
    End to End Communication. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1998, pp:37-44 [Conf]
  7. Micah Adler, Faith E. Fich
    The Complexity of End-to-End Communication in Memoryless Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:239-248 [Conf]
  8. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Relations Between Concurrent-Write Models of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    PODC, 1984, pp:179-189 [Conf]
  9. John Watkinson, Micah Adler, Faith E. Fich
    New Protocols for Asymmetric Communication Channels. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:337-350 [Conf]
  10. Faith E. Fich, V. Ramachandran
    Lower Bounds for Parallel Computation on Linked Structures. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:109-116 [Conf]
  11. Faith E. Fich, Avi Wigderson
    Towards Understanding Exclusive Read. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:76-82 [Conf]
  12. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:353-358 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:386-397 [Conf]
  14. Paul Beame, Faith E. Fich
    Optimal Bounds for the Predecessor Problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:295-304 [Conf]
  15. Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
    Bounds for Width Two Branching Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:87-93 [Conf]
  16. Faith E. Fich
    Lower Bounds for the Cycle Detection Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:96-105 [Conf]
  17. Faith E. Fich
    New Bounds for Parallel Prefix Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:100-109 [Conf]
  18. Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
    One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:48-58 [Conf]
  19. Faith E. Fich, Martin Tompa
    The Parallel Complexity of Exponentiating Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:38-47 [Conf]
  20. Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
    Retrieval of scattered information by EREW, CREW and CRCW PRAMs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:30-41 [Conf]
  21. Paul Beame, Faith E. Fich, Rakesh K. Sinha
    Separating the Power of EREW and CREW PRAMs with Small Communication Width. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:163-174 [Conf]
  22. Faith E. Fich, Peter Bro Miltersen
    Tables Should Be Sorted (On Random Access Machines). [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:482-493 [Conf]
  23. Faith E. Fich, Andreas Jakoby
    Short Headers Suffice for Communication in a DAG with Link Failures. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:360-373 [Conf]
  24. Faith E. Fich, Colette Johnen
    A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:224-239 [Conf]
  25. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Simulations Among Concurrent-Write PRAMs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:43-51 [Journal]
  26. Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
    Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:2, pp:113-131 [Journal]
  27. Faith E. Fich
    Infrastructure Issues Related to Theory of Computing Research. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:217- [Journal]
  28. Joan Boyar, Faith E. Fich, Kim S. Larsen
    Bounds on Certain Multiplications of Affine Combinations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:2, pp:155-167 [Journal]
  29. Faith E. Fich, Eric Ruppert
    Hundreds of impossibility results for distributed computing. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:121-163 [Journal]
  30. Paul Beame, Faith E. Fich
    On Searching Sorted Lists: A Near-Optimal Lower Bound [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:28, pp:- [Journal]
  31. Paul Beame, Faith E. Fich, Rakesh K. Sinha
    Separating the Power of EREW and CREW PRAMs with Small Communication Width. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:138, n:1, pp:89-99 [Journal]
  32. Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha
    On the Power of Concurrent-Write PRAMs With Read-Only Memory [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:2, pp:234-244 [Journal]
  33. Faith E. Fich, Martin Tompa
    The parallel complexity of exponentiating polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:651-667 [Journal]
  34. Paul Beame, Faith E. Fich
    Optimal Bounds for the Predecessor Problem and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:1, pp:38-72 [Journal]
  35. Janusz A. Brzozowski, Faith E. Fich
    Languages of R-Trivial Monoids. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:32-49 [Journal]
  36. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
    Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:218-232 [Journal]
  37. Faith E. Fich
    Lower Bounds for the Cycle Detection Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:3, pp:392-409 [Journal]
  38. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:1, pp:104-111 [Journal]
  39. Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
    Bounds for Width Two Branching Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:549-560 [Journal]
  40. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    A Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:97-99 [Journal]
  41. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting in Place. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:266-278 [Journal]
  42. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Relations Between Concurrent-Write Models of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:606-627 [Journal]
  43. Faith E. Fich, Avi Wigderson
    Toward Understanding Exclusive Read. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:4, pp:718-727 [Journal]
  44. Edward A. Ashcroft, Faith E. Fich
    A Generalized Setting for Fixpoint Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:243-256 [Journal]
  45. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:57-68 [Journal]
  46. Janusz A. Brzozowski, Faith E. Fich
    On generalized locally testable languages. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:153-169 [Journal]

Search in 0.003secs, Finished in 0.305secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002