dblp.uni-trier.dewww.uni-trier.de

Faith Ellen

Faith Ellen Fich, Faith E. Fich

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
76EEFaith Ellen, Panagiota Fatourou, Eric Ruppert: The space complexity of unbounded timestamps. Distributed Computing 21(2): 103-115 (2008)
2007
75EEFaith Ellen, Panagiota Fatourou, Eric Ruppert: The Space Complexity of Unbounded Timestamps. DISC 2007: 223-237
74EEFaith Ellen, Yossi Lev, Victor Luchangco, Mark Moir: SNZI: scalable NonZero indicators. PODC 2007: 13-22
73EEHagit Attiya, Faith Ellen, Panagiota Fatourou: The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319
72EEFaith Ellen, Panagiota Fatourou, Eric Ruppert: Time lower bounds for implementations of multi-writer snapshots. J. ACM 54(6): (2007)
2006
71EEAlex Brodsky, Faith Ellen, Philipp Woelfel: Fully-Adaptive Algorithms for Long-Lived Renaming. DISC 2006: 413-427
70EEFaith Ellen, Sivaramakrishnan Subramanian, Jennifer L. Welch: Maintaining Information About Nearby Processors in a Mobile Environment. ICDCN 2006: 193-202
69EEHagit Attiya, Faith Ellen, Panagiota Fatourou: The Complexity of Updating Multi-writer Snapshot Objects. ICDCN 2006: 319-330
68EEPanagiota Fatourou, Faith Ellen Fich, Eric Ruppert: Time-space tradeoffs for implementations of snapshots. STOC 2006: 169-178
67EEJames Aspnes, Faith Ellen Fich, Eric Ruppert: Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Computing 18(3): 209-219 (2006)
66EEFaith Ellen Fich, Danny Hendler, Nir Shavit: On the inherent weakness of conditional primitives. Distributed Computing 18(4): 267-277 (2006)
2005
65EEMatei David, Alex Brodsky, Faith Ellen Fich: Restricted Stack Implementations. DISC 2005: 137-151
64EEFaith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit: Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. DISC 2005: 493-494
63EEFaith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit: Obstruction-Free Algorithms Can Be Practically Wait-Free. DISC 2005: 78-92
62EEFaith Ellen Fich, Danny Hendler, Nir Shavit: Linear Lower Bounds on Real-World Implementations of Concurrent Objects. FOCS 2005: 165-173
61EEFaith Ellen Fich: How Hard Is It to Take a Snapshot?. SOFSEM 2005: 28-37
60EEFaith Ellen Fich: Introduction to the special issue DISC 2003. Distributed Computing 18(2): 111-111 (2005)
59EEBen Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich: Estimating the maximum. J. Algorithms 54(1): 105-114 (2005)
58EEFaith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi: Graph Minors and Reliable Single Message Transmission. SIAM J. Discrete Math. 19(4): 815-847 (2005)
2004
57EEJames Aspnes, Faith Ellen Fich, Eric Ruppert: Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC 2004: 260-274
56EEHagit Attiya, Faith Ellen Fich, Yaniv Kaplan: Lower bounds for adaptive collect and related objects. PODC 2004: 60-69
55EEAlex Brodsky, Faith Ellen Fich: Efficient synchronous snapshots. PODC 2004: 70-79
54EEFaith Ellen Fich, Danny Hendler, Nir Shavit: On the inherent weakness of conditional synchronization primitives. PODC 2004: 80-87
2003
53 Faith Ellen Fich: Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings Springer 2003
52EEPanagiota Fatourou, Faith Ellen Fich, Eric Ruppert: A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC 2003: 259-268
51EEFaith E. Fich, Eric Ruppert: Hundreds of impossibility results for distributed computing. Distributed Computing 16(2-3): 121-163 (2003)
2002
50EEPanagiota Fatourou, Faith Ellen Fich, Eric Ruppert: Space-optimal multi-writer snapshot objects are slow. PODC 2002: 13-20
49EEPaul Beame, Faith E. Fich: Optimal Bounds for the Predecessor Problem and Related Problems. J. Comput. Syst. Sci. 65(1): 38-72 (2002)
2001
48EEFaith E. Fich, Colette Johnen: A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. DISC 2001: 224-239
47 John Watkinson, Micah Adler, Faith E. Fich: New Protocols for Asymmetric Communication Channels. SIROCCO 2001: 337-350
2000
46EEFaith Ellen Fich, Eric Ruppert: Lower Bounds in Distributed Computing. DISC 2000: 1-28
45EEFaith E. Fich, Andreas Jakoby: Short Headers Suffice for Communication in a DAG with Link Failures. DISC 2000: 360-373
44EEMicah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson: Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767
1999
43EEMicah Adler, Faith E. Fich: The Complexity of End-to-End Communication in Memoryless Networks. PODC 1999: 239-248
42EEPaul Beame, Faith E. Fich: Optimal Bounds for the Predecessor Problem. STOC 1999: 295-304
1998
41 Faith E. Fich: End to End Communication. OPODIS 1998: 37-44
40EEPaul Beame, Faith E. Fich: On Searching Sorted Lists: A Near-Optimal Lower Bound Electronic Colloquium on Computational Complexity (ECCC) 5(28): (1998)
39EEFaith Ellen Fich, Maurice Herlihy, Nir Shavit: On the Space Complexity of Randomized Synchronization. J. ACM 45(5): 843-862 (1998)
1997
38 Paul Beame, Faith E. Fich, Rakesh K. Sinha: Separating the Power of EREW and CREW PRAMs with Small Communication Width. Inf. Comput. 138(1): 89-99 (1997)
1996
37 Faith E. Fich: Infrastructure Issues Related to Theory of Computing Research. ACM Comput. Surv. 28(4es): 217 (1996)
36 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. 53(1): 104-111 (1996)
35 Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo: Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53(2): 218-232 (1996)
1995
34 Faith E. Fich, Peter Bro Miltersen: Tables Should Be Sorted (On Random Access Machines). WADS 1995: 482-493
33 Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde: Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Computational Complexity 5(2): 113-131 (1995)
32 Faith E. Fich, J. Ian Munro, Patricio V. Poblete: Permuting in Place. SIAM J. Comput. 24(2): 266-278 (1995)
1994
31EEJoan Boyar, Faith E. Fich, Kim S. Larsen: Bounds on Certain Multiplications of Affine Combinations. Discrete Applied Mathematics 52(2): 155-167 (1994)
1993
30 Faith Ellen Fich, Maurice Herlihy, Nir Shavit: On the Space Complexity of Randomized Synchronization. PODC 1993: 241-249
29 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: 386-397
28 Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo: Pointers versus Arithmetic in PRAMs. Structure in Complexity Theory Conference 1993: 239-252
27 Paul Beame, Faith E. Fich, Rakesh K. Sinha: Separating the Power of EREW and CREW PRAMs with Small Communication Width. WADS 1993: 163-174
1992
26 Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde: Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT 1992: 30-41
1990
25 Faith E. Fich, J. Ian Munro, Patricio V. Poblete: Permuting FOCS 1990: 372-379
24EEFaith E. Fich, V. Ramachandran: Lower Bounds for Parallel Computation on Linked Structures. SPAA 1990: 109-116
23EEFaith Ellen Fich: Preface. Discrete Applied Mathematics 29(1): 1-2 (1990)
22 Faith E. Fich, Avi Wigderson: Toward Understanding Exclusive Read. SIAM J. Comput. 19(4): 718-727 (1990)
1989
21EEFaith E. Fich, Avi Wigderson: Towards Understanding Exclusive Read. SPAA 1989: 76-82
20 Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha: On the Power of Concurrent-Write PRAMs With Read-Only Memory Inf. Comput. 83(2): 234-244 (1989)
1988
19 Faith E. Fich, Prabhakar Ragde, Avi Wigderson: Simulations Among Concurrent-Write PRAMs. Algorithmica 3: 43-51 (1988)
18EEFaith E. Fich, Martin Tompa: The parallel complexity of exponentiating polynomials over finite fields. J. ACM 35(3): 651-667 (1988)
17 Faith E. Fich, Prabhakar Ragde, Avi Wigderson: Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17(3): 606-627 (1988)
16 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. 58: 57-68 (1988)
1987
15 Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson: A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 16(1): 97-99 (1987)
1986
14 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: 50-59
13 Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson: A Time-Space Tradeoff for Element Distinctness. STACS 1986: 353-358
12 Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul: Bounds for Width Two Branching Programs. SIAM J. Comput. 15(2): 549-560 (1986)
1985
11 Faith E. Fich, Martin Tompa: The Parallel Complexity of Exponentiating Polynomials over Finite Fields STOC 1985: 38-47
10 Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson: One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation STOC 1985: 48-58
1984
9 Faith E. Fich, Prabhakar Ragde, Avi Wigderson: Relations Between Concurrent-Write Models of Parallel Computation. PODC 1984: 179-189
8EEJanusz A. Brzozowski, Faith E. Fich: On generalized locally testable languages. Discrete Mathematics 50: 153-169 (1984)
1983
7 Faith E. Fich: New Bounds for Parallel Prefix Circuits STOC 1983: 100-109
6 Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul: Bounds for Width Two Branching Programs STOC 1983: 87-93
5 Faith E. Fich: Lower Bounds for the Cycle Detection Problem. J. Comput. Syst. Sci. 26(3): 392-409 (1983)
1981
4 Faith E. Fich: Lower Bounds for the Cycle Detection Problem STOC 1981: 96-105
1980
3 Janusz A. Brzozowski, Faith E. Fich: Languages of R-Trivial Monoids. J. Comput. Syst. Sci. 20(1): 32-49 (1980)
1979
2 Faith E. Fich, Janusz A. Brzozowski: A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. ICALP 1979: 230-244
1 Edward A. Ashcroft, Faith E. Fich: A Generalized Setting for Fixpoint Theory. Theor. Comput. Sci. 9: 243-256 (1979)

