We are happy to present a collection of abstract talks about papers from SODA 2012 (ACM-SIAM Symposium on Discrete Algorithms) to be held in Kyoto, Japan, January 17-19, 2012.
Enjoy!
- SINR Diagram with Interference Cancellation
- Metastability of Logit Dynamics for Coordination Games
- Wireless Connectivity and Capacity
- Approximation Algorithms for Stochastic Orienteering
- The Notion of a Rational Convex Program, and an Algorithm for the Arrow-Debreu Nash Bargaining Game
- On the communication and streaming complexity of maximum bipartite matching
- Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
- Exact Distance Oracles for Planar Graphs
- Ultra-Fast Rumor Spreading in Social Networks
- Information Dissemination via Random Walks in d-Dimensional Space
- Networks Cannot Compute Their Diameter in Sublinear Time
- Rumor Spreading and Vertex Expansion
- Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks
- The maximum number of faces of the Minkowski sum of two convex polytopes
- An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
- Scheduling Heterogeneous Processors Isn't As Easy As You Think
- A Proof of the Boyd-Carr Conjecture
Podcast 
iTunes 
Email Newsletter
