☰

Faith Fich - Publications

Affiliations: 
University of Toronto, Toronto, ON, Canada 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

16 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2006 Aspnes J, Fich F, Ruppert E. Relationships between broadcast and shared memory in reliable anonymous distributed systems Distributed Computing. 18: 209-219. DOI: 10.1007/S00446-005-0145-4  0.481
2006 Fatourou P, Fich FE, Ruppert E. Time-space tradeoffs for implementations of snapshots Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 169-178.  0.573
2005 Fich FE, Hendler D, Shavit N. Linear lower bounds on real-world implementations of concurrent objects Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2005: 165-173. DOI: 10.1109/SFCS.2005.47  0.323
2005 Fich FE. How hard is it to take a snapshot? Lecture Notes in Computer Science. 3381: 28-37.  0.315
2003 Fich F, Ruppert E. Hundreds of impossibility results for distributed computing Distributed Computing. 16: 121-163. DOI: 10.1007/S00446-003-0091-Y  0.539
2003 Fatourou P, Fich F, Ruppert E. A tight time lower bound for space-optimal implementations of multi-writer snapshots Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 259-268.  0.559
2002 Fatourou P, Fich F, Ruppert E. Space-optimal multi-writer snapshot objects are slow Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 13-20.  0.553
2000 Fich F, Ruppert E. Lower bounds in distributed computing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1914: 1-28. DOI: 10.1007/3-540-40026-5_1  0.494
1998 Fich F, Herlihy M, Shavit N. On the Space Complexity of Randomized Synchronization Journal of the Acm. 45: 843-862. DOI: 10.1145/290179.290183  0.424
1996 Dymond PW, Fich FE, Nishimura N, Ragde P, Ruzzo WL. Pointers versus arithmetic in PRAMs Journal of Computer and System Sciences. 53: 218-232. DOI: 10.1006/Jcss.1996.0063  0.333
1996 Fich FE, Impagliazzo R, Kapron B, King V, Kutyłowski M. Limits on the power of parallel random access machines with weak forms of write conflict resolution Journal of Computer and System Sciences. 53: 104-111. DOI: 10.1006/Jcss.1996.0052  0.386
1995 Fich F, Miltersen PB. Tables should be sorted (On random access machines) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 955: 482-493. DOI: 10.7146/Brics.V2I26.19928  0.428
1994 Boyar J, Fich F, Larsen KS. Bounds on certain multiplications of affine combinations Discrete Applied Mathematics. 52: 155-167. DOI: 10.1016/0166-218X(94)90079-5  0.362
1989 Fich FE, Li M, Ragde P, Yesha Y. On the power of concurrent-write PRAMs with read-only memory Information and Computation. 83: 234-244. DOI: 10.1016/0890-5401(89)90059-X  0.333
1988 Fich FE, Ragde P, Wigderson A. Simulations among concurrent-write PRAMs Algorithmica. 3: 43-51. DOI: 10.1007/Bf01762109  0.312
1987 Borodin A, Fich F, Meyer Auf Der Heide F, Upfal E, Wigderson A. TIME-SPACE TRADEOFF FOR ELEMENT DISTINCTNESS Siam Journal On Computing. 16: 97-99. DOI: 10.1137/0216007  0.346
Show low-probability matches.