Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Leqi Zhu"'
Publikováno v:
Journal of Cloud Computing: Advances, Systems and Applications, Vol 12, Iss 1, Pp 1-9 (2023)
Abstract According to the connotation and structure of government service resources, data of government service resources in L city from 2019 to 2021 are used to calculate the efficiency of government service resource allocation in each county and re
Externí odkaz:
https://doaj.org/article/4ee5027a2c104f80857f790d243e8ff5
Publikováno v:
SIAM Journal on Computing; 2024, Vol. 53 Issue 4, p1039-1084, 46p
Publikováno v:
IEEE Sensors Journal. 22:11034-11044
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c756c1a8ff7b4ef7c83999378ce6890
https://doi.org/10.1109/jsen.2022.3170295
https://doi.org/10.1109/jsen.2022.3170295
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3608bef85ad0bbd17653b92cff532f9
https://doi.org/10.1137/1.9781611977554.ch165
https://doi.org/10.1137/1.9781611977554.ch165
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:
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
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
Autor:
LEQI ZHU1 lezhu@cs.toronto.edu
Publikováno v:
SIAM Journal on Computing. 2021, Vol. 50 Issue 3, p18-29. 12p.
Publikováno v:
PODC
Determining the space complexity of $x$-obstruction-free $k$-set agreement for $x\leq k$ is an open problem. In $x$-obstruction-free protocols, processes are required to return in executions where at most $x$ processes take steps. The best known uppe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b47aacc7e3f37d7c34e64f493f2082e
https://doi.org/10.1145/3212734.3212749
https://doi.org/10.1145/3212734.3212749
Autor:
Leqi Zhu
Publikováno v:
STOC
Existing n-process randomized wait-free (and obstruction-free) consensus protocols from registers all use at least n registers. In 1992, it was proved that such protocols must use Omega(sqrt(n)) registers. Recently, this was improved to Omega(n) regi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a65850f064f252416676d3c3b1af3cd
https://doi.org/10.1137/16m1096785
https://doi.org/10.1137/16m1096785