Difference between revisions of "SODA 2019"

From Openresearch
Jump to: navigation, search
m
 
(3 intermediate revisions by the same user not shown)
Line 5: Line 5:
 
|Type=Conference
 
|Type=Conference
 
|Field=Algorithms
 
|Field=Algorithms
|Start date=2019
+
|Start date=2019/01/06
|End date=2019
+
|End date=2019/01/09
 +
|Submission deadline=2018/07/05
 +
|Homepage=https://www.siam.org/conferences/cm/conference/soda19
 +
|City=San Diego
 +
|State=CA
 +
|Country=USA
 +
|Paper deadline=2018/07/12
 +
|Submitting link=https://easychair.org/account/signin?l=187i3NKgs7Ick7xZO3wQOL#
 +
|has program chair=Timothy Chan
 +
|Submitted papers=591
 +
|Accepted papers=184
 +
|has Proceedings DOI=: https://doi.org/10.1137/1.9781611975482.fm
 
}}
 
}}
 
'''2019 Annual ACM-SIAM Symposium on Discrete Algorithms'''
 
'''2019 Annual ACM-SIAM Symposium on Discrete Algorithms'''
 +
 +
''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 10:54, 25 August 2020

SODA 2019
30th Annual ACM-SIAM Symposium on Discrete Algorithms
Event in series SODA
Dates 2019/01/06 (iCal) - 2019/01/09
Homepage: https://www.siam.org/conferences/cm/conference/soda19
Submitting link: https://easychair.org/account/signin?l=187i3NKgs7Ick7xZO3wQOL#
Location
Location: San Diego, CA, USA
Loading map...

Important dates
Papers: 2018/07/12
Submissions: 2018/07/05
Papers: Submitted 591 / Accepted 184 (31.1 %)
Committees
PC chairs: Timothy Chan
Table of Contents


2019 Annual ACM-SIAM Symposium on Discrete Algorithms

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.