Symposium on Experimental Algorithms

Last updated

The International Symposium on Experimental Algorithms (SEA), previously known as Workshop on Experimental Algorithms (WEA), is a computer science conference in the area of algorithm engineering.

Past SEA editions
EditionProceedingsLocationChairs
21stSEA 2023 [1] Barcelona, SpainLoukas Georgiadis
20thSEA 2022 [2] Heidelberg, GermanyChristian Schulz
19thSEA 2021 [3] Nice, France [4] David Coudert, Emanuele Natale
18thSEA 2020 [5] Catania, Italy [6] Simone Faro, Domenico Cantone
17thSEA 2018 [7] L'Aquila, Italy [8] Gianlorenzo D'Angelo
16thSEA 2017 [9] London, UK [10] Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman
15thSEA 2016 [11] St. Petersburg, Russia [12] Andrew V. Goldberg, Alexander S. Kulikov
14thSEA 2015 [13] Paris, FranceEvripidis Bampis
13thSEA 2014 [14] Copenhagen, Denmark [15] Joachim Gudmundsson, Jyrki Katajainen
12thSEA 2013 [16] Rome, Italy [17] Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela
11thSEA 2012 [18] Bordeaux, France [19] Ralf Klasing
10thSEA 2011 [20] Kolimpari, Chania, Crete, GreecePanos M. Pardalos, Steffen Rebennack
9thSEA 2010 [21] Ischia Island, Naples, ItalyPaola Festa
8thSEA 2009 [22] Dortmund, Germany [23] Jan Vahrenhold
7thWEA 2008 [24] Provincetown, MA, USACatherine C. McGeoch
6thWEA 2007 [25] Rome, ItalyCamil Demetrescu
5thWEA 2006 [26] Cala Galdana, Menorca Island, SpainCarme Àlvarez, Maria J. Serna
4thWEA 2005 [27] Santorini Island, GreeceSotiris E. Nikoletseas
3ndWEA 2004 [28] Angra dos Reis, BrazilCelso C. Ribeiro, Simone L. Martins
2ndWEA 2003 [29] Ascona, SwitzerlandKlaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim

