(mobo import Concept___Events_With_Academic_Fields-migrated) |
(mobo import Concept___Events-migrated) |
||
| Line 13: | Line 13: | ||
|City=San Diego | |City=San Diego | ||
|State=CA | |State=CA | ||
| − | |Country= | + | |Country=Country:US |
|Paper deadline=2018/07/12 | |Paper deadline=2018/07/12 | ||
|Submitting link=https://easychair.org/account/signin?l=187i3NKgs7Ick7xZO3wQOL# | |Submitting link=https://easychair.org/account/signin?l=187i3NKgs7Ick7xZO3wQOL# | ||
| Line 24: | Line 24: | ||
|contributionType=1 | |contributionType=1 | ||
|Academic Field=Algorithms | |Academic Field=Algorithms | ||
| + | |Event Status=as scheduled | ||
| + | |Event Mode=on site | ||
}} | }} | ||
'''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.'' | ''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 14:55, 6 September 2022
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.
