Filters








4 Hits in 10.4 sec

Decentralizing Information Technology: The Advent of Resource Based Systems [article]

Aggelos Kiayias
2021 arXiv   pre-print
The growth of the Bitcoin network during the first decade of its operation to a global scale system is a singular event in the deployment of Information Technology systems.  ...  Can this approach serve as a wider paradigm for Information Technology services beyond the use case of digital currencies?  ...  Schwarzmann, editors, Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pages 315–324. ACM, 2017. [29] Marshall C.  ... 
arXiv:2112.09941v2 fatcat:daiiimnipfe2lhjhbwcvc2rocm

Distributed Distance Approximation

Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams, Quentin Bramas, Rotem Oshman, Paolo Romano
2021
On the lower bound side, our constructions introduce the usage of new functions into the framework of reductions from 2-party communication complexity to distributed algorithms.  ...  In this paper, we give a near complete characterization of the trade-offs between approximation ratios and round complexity of distributed algorithms for approximating these parameters, with a focus on  ...  In Peter Robinson and Faith Ellen, editors, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 -August 2, 2019, pages 74-83.  ... 
doi:10.4230/lipics.opodis.2020.30 fatcat:ogfplphjk5gmjj627plcbw2rr4

On Two-Pass Streaming Algorithms for Maximum Bipartite Matching

Christian Konrad, Kheeran K. Naidu, Mary Wootters, Laura Sanità
2021
Furthermore, we combine the two main techniques, i.e., subsampling followed by the Greedy matching algorithm [Konrad, MFCS'18] which gives a 2-√2 ≈ 0.5857-approximation, and the computation of degree-bounded  ...  We give the following results: We show that every two-pass streaming algorithm that solely computes a maximal matching in the first pass and outputs a (2/3+ε)-approximation requires n^{1+Ω(1/(log log n  ...  In Peter Robinson and Faith Ellen, editors, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 -August 2, 2019, pages 491-500.  ... 
doi:10.4230/lipics.approx/random.2021.19 fatcat:j3ps6bl3jvfmtiifwdjvss7v74

Continuous Tasks and the Asynchronous Computability Theorem

Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid, Mark Braverman
2022
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit characterized distributed tasks that are wait-free solvable and uncovered deep connections with combinatorial topology  ...  venue for future research: For the well-known approximate agreement task, we show that one can easily encode the desired proportion of the occurrence of specific outputs, namely, exact agreement, in the  ...  In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 -August 2, 2019., pages 218-227, 2019.  ... 
doi:10.4230/lipics.itcs.2022.73 fatcat:dvwc6i3ar5dfvl6xxtbw3dxgfe