DIMACS Workshop on Big Data through the Lens of Sublinear Algorithms

August 27 - 28, 2015
DIMACS Center, CoRE Building, Rutgers University

Organizers:

Alexandr Andoni, Columbia University

Muthu Muthukrishnan, Rutgers University, smewtoo at gmail.com

Grigory Yaroslavtsev, University of Pennsylvania, grigory.yaroslavtsev at gmail.com

Slides:

• Nina Balcan, Carnegie Mellon University
  Distributed Machine Learning

• Mark Braverman, Princeton University
  Efficient Primal-dual Graph Algorithms on MapReduce

• Amit Chakrabarti, Dartmouth College
  Optimization While Streaming

• Graham Cormode, University of Warwick
  Trusting the Cloud with Practical Interactive Proofs

• Artur Czumaj, University of Warwick
  On Testing Properties in Directed Graphs

• Alina Ene, University of Warwick
  The Power of Randomization: Distributed Submodular Maximization on Massive Datasets

• Funda Ergun, Indiana University, Bloomington & Simon Fraser University
  Palindrome Recognition In The Streaming Model

• Ashish Goel, Stanford University
  Sublinear Algorithms for PageRank, with Applications

• Piotr Indyk, MIT
  Streaming Algorithms for Set Cover

• Sanjeev Khanna, University of Pennsylvania
  Approximate Matchings in Dynamic Graph Streams

• John Langford, Microsoft Research, NYC
  Logarithic Time Prediction

• Silvio Lattanzi, Google Research, NYC
  Expanders via Local Edge Flips

• Michael Mahoney, University of California, Berkeley
  Linear and Sublinear Aspects of Combining SGD and RLA

• Andrew McGregor, University of Massachusetts, Amherst
  The Latest on Linear Sketching for Large Graphs: Lots of Problems, Little Space

• Vahab Mirrokni, Google Research, NYC
  Large-scale Graph Mining at Google NYC: Problems and Frameworks

• Kamesh Munagala, Duke University
  Efficient Primal-dual Graph Algorithms on MapReduce

• Jelani Nelson, Harvard University
  An Introduction to Chaining, and Applications to Sublinear Algorithms

• Krzysztof Onak, IBM Research, NY
  Communication Complexity of Learning Discrete Distributions

• Ronitt Rubinfeld, MIT
  Testing and Correcting Structured Distributions

• Justin Thaler, Yahoo! Research, NYC
  Parallel Peeling Algorithms

• David Woodruff, IBM Research, Almaden
  Tutorial: A Survey of Results in the Message Passing Communication Model

Workshop Index

DIMACS Homepage