SWAT and WADS conferences
WADS, the Algorithms and Data Structures Symposium, is an international academic conference in the field of computer science, focusing on algorithms and data structures.[1] WADS is held every second year, usually in Canada and always in North America. It is held in alternation with its sister conference, the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), which is usually held in Scandinavia and always in Northern Europe.[2] Historically, the proceedings of both conferences were published by Springer Verlag through their Lecture Notes in Computer Science series. Springer continues to publish WADS proceedings, but starting in 2016, SWAT proceedings are now published by Dagstuhl through their Leibniz International Proceedings in Informatics.[3]
| Scandinavian Symposium and Workshops on Algorithm Theory | |
|---|---|
| Abbreviation | SWAT |
| Discipline | Algorithms |
| Publication details | |
| Publisher | |
| History | 1988– |
| Frequency | biennial |
| Algorithms and Data Structures Symposium | |
|---|---|
| Abbreviation | WADS |
| Discipline | Algorithms |
| Publication details | |
| Publisher | Springer LNCS |
| History | 1989– |
| Frequency | biennial |
History
editThe first SWAT took place in 1988, in Halmstad, Sweden.[4] The first WADS was organised one year later, in 1989, in Ottawa, Ontario, Canada.[5] Until 2007, WADS was known as the Workshop on Algorithms and Data Structures,[1] and until 2008, SWAT was known as the Scandinavian Workshop on Algorithm Theory.[6]
See also
edit- The list of computer science conferences contains other academic conferences in computer science.
Notes
edit- ^ a b WADS web page.
- ^ SWAT web page.
- ^ Pagh, Rasmus (2017), Pagh, Rasmus (ed.), 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), LIPIcs, vol. 53, LZI, doi:10.4230/LIPIcs.SWAT.2016.0, ISBN 978-3-540-19487-3, ISSN 1868-8969.
- ^ Karlsson, Rolf; Lingas, Andrzej, eds. (1988), Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT), Halmstad, Sweden, July 5–8, LNCS, vol. 318, Springer, doi:10.1007/3-540-19487-8, ISBN 978-3-540-19487-3.
- ^ Dehne, F.; Sack, J.-R.; Santoro, N., eds. (1989), Proc. Workshop on Algorithms and Data Structures (WADS), Ottawa, Ontario, Canada, August 17–19, LNCS, vol. 382, Springer, doi:10.1007/3-540-51542-9, ISBN 978-3-540-51542-5.
- ^ SWAT 2008 web page.
References
edit- Chazelle, Bernard; et al. (1996), "Application Challenges to Computational Geometry: CG Impact Task Force Report", in Chazelle, Bernard; Goodman, Jacob E.; Pollack, Richard (eds.), Advances in Discrete and Computational Geometry: Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry–Ten Years Later, July 14–18, 1996, Mount Holyoke College, American Mathematical Soc., ISBN 978-0-8218-0674-6. Also available as a Princeton University technical report TR-521-96. Section 13.2 mentions the following conferences (in this order) as examples of "major algorithms conferences" with "a large amount of geometry": SODA, ISAAC, ESA, WADS, SWAT.
- Navarro, Gonzalo; Raffinot, Mathieu (2002), Flexible Pattern Matching in Strings, Cambridge University Press, ISBN 978-0-521-81307-5. Section 7.3.2 mentions the following conferences (in this order) as examples of conferences that publish articles on pattern matching (in addition to more narrow conferences CPM, COCOON, RECOMB, SPIRE, ISMB): DCC, ESA, FOCS, FSTTCS, ICALP, ISAAC, MFCS, SODA, STACS, STOC, SWAT, WAE, WADS.
- The 2007 Australian Ranking of ICT Conferences. Conferences on tier A ("... would add to the author's respect...") include SWAT and WADS.