| 词条 | Symposium on Discrete Algorithms |
| 释义 |
The Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) is an academic conference in the fields of algorithm design and discrete mathematics. It is considered to be one of the top conferences for research in algorithms.{{cn|date=December 2017}} SODA has been organized annually since 1990, typically in January.[1] SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the SIAM Activity Group on Discrete Mathematics, and in format is more similar to a theoretical computer science conference than to a mathematics conference.[2] References1. ^{{citation|url=http://dblp.uni-trier.de/db/conf/soda/|title=Symposium on Discrete Algorithms (SODA)|publisher=DBLP|accessdate=2017-12-11}} {{Association for Computing Machinery}}{{Society for Industrial and Applied Mathematics}}{{compu-conference-stub}}2. ^{{citation|first=Peter|last=Winkler|authorlink=Peter Winkler|title=How (and Why!) to Write a SODA Paper|url=http://www.siam.org/meetings/da98/winkler.ps}}. Distributed by Howard Karloff with the call for papers for SODA 1998. 2 : Theoretical computer science conferences|Association for Computing Machinery conferences |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。