ComputersSquare.com The most comprehensive Computers web Directory
Home > Algorithms > Conferences > Past Conferences
Past Conferences
Listing:
  • ALENEX03
    5th Workshop on Algorithm Engineering and Experiments. Baltimore, Maryland, USA; 11 January 2003.
  • ALENEX 00
    2nd Workshop on Algorithm Engineering and Experiments. San Francisco, CA, USA; 7--8 January 2000.
  • ALENEX 01
    3rd Workshop on Algorithm Engineering and Experiments. Wyndham City Center Hotel, Washington, DC, USA; 5--6 January 2001.
  • ALENEX 02
    4th Workshop on Algorithm Engineering and Experiments. San Francisco, CA, USA; 4--5 January 2002.
  • ALENEX 99
    Workshop on Algorithm Engineering and Experimentation. Omni Hotel, Baltimore, MD, USA; 15--16 January 1999.
  • 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, Hanugary; 15--20 September 2003.
  • Algorithms and Complexity Day
    Department of Computer Science, University of Warwick, UK; 3 May 2002.
  • Algorithms for Hard Problems
    Bildungszentrum Matt, Schwarzenberg, Switzerland; 23--27 September 2002.
  • 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.
  • Analysis of Algorithms Seminar
    Krynica Morska, near Gdansk, Poland; 3--7 July 2000. Abstracts, photographs.
  • APPROX 2002
    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.
  • CCC 2002
    17th Conference on Computational Complexity. Co-located with STOC'02. Montr?al, Qu?bec, Canada; 21--24 May 2002.
  • Complexity and Probability
    A workshop and concentrated research course. Chalmers University of Technology, G?teborg, Sweden; 15--19 April 2002.
  • 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.
  • Computational Complexity and Statistical Physics
    Santa Fe, New Mexico, USA; 4--6 September 2001.
  • ESA 2001
    9th Annual European Symposium on Algorithms. BRICS, University of Aarhus, Denmark; 28--31 August 2001.
  • ESA 2002
    10th European Symposium on Algorithms. Part of Algo'02. University of Rome "La Sapienza", Italy; 17--21 September 2002.
  • ICC'01
    Third international workshop on Implicit Computational Complexity. Co-located with PADO II and MFPS XVII. Aarhus, Denmark; 20--21 May 2001.
  • ISAAC'01
    International Symposium on Algorithms And Computation. Christchurch, New Zealand; 19--21 December 2001.
  • ISAAC 2002
    The 13th Annual International Symposium on Algorithms and Computation. Vancouver, Canada; 20--23 November 2002.
  • ISAAC 2003
    14th Annual International Symposium on Algorithms and Computation. Kyoto, Japan; 15--17 December 2003.
  • Logic and Algorithms
    DIMACS special year 1995-6.
  • MCQMC 2002
    5th international conference on Monte Carlo and Quasi Monte Carlo methods. Singapore; 25--28 November 2002.
  • 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
  • Phase Transitions and Algorithmic Complexity
    IPAM, Los Angelese, CA, USA; 3--5 June 2002.
  • PSC'03
    Prague Stringology Conference. Czech Technical University, Prague; 22--23 September 2003.
  • Random Structures and Algorithms
    Poznan, Poland; 2--6 August 1999.
  • 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'98
    Second workshop on the Satisfiability problem. Eringerfeld, Germany; 10--14 May 1998.
  • SAT 2000
    Third Workshop on the Satisfiability Problem. Renesse, The Netherlands; 14--18 May 2000.
  • 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.
  • School on Algorithm Engineering
    IASI-CNR, Rome, Italy; 10--12 September 2001.
  • SODA'01
    12th Annual ACM-SIAM Symposium on Discrete Algorithms. Washington, D.C., USA; 7--9 January 2001.
  • SODA'02
    13th SIAM Symposium on Discrete Algorithms. San Francisco, CA, USA; 6--8 January 2002.
  • SODA'03
    14th ACM-SIAM Symposium on Discrete Algorithms. Hyatt Regency, Baltimore, MD, USA; 12--14 January 2003.
  • SODA'98
    Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Holiday Inn Golden Gateway Hotel, San Francisco, CA, USA; 25--27 January 1998.
  • 1st International Workshop on Efficient Algorithms (WEA2001)
    Riga, Latvia; August 24-25, 2001.
  • SWAT 2000
    The Seventh Scandinavian Workshop on Algorithm Theory. Bergen, Norway; 5--7 July 2000.
  • SWAT 2002
    8th Scandinavian Workshop on Algorithm Theory. Turku, Finland; 3--5 July 2002.
  • URAW 2002
    Upper Rhine Algorithms Workshop. ETH Zurich, Switzerland; 18--19 October 2002.
  • 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.
  • WABI 2002
    2nd Workshop on Algorithms in BioInformatics. Faculty of Engineering, University of Rome "La Sapienza", Italy; 16--21 September 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.
  • WEA 2003
    Second International Workshop on Experimental and Efficient Algorithms. Monte Verit?, Ascona, Switzerland; 26--29 May 2003.
  • WEA 2003 Summer School
    Algorithms for Hard Problems: prelude to WEA 2003. Lugano, Switzerland; 19--23 May 2003.
| Home | Contact us | About us | Link to us | Submit a site |
Information contained herein is deemed accurate and correct, but no warranty is implied or given
®Copyright ComputersSquare.com, Inc., 2004. All rights reserved