Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Denysyuk, Oksana"'
Autor:
Denysyuk, Oksana, Rodrigues, Luis
Renaming is a fundamental problem in distributed computing, which consists of a set of processes picking distinct names from a given namespace. The paper presents algorithms that solve order-preserving renaming in synchronous message passing systems
Externí odkaz:
http://arxiv.org/abs/1205.0477
The problem of reliably transferring data from a set of $N_P$ producers to a set of $N_C$ consumers in the BAR model, named N-party BAR Transfer (NBART), is an important building block for volunteer computing systems. An algorithm to solve this probl
Externí odkaz:
http://arxiv.org/abs/1204.4044
Autor:
Denysyuk, Oksana, Rodrigues, Luis
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the undirected dy
Externí odkaz:
http://arxiv.org/abs/1101.5944
Publikováno v:
18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016)
18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France
18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France
International audience; This paper considers the fundamental problem of self-stabilizing leader election (SSLE) in the model of population protocols. In this model an unknown number of asynchronous, anonymous and finite state mobile agents interact i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8e413ce54654fc595473d6e027776ada
https://hal.science/hal-00839759v3
https://hal.science/hal-00839759v3
The problem of reliably transferring data from a set of $N_P$ producers to a set of $N_C$ consumers in the BAR model, named N-party BAR Transfer (NBART), is an important building block for volunteer computing systems. An algorithm to solve this probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1dfa78de4cccee7f8c7d7a247b0162ba
http://arxiv.org/abs/1204.4044
http://arxiv.org/abs/1204.4044
On the Power of Oracle $$\VAROMEGA ?$$ for Self-Stabilizing Leader Election in Population Protocols.
Publikováno v:
Stabilization, Safety & Security of Distributed Systems: 18th International Symposium, SSS 2016, Lyon, France, November 7-10, 2016, Proceedings; 2016, p20-35, 16p
Autor:
Denysyuk, Oksana, Woelfel, Philipp
Publikováno v:
Distributed Computing 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings; 2015, p60-74, 15p
Autor:
Denysyuk, Oksana, Rodrigues, Luís
Publikováno v:
Distributed Computing: 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings; 2014, p333-345, 13p
Autor:
Denysyuk, Oksana, Rodrigues, Luis
Publikováno v:
2013 IEEE 33rd International Conference on Distributed Computing Systems; 2013, p276-285, 10p
Publikováno v:
2011 IEEE 36th Conference on Local Computer Networks (LCN); 2011, p287-290, 4p