DIMACS Workshop on Algorithms in the Field

May 16 - 18, 2011
DIMACS Center, CoRE Building, Rutgers University, Piscataway, NJ

Hari Balakrishnan, MIT
Paul Barford, University of Wisconsin-Madison
Tanya Berger-Wolf, University of Illinois at Chicago
Inderjit Dhillon, University of Texas, Austin
Tina Eliassi-Rad, Rutgers University
Christos Faloutsos, CMU
Phillip Gibbons, Intel
Joseph Hellerstein, UC-Berkeley
Michael Jordan, UC-Berkeley
S. Muthukrishnan, Rutgers University, muthu@cs.rutgers.edu
George Varghese, UCSD
Suresh Venkatasubramanian, University of Utah
Presented under the auspices of the DIMACS Special Focus on Algorithmic Foundations of the Internet.

Premise: Computer Science (CS) is rapidly evolving. We need to understand the evolving CS systems and their algorithmic foundations. This needs close collaboration between the researchers in algorithmic foundations and expert researchers in various areas. The premise is that researchers from different communities should work jointly "in the field", constantly informing each other, inventing in their respective areas, and forging systems that are simultaneously validated by both algorithmic and systems communities (and without needing to make independent research threads meet ex post).

The purpose of this workshop is to provide a working vision for examples of Algorithms in the Field, near term goals and directions for research in the future. The outcome of this workshop will be a report contributed by the participants that will inform the academic community and future funding programs. Scientifically, we hope bringing people with widely varied research interest together with algorithms researchers will lead to happy collisions, and unexpected directions of research.

Details: The workshop will be held at DIMACS, Rutgers University, NJ, May 16 - 18, 2011 and attendance is by invitation only. Many NSF programs within CISE from CCF to IIS and CNS will be represented. Topics of interest in systems include networking, databases, data mining, machine learning, social networks, massive data, robotics and graphics among others; all areas of algorithms are of interest including parallel, linear-algebraic, randomized, approximate, graphs, scheduling, etc. There are also some unusual topics of interaction between algorithms and business models, education and others. See the list of current confirmed invitees here. There will be a handful of talks, and a few breakout sessions for focused discussions in depth.

Next: Call for Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on April 8, 2011.