We are happy to present a collection of abstract talks about papers from SODA 2014 (Symposioum on Discrete Algorithms) Portland, USA.
- Fault Tolerant Approximate BFS Trees
- A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage
- Lower Bounds for Distinct Elements in the Message Passing Model
- Improved bounds and algorithms for graph cuts and network reliability