Faith Fich
Affiliations: | University of Toronto, Toronto, ON, Canada |
Area:
Computer ScienceGoogle:
"Faith Fich"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Aspnes J, Fich F, Ruppert E. (2006) Relationships between broadcast and shared memory in reliable anonymous distributed systems Distributed Computing. 18: 209-219 |
Fatourou P, Fich FE, Ruppert E. (2006) Time-space tradeoffs for implementations of snapshots Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 169-178 |
Fich FE, Hendler D, Shavit N. (2005) Linear lower bounds on real-world implementations of concurrent objects Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2005: 165-173 |
Fich FE. (2005) How hard is it to take a snapshot? Lecture Notes in Computer Science. 3381: 28-37 |
Fich F, Ruppert E. (2003) Hundreds of impossibility results for distributed computing Distributed Computing. 16: 121-163 |
Fatourou P, Fich F, Ruppert E. (2003) 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 |
Fatourou P, Fich F, Ruppert E. (2002) Space-optimal multi-writer snapshot objects are slow Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 13-20 |
Fich F, Ruppert E. (2000) 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 |
Fich F, Herlihy M, Shavit N. (1998) On the Space Complexity of Randomized Synchronization Journal of the Acm. 45: 843-862 |
Dymond PW, Fich FE, Nishimura N, et al. (1996) Pointers versus arithmetic in PRAMs Journal of Computer and System Sciences. 53: 218-232 |