Difference between revisions of "SODA 2020"

From OPENRESEARCH fixed Wiki
Jump to navigation Jump to search
(modified through wikirestore by Th)
 
(modified through wikirestore by Th)
Line 1: Line 1:
 
{{Event
 
{{Event
 +
|Acronym=SODA 2020
 +
|Title=31st Annual ACM/SIAM Symposium on Discrete Algorithms
 +
|Series=SODA
 +
|Type=Conference
 
|Field=Algorithms
 
|Field=Algorithms
 +
|Start date=2020/01/05
 +
|End date=2020/01/08
 
|Submission deadline=2019/07/05
 
|Submission deadline=2019/07/05
 +
|Homepage=https://www.siam.org/conferences/cm/conference/soda20
 +
|City=Salt Lake City
 +
|State=Utah
 +
|Country=USA
 
|Has host organization=Society for Industrial and Applied Mathematics
 
|Has host organization=Society for Industrial and Applied Mathematics
 
|has program chair=Shuchi Chawla
 
|has program chair=Shuchi Chawla
 
|has Keynote speaker=Sanjeev Arora, Monika Henzinger, Nike Sun, Stéphan Thomassé
 
|has Keynote speaker=Sanjeev Arora, Monika Henzinger, Nike Sun, Stéphan Thomassé
 +
|Submitted papers=594
 +
|Accepted papers=182
 
|has Proceedings DOI=https://epubs.siam.org/doi/book/10.1137/1.9781611975994
 
|has Proceedings DOI=https://epubs.siam.org/doi/book/10.1137/1.9781611975994
|Acronym=SODA 2020
 
|End date=2020/01/08
 
|Series=SODA
 
|Type =Conference
 
|Country=US
 
|State=US/UT
 
|City =US/UT/Salt Lake City
 
|Homepage=https://www.siam.org/conferences/cm/conference/soda20
 
|Start date=2020/01/05
 
|Title=31st Annual ACM/SIAM Symposium on Discrete Algorithms
 
|Accepted papers=182
 
|Submitted papers=594
 
 
}}
 
}}
 
'''31st Annual ACM/SIAM Symposium on Discrete Algorithms''' (SODA 2020)
 
'''31st Annual ACM/SIAM Symposium on Discrete Algorithms''' (SODA 2020)
  
 
''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.''
 
''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.''

Revision as of 00:03, 25 October 2021


Event Rating

median worst
Pain1.svg Pain4.svg

List of all ratings can be found at SODA 2020/rating

SODA 2020
31st Annual ACM/SIAM Symposium on Discrete Algorithms
Event in series SODA
Dates 2020/01/05 (iCal) - 2020/01/08
Homepage: https://www.siam.org/conferences/cm/conference/soda20
Location
Location: Salt Lake City, Utah, USA
Loading map...

Important dates
Submissions: 2019/07/05
Papers: Submitted 594 / Accepted 182 (30.6 %)
Committees
PC chairs: Shuchi Chawla
Keynote speaker: Sanjeev Arora, Monika Henzinger, Nike Sun, Stéphan Thomassé
Table of Contents

31st Annual ACM/SIAM Symposium on Discrete Algorithms (SODA 2020)

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.