Notes

  1. ↑ "SEA 2023". Universitat Politècnica de Catalunya. Retrieved 2023-02-08.
  2. ↑ "Welcome to SEA 2022 | SEA 2022". sea2022.ifi.uni-heidelberg.de. Retrieved 2023-02-08.
  3. ↑ Coudert, David; Natale, Emanuele (2021). Coudert, David; Natale, Emanuele (eds.). Proceedings of the 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs). Vol. 190. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 0:i–0:xii. doi: 10.4230/LIPIcs.SEA.2021.0 . ISBN   978-3-95977-185-6.
  4. ↑ "Welcome to SEA 2021 | SEA 2021". sea2021.i3s.unice.fr. Retrieved 2021-02-17.
  5. ↑ "Portal - SEA 2020". www.dagstuhl.de. Retrieved 2021-02-17.
  6. ↑ "SEA 2020 - 18th Symposium on Experimental Algorithms". www.sea2020.dmi.unict.it. Retrieved 2021-02-17.
  7. ↑ "Portal - SEA 2018". www.dagstuhl.de. Retrieved 2021-02-17.
  8. ↑ "17th International Symposium on Experimental Algorithms (SEA 2018) - Computer Science @ GSSI". cs.gssi.it. Retrieved 2021-02-17.
  9. ↑ "Portal - SEA 2017". www.dagstuhl.de. Retrieved 2021-02-17.
  10. ↑ "SEA 2017 - 16th International Symposium on Experimental Algorithms". nms.kcl.ac.uk. Retrieved 2021-02-17.
  11. ↑ Goldberg, Andrew V.; Kulikov, Alexander S., eds. (2016). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 9685. doi: 10.1007/978-3-319-38851-9 . ISBN   978-3-319-38850-2. ISSN   0302-9743.
  12. ↑ "Welcome | 15th International Symposium on Experimental Algorithms - SEA 2016". logic.pdmi.ras.ru. Retrieved 2021-02-17.
  13. ↑ Bampis, Evripidis, ed. (2015). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 9125. doi:10.1007/978-3-319-20086-6. ISBN   978-3-319-20085-9. ISSN   0302-9743. S2CID   12556148.
  14. ↑ Bampis, Evripidis, ed. (2015). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 9125. doi:10.1007/978-3-319-20086-6. ISBN   978-3-319-20085-9. ISSN   0302-9743. S2CID   12556148.
  15. ↑ DIKU (2013-05-28). "Home". di.ku.dk. Retrieved 2021-02-17.
  16. ↑ Bonifaci, Vincenzo; Demetrescu, Camil; Marchetti-Spaccamela, Alberto, eds. (2013). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 7933. doi:10.1007/978-3-642-38527-8. ISBN   978-3-642-38526-1. ISSN   0302-9743. S2CID   576771.
  17. ↑ Caminiti, Saverio. "SEA 2013 — 12th International Symposium on Experimental Algorithms". sea2013.dis.uniroma1.it. Retrieved 2021-02-17.
  18. ↑ Klasing, Ralf, ed. (2012). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 7276. doi:10.1007/978-3-642-30850-5. ISBN   978-3-642-30849-9. ISSN   0302-9743. S2CID   40512938.
  19. ↑ "SEA 2012 Main/Home Page". sea2012.labri.fr. Retrieved 2021-02-17.
  20. ↑ Pardalos, Panos M.; Rebennack, Steffen, eds. (2011). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 6630. doi:10.1007/978-3-642-20662-7. ISBN   978-3-642-20661-0. ISSN   0302-9743. S2CID   11968126.
  21. ↑ Festa, Paola, ed. (2010). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 6049. doi:10.1007/978-3-642-13193-6. ISBN   978-3-642-13192-9. ISSN   0302-9743.
  22. ↑ Vahrenhold, Jan, ed. (2009). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 5526. doi:10.1007/978-3-642-02011-7. ISBN   978-3-642-02010-0. ISSN   0302-9743. S2CID   31285560.
  23. ↑ "SEA 2009 – 8th International Symposium on Experimental Algorithms". www.sea2009.org. Retrieved 2021-02-17.
  24. ↑ McGeoch, Catherine C., ed. (2008). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 5038. doi:10.1007/978-3-540-68552-4. ISBN   978-3-540-68548-7. ISSN   0302-9743.
  25. ↑ Demetrescu, Camil, ed. (2007). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 4525. doi:10.1007/978-3-540-72845-0. ISBN   978-3-540-72844-3. ISSN   0302-9743.
  26. ↑ Àlvarez, Carme; Serna, María, eds. (2006). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 4007. doi:10.1007/11764298. ISBN   978-3-540-34597-8. ISSN   0302-9743.
  27. ↑ Nikoletseas, Sotiris E., ed. (2005). Experimental and Efficient Algorithms. Lecture Notes in Computer Science. Vol. 3503. doi:10.1007/b136461. ISBN   978-3-540-25920-6. ISSN   0302-9743.
  28. ↑ Ribeiro, Celso C.; Martins, Simone L., eds. (2004). Experimental and Efficient Algorithms. Lecture Notes in Computer Science. Vol. 3059. doi:10.1007/b97914. ISBN   978-3-540-22067-1. ISSN   0302-9743. S2CID   28326937.
  29. ↑ Jansen, Klaus; Margraf, Marian; Mastrolilli, Monaldo; Rolim, José D. P., eds. (2003). Experimental and Efficient Algorithms. Lecture Notes in Computer Science. Vol. 2647. doi:10.1007/3-540-44867-5. ISBN   978-3-540-40205-3. ISSN   0302-9743. S2CID   26445865.

Related Research Articles

In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties. Each concept in the hierarchy represents the objects sharing some set of properties; and each sub-concept in the hierarchy represents a subset of the objects in the concepts above it. The term was introduced by Rudolf Wille in 1981, and builds on the mathematical theory of lattices and ordered sets that was developed by Garrett Birkhoff and others in the 1930s.

In compiler optimization, register allocation is the process of assigning local automatic variables and expression results to a limited number of processor registers.

<span class="mw-page-title-main">Aircrack-ng</span> Software suite

Aircrack-ng is a network software suite consisting of a detector, packet sniffer, WEP and WPA/WPA2-PSK cracker and analysis tool for 802.11 wireless LANs. It works with any wireless network interface controller whose driver supports raw monitoring mode and can sniff 802.11a, 802.11b and 802.11g traffic. Packages are released for Linux and Windows.

In computer science, the International Conference on Computer-Aided Verification (CAV) is an annual academic conference on the theory and practice of computer-aided formal analysis of software and hardware systems, broadly known as formal methods. Among the important results originally published in CAV are techniques in model checking, such as Counterexample-Guided Abstraction Refinement (CEGAR) and partial order reduction. It is often ranked among the top conferences in computer science.

