[DMANET] New York Computer Science and Economics day (NYCE): October 15th

We invite participants to the third New York Computer Science and
Economics Day (NYCE Day), October 15 2010, at the New York Academy of
Sciences, 7 World Trade Center. Details at:

www.nyas.org/nyce2010

NYCE Day is a gathering for people in the larger New York City
metropolitan area with interests in computer science, economics,
marketing and finance to discuss common research problems and topics in
a relaxed environment. The aim is to foster collaboration and the
exchange of ideas.

The program features invited speakers Robert Almgren (NYU and
Quantitative Brokers), Sham Kakade (Wharton), Robert Kleinberg
(Cornell), Hal Varian (Google), and Mihalis Yannakakis (Columbia), and a
rump session with short contributed presentations.

Call for Rump Session Speakers---Deadline September 13: We are currently
soliciting speakers for the rump session. Each speaker will have 5
minutes to describe a problem and result, an experiment/system and
results, or an open problem or a big challenge. If you would like to
speak, please send a one paragraph text description of what you would
like to present, including links to references if needed, to
physicalscience@nyas.org with NYCE in the subject line. Submissions must
be received by Monday, September 13 and accepted speakers will be
notified by September 20.

Your participation and suggestions are greatly welcome. Please pass this
information on to people who may be interested.

Thanks,
NYCE Organizers
Christian Borgs, Microsoft
Michael Kearns, University of Pennsylvania
Sebastien Lahaie, Yahoo!
Vahab Mirrokni, Google
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] EPTCS

Electronic Proceedings in Theoretical Computer Science

Electronic Proceedings in Theoretical Computer Science (EPTCS) was
launched by Rob van Glabbeek in 2009, as an initiative to have
proceedings of all worthy workshops in Theoretical Computer Science
freely available on-line. The papers in the proceedings are simply
entries in the CoRR repository, http://arxiv.org/corr. DOI numbers are
assigned to EPTCS publications, and they are indexed in CrossRef and
in the Directory of Open Access Journals. There is no charge for
authors or workshops/conferences.

The idea caught on like wildfire, and since EPTCS was launched 30
proceedings were published, and 22 more have been accepted for
publication, see http://forthcoming.eptcs.org.

Perhaps one of the reasons is that the procedure for submitting a
proposal is very simple, see http://apply.eptcs.org/ and our response
time to a proposal is very fast, usually less than 10 days.
Additionally, thanks to efficient workflow, proceedings usually appear
within 10 days after all the constituents have been delivered.

We find that it is very important to properly record workshop
proceedings in one, easily searchable place. Also, we want to
contribute in this way to the growing acceptance of the view that all
scientific publications should be freely available on-line.

We hope that researchers working in Theoretical Computer Science will
follow the example of the many others in accord with the originators
of this idea. Please see http://published.eptcs.org/ for the list of
published workshops.

The editors,

Rob van Glabbeek (NICTA, Sydney, Australia)
Editor in Chief
Luca Aceto (Reykjavik University)
Rajeev Alur (University of Pennsylvania)
Krzysztof R. Apt (CWI and University of Amsterdam)
Lars Arge (Aarhus University)
Ran Canetti (Tel Aviv University)
Luca Cardelli (Microsoft Research)
Rocco De Nicola (Universita di Firenze)
Jose Luiz Fiadeiro (University of Leicester)
Wan Fokkink (Vrije Universiteit Amsterdam)
Lane A. Hemaspaandra (University of Rochester)
Matthew Hennessy (Trinity College Dublin)
Bartek Klin (Warsaw University, University of Cambridge)
Evangelos Kranakis (Carleton University)
Shay Kutten (Technion)
Nancy Lynch (Massachusetts Institute of Technology)
Aart Middeldorp (University of Innsbruck)
Benjamin Pierce (University of Pennsylvania)
Gordon Plotkin (University of Edinburgh)
Vladimiro Sassone (University of Southampton)
Robert H. Sloan (University of Illinois at Chicago)
Wolfgang Thomas (RWTH Aachen University)
Irek Ulidowski (University of Leicester)
Dorothea Wagner (Universitaet Karlsruhe (TH))
Martin Wirsing (LMU Munich)
Moti Yung (Google Inc. and Columbia University)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CATS 2011 - Extended submission deadline

The CATS submission deadline was extended to Monday August 30.

---

CATS 2011 -- Computing: The Australasian Theory Symposium
Perth, Australia, January 17-20, 2011
http://cats.it.usyd.edu.au/

The 17th Computing: The Australasian Theory Symposium (CATS) will be held in
Perth, Australia, January 17-20, 2011. CATS is an annual conference held in
the Australia-New Zealand region, dedicated to theoretical computer science.