Coauthor Index

1Micah Adler [43] [44] [47]
2Edward A. Ashcroft [1]
3James Aspnes [57] [67]
4Hagit Attiya (Chagit Attiya) [56] [69] [73]
5Paul Beame [27] [38] [40] [42] [49]
6Allan Borodin [6] [12] [13] [14] [15] [16]
7Joan Boyar [31]
8Alex Brodsky (Alexander O. Brodsky, Alexander Brodsky) [55] [65] [71]
9Janusz A. Brzozowski [2] [3] [8]
10Matei David [65]
11Danny Dolev [6] [12]
12Patrick W. Dymond [28] [35]
13Panagiota Fatourou [50] [52] [68] [69] [72] [73] [75] [76]
14Leslie Ann Goldberg [44]
15Ben Gum [59]
16Friedhelm Meyer auf der Heide [10] [13] [14] [15] [16]
17Danny Hendler [54] [62] [66]
18Maurice Herlihy [30] [39]
19Russell Impagliazzo [29] [36]
20Andreas Jakoby [45]
21Colette Johnen [48]
22Yaniv Kaplan [56]
23Bruce M. Kapron [29] [36]
24Valerie King [29] [36]
25Miroslaw Kowaluk [26] [33]
26André Kündgen [58]
27Miroslaw Kutylowski [26] [29] [33] [36]
28Andrea S. LaPaugh [59]
29Kim S. Larsen [31]
30Yossi Lev [74]
31Ming Li [20]
32Richard J. Lipton [59]
33Krzysztof Lorys [26] [33]
34Victor Luchangco [63] [64] [74]
35Peter Bro Miltersen [34]
36Mark Moir [63] [64] [74]
37J. Ian Munro [25] [32]
38Naomi Nishimura [28] [35]
39Mike Paterson [44]
40Wolfgang J. Paul [6] [12]
41Michael J. Pelsmajer [58]
42Patricio V. Poblete [25] [32]
43Prabhakar Ragde [9] [10] [17] [19] [20] [26] [28] [33] [35]
44V. Ramachandran [24]
45Radhika Ramamurthi [58]
46Eric Ruppert [46] [50] [51] [52] [57] [67] [68] [72] [75] [76]
47Walter L. Ruzzo [28] [35]
48Nir Shavit [30] [39] [54] [62] [63] [64] [66]
49Rakesh K. Sinha [27] [38]
50Sivaramakrishnan Subramanian [70]
51Martin Tompa [11] [18]
52Eli Upfal [13] [14] [15] [16]
53John Watkinson [47]
54Jennifer L. Welch [70]
55Avi Wigderson [9] [10] [13] [14] [15] [16] [17] [19] [21] [22]
56Philipp Woelfel [71]
57Yaacov Yesha [20]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)