posted by user: timwylie || 7139 views || tracked by 13 users: [display]

SODA 2017 : Symposium on Discrete Algorithms

FacebookTwitterLinkedInGoogle


Conference Series : Symposium on Discrete Algorithms
 
Link: https://www.siam.org/meetings/da17/
 
When Jan 16, 2017 - Jan 19, 2017
Where Barcelona, Spain
Abstract Registration Due Jul 6, 2016
Submission Deadline Jul 13, 2016
Notification Due Oct 7, 2016
Final Version Due Nov 1, 2016
Categories    algorithms   theory   discrete   combinatorics
 

Call For Papers

Program Committee Chair

Philip Klein, Brown University, USA
Program Committee

Pankaj Agarwal, Duke University, USA
Yair Bartal, Hebrew University, Israel
Sébastien Bubeck, Microsoft Research, USA
Anne Driemel, Eindhoven University of Technology, Netherlands
David Eppstein, University of California, Irvine, USA
Jeff Erickson, University of Illinois at Urbana-Champaign, USA
Rong Ge, Duke University, USA
MohammadTaghi Hajiaghayi, University of Maryland, USA
Thomas P. Hayes, University of New Mexico, USA
Dorit Hochbaum, University of California, Berkeley, USA
Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
Jochen Koenemann, University of Waterloo, Canada
Ravishankar Krishnaswamy, Microsoft Research, India
Reut Levi, Max Planck Institute for Informatics, Germany
Dániel Marx, Hungarian Academy of Sciences, Hungary
Nicole Megow, Technical University of Munich, Germany
Ruta Mehta, University of Illinois at Urbana-Champaign, USA
Vahab Mirrokni, Google, USA
Shay Mozes, The Interdisciplinary Center Herzliya, Israel
Kamesh Munagala, Duke University, USA
Jelani Nelson, Harvard University, USA
Lorenzo Orecchia, Boston University, USA
Alessandro Panconesi, Sapienza University of Rome, Italy
Andrea Pietracaprina, University of Padova, Italy
Ely Porat, Bar-Ilan University, Israel
Vijaya Ramachandran, University of Texas at Austin, USA
Adi Rosén, National Center for Scientific Research (CNRS) and University of Paris Diderot, France
Maria Serna, Universitat Politècnica de Catalunya, Spain
Aaron Sidford, Stanford University, USA
Gerth Stølting Brodal, Aarhus University, Denmark
Mikkel Thorup, University of Copenhagen, Denmark
Virginia Vassilevska Williams, Stanford University, USA
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
Roger Wattenhofer, ETH Zurich, Switzerland
Matt Weinberg, Princeton University, USA
Peter Winkler, Dartmouth College, USA
Grigory Yaroslavtsev, University of Pennsylvania, USA
Ke Yi, Hong Kong University of Science and Technology, China
Neal Young, University of California Riverside, USA
Steering Committee

Pavol Hell, Simon Fraser University, Canada
Daniel Kráľ, University of Warwick, United Kingdom
Dana Randall, Georgia Institute of Technology, USA
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 Agencies

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:
• Combinatorial structures
• Discrete optimization
• Discrete probability
• Finite metric spaces
• Graph theory
• Mathematical programming
• Random structures
• Topological problems

Core topics in discrete algorithms, such as:
• Algorithm analysis
• Data structures
• Experimental algorithmics

Algorithmic aspects of other areas of computer science, such as:
• Combinatorial scientific computing
• Communication networks and the Internet
• Computational geometry and topology
• Computer graphics and computer vision
• Computer systems
• Data compression
• Cryptography and security
• Databases and information retrieval
• Distributed and parallel computing
• Game theory and mechanism design
• Machine learning
• Quantum computing


Important Deadlines

SUBMISSION DEADLINES
July 6, 2016, 4:59 PM EDT - Deadline - Short Abstract Submission and Paper Registration Deadline
July 13, 2016, 4:59 PM EDT - Deadline - Full Paper Submission
Acceptance/rejection notices will be sent to authors via email in early October 2016.

REGISTRATION DEADLINES
Pre-registration: October 16, 2016
Regular Registration: December 30, 2016
Onsite Registration: January 16-19, 2017

HOTEL RESERVATION DEADLINE
October 15, 2016

Related Resources

ISOTAEP-ICAMCS 2017   International Symposium on Optimization Techniques Applied to Engineering problems
SODA 2016   Symposium on Discrete Algorithms
IAEAC 2017   2017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference
STACS 2017   34th International Symposium on Theoretical Aspects of Computer Science
Gift-ACLA 2017   The Gift in Literature: ACLA Seminar
PDAA 2016   PDAA 2016: The 8th International Workshop on Parallel and Distributed Algorithms and Applications
IEEE IAEAC 2017   2017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference
ADMA 2016   Advanced Data Mining and Applications
IEICE-EA-SI-DMA 2017   Special Section on Discrete Mathematics and Its Applications -- IEICE Trans. Fundamentals
ISAAC 2016   International Symposium on Algorithms and Computation