Authors are invited to submit papers that present original and unpublished
research on topics related to theoretical aspects of computer science,
including (but not limited to): algorithms and data structures, algorithmic
game theory, combinatorial optimization, computability, computational
complexity theory, computational geometry, foundational calculi, graph
theory and combinatorics, logic and type systems, program derivation,
analysis, transformation, program verification and safety, semantics of
programming languages, theory of programming.

(Extended) Deadlines and other dates:
Submission Deadline: 30 August 2010
Notification of Acceptance: 11 October 2010
Final Camera-Ready Papers: 10 November 2010
Author Registration Deadline: 12 November 2010
Early-Bird Registration Deadline: 6 December 2010

Conference dates: January 17-20, 2011

The proceedings of this event will be published by the Australian Computer
Society (ACS) in the CRPIT Series (http://crpit.com/), and will also appear
in the ACM digital library.

CATS 2011 is part of the Australasian Computer Science Week (ACSW), an
international annual conference event, supported by the Computing Research
and Education Association (CORE) in Australia. ACSW 2011 is hosted by Curtin
University in Perth, Australia.

For more information please visit http://cats.it.usyd.edu.au/
Contact: taso viglas and alex potanin at <cats2011@easychair.org>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] DIALM-POMC 2010 Call for Participation and Accepted Papers

Dear all,

Below is the list of accepted papers to ACM SIGACT-SIGMOBILE DIALM-POMC
2010, which will be held on September 16 in Cambridge, MA, USA. We will have
an exciting program at the workshop, with very high quality papers and
invited talks by Rajmohan Rajaraman, Northeastern U., and Ranveer Chandra,
Microsoft Research. We hope to see you there! For more information on
DIALM-POMC 2010 and registration, please go to

http://dialm-pomc2010.engineering.asu.edu/

Andrea Richa and Thomas Moscibroda, PC Chairs
________________________________________________________________________________________________
Decomposing Broadcast Algorithms Using Abstract MAC Layers
Majid Khabbazian, Dariusz Kowalski, Fabian Kuhn and Nancy Lynch

Radio Cover Time in Hyper-Graphs
Chen Avin, Yuval Lando and Zvi Lotker

Data Transmission and Base-Station Placement for Optimizing Network
Lifetime
Esther Arkin, Alon Efrat, Joseph Mitchell, Srinivasan Ramasubramanian,
Valentin Polishchuk, Swaminathan Sankararaman and Javad Taheri

Bandwidth Allocation in Cellular Networks with Multiple Interferences
Reuven Bar-Yehuda, Gleb Polevoy and Dror Rawitz

Reliable Neighbor Discovery for Mobile Ad Hoc Networks
Alejandro Cornejo, Saira Viqar and Jennifer Welch

Finding Available Parking Spaces Made Easy
Andreas Klappenecker, Hyunyoung Lee and Jennifer Welch

Prioritized Gossip in Vehicular Networks
Alejandro Cornejo and Calvin Newport

Direction Election in Flocking Swarms
Ohad Ben-Shahar, Shlomi Dolev, Andrey Dolgin and Michael Segal

Regional Consecutive Leader Election in Mobile Ad-Hoc Networks
Hyun Chul Chung, Peter Robinson and Jennifer Welch

Information Security for Sensors by Overwhelming Random Sequences and
Permutations
Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano and Paul G.
Spirakis
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

2011 NSF EAPSI Fellowship Program Now Open

NATIONAL SCIENCE FOUNDATION EAST ASIA AND PACIFIC SUMMER INSTITUTES FOR U.S. GRADUATE STUDENTS - 2011 APPLICATION NOW OPEN

(Link: www.nsfsi.org )
  
The National Science Foundation (NSF) East Asia and Pacific Summer Institutes for U.S. Graduate Students (EAPSI) is a flagship international fellowship program for developing the next generation of globally  engaged U.S. scientists and engineers knowledgeable about the Asian and Pacific regions. The Summer Institutes are hosted by foreign counterparts committed to increasing opportunities for young U.S. researchers to work in research facilities and with host mentors abroad. Fellows are supported to participate in eight-week research experiences at host laboratories in Australia, China, Japan (10 weeks), Korea, New Zealand, Singapore and Taiwan from June to August. The program provides a $5,000 summer stipend, round-trip airfare to the host location, living expenses abroad, and an introduction to the society, culture, language, and research environment of the host location.

The 2011 application is now open and will close at 5:00 pm local time on November 10, 2010.  Application instructions are available online at www.nsfsi.org. For further information concerning benefits, eligibility, and tips on applying, applicants are encouraged to visit www.nsf.gov/eapsi or www.nsfsi.org.

