Last call for papers CAAN 2005

Alex Lopez-Ortiz alopez-o at softbase.math.uwaterloo.ca
Fri Apr 8 12:45:19 PDT 2005




 2nd Workshop on Combinatorial and Algorithmic Aspects of Networking

                          CAAN 2005

                     LAST CALL FOR PAPERS


                    August 13th - 14th, 2004

                    Waterloo, Ontario, Canada


Following the success of the first Combinatorics and Algorithms Aspects of
Networking (CAAN04) conference that was held August 5-7, 2004 at the Banff
International Research Station (BIRS), CAAN05 will be held in Waterloo,
Ontario, Canada, August 13-14, 2005 as a satellite conference of the
Workshop on Algorithms and Data Structures (WADS 05), Waterloo, On,
Canada, August 15-17, 2005.

The Internet because of its size, decentralized nature, and loosely
controlled architecture provides a hotbed of challenges that are amenable
to mathematical analysis and algorithmic techniques. This conference
brings together mathematicians, theoretical computer scientists and
network specialists. This fast growing area is an intriguing intersection
of Computer Science/Graph Theory/Game Theory/Networks.

Original research papers are solicited. The list of topics for the
conference includes, but is not limited to: Economics, Game Theory and the
Internet, Geometric Routing, Web Caching, Combinatorics, Tomography,
Peer-to-peer systems, Graph Theory/Web Graph, Data Stream analysis,
Statistical Distributions, Optimization, and QoS, as they relate to
Networks in general and the Internet in particular. The conference will be
organized as a series of talks with time for focused discussions. We
solicit general participation and invite presentations on all aspects of
networking challenges that can be addressed using techniques from
theoretical computer science and mathematics. The goal of of the
conference is to foster interdisciplinary collaborations among researchers
in this field.

Paper submissions
Authors should send an extended abstract in postscript or PDF format by
May 2nd, 2005. The paper should not exceed 16 pages in length on
letter-size paper using 11 point or larger font. Submissions are open
using the SIGACT electronics submission server.
http://sigact.acm.org/~caan05/CAAN05.html

Program Committee

 Dimitris Achlioptas, Microsoft Research, USA
 Claus Bauer, Dolby Labs, USA
 Anthony Bonato, Wilfrid Laurier University, Canada
 Andrei Broder, IBM Research, USA
 Hervi Brvnniman, Polytechnic University, USA
 Erik Demaine, MIT, USA
 Thomas Erlebach, University of Leicester, UK
 Jean-Charles Gregoire, IIT and INRS-EMT, Canada
 Angele Hamel, Wilfrid Laurier University, Canada (Program Chair)
 Jochen Konemann, University of Waterloo, Canada
 Matthieu Latapy, LIAFA - Universite Paris 7
 Alejandro Lopez-Ortiz, University of Waterloo, Canada (Organizing Comm.
Chair)
 Rajeev Motwani, Stanford University, USA
 Ian Munro, University of Waterloo, Canada
 Tim Roughgarden, Stanford University, USA
 Rahul Sami, MIT, USA
 Shubho Sen, ATT, USA
 D. Sivakumar, IBM, USA
 Jan ven den Heuvel, London School of Economics, UK
 Gordon Wilfong, Bell Labs, USA






-- 
Alex Lopez-Ortiz                                   alopez-o at uwaterloo.ca
http://db.uwaterloo.ca/~alopez-o                     Associate Professor
School of Computer Science                        University of Waterloo


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.



More information about the Compgeom-announce mailing list