Faith E. Fich - RankMe

58 papers A* 16A 6B 6Journal 28Unranked 2

Year	Rank	Type	Title / Venue / Authors
2005	J	`jnl`	Estimating the maximum. J. Algorithms Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich
2004	A*	`conf`	On the inherent weakness of conditional synchronization primitives. PODC Faith E. Fich, Danny Hendler, Nir Shavit
2004	A	`conf`	Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC James Aspnes, Faith E. Fich, Eric Ruppert
2003	A*	`conf`	A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC Panagiota Fatourou, Faith E. Fich, Eric Ruppert
2003	J	`jnl`	Hundreds of impossibility results for distributed computing. Distributed Comput. Faith E. Fich, Eric Ruppert
2002	J	`jnl`	Optimal Bounds for the Predecessor Problem and Related Problems. J. Comput. Syst. Sci. Paul Beame, Faith E. Fich
2002	A*	`conf`	Space-optimal multi-writer snapshot objects are slow. PODC Panagiota Fatourou, Faith E. Fich, Eric Ruppert
2001	A	`conf`	A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. DISC Faith E. Fich, Colette Johnen
2001	B	`conf`	New Protocols for Asymmetric Communication Channels. SIROCCO John Watkinson, Micah Adler, Faith E. Fich
2000	A	`conf`	Lower Bounds in Distributed Computing. DISC Faith E. Fich, Eric Ruppert
2000	A	`conf`	Short Headers Suffice for Communication in a DAG with Link Failures. DISC Faith E. Fich, Andreas Jakoby
2000	A*	`conf`	Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson
1999	A*	`conf`	Optimal Bounds for the Predecessor Problem. STOC Paul Beame, Faith E. Fich
1999	A*	`conf`	The Complexity of End-to-End Communication in Memoryless Networks. PODC Micah Adler, Faith E. Fich
1998	B	`conf`	End to End Communication. OPODIS Faith E. Fich
1998	J	`jnl`	On Searching Sorted Lists: A Near-Optimal Lower Bound Electron. Colloquium Comput. Complex. Paul Beame, Faith E. Fich
1998	J	`jnl`	On the Space Complexity of Randomized Synchronization. J. ACM Faith E. Fich, Maurice Herlihy, Nir Shavit
1997	J	`jnl`	Infrastructure issues related to theory of computing research. SIGACT News Faith E. Fich
1997	J	`jnl`	Separating the Power of EREW and CREW PRAMs with Small Communication Width. Inf. Comput. Paul Beame, Faith E. Fich, Rakesh K. Sinha
1997	J	`jnl`	Strategic directions in research in theory of computing. SIGACT News Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
1996	J	`jnl`	Infrastructure Issues Related to Theory of Computing Research. ACM Comput. Surv. Faith E. Fich
1996	J	`jnl`	Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. J. Comput. Syst. Sci. Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
1996	J	`jnl`	Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
1995	J	`jnl`	Permuting in Place. SIAM J. Comput. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
1995	J	`jnl`	Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Comput. Complex. Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
1995	B	`conf`	Tables Should Be Sorted (On Random Access Machines). WADS Faith E. Fich, Peter Bro Miltersen
1994	J	`jnl`	Bounds on Certain Multiplications of Affine Combinations. Discret. Appl. Math. Joan Boyar, Faith E. Fich, Kim S. Larsen
1993	A	`conf`	Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. STACS Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski
1993	A*	`conf`	On the Space Complexity of Randomized Synchronization. PODC Faith E. Fich, Maurice Herlihy, Nir Shavit
1993	—	`conf`	Pointers versus Arithmetic in PRAMs. SCT Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
1993	B	`conf`	Separating the Power of EREW and CREW PRAMs with Small Communication Width. WADS Paul Beame, Faith E. Fich, Rakesh K. Sinha
1992	—	`conf`	Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
1990	B	`conf`	Lower Bounds for Parallel Computation on Linked Structures. SPAA Faith E. Fich, Vijaya Ramachandran
1990	A*	`conf`	Permuting FOCS Faith E. Fich, J. Ian Munro, Patricio V. Poblete
1990	J	`jnl`	Preface. Discret. Appl. Math. Faith E. Fich
1990	J	`jnl`	Toward Understanding Exclusive Read. SIAM J. Comput. Faith E. Fich, Avi Wigderson
1989	J	`jnl`	On the Power of Concurrent-Write PRAMs With Read-Only Memory Inf. Comput. Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha
1989	B	`conf`	Towards Understanding Exclusive Read. SPAA Faith E. Fich, Avi Wigderson
1988	J	`jnl`	A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1988	J	`jnl`	Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
1988	J	`jnl`	Simulations Among Concurrent-Write PRAMs. Algorithmica Faith E. Fich, Prabhakar Ragde, Avi Wigderson
1988	J	`jnl`	The parallel complexity of exponentiating polynomials over finite fields. J. ACM Faith E. Fich, Martin Tompa
1987	J	`jnl`	A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1986	A	`conf`	A Time-Space Tradeoff for Element Distinctness. STACS Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1986	A*	`conf`	A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
1986	J	`jnl`	Bounds for Width Two Branching Programs. SIAM J. Comput. Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
1985	A*	`conf`	One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation STOC Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
1985	A*	`conf`	The Parallel Complexity of Exponentiating Polynomials over Finite Fields STOC Faith E. Fich, Martin Tompa
1984	J	`jnl`	On generalized locally testable languages. Discret. Math. Janusz A. Brzozowski, Faith E. Fich
1984	A*	`conf`	Relations Between Concurrent-Write Models of Parallel Computation. PODC Faith E. Fich, Prabhakar Ragde, Avi Wigderson
1983	A*	`conf`	Bounds for Width Two Branching Programs STOC Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
1983	J	`jnl`	Lower Bounds for the Cycle Detection Problem. J. Comput. Syst. Sci. Faith E. Fich
1983	A*	`conf`	New Bounds for Parallel Prefix Circuits STOC Faith E. Fich
1982	J	`jnl`	A homomorphic characterization of regular languages. Discret. Appl. Math. Karel Culík II, Faith E. Fich, Arto Salomaa
1981	A*	`conf`	Lower Bounds for the Cycle Detection Problem STOC Faith E. Fich
1980	J	`jnl`	Languages of R-Trivial Monoids. J. Comput. Syst. Sci. Janusz A. Brzozowski, Faith E. Fich
1979	A*	`conf`	A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. ICALP Faith E. Fich, Janusz A. Brzozowski
1979	J	`jnl`	A Generalized Setting for Fixpoint Theory. Theor. Comput. Sci. Edward A. Ashcroft, Faith E. Fich