NSF recognizes the importance of enabling U.S. researchers and educators to advance their work through international collaborations and the value of ensuring that future generations of U.S. scientists and engineers gain professional experience beyond this nation's borders early in their careers. The program is intended for U.S. graduate students pursuing studies in fields supported by the National Science Foundation. Women, minorities, and persons with disabilities are strongly encouraged to apply for the EAPSI. Applicants must be enrolled in a research-oriented master's or PhD program and be U.S. citizens or U.S. permanent residents by the application deadline date. Students in combined bachelor/master degree programs must have matriculated from the undergraduate degree program by the application deadline date.

The first Summer Institutes began in Japan in 1990, and to date over 2,000 U.S. graduate students have participated in the program.

Should you have any questions, please contact the EAPSI Help Desk by email at eapsi@nsfsi.org or by phone at 1-866-501-2922.

Electronic Proceedings in Theoretical Computer Science

Electronic Proceedings in Theoretical Computer Science (EPTCS) was
launched by Rob van Glabbeek in 2009, as an initiative to have
proceedings of all worthy workshops in Theoretical Computer Science
freely available on-line. The papers in the proceedings are simply
entries in the CoRR repository, http://arxiv.org/corr. DOI numbers are
assigned to EPTCS publications, and they are indexed in CrossRef and
in the Directory of Open Access Journals.  There is no charge for
authors or workshops/conferences.

The idea caught on like wildfire, and since EPTCS was launched 30
proceedings were published, and 22 more have been accepted for
publication, see http://forthcoming.eptcs.org.

Perhaps one of the reasons is that the procedure for submitting a
proposal is very simple, see http://apply.eptcs.org/ and our response
time to a proposal is very fast, usually less than 10 days.
Additionally, thanks to efficient workflow, proceedings usually appear
within 10 days after all the constituents have been delivered.

We find that it is very important to properly record workshop
proceedings in one, easily searchable place. Also, we want to
contribute in this way to the growing acceptance of the view that all
scientific publications should be freely available on-line.

We hope that researchers working in Theoretical Computer Science will
follow the example of the many others in accord with the originators
of this idea.  Please see http://published.eptcs.org/ for the list of
published workshops.

The editors,

Rob van Glabbeek (NICTA, Sydney, Australia)
  Editor in Chief
Luca Aceto (Reykjavik University)
Rajeev Alur (University of Pennsylvania)
Krzysztof R. Apt (CWI and University of Amsterdam)
Lars Arge (Aarhus University)
Ran Canetti (Tel Aviv University)
Luca Cardelli (Microsoft Research)
Rocco De Nicola (Universita di Firenze)
Jose Luiz Fiadeiro (University of Leicester)
Wan Fokkink  (Vrije Universiteit Amsterdam)
Lane A. Hemaspaandra (University of Rochester)
Matthew Hennessy (Trinity College Dublin)
Bartek Klin (Warsaw University, University of Cambridge)
Evangelos Kranakis (Carleton University)
Shay Kutten (Technion)
Nancy Lynch (Massachusetts Institute of Technology)
Aart Middeldorp (University of Innsbruck)
Benjamin Pierce (University of Pennsylvania)
Gordon Plotkin (University of Edinburgh)
Vladimiro Sassone (University of Southampton)
Robert H. Sloan (University of Illinois at Chicago)
Wolfgang Thomas (RWTH Aachen University)
Irek Ulidowski (University of Leicester)
Dorothea Wagner (Universitaet Karlsruhe (TH))
Martin Wirsing (LMU Munich)
Moti Yung (Google Inc. and Columbia University)

NSF Graduate Research Fellowship Applications Open

The National Science Foundation's Graduate Research Fellowship Program (GRFP) helps ensure the vitality of the human resource base of science and engineering in the United States and reinforces its diversity.  The program recognizes and supports outstanding graduate students in NSF-supported science, technology, engineering, and mathematics disciplines who are pursuing research-based master's and doctoral degrees in the U.S. and abroad.  The NSF welcomes applications from all qualified students and strongly encourages under-represented populations, including women, under-represented racial and ethnic minorities, and persons with disabilities, to apply for this fellowship.


Computer Science Deadline is November 18.

http://www.nsfgrfp.org/

Rutgers Faculty Hiring in Cryptography

The Department of Computer Science at Rutgers University invites applications for faculty positions at all ranks, with appointments starting in September 2011. The search focuses on theoretical and applied cryptography, although all candidates whose research deals with security will be considered.

Applicants for this position must have completed or be in the process of completing a dissertation in Computer Science or a closely related field, and should show evidence of exceptional research promise, potential for developing an externally funded research program, and commitment to quality advising and teaching at the graduate and undergraduate levels. Candidates are expected to have defended their PhD by the start of the fall semester.

Applicants should go to http://www.cs.rutgers.edu/employment/positions.php?action=positiondetail&position_id=41 to apply. Required materials are a curriculum vitae, a research statement addressing both past work and future plans, a teaching statement, and three references.

Applications should be received by November 15, 2010 for full consideration.

Rutgers values academic diversity and encourages applications from individuals with a variety of experiences, perspectives, and backgrounds. Females, minorities, dual-career couples, and persons with disabilities are encouraged to apply.

Rutgers is an affirmative action/equal opportunity employer.

PhD Stipend in Algorithmics

The Department of Mathematics and Computer Science at the
University of Southern Denmark has funding for a PhD student
for a project in Algorithmics. The project will be in one of the
areas of On-Line Algorithms, Graph Algorithms, and Bioinformatics.
Further information about these areas and projects can be found at:
http://www.imada.sdu.dk/~joan/areas.html

The qualifications necessary for application are:

1. A course in Algorithms and Complexity. This is a course beyond a
low level course on Data Structures.

2. A Master's degree in Computer Science, or a Bachelor's degree in
Computer Science with one year of courses beyond a 3-year Bachelor's
degree. (Note that the PhD programme lasts three years in the first
case and four in the second.) The degree cannot be from the University
of Southern Denmark. For the area graph algorithms, degrees in
Mathematics are also acceptable.

3. Excellent grades and letters of recommendation.

4. Interest and motivation to work in one of these areas.

5. Fluency in English.

The expected start date for these scholarships is January 17, 2010. The
amount of the scholarship, which is paid as salary (including pension
contribuations and vacation money), is about 380,000.00 DKK (equivalent to
approx. 51,000.00 Euros or $71,000.00 US) per year for students who
already have a Master's degree. The salary starts lower for students who
do not have a Master's degree making the total salary over four years
approximately the same as the salary over three years for the students
with a Master's degree.

The algorithmics group at the Department of Mathematics and Computer Science
provides a very strong scientific environment combined with a friendly
atmosphere.

The University of Southern Denmark was founded in 1966 and currently has
several campuses, with a total of almost 20,000 students. The Department of
Mathematics and Computer Science resides at the main campus which is located
in Odense, the third largest city in Denmark, a country known for its high
standard of living, high tech industry, and cultural scene.

The application deadline is October 20, 2010.

For application details see:

http://www.jobs.sdu.dk/vis_stilling.php?id=6054&lang=eng

For further information, please contact Joan Boyar, joan@imada.sdu.dk.

[DMANET] PhD position in Department of Computer Science, Royal Holloway, University of London

We are looking for a PhD candidate with a strong mathematical
background interested in doing PhD in the area of
parameterized algorithms and complexity, see http://fpt.wikidot.com/
and www.cs.rhul.ac.uk/home/gutin/publ.pdf

The PhD student will start in mid-September 2010 and will be
supervised by Prof. Gregory Gutin and Dr. Anders Yeo.

Since the start day is very close and because of funding issues, to
express your interest please write to Gregory Gutin,
gutin@cs.rhul.ac.uk, as soon as possible preferably this week.

--
Professor Gregory Z. Gutin
Acting Head of Department
Department of Computer Science
Royal Holloway, University of London
Egham, Surrey, TW20 0EX, UK
tel: +44-1784414229; fax: +44-1784439786
web: www.cs.rhul.ac.uk/home/gutin
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Call for Papers: 20th Annual Fall Workshop on Computational Geometry, Oct 29-30

20th Annual Fall Workshop on Computational Geometry
October 29-30, 2010

Stony Brook University
http://www.ams.sunysb.edu/~jsbm/fwcg-2010.html

SCOPE AND FORMAT:
The aim of this workshop is to bring together students and researchers
from academia and industry, to stimulate collaboration on problems of
common interest arising in geometric computations. Topics to be covered
include, but are not limited to:

Algorithmic methods in geometry and topology
Sensor networks and network technologies
I/O-scalable geometric algorithms
Animation of geometric algorithms
Computer graphics
Solid modeling
Geographic information systems
Computational metrology
Graph drawing
Experimental studies
Folding and unfolding
Geometric data structures
Implementation issues
Robustness in geometric computations
Computer vision
Robotics
Computer-aided design
Mesh generation
Manufacturing applications of geometry
Computational biology and geometric computations

Following the tradition of the previous Fall Workshops on
Computational Geometry, the format of the workshop will be informal,
extending over 2 days, with several breaks scheduled for discussions.
The workshop is open to the public, with no registration fee.
There will be an Open Problem Session where participants are encouraged
to pose and present research questions.

CONFIRMED INVITED SPEAKERS:
Christopher J. Bishop
Erik Demaine

