Theory of Distributed Systems (TDS)

Zhiyang Wang: smallWig: Compression on RNA-seq Expression Data
Wednesday, November 19, 2014 - 12:15pm

The start of the 21st century has witnessed a dramatic decrease in the cost of DNA/RNA sequencing. As a result, peta bytes of genomic data are generated per year. However, current storage solutions and prices do not scale appropriately with such massive data surges.

Mira Radeva: Studying House-Hunting in the Temnothorax Ant Using Distributed Computing Theory
Friday, November 14, 2014 - 1:00pm to 2:30pm

We propose using tools from distributed computing to understand the behavior of the Temnothorax ant colonies when relocating to a new nest. We attempt to model the house-hunting process of the ants and study upper and lower bounds for different algorithmic metrics in this model.

Cameron Musco: Linear Sketching and Applications to Distributed Computation
Friday, November 7, 2014 - 1:00pm to 2:30pm

I will give a basic introduction to linear sketching, reviewing important tools that include the Johnson-Lindenstrauss lemma and Heavy-Hitter (sparse recovery) sketches.

Stephan Holzer: The Power of a Leader in the Stone Age
Friday, October 31, 2014 - 1:00am to 2:30pm

It is known that in cellular networks modeled by the stone age model of distributed computing [PODC 2013] certain computations are not possible. This includes electing a leader, computing shortest paths and the diameter of a graph [STOC 1980],[ICALP 2014].

Eli Gafni: Generalized Asynchronous Computability Theorem
Friday, September 19, 2014 - 1:00pm to 2:30pm
I'll review the asynchronous computability theorem (ACT) of Herlihy and Shavit
Merav Parter: The topology of wireless communication
Thursday, June 12, 2014 - 1:00pm to 2:30pm
Abstract: We study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths of other interfering signals plus background noise.
Grigory Yaroslavtsev: Beyond Set Disjointness: The Communication Complexity of Finding the Intersection
Friday, May 16, 2014 - 11:00am to 12:30pm


Jonathan Ponniah: A System-Theoretic Clean Slate Approach to Provably Secure Ad Hoc
Friday, December 13, 2013 - 1:00pm to 2:30pm

Traditionally, wireless network protocols have been designed for performance. Subsequently, as attacks have been identified, patches have been developed. This has resulted in an “arm’s race” development process of discovering vulnerabilities and then patching them.

Alejandro Cornejo: Long-Lived Distributed Localization of Robot Swarms
Friday, November 22, 2013 - 1:00pm to 2:30pm

In the context of large swarms of simple robots which are capable of measuring only the distance to near-by robots, we study the problem of maintaining an estimate of the relative position and relative orientation of other near-by robots in the environment.

Vasileios Trigonakis: Everything you always wanted to know about synchronization, but were afraid to ask
Friday, November 8, 2013 - 1:00pm to 2:30pm

Joint TDS/C++ Seminar


Subscribe to Theory of Distributed Systems (TDS)