Untitled Document
Not a member yet? Register for full benefits!

 ACM-SIAM Symposium on Discrete Algorithms 2014

This story is from the category Conferences
Printer Friendly Version
Email to a Friend (currently Down)



Date posted: 12/12/2013

January 5th 2014 - January 7th 2014
Hilton Portland & Executive Tower, Portland, Oregon, USA

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.

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: