Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Rati Gelashvili"'
Autor:
Shir Cohen, Rati Gelashvili, Lefteris Kokoris Kogias, Zekun Li, Dahlia Malkhi, Alberto Sonnino, Alexander Spiegelman
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783031182822
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6917cafb7eddabbdb65f114fad93fbbe
https://doi.org/10.1007/978-3-031-18283-9_13
https://doi.org/10.1007/978-3-031-18283-9_13
Autor:
Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, Zhuolun Xiang
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783031182822
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab07636313c0b4533fbe12a355c8dcf6
https://doi.org/10.1007/978-3-031-18283-9_14
https://doi.org/10.1007/978-3-031-18283-9_14
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783031182822
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a68e1839c994693c9de0967c183a26c5
https://doi.org/10.1007/978-3-031-18283-9_26
https://doi.org/10.1007/978-3-031-18283-9_26
Publikováno v:
PODC
The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT SMR protocol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9307e7e605fcc5e4514f0de96360c331
https://doi.org/10.1145/3465084.3467941
https://doi.org/10.1145/3465084.3467941
Publikováno v:
Springer Berlin Heidelberg
For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best explanation of the relative power of various objects. Since real multiprocessors allow the different instructions they support to be applied to any memory l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a401b5aa044630d3729db22d92802ca4
https://doi.org/10.1007/s00446-019-00361-3
https://doi.org/10.1007/s00446-019-00361-3
Publikováno v:
Proceedings of the 35th International Symposium on Distributed Computing (DISC 2021)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=r3c4b2081b22::3dd71db0ecc06c1e264976ad1d230b02
Publikováno v:
PODC
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aeb83bf6e64e1d3bee2af8f1c9293006
https://doi.org/10.1145/3382734.3405743
https://doi.org/10.1145/3382734.3405743
Autor:
Rati Gelashvili, Dan Alistarh
Publikováno v:
ACM SIGACT News. 49:63-73
Population protocols are a popular model of distributed computing, introduced by Angluin, Aspnes, Diamadi, Fischer, and Peralta [6] a little over a decade ago. In the meantime, the model has proved a useful abstraction for modeling various settings,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0436846f5f8b8d12070f6743cc8887d2
https://doi.org/10.1145/3289137.3289150
https://doi.org/10.1145/3289137.3289150
Autor:
Rati Gelashvili
Publikováno v:
Distributed Computing. 31:317-326
The optimal space complexity of consensus in asynchronous shared memory was an open problem for two decades. For a system of n processes, no algorithm using a sublinear number of registers is known. Up until very recently, the best known lower bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7553bf7dca0ac7423db29e108ad6259a
https://doi.org/10.1007/s00446-018-0331-9
https://doi.org/10.1007/s00446-018-0331-9
Publikováno v:
Theory of Computing Systems
Many shared memory algorithms have to deal with the problem of determining whether the value of a shared object has changed in between two successive accesses of that object by a process when the responses from both are the same. Motivated by this pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a02a56ce59072164eec29f415b1b802