2017 NSF Algorithms in the Field PI Meeting

March 30 - 31, 2017
Arlington, VA

Organizing Committee:

Martin Farach-Colton, Rutgers University

Sucheta Soundarajan, Syracuse University

Slides:

• Amy Babay, Emily Wagner, Yasamin Nazari, Michael Dinitz, and Yair Amir, Johns Hopkins University
  Wide-area Dissemination under Strict Timeliness, Reliability, and Cost Constraints

• Magdalena Balazinska and Dan Suciu, University of Washington
  Query Processing with Optimal Communication Cost

• Maria-Florina Balcan, Avrim Blum, and Tom M Mitchell
  From Worst-Case to Realistic-Case Analysis for Large Scale Machine Learning Algorithms

• Sarah Cannon, Georgia Institute of Technology, Joshua Daymude, Arizona State University, Daniel Goldman, Georgia Institute of Technology, Shengkai Li, Georgia Institute of Technology, Dana Randall, Georgia Institute of Technology, Andrea Richa, Arizona State University, and Will Savoie, Georgia Institute of Technology
  A Distributed and Stochastic Algorithmic Framework for Active Matter

• Loris D'Antoni, Aditya Akella, University of Wisconsin-Madison and Aaron Gember-Jacobson, Colgate University
  Foundations of Intent-based Networking

• Anupam Gupta, Carnegie Mellon University, Michael K. Reiter, UNC Chapel Hill and Vyas Sekar, Carnegie Mellon University
  Practical Foundations for Software-Defined Network Optimization

• Bruce Maggs, Debmalya Panigrahi, Duke University, Rajmohan Rajaraman, Northeastern University and Ravi Sundaram, Northeastern University
  Optimizing Networked Systems with Limited Information

• Muthu Muthukrishnan, Rutgers University and Jennifer Rexford, Princeton University
  8F: Compact Data Structures for SDNs

• John Owens, UC Davis and Martin Farach-Colton, Rutgers University
  Theory and Implementation of Dynamic Data Structures for the GPU

• Richard Peng, Georgia Tech
  High Performance Linear System Solvers with Focus on Graph Laplacians

• Kirk Pruhs and Youtao Zhang, University of Pittsburgh
  AitF: EXPL: Data Management in Domain Wall Memory-based Scratchpad for High Performance Mobile Devices

• Kate Saenko, Boston University, Trevor Darrell, UC Berkeley, Eric Tzeng, UC Berkeley and Judy Hoffman, UC Berkeley
  PEARL: Perceptual Adaptive Representation Learning in the WildAdversarial Domain Adaptation

• Sucheta Soundarajan and Yanzhi Wang, University of Syracuse
  Fast and Accurate Memristor-Based Algorithms for Social Network Analysis

• Tandy Warnow and Pranjal Vachaspati, University of Illinois at Urbana-Champaign
  Graph-theoretic Algorithms to Improve Phylogenomic Analyses

Workshop Index

DIMACS Homepage