( en | de | ru )

 

Disambiguation of "Lynch, Nancy A."

Author of the publication

copydeleteadd this publication to your clipboard
Counting Networks are Practically Linearizable.

, , , and . PODC, page 280-289. ACM, (1996)

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.

Enrique A J Lynch Frigeiro

Philip Lynch

John Lynch

Matthew Lynch

Grit Lynch

 

Other publications of authors with the same name

A Dynamic View-Oriented Group Communication Service., , , and . PODC, page 227-236. ACM, (1998)A Tight Lower Bound for k-Set Agreement, , , and . FOCS, page 206-215. IEEE Computer Society, (1993)Revisiting the Paxos Algorithm., , and . WDAG, volume 1320 of Lecture Notes in Computer Science, page 111-125. Springer, (1997)Specifying and using a partitionable group communication service., , and . ACM Trans. Comput. Syst., 19 (2): 171-216 (2001)Upper Bounds for Static Resource Allocation in a Distributed System.. J. Comput. Syst. Sci., 23 (2): 254-278 (1981)Straight-Line Program Length as a Parameter for Complexity Analysis.. J. Comput. Syst. Sci., 21 (3): 251-280 (1980)The impossibility of boosting distributed service resilience., , , , and . Inf. Comput., 209 (6): 927-950 (2011)An Upper and Lower Bound for Clock Synchronization, and . Inf. Control., 62 (2/3): 190-204 (August 1984)A Basic Compositional Model for Spiking Neural Networks., and . A Journey from Process Algebra via Timed Automata to Model Learning, volume 13560 of Lecture Notes in Computer Science, page 403-449. Springer, (2022)Motion Coordination using Virtual Nodes., , and . CDC/ECC, page 2823-2828. IEEE, (2005)