Theory of Distributed Computing (TDS)
 |
Lili Su: Learning with Distributed Systems: Adversary-Resilience and Neural Networks Friday, October 18, 2019 - 1:00pm to 2:30pm In this talk, I will first talk about how to secure Federated Learning (FL) against adversarial faults. FL is a new distributed learning paradigm proposed by Google. |
|
|
Lower Bounds for Dynamic Distributed Task Allocation Friday, May 10, 2019 - 1:00pm to 2:30pm Abstract: I will talk about problem of distributed task allocation in multi-agent systems. |
|
|
Brabeeba Wang: Integrating Temporal Information to Spatial Information in a Neural Circuit Friday, March 8, 2019 - 1:00pm to 2:30pm Algorithms in the brain are inherently distributed. |
|
|
Quanquan Liu: On Bioelectric Algorithms: A Novel Application of Theoretical Computer Science to Core Problems in Developmental Biology. Authors: Seth Gilbert, James Maguire, Calvin Newport Friday, December 14, 2018 - 1:00pm to 2:30pm Previous experimental studies have suggested that cellular bioelectricity plays a key role in organism developmental processes such as tissue regeneration, tumor suppression, and embryogenesis. |
|
|
Lewis Tseng: Resilient Causal Memory in Client-Server Model Friday, December 7, 2018 - 1:00pm to 2:30pm We study how to emulate resilient causal memory in the client-server model over asynchronous message- passing network. |
|
|
Rati Gelashvili: Why Extension-based Proofs Fail Friday, November 30, 2018 - 1:00pm to 2:30pm We prove that a class of fundamental shared memory tasks are not amenable to certain standard proof techniques in the field. |
|
|
Adam Alon: Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity Friday, October 12, 2018 - 1:00pm to 2:30pm Abstract: We present a deterministic abortable mutual exclusion algorithm for a cache-coherent (CC) model with read, write, Fetch-And-Add (F&A), and CAS primitives, whose RMR complexity is O(log_W N) , where W is the size of the F& |
|
|
Kishori Konwar: FLECKS-Fast Lean Erasure-coded Consistent Key-value Store Friday, September 14, 2018 - 1:00pm to 2:30pm Creating highly-available and cost-effective large-scale distributed object storage systems with useful consistency guarantees is at the heart of enabling the implementation of many Internet-based applications. |
|
|
Nancy Lynch: An Algorithmic Theory of Brain Networks Friday, May 18, 2018 - 1:00pm to 2:30pm |
|
|
Ren Ling: Efficient Synchronous Byzantine Consensus Friday, May 4, 2018 - 1:00pm to 2:30pm |
|
|
Mohsen Ghaffari: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover Friday, April 13, 2018 - 1:00pm to 2:30pm In this white-board talk, I will explain some new Massively Parallel Computation (MPC) algorithms for graph problems such as approximating maximum matching and minimum vertex cover. |
|
|
Lili Su: Collaboratively Learning the Best Option, Using Bounded Memory Friday, March 16, 2018 - 12:00pm to 1:30pm |
|
|
Frederik Mallmann-Trenn: Self-Stabilizing Task Allocation in Spite of Noise Friday, March 9, 2018 - 1:00pm to 2:30pm We study the problem of distributed task allocation inspired by the behavior of various ant species, which are known to perform task allocation efficiently in a setting of limited capabilities and noisy environment feedback. |
|
|
Dominik Pajak: Broadcast in stochastically varying networks Friday, March 2, 2018 - 1:00pm to 2:30pm In this talk, we will study a problem of broadcast in radio networks, |
|
|
Kishori Konwar: RECS : Reconfigurable, Erasure coded, Consistent Storage Friday, November 17, 2017 - 1:00pm to 2:30pm We present a new dynamic distributed storage system, which offers strong consistency guarantee for read and write operations. Large-scale distributed storage systems are at the heart of many cloud and web-based data-dependent applications. |
|
|
Lewis Tseng: Fault-tolerant Consensus in Directed Networks Friday, October 13, 2017 - 1:00pm to 2:30pm We studied various fault-tolerant consensus problems under different fault models in communication networks that are modeled as arbitrary directed graphs. |
|
|
Lilika Markatou: Leader Election in the SINR Model with Arbitrary Power Control Friday, September 15, 2017 - 1:00pm to 2:30pm We study the Leader Election Problem in the Signal-to-Interference-plus-No |
|
|
Merav Parter: Graph Algorithms for Distributed Networks Friday, December 16, 2016 - 1:00pm to 2:30pm I will describe two branches of my work related to algorithms for distributed networks. The main focus will be devoted for fault tolerant network design and fault tolerant BFS structures. |
