Saturday, September 17, 2011

SODA accepts from Brown

This is an ad for Brown Algorithms. The list of papers accepted to Soda is out. I noticed the high number of papers with authors from Brown. Among those, the PhD students are: David Eisenstat, Shay Mozes, and Olga Ohrimenko. Here is the list:

An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
David Eisenstat, Philip Klein and Claire Mathieu

A Polynomial-time Approximation Scheme for Planar Multiway Cut
Mohammadhossein Bateni, Mohammadtaghi Hajiaghayi, Philip Klein and Claire Mathieu

Exact Distance Oracles for Planar Graphs
Shay Mozes and Christian Sommer

Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks
John Augustine, Gopal Pandurangan, Peter Robinson and Eli Upfal

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their
Haim Kaplan, Shay Mozes, Yahav Nussbaum and Micha Sharir

Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation
Michael Goodrich, Michael Mitzenmacher, Olga Ohrimenko and Roberto Tamassia

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.