Algorithm Engineering and Experiments (ALENEX15) and Analytic Algorithmics and Combinatorics (ANALCO15) will take place at the same location, and will hold sessions during the SODA conference.
SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.A Workshop on Algorithmic Challenges in Machine Learning will take place following the SODA conference at the University of California, San Diego.
Announcements
Local Restaurant List [PDF, 30KB]
To RSVP to the conference on Facebook and connect with other attendees, find roommates etc., please visit https://www.facebook.com/events/231759537012117/.
If you are tweeting about the conference, please use the designated hashtag to enable other attendees to keep up with the Twitter conversation and to allow better archiving of our conference discussions. The hashtag for this meeting is #SIAMDA15.
Program Committee Chair
Piotr Indyk, Massachusetts Institute of Technology, USA
Program Committee
Peyman Afshani, MADALGO, Aarhus University, Denmark
Pankaj K. Agarwal, Duke University, USA
Alex Andoni, Microsoft Research, USA
Michael Bender, State University of New York at Stony Brook, USA
Amit Chakrabarti, Dartmouth College, USA
Shiri Chechik, Tel Aviv University, Israel and Microsoft Research, USA
Flavio Chierichetti, Sapienza University of Rome, Italy
Colin Cooper, King's College London, United Kingdom
Alina Ene, Princeton University, USA and University of Warwick, United Kingdom
Andrew V. Goldberg, Microsoft Research, USA
Roberto Grossi, Università di Pisa, Italy
Anupam Gupta, Carnegie Mellon University, USA
Sariel Har-Peled, University of Illinois at Urbana-Champaign, USA
Avinatan Hassidim, Bar-Ilan University, Israel
Sidharth (Sid) Jaggi, The Chinese University of Hong Kong, Hong Kong
Daniel Kráľ, University of Warwick, United Kingdom
Robert Krauthgamer, Weizmann Institute of Science, Israel
Ravi Kumar, Google, USA
Katrina Ligett, California Institute of Technology, USA
Mohammad Mahdian, Google Research, USA
Yury Makarychev, Toyota Technological Institute at Chicago, USA
Jiri Matousek, Charles University, Czech Republic and ETH Zurich, Switzerland
Ankur Moitra, Massachusetts Institute of Technology, USA
Shayan Oveis Gharan, University of California at Berkeley, USA
Debmalya Panigrahi, Duke University, USA
Jeff M. Phillips, University of Utah, USA
Marcin Pilipczuk, University of Bergen, Norway and University of Warsaw, Poland
Yuval Rabani, Hebrew University of Jerusalem, Israel
Thomas Rothvoß, University of Washington, USA
Shubhangi Saraf, Rutgers University, USA
Thomas Sauerwald, University of Cambridge, United Kingdom
Christian Scheideler, Universität Paderborn, Germany
Christian Sohler, Technische Universität Dortmund, Germany
László A. Végh, London School of Economics, United Kingdom
Yusu Wang, The Ohio State University, USA
Steering Committee
Pavol Hell, Simon Fraser University, Canada
Dana Randall, Georgia Institute of Technology, USA
Angelika Steger, ETH Zürich, Switzerland
Cliff Stein, Columbia University, USA (chair)
Shang-Hua Teng, University of Southern California, USA
Description
This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.
Funding Agency
Funding agency information will be posted here when available.
Themes
Themes and application areas include, but are not limited to, the following topics:Aspects of Combinatorics and Discrete Mathematics, such as:
- Algebra
- Combinatorial Structures
- Discrete Optimization
- Discrete Probability
- Finite Metric Spaces
- Graph Theory
- Mathematical Programming
- Number Theory
- Random Structures
- Topological Problems
Aspects of Computer Science, such as:
- Algorithm Analysis and Complexity
- Algorithmic Game Theory
- Algorithmic Mechanism Design
- Combinatorial Scientific Computing
- Communication Networks and the Internet
- Computational Geometry & Topology
- Computer Graphics and Computer Vision
- Computer Systems
- Cryptography and Computer Security
- Data Compression
- Data Structures
- Databases and Information Retrieval
- Distributed and Parallel Computing
- Experimental Algorithmics
- Machine Learning
- Quantum Computing
- Robotics
- Symbolic Computation
Applications in the Sciences and Business such as:
- Bioinformatics
- Economics
- Finance
- Manufacturing
- Physics
- Sociology
Important Deadlines
SUBMISSION DEADLINES
July 2, 2014, 4:59 PM EDT - Deadline - Short Abstract Submission and Paper Registration Deadline
July 7, 2014, 4:59 PM EDT - Deadline - Full Paper Submission
Acceptance/rejection notices will be sent to authors via email in mid-September 2014.
PRE-REGISTRATION DEADLINE
December 1, 2014 Disconnect time is 4:00 PM EST
HOTEL RESERVATION DEADLINE
Reservation Deadline December 1, 2014 EXTENDED to 5:00 PM Pacific Time, Monday, December 8, 2014 (or until the room block is filled)
STUDENT TRAVEL SUPPORT DEADLINE
November 17, 2014
