Difference between revisions of "SODA 2018"
(modified through wikirestore by orapi) |
(modified through wikirestore by orapi) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Event | {{Event | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Field=Algorithms | |Field=Algorithms | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Abstract deadline=2017/07/06 | |Abstract deadline=2017/07/06 | ||
|Paper deadline=2017/07/13 | |Paper deadline=2017/07/13 | ||
| Line 16: | Line 6: | ||
|has program chair=Artur Czumaj | |has program chair=Artur Czumaj | ||
|has Keynote speaker=Cynthia Dwork, Anupam Gupta, Mikkel Thorup, Virginia Vassilevska Williams | |has Keynote speaker=Cynthia Dwork, Anupam Gupta, Mikkel Thorup, Virginia Vassilevska Williams | ||
| + | |has Proceedings DOI=https://epubs.siam.org/doi/book/10.1137/1.9781611975031 | ||
| + | |Acronym=SODA 2018 | ||
| + | |End date=2018-02-10 | ||
| + | |Series=SODA | ||
| + | |Type =Conference | ||
| + | |Country=US | ||
| + | |State=US/LA | ||
| + | |City =US/LA/New Orleans | ||
| + | |Year =2018 | ||
| + | |Homepage=https://archive.siam.org/meetings/da18/ | ||
| + | |Start date=2018-01-07 | ||
| + | |Title=29th Annual ACM-SIAM Symposium on Discrete Algorithms | ||
| + | |Accepted papers=181 | ||
|Submitted papers=547 | |Submitted papers=547 | ||
| − | |||
| − | |||
}} | }} | ||
'''Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)''', held January 7 – 10, 2018 in New Orleans, LA, USA. The Symposium was jointly sponsored by SIGACT (the ACM Special Interest Group on Algorithms and Computation Theory) and by the SIAM Activity Group on Discrete Mathematics. | '''Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)''', held January 7 – 10, 2018 in New Orleans, LA, USA. The Symposium was jointly sponsored by SIGACT (the ACM Special Interest Group on Algorithms and Computation Theory) and by the SIAM Activity Group on Discrete Mathematics. | ||
Latest revision as of 04:45, 6 December 2021
Event Rating
| median | worst |
|---|---|
|
|
List of all ratings can be found at SODA 2018/rating
| SODA 2018 | |
|---|---|
29th Annual ACM-SIAM Symposium on Discrete Algorithms
| |
| Event in series | SODA |
| Dates | 2018-01-07 (iCal) - 2018-02-10 |
| Homepage: | https://archive.siam.org/meetings/da18/ |
| Submitting link: | https://easychair.org/conferences/?conf=soda2018 |
| Location | |
| Location: | US/LA/New Orleans, US/LA, US |
| Important dates | |
| Abstracts: | 2017/07/06 |
| Papers: | 2017/07/13 |
| Papers: | Submitted 547 / Accepted 181 (33.1 %) |
| Committees | |
| PC chairs: | Artur Czumaj |
| Keynote speaker: | Cynthia Dwork, Anupam Gupta, Mikkel Thorup, Virginia Vassilevska Williams |
| Table of Contents | |
Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), held January 7 – 10, 2018 in New Orleans, LA, USA. The Symposium was jointly sponsored by SIGACT (the ACM Special Interest Group on Algorithms and Computation Theory) and by the SIAM Activity Group on Discrete Mathematics.
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.
Important Dates
Submissions Deadline Dates
- July 6, 2017, 4:59 PM EDT - Deadline - Short Abstract Submission and Paper Registration Deadline
- July 13, 2017, 4:59 PM EDT - Deadline - Full Paper Submission
Acceptance/rejection notices will be sent to authors via email in early October 2017. All submissions must be in .pdf format and submitted electronically. Submitting authors are encouraged to post their submission on their website.