The Algorithm Engineering and Experiments (ALENEX13) and Analytic Algorithmics and Combinatorics (ANALCO13) meetings 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.
Announcements
Math of Planet Earth 2013
2013 is designated as the year of Math of Planet Earth. SIAM supports MPE2013.
A Facebook link to RSVP to the conference, connect with other attendees and find roommates will be posted here in October 2012.
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 #SIAMDA13.Program Committee
Program Committee Chair
Sanjeev Khanna, University of Pennsylvania, USA
Program Committee
Glencora Borradaile, Oregon State University, USA
Niv Buchbinder, Open University, Israel
Deeparnab Chakrabarty, Microsoft Research India, India
Xi Chen, Columbia University, USA
Joseph Cheriyan, University of Waterloo, Canada
Maria Chudnovsky, Columbia University, USA
Edith Elkind, Nanyang Technological University, Singapore
Cyril Gavoille, University of Bordeaux, France
Ashish Goel, Stanford University, USA
Nick Harvey, University of British Columbia, Canada
John Iacono, Polytechnic Institute of New York University, USA
Lap Chi Lau, The Chinese University of Hong Kong, Hong Kong
Aleksander Madry, EPFL, Switzerland, and Microsoft Research New England, USA
Konstantin Makarychev, Microsoft Research, Redmond, USA
Conrado Martínez , Universitat Politècnica de Catalunya, Spain
Dániel Marx, MTA SZTAKI, Hungarian Academy of Sciences, Hungary
Viswanath Nagarajan, IBM T.J. Watson Research Center, USA
Jelani Nelson, Princeton University, USA, and IAS, Princeton, USA
Krzysztof Onak, Carnegie Mellon University, USA
Konstantinos Panagiotou, Ludwig-Maximilians-Universität München, Germany
Seth Pettie, University of Michigan, USA
Kirk Pruhs, University of Pittsburgh, USA
Aaron Roth, University of Pennsylvania, USA
Mohammad Salavatipour, University of Alberta, Canada
Peter Sanders, Karlsruhe Institute for Technology, Germany
Piotr Sankowski, University of Warsaw, Poland
Bruce Shepherd, McGill University, Canada
Daniel Štefankovič, University of Rochester, USA
Kavitha Telikepalli, Tata Institute of Fundamental Research, India
Kasturi Varadarajan, University of Iowa, USA
Virginia Vassilevska Williams, University of California, Berkeley, USA, and Stanford University, USA
Suresh Venkatasubramanian, University of Utah, USA
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
SODA Steering Committee
Moses Charikar, Princeton University, USA
David Johnson, AT&T Labs – Research, USA
Claire Mathieu, Brown University, USA
Mike Molloy, University of Toronto, Canada
Angelika Steger, ETH Zürich, Switzerland
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
- Computational Geometry
- 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
- Graph Algorithms
- Internet and Network Algorithms
- Machine Learning
- On-line Problems
- Quantum Computing
- Pattern Matching
- Robotics
- Scheduling and Resource Allocation Problems
- Symbolic Computation
Applications in the Sciences and Business such as:
- Bioinformatics
- Economics
- Finance
- Manufacturing
- Physics
- Sociology
Important Deadlines
SUBMISSION DEADLINES
June 26, 2012, 4:59 PM EDT - Deadline - Short Abstract Submission and Paper Registration Deadline
July 3, 2012, 4:59 PM EDT - Deadline - Full Paper Submission
Acceptance/rejection notices will be sent to authors via e-mail in mid September 2012.
PRE-REGISTRATION DEADLINE
December 3, 2012: Disconnect time is 4:00 PM EST
HOTEL RESERVATION DEADLINE
December 3, 2012
STUDENT TRAVEL SUPPORT APPLICATION DEADLINE
December 10, 2012