|
|
|
|
Home / Computers / Algorithms / Conferences / Past Conferences
|
| Categories |
|
|
|
|
|
|
|
|
Web Sites
|
- 1st International Workshop on Efficient Algorithms (WEA2001) - Riga, Latvia; August 24-25, 2001.
www.lami.univ-evry.fr/~bampis/WEA2001.html
- ALENEX 00 - 2nd Workshop on Algorithm Engineering and Experiments. San Francisco, CA, USA; 7--8 January 2000.
www.cs.unm.edu/Conferences/ALENEX00
- ALENEX 01 - 3rd Workshop on Algorithm Engineering and Experiments. Wyndham City Center Hotel, Washington, DC, USA; 5--6 January 2001.
www.research.att.com/~alb/ALENEX01
- ALENEX 02 - 4th Workshop on Algorithm Engineering and Experiments. San Francisco, CA, USA; 4--5 January 2002.
www.cs.umd.edu/~mount/ALENEX02
- ALENEX 99 - Workshop on Algorithm Engineering and Experimentation. Omni Hotel, Baltimore, MD, USA; 15--16 January 1999.
www.cs.jhu.edu/Conferences/ALENEX99
- Algorithms and Complexity Day - Department of Computer Science, University of Warwick, UK; 3 May 2002.
www.dcs.warwick.ac.uk/~msp/ACD.html
- Analysis of Algorithms Seminar - Krynica Morska, near Gdansk, Poland; 3--7 July 2000. Abstracts, photographs.
www.cs.purdue.edu/homes/spa/gdansk/aofa.html
- 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.
cui.unige.ch/tcs/random-approx
- CCC 2002 - 17th Conference on Computational Complexity. Co-located with STOC'02. Montréal, Québec, Canada; 21--24 May 2002.
omega.CRM.UMontreal.CA/CCC
- Complexity and Probability - A workshop and concentrated research course. Chalmers University of Technology, Göteborg, Sweden; 15--19 April 2002.
www.math.chalmers.se/~fredrikl/events/RandomWorkshop
- Computational Complexity and Statistical Physics - Santa Fe, New Mexico, USA; 4--6 September 2001.
cnls.lanl.gov/~gistrate/conference/cfp.html
- ESA 2001 - 9th Annual European Symposium on Algorithms. BRICS, University of Aarhus, Denmark; 28--31 August 2001.
www.brics.dk/esa2001
- ICC'01 - Third international workshop on Implicit Computational Complexity. Co-located with PADO II and MFPS XVII. Aarhus, Denmark; 20--21 May 2001.
www.dcs.ed.ac.uk/home/mxh/ICC01.html
- ISAAC'01 - International Symposium on Algorithms And Computation. Christchurch, New Zealand; 19--21 December 2001.
www.cosc.canterbury.ac.nz/isaac01
- Logic and Algorithms - DIMACS special year 1995-6.
dimacs.rutgers.edu/Workshops/index-la.html
- Optimal Discrete Structures and Algorithms (ODSA 2000) - The conference is devoted to combinatorial optimization and algorithms on discrete structures, extremal problems in posets, design theory, coding theory, cryptography, graph theory, complexity theory, and related topics. Rostock, Germany, September 11-13, 2000
ftp://neptun.math.uni-rostock.de/odsa.html
- Phase Transitions and Algorithmic Complexity - IPAM, Los Angelese, CA, USA; 3--5 June 2002.
www.ipam.ucla.edu/programs/ptac2002
- Random Structures and Algorithms - Poznan, Poland; 2--6 August 1999.
main.amu.edu.pl/~rsa99
- Random Structures and Algorithms 2001 - Poznan, Poland; 6--10 August 2001.
main.amu.edu.pl/~rsa2001
- 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.
dimacs.rutgers.edu/Workshops/Randomized
- SAT 2000 - Third Workshop on the Satisfiability Problem. Renesse, The Netherlands; 14--18 May 2000.
ssor.twi.tudelft.nl/~warners/sat2000.htm
- SAT 2001 - Workshop on Theory and Applications of Satisfiability Testing. Boston University, MA, USA; 14--15 June 2001.
www.cs.washington.edu/homes/kautz/sat2001
- SAT 2002 - Fifth International Symposium on the Theory and Applications of Satisfiability Testing. Cincinnati, Ohio, USA; 6--9 May 2002.
gauss.ececs.uc.edu/Workshops/SAT/sat2002.html
- SAT 2002 - Fifth International Symposium on the Theory and Applications of Satisfiability Testing. Cincinnati, Ohio, USA; 6--9 May 2002.
gauss.ececs.uc.edu/Conferences/SAT2002
- SAT'98 - Second workshop on the Satisfiability problem. Eringerfeld, Germany; 10--14 May 1998.
www.uni-paderborn.de/fachbereich/AG/agklbue/staff/lettmann/sat-workshop.html
- School on Algorithm Engineering - IASI-CNR, Rome, Italy; 10--12 September 2001.
www.info.uniroma2.it/~italiano/School
- SODA'01 - 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Washington, D.C., USA; 7--9 January 2001.
www.siam.org/meetings/da01
- SODA'02 - 13th SIAM Symposium on Discrete Algorithms. San Francisco, CA, USA; 6--8 January 2002.
www.siam.org/meetings/da02
- SODA'98 - Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Holiday Inn Golden Gateway Hotel, San Francisco, CA, USA; 25--27 January 1998.
www.siam.org/meetings/da98/da98home.htm
- SWAT 2000 - The Seventh Scandinavian Workshop on Algorithm Theory. Bergen, Norway; 5--7 July 2000.
www.ii.uib.no/swat2000
- SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory. Turku, Finland; 3--5 July 2002.
www.cs.utu.fi/swat2002
- The Satisfiability Problem: Theory and Applications - DIMACS Workshop, Rutgers University, Piscataway, NJ, USA; 11--12 March 1996.
dimacs.rutgers.edu/Workshops/Satisfiability
- WABI 2001 - First Workshop on Algorithms in BioInformatics: covering research in all aspects of algorithmic work in bioinformatics. The emphasis is on discrete algorithms that address important problems in molecular biology, that are founded on sound models, that are computationally efficient, and that have been implemented and tested in simulations and on real datasets. Jointly organized and colocated with ESA 2001 and WAE 2001 in the context of ALGO 2001. BRICS, University of Aarhus, Denmark; 28--31 August 2001.
www.brics.dk/wabi2001
- WADS 2001 - Seventh International Workshop on Algorithms and Data Structures. Brown University, Providence, RI, USA; 8--10 August 2001.
www.cs.brown.edu/cgc/wads2001
|
|
|
|
|