SWAT and WADS conferences

Algorithms and Data Structures Symposium
Algorithms and Data Structures Symposium
Abbreviation	WADS
Discipline	Algorithms
Publication details
Publisher	Springer LNCS
History	1989–
Frequency	biennial

Scandinavian Symposium and Workshops on Algorithm Theory
Scandinavian Symposium and Workshops on Algorithm Theory
Abbreviation	SWAT
Discipline	Algorithms
Publication details
Publisher	LZI LIPIcs ; Springer LNCS ;
History	1988–
Frequency	biennial

Last updated February 17, 2023

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]

History

The 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]

Notes

1 2 WADS web page.
↑ SWAT web page.
↑ Pagh, Rasmus, ed. (2017), 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.

Related Research Articles

<span class="mw-page-title-main">Theoretical computer science</span> Subfield of computer science and mathematics

Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory.

David Arthur Eppstein is an American computer scientist and mathematician. He is a Distinguished Professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.

Algorithmic Number Theory Symposium (ANTS) is a biennial academic conference, first held in Cornell in 1994, constituting an international forum for the presentation of new research in computational number theory. They are devoted to algorithmic aspects of number theory, including elementary number theory, algebraic number theory, analytic number theory, geometry of numbers, arithmetic geometry, finite fields, and cryptography.

<span class="mw-page-title-main">Kurt Mehlhorn</span> German computer scientist (born 1949)

Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.

The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both Design and Analysis and Engineering and Applications tracks.

Jörg-Rüdiger Wolfgang Sack is a professor of computer science at Carleton University, where he holds the SUN–NSERC chair in Applied Parallel Computing. Sack received a master's degree from the University of Bonn in 1979 and a Ph.D. in 1984 from McGill University, under the supervision of Godfried Toussaint. He is co-editor-in-chief of the journal Computational Geometry: Theory and Applications, co-editor of the Handbook of Computational Geometry, and co-editor of the proceedings of the biennial Algorithms and Data Structures Symposium (WADS). He was a co-founding editor-in-chief of the open access Journal of Spatial Information Science but is no longer an editor there. Sack's research interests include computational geometry, parallel algorithms, and geographic information systems.

In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random access machine in which the machine word size is assumed to match the problem size. The model was proposed by Michael Fredman and Dan Willard, who chose its name "because the dichotomy between the machine model and the problem size is crossed in a reasonable manner."

Peter D. Eades is an Australian computer scientist, an emeritus professor in the School of Information Technologies at the University of Sydney, known for his expertise in graph drawing.

FCT, the International Symposia on Fundamentals of Computation Theory is a biennial series of conferences in the field of theoretical computer science. It was established in 1977 for researchers interested in all aspects of theoretical computer science, and in particular algorithms, computational complexity, formal and logical methods. FCT was previously held at the following institutions.

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. SODA has been organized annually since 1990, typically in January. 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.

Gad Menahem Landau is an Israeli computer scientist noted for his contributions to combinatorial pattern matching and string algorithms and is the founding department chair of the Computer Science Department at the University of Haifa.

Chandrasekaran Pandurangan is a computer scientist and academic professor of the Computer Science and Engineering Department at Indian Institute of Technology - Madras (IITM). He mainly focuses on the design of pragmatic algorithms, graph theory and cryptography.

Deborah A. Joseph is an American computer scientist known for her research in computational geometry, computational biology, and computational complexity theory. She is a professor emeritus of computer science at the University of Wisconsin–Madison.

In economics, a budget-additive valuation is a kind of a utility function. It corresponds to a person that, when given a set of items, evaluates them in the following way:

Hartmut Ehrig was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification of abstract data types, and in graph grammars.

In geometry, the zone theorem is a result that establishes the complexity of the zone of a line in an arrangement of lines.

References

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, 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.

External links

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[wads-web-1] 1 2 WADS web page.

[2] SWAT web page.

[3] Pagh, Rasmus, ed. (2017), 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 .

[4] 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 .

[5] 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 .

[6] SWAT 2008 web page.

[1]

[2]

[3]

[4]

[5]

[6]