In computer science and formal methods, a SAT solver is a computer program which aims to solve the Boolean satisfiability problem. On input a formula over Boolean variables, such as "(x or y) and (x or not y)", a SAT solver outputs whether the formula is satisfiable, meaning that there are possible values of x and y which make the formula true, or unsatisfiable, meaning that there are no such values of x and y. In this case, the formula is satisfiable when x is true, so the solver should return "satisfiable". Since the introduction of algorithms for SAT in the 1960s, modern SAT solvers have grown into complex software artifacts involving a large number of heuristics and program optimizations to work efficiently.

The European Joint Conferences on Theory and Practice of Software (ETAPS) is a confederation of (currently) four computer science conferences taking place annually at one conference site, usually end of March or April. Three of the four conferences are top ranked in software engineering and one (ESOP) is top ranked in programming languages.

WoLLIC, the Workshop on Logic, Language, Information and Computation is an academic conference in the field of pure and applied logic and theoretical computer science. WoLLIC has been organised annually since 1994, typically in June or July; the conference is scientifically sponsored by the Association for Logic, Language and Information, the Association for Symbolic Logic, the European Association for Theoretical Computer Science and the European Association for Computer Science Logic.

The International Semantic Web Conference (ISWC) is a series of academic conferences and the premier international forum for the Semantic Web, Linked Data and Knowledge Graph Community. Here, scientists, industry specialists, and practitioners meet to discuss the future of practical, scalable, user-friendly, and game changing solutions. Its proceedings are published in the Lecture Notes in Computer Science by Springer-Verlag.

Amos Fiat is an Israeli computer scientist, a professor of computer science at Tel Aviv University. He is known for his work in cryptography, online algorithms, and algorithmic game theory.

<span class="mw-page-title-main">Peter Ružička</span> Slovak scientist

Peter Ružička was a Slovak computer scientist and mathematician who worked in the fields of distributed computing and computer networks. He was a professor at the Comenius University, Faculty of Mathematics, Physics and Informatics working in several research areas of theoretical computer science throughout his long career.

Massive Online Analysis (MOA) is a free open-source software project specific for data stream mining with concept drift. It is written in Java and developed at the University of Waikato, New Zealand.

<span class="mw-page-title-main">Kai Salomaa</span> Finnish Canadian theoretical computer scientist

Kai Tapani Salomaa is a Finnish Canadian theoretical computer scientist, known for his numerous contributions to the state complexity of finite automata. His highly cited 1994 joint paper with Yu and Zhuang laid the foundations of the area. He has published over 100 papers in scientific journals on various subjects in formal language theory. Salomaa is a full professor at Queen's University.

Esko Juhani Ukkonen is a Finnish theoretical computer scientist known for his contributions to string algorithms, and particularly for Ukkonen's algorithm for suffix tree construction. He is a professor emeritus of the University of Helsinki.

Maxime Crochemore is a French computer scientist known for his numerous contributions to algorithms on strings. He is currently a professor at King's College London.

Hash-based cryptography is the generic term for constructions of cryptographic primitives based on the security of hash functions. It is of interest as a type of post-quantum cryptography.

Dmitry Khovratovich is a Russian cryptographer, currently a Lead Cryptographer for the Dusk Network, researcher for the Ethereum Foundation, and member of the International Association for Cryptologic Research.

<span class="mw-page-title-main">Klaus Peter Jantke</span>

Klaus Peter Jantke is a German mathematician, computer scientist, university teacher and academic researcher focusing on Artificial intelligence, Educational technology, Game studies and gamification.

Runtime predictive analysis is a runtime verification technique in computer science for detecting property violations in program executions inferred from an observed execution. An important class of predictive analysis methods has been developed for detecting concurrency errors in concurrent programs, where a runtime monitor is used to predict errors which did not happen in the observed run, but can happen in an alternative execution of the same program. The predictive capability comes from the fact that the analysis is performed on an abstract model extracted online from the observed execution, which admits a class of executions beyond the observed one.

Deepak Kapur is a Distinguished Professor in the Department of Computer Science at the University of New Mexico.

In cryptography, a round or round function is a basic transformation that is repeated (iterated) multiple times inside the algorithm. Splitting a large algorithmic function into rounds simplifies both implementation and cryptanalysis.

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.