SUBMISSIONS:
Authors are invited to submit abstracts (up to 4 pages) for
contributed talks to be given at the workshop. Submission is via the
workshop web page or by email to joseph.mitchell@stonybrook.edu, with
"FWCG" in the subject. We encourage submissions of full paper drafts
(if available) along with the abstract. Because there are no formal
proceedings for the workshop, submission of material that is to be
submitted to (or to appear in) a refereed conference (e.g., SODA'2011,
SoCG'2011) is allowed and encouraged; please indicate clearly with the
submission if the work has already been presented/accepted elsewhere.
Contributed talk abstracts, due by October 1, will be reviewed by the
program committee, with notification by October 11.

In addition to presentations of contributed talks, the workshop will
feature a poster session. Poster abstracts (1-4 pages) are due by
October 15. Poster presentations may include software demonstrations,
as appropriate.

IMPORTANT DATES:
Abstract submission: Friday October 1, 2010
Notification of acceptance: Monday October 11, 2010
Poster submissions: Friday October 15, 2010
Hotel block deadline: Friday October 15, 2010
Final abstracts due: Monday October 25, 2010
Registration (no fee): Monday October 25, 2010
Workshop: Fri-Sat October 29-30, 2010

PROGRAM COMMITTEE:
Esther M. Arkin (Stony Brook University)
Gill Barequet (Technion)
Ovidiu Daescu (UT Dallas)
Jie Gao (Stony Brook University)
Gary Miller (Carnegie Mellon University)
Joseph S. B. Mitchell (chair, Stony Brook University)
Diane L. Souvaine (Tufts University)

STUDENT TRAVEL SUPPORT:
Thanks to support from NSF, there will be a limited amount of travel
support available for students/postdocs who do not have other sources
of travel money. Requests can be made online.

SPONSORSHIP:
Sponsored by the National Science Foundation, the Department of
Applied Mathematics and Statistics at Stony Brook University,
the Center of Excellence in Wireless and Information Technology (CEWIT),
and the Simons Center for Geometry and Physics.

HISTORY:
This series of Fall Workshops on Computational Geometry was originally
founded in 1991 under the sponsorship of the Mathematical Sciences
Institute (MSI) at Stony Brook, with funding from the U. S. Army
Research Office providing support during 1991-1995. It continued
during 1996-1999 under the sponsorship of the Center for Geometric
Computing, a collaborative center of Brown, Duke, and Johns Hopkins
Universities, also funded by the U.S. Army Research Office. The
workshop returned in 2000 to Stony Brook for its tenth year, and then
was hosted at Polytechnic University, Brooklyn, NY in 2001. The
twelfth workshop (2002) was part of the Special Focus on Computational
Geometry and Applications at DIMACS, while the thirteenth (2003) was
part of the the Mathematical Foundation of Geometric Algorithms, as
part of the Special Semester on Computational Geometry at Mathematical
Sciences Research Institute, Berkeley. The fourteenth through
nineteenth workshops were hosted at MIT, the University of
Pennsylvania, Smith College, IBM T.J. Watson Research Center,
Rensselaer Polytechnic Institute, and Tufts University, respectively.
In 2010, we are pleased to host the 20th Fall Workshop on
Computational Geometry back at Stony Brook University, its founding
location.

[DMANET] Call for papers: ANALCO'11

Call for papers:

ANalytic ALgorithmics and COmbinatorics -- ANALCO'11
San Francisco, California, USA
January 22, 2011
http://www.siam.org/meetings/analco11/

Description
===========

The Workshop on Analytic Algorithmics and Combinatorics
(ANALCO'11) will be held on January 22, 2011, at the
Holiday Inn San Francisco Golden Gateway, San Francisco,
California, USA.

The aim of the ANALCO workshop is to provide a forum for
the presentation of original research in the analysis of
algorithms and associated combinatorial structures. We
invite both papers that study properties of fundamental
combinatorial structures that arise in practical
computational applications (such as permutations, trees,
strings, tries, and graphs) and papers that address the
precise analysis of algorithms for processing such
structures, including: average-case analysis; analysis
of moments, extrema, and distributions; probabilistic
analysis of randomized algorithms, and so on.

Submissions that present significant new information
about classic algorithms are welcome, as are new analyses
of new algorithms that present unique analytic challenges.
We also invite submissions that address tools and techniques
for the analysis of algorithms and combinatorial structures,
both mathematical and computational.

This workshop is co-located with the ACM-SIAM Symposium
on Discrete Algorithms -- SODA'11:
http://www.siam.org/meetings/da11/
and will take place the day preceding that conference.
The workshop is also co-located with the Workshop on
Algorithm Engineering and Experimentation -- ALENEX11:
http://www.siam.org/meetings/alenex11/
and will take place on the same day. Since researchers
in both fields are approaching the problem of learning
detailed information about the performance of particular
algorithms, we expect that interesting synergies will
develop.

Registrants from either workshop will be cross-registered
with the other. Proceedings of ALENEX and ANALCO will
be available online in January 2011.

A paper that has been reviewed and accepted for
presentation at SODA is not eligible for submission to
ANALCO. We recognize, however that some research projects
spawn multiple papers that elaborate on different aspects
of the work and are willing to respond to inquiries about
SODA, ALENEX, and ANALCO papers that may overlap. Papers
of interest to both the ALENEX and the ANALCO communities
are particularly encouraged. Such papers may be submitted
to either workshop and will, as appropriate, be presented
in a joint session. The ANALCO workshop is supported by
SIAM (Society for Industrial and Applied Mathematics).

Important Deadlines
===================

SUBMISSION DEADLINE
October 4, 2010

PRE-REGISTRATION DEADLINE
December 20, 2010

HOTEL RESERVATION DEADLINE
December 20, 2010

Program Committee
=================

Philippe Flajolet (Co-chair), INRIA Rocquencourt, France
Daniel Panario (Co-chair), Carleton University, Canada

Luc Devroye, McGill University, Canada
Eric Fusy, Ecole Polytechnique, France
Zhicheng (Jason) Gao, Carleton University, Canada
Michael T. Goodrich, University of California - Irvine, USA
Hsien-Kuei Hwang, Academia Sinica, Taiwan
Manuel Lladser, The University of Colorado, USA
Colin McDiarmid, University of Oxford, England
Marni Mishna, Simon Fraser University, Canada
Markus Nebel, University of Kaiserslautern, Germany
Brigitte Vallee, Universite de Caen, France

Invited Speaker
===============

Rober Sedgewick, Princeton University, USA
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

postdoc vacancy in security & formal methods

In the DASDIP project (Design and Analysis of Secure Distributed
Protocols) there is a vacancy for a 2.5 year post-doc position at
the Vrije Universiteit in Amsterdam

DASDIP is a joint research project between the Theoretical
Computer Science group in Amsterdam (www.cs.vu.nl/~tcs) and
the Digital Security group in Nijmegen (www.ru.nl/ds/).

The project involves research at the crossroads of security,
formal methods, and distributed computations and procotols.

Taking the established theory of traditional distributed protocols
(such as consensus, leader election, or atomic commit) as starting
point, the project aims to study secure distributed protocols,
taking into account the possibility of malicious behaviour and the
realisation of security goals. More information on the project can
be found at

http://www.cs.vu.nl/~wanf/dasdip.pdf

To apply, send a CV, letter of motivation, and names of at least
two references to Wan Fokkink (wanf@cs.vu.nl). Deadline for
application is September 21, 2010.

[DMANET] PhD Stipend in Algorithmics

The Department of Mathematics and Computer Science at the
University of Southern Denmark has funding for a PhD student
for a project in Algorithmics. The project will be in one of the
areas of On-Line Algorithms, Graph Algorithms, and Bioinformatics.
Further information about these areas and projects can be found at:
http://www.imada.sdu.dk/~joan/areas.html

The qualifications necessary for application are:

1. A course in Algorithms and Complexity. This is a course beyond a
low level course on Data Structures.

2. A Master's degree in Computer Science, or a Bachelor's degree in
Computer Science with one year of courses beyond a 3-year Bachelor's
degree. (Note that the PhD programme lasts three years in the first
case and four in the second.) The degree cannot be from the University
of Southern Denmark. For the area graph algorithms, degrees in Mathematics
are also acceptable.

3. Excellent grades and letters of recommendation.

4. Interest and motivation to work in one of these areas.

5. Fluency in English.

The expected start date for these scholarships is January 17, 2010. The
amount of the scholarship, which is paid as salary (including pension
contribuations and vacation money), is about 380,000.00 DKK (equivalent to
approx. 51,000.00 Euros or $71,000.00 US) per year for students who
already have a Master's degree. The salary starts lower for students who
do not have a Master's degree making the total salary over four years
approximately the same as the salary over three years for the students
with a Master's degree.

The algorithmics group at the Department of Mathematics and Computer Science
provides a very strong scientific environment combined with a friendly atmosphere.
The University of Southern Denmark was founded in 1966 and currently has several
campuses, with a total of almost 20,000 students. The Department of Mathematics
and Computer Science resides at the main campus which is located in Odense, the
third largest city in Denmark, a country known for its high standard of living,
high tech industry, and cultural scene.

The application deadline is October 20, 2010.
For application details see:
http://www.jobs.sdu.dk/vis_stilling.php?id=6054&lang=eng
For further information, please contact Joan Boyar, joan@imada.sdu.dk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] BDC 2010 - EXTENSION OF DEADLINE

Abstract submission close: September 6
Notification: September 13
Close of Early Bird: September 20

The Inaugural Biomarker Discovery Conference (BDC 2010) will be held in magnificent Shoal Bay, NSW. It showcases the latest innovations in Biomarker Discovery using genomic, proteomic and metabolomic tools and methods. International experts in all these fields and bioinformatics will be presenting at the meeting. Cancer and Neurobiology will be important topics and there will be specialist workshops on aspects of biomarker discovery, bioinformatics and applications.

Deadline for abstract submission is September 6. For more information please see our web site http://bdc.mtci.com.au/.

Kind regards,
Elena Prieto

_________________________________________________

Dr. Elena Prieto
Research Academic
Centre for Bioinformatics, Biomarker Discovery and Information-based Medicine
The University of Newcastle

Ph. (02) 49217758 (Tuesday, Thursday and Fridays)

AUSTRALIA
_________________________________________________

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

ALT 2010 - early registration deadline Sep 01

CALL FOR PARTICIPATION - ALT 2010

Dear colleagues,

The early registration deadline for the 21st International Conference
on Algorithmic Learning Theory (ALT 2010) is approaching; please
register on or before ** September 1, 2010 ** to ensure early-bird fees.

You can find the online registration site at:
http://www-alg.ist.hokudai.ac.jp/~thomas/ALT10/regist.html

ALT 2010 will be held in Canberra, Australia, October 6-8, 2010.
ALT will be co-located with the 13th International Conference on
Discovery Science (DS).

The invited speakers for ALT and DS 2010 are
Peter L. Bartlett
Ivan Bratko
Alexander Clark
Rao Kotagiri
Manfred K. Warmuth

For more information see
http://www-alg.ist.hokudai.ac.jp/~thomas/ALT10/alt10.jhtml

----------

Dr. Sandra Zilles
Assistant Professor
Department of Computer Science
University of Regina
Canada

Postdoc Opening

Dear Colleagues,

The Department of Computer Science and Engineering at Michigan State
University has an open postdoctoral fellow position for two NSF funded
projects on designing advanced high-speed algorithms for packet processing
systems. One project focuses on packet classification algorithms for quickly
processing packet headers. The other project focuses on developing deep
packet inspection algorithms and architectures for parsing and extracting
information from application protocol flows. The two principal investigators
are Professor Alex Liu and Professor Eric Torng. For the style of the
research that we have done, please refer to
http://www.cse.msu.edu/~alexliu/. The postdoc position would start as early
as August 2010 and last for a minimum of one year, with extensions possible
based on research performance and availability of funds. Salary to be
determined based upon qualifications.

Qualified candidates should meet the following requirements:
1. Strong publication record in top conferences and journals.
2. Be proficient in the design, analysis, and optimization of algorithms.
3. Be proficient in programming. Familiarity with C# and F# is preferred.
4. Have taken compiler courses.

Application materials include:
(1) A brief cover letter highlighting your qualifications
(2) A CV
(3) The link to candidate's homepage where most significant papers are
available
(4) Contact information for 3 references.

All application materials should be sent directly to Professor Alex Liu:
alexliu@cse.msu.edu and Professor Eric Torng: torng@msu.edu.

Please forward this message to researchers who may be interested. Thank you
very much for your attention.

Eric Torng
Associate Professor and Graduate Director
Department of Computer Science and Engineering
Michigan State University
East Lansing, MI 48824
http://www.cse.msu.edu/~torng/

Postdoc Opening

Dear Colleagues, The Department of Computer Science and Engineering at Michigan State University has an open postdoctoral fellow position for two NSF funded projects on designing advanced high-speed algorithms for packet processing systems. One project focuses on packet classification algorithms for quickly processing packet headers. The other project focuses on developing deep packet inspection algorithms and architectures for parsing and extracting information from application protocol flows. The two principal investigators are Professor Alex Liu and Professor Eric Torng. For the style of the research that we have done, please refer to http://www.cse.msu.edu/~alexliu/. The postdoc position would start as early as August 2010 and last for a minimum of one year, with extensions possible based on research performance and availability of funds. Salary to be determined based upon qualifications. Qualified candidates should meet the following requirements: 1. Strong publication record in top conferences and journals. 2. Be proficient in the design, analysis, and optimization of algorithms. 3. Be proficient in programming. Familiarity with C# and F# is preferred. 4. Have taken compiler courses. Application materials include: (1) A brief cover letter highlighting your qualifications (2) A CV (3) The link to candidate's homepage where most significant papers are available (4) Contact information for 3 references. All application materials should be sent directly to Professor Alex Liu: alexliu@cse.msu.edu and Professor Eric Torng: torng@msu.edu. Please forward this message to researchers who may be interested. Thank you very much for your attention. Eric Torng Associate Professor and Graduate Director Department of Computer Science and Engineering Michigan State University East Lansing, MI 48824 http://www.cse.msu.edu/~torng/ (517) 353-3543

[DMANET] PhD Studentship in Optimisation and River Infrastructure Planning

PhD Studentship in Optimisation and River Infrastructure Planning
Kent Business School
University of Kent

Applications are invited for a full-time PhD studentship in the area of
Optimisation and River Infrastructure Planning starting (ideally) in
January 2011. The studentship, which is supported through an EPSRC
Doctoral Training Grant, will involve working on an interdisciplinary
research project entitled 'Next Generation Decision Planning Methods for
River Infrastructure Placement and Mitigation' under the supervision of
Dr Jesse O'Hanley. The main objective of the project is to develop novel
optimisation models for prioritising river infrastructure removal and
other mitigation activities, as well as identifying sites for future
river infrastructure expansion, while taking into account a host of key
environmental/ecological impacts (e.g. stream flow, sediment transport,
water quality, habitat availability and fish dispersal) and
socioeconomic impacts (e.g. recreation, fishing, water supply, flood
control and hydropower generation). Multi-objective and stochastic
integer programming techniques will be investigated together with
exact/heuristic solution methods. Further, depending on the student's
interests, application of Bayesian statistical methods may also be explored.

The PhD student will join the Management Science group within the Kent
Business School. The Management Science group is one of the largest and
top rated research groups in the UK. Further advanced training in
operational research and statistics is available through the EPSRC's
NATCOR programme. As part of the project, the PhD will also have the
opportunity to reside for up to one academic term in the US in order to
work and study under the guidance of a leading academic (Prof Michael
Kuby) from the School of Geographical Sciences and Urban Planning at
Arizona State University. Prof Kuby specialises in the field of
optimisation and Geographic Information Systems (GIS) applied to
transportation, energy, and environmental planning. Additional
short-term visits to Scotland in order to work and liaise with the
Scottish Environment Protection Agency, the main external project
partner, may also be required.

The studentship covers Home/EU fees and provides a monthly stipend
(approximately GBP13,500 p.a). Only UK/EU citizens are eligible to apply.
The ideal candidate would normally be expected to hold a 2:1 or First
class honours degree plus an MSc, or equivalently an upper 5-year
undergraduate degree if coming from Europe, with a background in
operational research, mathematics, statistics, computer science or some
other quantitative discipline relating to the project. Excellent written
and verbal communication skills are essential. Knowledge of or
experience in the use of one or more of the following is highly
desirable: optimisation modelling, algorithm design, CPLEX (or some
other optimisation software package), computer programming (preferably
C/C++ or Java), inferential statistics, GIS, environmental economics,
ecological/environmental modelling. Applications will be assessed based
on previous academic achievements and relevant skills.

How to Apply

Applications should be sent to Claire Baldock, Research Secretary, Kent
Business School, University of Kent, Canterbury, Kent CT2 7PE, telephone
01227 823009, e-mail c.a.baldock@kent.ac.uk quoting EPSRC DTA PhD
Studentship in the e-mail subject. Further details regarding the
studentship are available through the web link below:

http://www.kent.ac.uk/kbs/programmes/research/opportunities/index.html

Applications should be sent electronically and include all of the
following materials:

- A cover letter explaining your specific interest in the research
project, relevant training and skills appropriate to working on the
project, and long-term career goals
- A curriculum vitae (CV)
- Official transcript(s) of your undergraduate/postgraduate degrees
- Names and contact information of two references (one of which must be
from an academic institution you have studied at) who can supply letters
of support if short-listed for the position
- Any English qualifications obtained if English is not your first language

Informal enquiries may be directed by email to:

Dr Jesse O'Hanley, Kent Business School, e-mail j.ohanley@kent.ac.uk

Completed applications should be received no later than: 15 September 2010
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

PhD scholarships 2011 -- Galileo School -- Pisa

********** PLEASE POST ************

We would like to announce a number of grants reserved for candidates
educated outside Italy at the Phd School Galileo Galilei:
http://dottorato.unipi.it/index.php?option=com_remository&Itemid=23&func=select&id=38&lang=it

The deadline for applications is September 30th, 2010, and the
selection will be made on CV and reference letters.

For further details, see the attached call (galilei2011) and visit:
http://www.di.unipi.it/galilei/

There are also further grants for 10 or more PhD positions, for
italian and foreign candidates, to be selected through a written and
oral exam, also in English (see the attachment "scheda-2011-inf" and,
from the web site
http://dottorato.unipi.it/index.php?option=com_content&view=article&id=13&Itemid=5&lang=it,
follow the link "Informazioni sulle selezioni (Allegati A)")
--

+++++++++++++++++++++++++++++++++++++++++++++++++++++
Prof. Pierpaolo Degano

Dipartimento di Informatica
Universita' di Pisa
Largo Bruno Pontecorvo, 3 -- I-56127 PISA, Italia
Tel: +39 050 2212757 Fax: +39 050 2212726
e_mail: degano@di.unipi.it
http://www.di.unipi.it/~degano
+++++++++++++++++++++++++++++++++++++++++++++++++++++++