Duke Wiki  logo
Child pages
  • Theory Reading Group, Fall 2013

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.


09/06/1310:00 amLSRC D309Sungjin ImConstructive Discrepancy Minimization by walking on the edges, Lovett and Meka
09/13/1310:00 amNorth 311Janardhan Kulkarni Approximating Bin Packing within O(log OPT log log OPT) bins, Rothvosshttp://arxiv.org/abs/1301.4010
09/20/1310:00 amNorth 311Kamesh Munagala

The weighted majority algorithm, and applications to fast, parallel algorithm design

09/27/1310:00 amNorth 311Debmalya Panigrahi

Electrical flows, Laplacian systems and faster approximation of maximum flow in undirected graphs, Christiano, Kelner, Madry, Spielman, and Teng

10/04/1310:00 amNorth 311Vahid Liaghat Eight-Fifth Approximation for TSP Paths, Sebohttp://arxiv.org/abs/1209.3523
10/11/1310:00 am

North 311

Jiangwei Pan A constructive proof of the general Lovász Local Lemma, Moser and Tardos http://arxiv.org/abs/0903.0544
10/18/1310:00 amNorth 311Xiaoming (Nate) XuThe Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation is Constant, Bilo, Flammini, and Moscardel 
10/25/1310:00 amNorth 311Vahid Liaghat

Online Node-weighted Steiner Forest and Extensions via Disk Paintings, Hajiaghayi, Liaghat, and Panigrahi

11/01/1310:00 amNorth 311Sam Haney Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs, Goel, Kapralov and Khannahttp://arxiv.org/abs/0909.3346
11/08/13   STOC deadline 
11/15/1310:00 amNorth 311Abhinandan NathGraph Sparsification by Effective Resistances, Spielman and Srivastavahttp://arxiv.org/abs/0803.0929
11/22/1310:00 amNorth 311Nat KellA primal–dual randomized algorithm for weighted paging, Bansal, Buchbinder, and Naorhttp://www.win.tue.nl/~nikhil/pubs/paging-acm-final.pdf
12/02/1303:30 pmLSRC D344   Eric PriceImproved Concentration Bounds for Count-Sketch (and more)http://arxiv.org/abs/1207.5200