( en | de | ru )

 

Disambiguation of "Pelc, Andrzej"

Author of the publication

copydeleteadd this publication to your clipboard
How much memory is needed for leader election.

, and . Distributed Comput., 24 (2): 65-78 (2011)

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.

Christopher Pelczar

Penelope Pelczar

Gernot Pelchrzim

Christoph Pelchen

Kuno Pelckmann

 

Other publications of authors with the same name

Transducers with Set Output., , and . Journal of Automata, Languages and Combinatorics, 10 (1): 37-49 (2005)Searching for a Black Hole in Synchronous Tree Networks., , , and . Comb. Probab. Comput., 16 (4): 595-619 (2007)Deterministic distributed construction of T-dominating sets in time T., and . Discret. Appl. Math., (2017)How much memory is needed for leader election., and . Distributed Comput., 24 (2): 65-78 (2011)Deterministic polynomial approach in the plane., and . Distributed Comput., 28 (2): 111-129 (2015)Special issue on DISC 07.. Distributed Comput., 21 (2): 85 (2008)Leader election for anonymous asynchronous agents in arbitrary networks., and . Distributed Comput., 27 (1): 21-38 (2014)Time versus cost tradeoffs for deterministic rendezvous in networks., and . Distributed Comput., 29 (1): 51-64 (2016)Voting Mechanisms in Asynchronous Byzantine Environments.. Parallel Process. Lett., 16 (1): 93-100 (2006)An Optimal Algorithm for Broadcasting Multiple Messages in Trees., , and . SIROCCO, page 69-80. Carleton Scientific, (1997)