( en | de | ru )

 

Disambiguation of "Fich, Faith Ellen"

Author of the publication

copydeleteadd this publication to your clipboard
On the inherent weakness of conditional primitives.

, , and . Distributed Comput., 18 (4): 267-277 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Faith Kihiu

Women as agents of democratisation: the role of women's organisations in Kenya (1990 - 2007). Uni Frankfurt Main, (2009)

Mathias Fich

Claudia Fich

Faith Njoki Karanja

Franz Ellendorf

 

Other publications of authors with the same name

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example., , , and . DISC, volume 3724 of Lecture Notes in Computer Science, page 493-494. Springer, (2005)How Hard Is It to Take a Snapshot?.. SOFSEM, volume 3381 of Lecture Notes in Computer Science, page 28-37. Springer, (2005)On the inherent weakness of conditional primitives., , and . Distributed Comput., 18 (4): 267-277 (2006)Time-space tradeoffs for implementations of snapshots., , and . STOC, page 169-178. ACM, (2006)Relationships between broadcast and shared memory in reliable anonymous distributed systems., , and . Distributed Comput., 18 (3): 209-219 (2006)Introduction to the special issue DISC 2003.. Distributed Comput., 18 (2): 111-111 (2005)Restricted Stack Implementations., , and . DISC, volume 3724 of Lecture Notes in Computer Science, page 137-151. Springer, (2005)Obstruction-Free Algorithms Can Be Practically Wait-Free., , , and . DISC, volume 3724 of Lecture Notes in Computer Science, page 78-92. Springer, (2005)Linear Lower Bounds on Real-World Implementations of Concurrent Objects., , and . FOCS, page 165-173. IEEE Computer Society, (2005)Lower bounds for adaptive collect and related objects., , and . PODC, page 60-69. ACM, (2004)