( en | de | ru )

 

Disambiguation of "Fich, Faith E."

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Bounds for the Predecessor Problem.

, and . STOC, page 295-304. ACM, (1999)

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

Ursula E E Köhler

 

Other publications of authors with the same name

Lower Bounds for Parallel Computation on Linked Structures., and . SPAA, page 109-116. ACM, (1990)Tables Should Be Sorted (On Random Access Machines)., and . WADS, volume 955 of Lecture Notes in Computer Science, page 482-493. Springer, (1995)Short Headers Suffice for Communication in a DAG with Link Failures., and . DISC, volume 1914 of Lecture Notes in Computer Science, page 360-373. Springer, (2000)A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings., and . DISC, volume 2180 of Lecture Notes in Computer Science, page 224-239. Springer, (2001)A homomorphic characterization of regular languages., , and . Discret. Appl. Math., 4 (2): 149-152 (1982)Lower Bounds for the Cycle Detection Problem. STOC, page 96-105. ACM, (1981)One, Two, Three Infinity: Lower Bounds for Parallel Computation, , , and . STOC, page 48-58. ACM, (1985)Bounds for Width Two Branching Programs, , , and . STOC, page 87-93. ACM, (1983)Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution., , , , and . STACS, volume 665 of Lecture Notes in Computer Science, page 386-397. Springer, (1993)Permuting, , and . FOCS, page 372-379. IEEE Computer Society, (1990)