Zobrazeno 1 - 10
of 132
pro vyhledávání: '"Moses Charikar"'
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_________::48db61f44df5f975b4a52e7d545959e4
https://doi.org/10.1137/1.9781611977554.ch33
https://doi.org/10.1137/1.9781611977554.ch33
Publikováno v:
Proceedings of the VLDB Endowment. 13:2174-2187
An emerging class of data systems partition their data and precompute approximate summaries (i.e., sketches and samples) for each segment to reduce query costs. They can then aggregate and combine the segment summaries to estimate results without sca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::121caa96af5340d55717d2af5906c225
https://doi.org/10.14778/3407790.3407817
https://doi.org/10.14778/3407790.3407817
Publikováno v:
PODC
We give a randomness-efficient Massively Parallel Computation (MPC) algorithm for deciding whether an undirected graph is connected. For Connectivity on n-vertex, m-edge graphs whose components have diameter at most D = 2o(log n/ log log n), our algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8604f7a1c60dd81aa70783162161e9a3
https://doi.org/10.1145/3465084.3467951
https://doi.org/10.1145/3465084.3467951
Autor:
Guy Blanc, Moses Charikar
We give a $0.5368$-competitive algorithm for edge-weighted online bipartite matching. Prior to our work, the best competitive ratio was $0.5086$ due to Fahrbach, Huang, Tao, and Zadimoghaddam (FOCS 2020). They achieved their breakthrough result by de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a772077467d705ff3dac4af5b866515c
http://arxiv.org/abs/2106.05579
http://arxiv.org/abs/2106.05579
Publikováno v:
SPAA
We consider unconditional lower bounds in the Adaptive Massively Parallel Computation (AMPC) model introduced by Behnezhad et al. (SPAA 19), which is an adaptive variant of the Massively Parallel Computation (MPC) model. Our first contribution is an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62fcbf89d0028b12f918bdef8c1fe8c7
https://doi.org/10.1145/3350755.3400230
https://doi.org/10.1145/3350755.3400230
Publikováno v:
SIGCSE
Five institutions awarded grants by the Hopper-Dean foundation to develop interventions that would advance diversity in computer science will present their initiatives and results. This panel will allow them to share what was successful, what was cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6af7111dbac685ead254210258cb29f3
https://doi.org/10.1145/3328778.3366976
https://doi.org/10.1145/3328778.3366976
Colonies of the arboreal turtle ant create networks of trails that link nests and food sources on the graph formed by branches and vines in the canopy of the tropical forest. Ants put down a volatile pheromone on edges as they traverse them. At each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::259d4def92e0660d76dd05a111151808