Faith Ellen

Faith Ellen Fich, Faith E. Fich

2007
74	EE	Faith Ellen, Panagiota Fatourou, Eric Ruppert: The Space Complexity of Unbounded Timestamps. DISC 2007: 223-237
73	EE	Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir: SNZI: scalable NonZero indicators. PODC 2007: 13-22
72	EE	Hagit Attiya, Faith Ellen, Panagiota Fatourou: The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319
71	EE	Faith Ellen, Panagiota Fatourou, Eric Ruppert: Time lower bounds for implementations of multi-writer snapshots. J. ACM 54(6): (2007)
2006
70	EE	Alex Brodsky, Faith Ellen, Philipp Woelfel: Fully-Adaptive Algorithms for Long-Lived Renaming. DISC 2006: 413-427
69	EE	Faith Ellen, Sivaramakrishnan Subramanian, Jennifer L. Welch: Maintaining Information About Nearby Processors in a Mobile Environment. ICDCN 2006: 193-202
68	EE	Hagit Attiya, Faith Ellen, Panagiota Fatourou: The Complexity of Updating Multi-writer Snapshot Objects. ICDCN 2006: 319-330
67	EE	Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert: Time-space tradeoffs for implementations of snapshots. STOC 2006: 169-178
66	EE	James Aspnes, Faith Ellen Fich, Eric Ruppert: Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Computing 18(3): 209-219 (2006)
65	EE	Faith Ellen Fich, Danny Hendler, Nir Shavit: On the inherent weakness of conditional primitives. Distributed Computing 18(4): 267-277 (2006)
2005
64	EE	Matei David, Alex Brodsky, Faith Ellen Fich: Restricted Stack Implementations. DISC 2005: 137-151
63	EE	Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit: Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. DISC 2005: 493-494
62	EE	Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit: Obstruction-Free Algorithms Can Be Practically Wait-Free. DISC 2005: 78-92
61	EE	Faith Ellen Fich, Danny Hendler, Nir Shavit: Linear Lower Bounds on Real-World Implementations of Concurrent Objects. FOCS 2005: 165-173
60	EE	Faith Ellen Fich: How Hard Is It to Take a Snapshot?. SOFSEM 2005: 28-37
59	EE	Faith Ellen Fich: Introduction to the special issue DISC 2003. Distributed Computing 18(2): 111-111 (2005)
58	EE	Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich: Estimating the maximum. J. Algorithms 54(1): 105-114 (2005)
57	EE	Faith 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
56	EE	James Aspnes, Faith Ellen Fich, Eric Ruppert: Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC 2004: 260-274
55	EE	Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan: Lower bounds for adaptive collect and related objects. PODC 2004: 60-69
54	EE	Alex Brodsky, Faith Ellen Fich: Efficient synchronous snapshots. PODC 2004: 70-79
53	EE	Faith Ellen Fich, Danny Hendler, Nir Shavit: On the inherent weakness of conditional synchronization primitives. PODC 2004: 80-87
2003
52		Faith Ellen Fich: Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings Springer 2003
51	EE	Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert: A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC 2003: 259-268
50	EE	Faith E. Fich, Eric Ruppert: Hundreds of impossibility results for distributed computing. Distributed Computing 16(2-3): 121-163 (2003)
2002
49	EE	Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert: Space-optimal multi-writer snapshot objects are slow. PODC 2002: 13-20
48	EE	Paul Beame, Faith E. Fich: Optimal Bounds for the Predecessor Problem and Related Problems. J. Comput. Syst. Sci. 65(1): 38-72 (2002)
2001
47	EE	Faith E. Fich, Colette Johnen: A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. DISC 2001: 224-239
46		John Watkinson, Micah Adler, Faith E. Fich: New Protocols for Asymmetric Communication Channels. SIROCCO 2001: 337-350
2000
45	EE	Faith Ellen Fich, Eric Ruppert: Lower Bounds in Distributed Computing. DISC 2000: 1-28
44	EE	Faith E. Fich, Andreas Jakoby: Short Headers Suffice for Communication in a DAG with Link Failures. DISC 2000: 360-373
43	EE	Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson: Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767
1999
42	EE	Micah Adler, Faith E. Fich: The Complexity of End-to-End Communication in Memoryless Networks. PODC 1999: 239-248
41	EE	Paul Beame, Faith E. Fich: Optimal Bounds for the Predecessor Problem. STOC 1999: 295-304
1998
40		Faith E. Fich: End to End Communication. OPODIS 1998: 37-44
39	EE	Paul Beame, Faith E. Fich: On Searching Sorted Lists: A Near-Optimal Lower Bound Electronic Colloquium on Computational Complexity (ECCC) 5(28): (1998)
38	EE	Faith Ellen Fich, Maurice Herlihy, Nir Shavit: On the Space Complexity of Randomized Synchronization. J. ACM 45(5): 843-862 (1998)
1997
37		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
36		Faith E. Fich: Infrastructure Issues Related to Theory of Computing Research. ACM Comput. Surv. 28(4es): 217 (1996)
35		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)
34		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
33		Faith E. Fich, Peter Bro Miltersen: Tables Should Be Sorted (On Random Access Machines). WADS 1995: 482-493
32		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)
31		Faith E. Fich, J. Ian Munro, Patricio V. Poblete: Permuting in Place. SIAM J. Comput. 24(2): 266-278 (1995)
1994
30	EE	Joan Boyar, Faith E. Fich, Kim S. Larsen: Bounds on Certain Multiplications of Affine Combinations. Discrete Applied Mathematics 52(2): 155-167 (1994)
1993
29		Faith Ellen Fich, Maurice Herlihy, Nir Shavit: On the Space Complexity of Randomized Synchronization. PODC 1993: 241-249
28		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
27		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
26		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
25		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
24		Faith E. Fich, J. Ian Munro, Patricio V. Poblete: Permuting FOCS 1990: 372-379
23	EE	Faith E. Fich, V. Ramachandran: Lower Bounds for Parallel Computation on Linked Structures. SPAA 1990: 109-116
22		Faith E. Fich, Avi Wigderson: Toward Understanding Exclusive Read. SIAM J. Comput. 19(4): 718-727 (1990)
1989
21	EE	Faith 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)
18	EE	Faith 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
8	EE	Janusz 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

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

Colors in the list of coauthors