Conferences and similar meetings for study and research into Algorithms which have already taken place but for which the site is still of interest.

Subcategories 3

Related categories 1

ACID 2005
Algorithms and Complexity in Durham 2005. University of Durham, UK; 8--10 July 2005.
4th Workshop on Algorithm Engineering and Experiments. San Francisco, CA, USA; 4--5 January 2002.
Workshop on Algorithm Engineering and Experimentation. Omni Hotel, Baltimore, MD, USA; 15--16 January 1999.
5th Workshop on Algorithm Engineering and Experiments. Baltimore, Maryland, USA; 11 January 2003.
Workshop on Algorithm Engineering and Experiments. Held in conjunction with ANALCO04 and SODA04. New Orleans, LA, USA; 10 January 2004.
ALGO 2002
A multi-conference comprising ESA02, WAE02, APPROX02, WABI02 and ARACNE02. Rome, Italy; 16--21 September 2002.
ALGO 2003
Comprising: ESA 2003 (11th Annual European Symposium on Algorithms); WABI 2003 (3rd Workshop on Algorithms in Bioinformatics); ATMOS 2003 (Algorithmic Methods and Models for Optimization of Railways); WAOA 2003 (Workshop on Approximation and Online Algorithms). Budapest, Hungary; 15--20 September 2003.
ALGO 2004 Symposium and Workshops
Includes ESA 2004; WABI 2004; WAOA 2004; IWPEC 2004; ATMOS 2004. Bergen, Norway; 14--17 September 2004.
ALGO 2005
Including ESA, WABI, WAOA and ATMOS. Eivissa, Balearic Islands, Spain; 3--7 October, 2005.
ALICE 2003
1st Workshop on Algorithms for Listing, Counting, and Enumeration. To run concurrently with ALENEX03 and co-located with SODA03. Baltimore, Maryland, USA; 11 January 2003.
The First Workshop on Analytic Algorithmics and Combinatorics. Held in conjunction with ALENEX04 and SODA04. New Orleans, LA, USA; 10 January 2004.
Analysis of Algorithms Seminar
Krynica Morska, near Gdansk, Poland; 3--7 July 2000. Abstracts, photographs.
Anogia Algorithmica '05
First workshop on open problems in algorithmics. Anogia Academic Village, Crete, Greece; 30 May -- 3 June 2005.
A workshop on approximation algorithms for combinatorial optimization problems focussing on algorithmic and complexity aspects arising in the development of efficient approximate solutions to computationally difficult problems. It aims, in particular, at fostering the cooperation among algorithmic and complexity researchers of the field. Part of ALGO 2002 in conjunction with ESA'2002 and WABI 2002. Universita' di Roma "La Sapienza", Roma, Italy; 17--21 September 2002.
Approximation and Randomized Algorithms
4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2001) and 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2001). Berkeley, California; August 18-20, 2001.
Bristol Algorithms Days '10 - Feasibility Workshop. 15 - 16 February 2010.
Computation, Combinatorics and Probability
Research programme at the Isaac Newton Institute, Cambridge UK. Themes include: Randomised algorithms; "Phase transitions" in statistical physics and computer science; Random graphs and structures. August -- December 2002.
ESA 2002
10th European Symposium on Algorithms. Part of Algo'02. University of Rome "La Sapienza", Italy; 17--21 September 2002.
ESA 2004
12th Annual European Symposium on Algorithms. Part of ALGO'04. Bergen, Norway; 14--17 September 2004.
Third international workshop on Implicit Computational Complexity. Co-located with PADO II and MFPS XVII. Aarhus, Denmark; 20--21 May 2001.
Logic and Algorithms
Research session at the Isaac Newton Institute for Mathematical Sciences, Cambridge, UK; 16 January -- 7 July 2006.
Logic and Algorithms
DIMACS special year 1995-6.
Random Structures and Algorithms 2001
Poznan, Poland; 6--10 August 2001.
Randomized and Derandomized Algorithms for Discrete Structures
DIMACS/IAS Workshop. Part of the special year on Large-scale Discrete Optimisation. Princeton, NJ, USA; 2--4 November 1998.
SAT 2001
Workshop on Theory and Applications of Satisfiability Testing. Boston University, MA, USA; 14--15 June 2001.
SAT 2002
Fifth International Symposium on the Theory and Applications of Satisfiability Testing. Cincinnati, Ohio, USA; 6--9 May 2002.
The Satisfiability Problem: Theory and Applications
DIMACS Workshop, Rutgers University, Piscataway, NJ, USA; 11--12 March 1996.
12th Annual ACM-SIAM Symposium on Discrete Algorithms. Washington, D.C., USA; 7--9 January 2001.
13th SIAM Symposium on Discrete Algorithms. San Francisco, CA, USA; 6--8 January 2002.
14th ACM-SIAM Symposium on Discrete Algorithms. Hyatt Regency, Baltimore, MD, USA; 12--14 January 2003.
Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Holiday Inn Golden Gateway Hotel, San Francisco, CA, USA; 25--27 January 1998.
ACM-SIAM Symposium on Discrete Algorithms. New Orleans, LA, USA; 11--13 January 2004.
SWAT 2000
The Seventh Scandinavian Workshop on Algorithm Theory. Bergen, Norway; 5--7 July 2000.
Tenth Seminar on Analysis of Algorithms
MSRI, Berkeley, CA; 14--18 June 2004.
URAW 2002
Upper Rhine Algorithms Workshop. ETH Zurich, Switzerland; 18--19 October 2002.
WADS 2001
Seventh International Workshop on Algorithms and Data Structures. Brown University, Providence, RI, USA; 8--10 August 2001.
WAFR 2002
Workshop on the Algorithmic Foundations of Robotics. Nice, France; 15--17 December 2002.
WAOA 2005
Third Workshop on Approximation and Online Algorithms: part of ALGO 2005. Hotel Torre del Mar, Ibiza, Spain; 6--7 October 2005.
WEA 2004
III Workshop on Efficient and Experimental Algorithms. Angra dos Reis, Rio de Janeiro, Brazil; 25--28 May 2004.
Workshop on Dynamic Algorithms and Applications
Following SODA04. New Orleans, LA, USA; 14 January 2004.
[Computer Mozilla]
Last update:
September 25, 2016 at 12:53:48 UTC
All Languages