Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Varsha Dani"'
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031327322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c319306fc8e7e2b16b31b0bef3688838
https://doi.org/10.1007/978-3-031-32733-9_16
https://doi.org/10.1007/978-3-031-32733-9_16
Publikováno v:
PODC
We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited resource. Working
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2923cb6a53c20a0a65a2048eb69f8e6
https://doi.org/10.1145/3465084.3467950
https://doi.org/10.1145/3465084.3467950
Publikováno v:
ICDCN
A group of n players wants to run a distributed protocol ρ over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows P, is able to maliciously flip bits on the channels. Can we efficiently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8272e1abb2994b0eb639628f398a1a54
https://doi.org/10.1145/3369740.3369771
https://doi.org/10.1145/3369740.3369771
Publikováno v:
PODC
We consider a model of energy complexity in Radio Networks in which transmitting or listening on the channel costs one unit of energy and computation is free. This simplified model captures key aspects of battery-powered sensors: that battery life is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95baa44fd95f34a041d0d8afd5181aa5
Publikováno v:
PODC
A group of n players wants to run a distributed protocol ℘ over a network where communication occurs via private point-to-point channels. Can we efficiently simulate ℘ in the presence of an adversary who knows ℘ and is able to maliciously flip
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::461ba2fd3fdbcda08f56d2cc042b2443
https://doi.org/10.1145/3293611.3331571
https://doi.org/10.1145/3293611.3331571
Publikováno v:
Random Structures & Algorithms. 49:742-765
In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well-known that if the parties have predetermined roles, then the strategy where one of them
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad0eb187e1eb46619cf2d121ed7f836c
https://doi.org/10.1002/rsa.20691
https://doi.org/10.1002/rsa.20691
Publikováno v:
Distributed Computing. 30:193-229
We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a large number of parties. We consider both the synchronous and the asynchronous communication models. In the synchronous setting, our protocol is secur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7591591019e3a07ed08a91c13a98232
https://doi.org/10.1007/s00446-016-0284-9
https://doi.org/10.1007/s00446-016-0284-9
Publikováno v:
PODC
Energy is often the most constrained resource in networks of battery-powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true ene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d37016334888ebad1b7de200bd9c1033
https://doi.org/10.1145/3212734.3212774
https://doi.org/10.1145/3212734.3212774
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 32
Mechanisms for aggregating the preferences of agents in elections need to balance many different considerations, including efficiency, information elicited from agents, and manipulability. We consider the utilitarian social welfare of mechanisms for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::417f42cfa006d916832344f2b37ea49b
https://doi.org/10.1609/aaai.v32i1.11480
https://doi.org/10.1609/aaai.v32i1.11480
Autor:
Seth Pettie, Jeremy T. Fineman, Varsha Dani, Seth Gilbert, Michael A. Bender, Mahnush Movahedi, Jared Saia, Maxwell Young
Publikováno v:
ACM SIGACT News. 46:57-71
The point of adversarial analysis is to model the worst-case performance of an algorithm. Unfortunately, this analysis may not always reect performance in practice because the adversarial assumption can be overly pessimistic. In such cases, several t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecec34608e91091764fbb2a7677c8295
https://doi.org/10.1145/2818936.2818949
https://doi.org/10.1145/2818936.2818949