Difference between revisions of "Event:SODA 2020"

From ConfIDent
(mobo import Concept___Events-migrated)
m (Text replacement - "Homepage=" to "Official Website=")
 
(5 intermediate revisions by 2 users not shown)
Line 7: Line 7:
 
|Start Date=2020/01/05
 
|Start Date=2020/01/05
 
|End Date=2020/01/08
 
|End Date=2020/01/08
 +
|Event Status=as scheduled
 +
|Event Mode=on site
 +
|City=Salt Lake City
 +
|Region=Utah
 +
|Country=Country:US
 +
|Academic Field=Algorithm
 
|Official Website=https://siam.org/conferences/cm/conference/soda20
 
|Official Website=https://siam.org/conferences/cm/conference/soda20
 
|Type=Conference
 
|Type=Conference
|Submission deadline=2019/07/05
+
|Official Website=https://www.siam.org/conferences/cm/conference/soda20
|Homepage=https://www.siam.org/conferences/cm/conference/soda20
 
|City=Salt Lake City
 
|State=Utah
 
|Country=Country:US
 
|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é
 
|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
 
|pageCreator=User:Curator 89
 
|pageCreator=User:Curator 89
 
|pageEditor=User:Curator 19
 
|pageEditor=User:Curator 19
 
|contributionType=1
 
|contributionType=1
|Academic Field=Algorithms
+
}}
|Event Status=as scheduled
+
{{Event Deadline
|Event Mode=on site
+
|Submission Deadline=2019/07/05
 +
}}
 +
{{Event Metric
 +
|Number Of Submitted Papers=594
 +
|Number Of Accepted Papers=182
 +
}}
 +
{{S Event}}
 +
{{Organizer
 +
|Organization=Society for Industrial and Applied Mathematics
 +
|Contributor Type=organization
 
}}
 
}}
 
'''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.''

Latest revision as of 14:22, 19 October 2022

Deadlines
2019-07-05
5
Jul
2019
Submission
Metrics
Submitted Papers
594
Accepted Papers
182
Venue

Salt Lake City, Utah, United States of America

Loading map...
organization

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.

Cookies help us deliver our services. By using our services, you agree to our use of cookies.