Monday, December 14, 2009

Lectureship in Mathematics - London School of Economics and Political Science

--- Apologies for multiple copies ---

LONDON SCHOOL OF ECONOMICS AND POLITICAL SCIENCE

Department of Mathematics

Lectureship in Mathematics

Salary: £40,123 to £46,477 pa. incl.

Applications are invited from candidates with proven research ability in
Mathematics, especially those with research interests in an area where
the Department has current strengths, such as algorithms and discrete
mathematics, financial mathematics, game theory and probability theory.
Interest in applications of Mathematics or Computer Science to the
Social Sciences is an asset.

You will maintain an active programme of research and will contribute to
the general work of the department, including the teaching of a range of
mathematics courses.

You should have an established track-record of research at a level of
international excellence as well as a completed, or nearly completed,
PhD in a mathematical subject.

Ideally, the post will commence on 1 September 2010.

Information about the department can be found at http://www2.lse.ac.uk/maths

For a full application pack visit www.lse.ac.uk/jobsatLSE. If you cannot
download the pack email hr.recruit.lec@lse.ac.uk or call 020 7955 6183
quoting reference LEC/09/14.

The closing date for the receipt of applications is 18 January 2010 at
5.30pm. Regrettably, we are unable to accept any applications that are
received after this date.

We value diversity and wish to promote equality at all levels.

Please access the attached hyperlink for an important electronic communications disclaimer: http://www.lse.ac.uk/collections/secretariat/legal/disclaimer.htm

[DMANET] NetSciCom 2010 Call for Papers

CALL FOR PAPERS

NetSciCom 2010
Second IEEE International Workshop on Network Science
For Communication Networks

March 19, 2010 - San Diego, CA, USA
http://netscicom2010.asu.edu/

In conjunction with IEEE Infocom 2010

SCOPE:

Network Science is a newly emerging discipline with applications in a
variety of domains, such as, Communication Networks, Power Grid
Networks, Transportation Networks, Social Networks, Biological Networks
and Economics. Designing complex communication networks of the future
needs a deep understanding of the interplay between the physical, the
communication, and the social networks involved. An understanding of
such interdependency can only be achieved by closer interaction between
Network Scientists, Communication Network Designers, and Social and
Behavioral Scientists. The goal of this workshop is to a provide a forum
where this diverse group of researchers can meet and exchange ideas that
will lead to deeper insights into the design of robust, efficient and
complex communication networks of the future.

TOPICS OF INTEREST:

The topics of this workshop lie at the intersection of Network Science
and Communication Network Design - including Topology Design and
Analysis, Traffic Modeling, Traffic Routing, Social Media Analysis:
blogs and friendship networks, Bio-inspired networks, Internet scale
measurement and analysis of online communities, Social network analysis
with mobile phone data, Interdependency between power grid,
communication and transportation networks.

PAPER SUBMISSION:

Papers should contain original material, i.e., that has not been
previously published or currently submitted elsewhere. Manuscripts
must be limited to 6 pages in IEEE 8.5x11 conference format, and
formatted in strict accordance with the IEEE Communications Society
author guidelines. All submissions will be handled
electronically. Accepted papers will be published on IEEExplore right
after the conference. Camera ready versions are processed through the
IEEE Conference eXpress website. Papers will be included in the Infocom
2011 proceedings.

For paper formatting instructions, please check
http://www.ieee-infocom.org/paper-layout.html

Prospective authors should submit their papers though EDAS.
The submission link is here:

Submit Paper <http://edas.info/newPaper.php?c=8473>

IMPORTANT DATES:

Workshop date: March 19, 2010

Submission deadline: January 5, 2010

Notification of acceptance: February 5, 2010

Camera-ready version submission deadline: February 25, 2010

PROGRAM CO-CHAIRS/WORKSHOP ORGANIZERS:

Arun Sen, Arizona State U.
Andrea Richa, Arizona State U.
Katia Obraczka, UC Santa Cruz

Pavel Ghosh

Doctoral Student
Computer Science and Engineering Department
Arizona State University
Tempe, AZ, 85287

e-mail: pavel.ghosh@asu.edu
phone: (480) 603-8659
**********************************************************
*
* 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/
*
**********************************************************

ETAPS 2011: Call for Satellite Events

*** CALL FOR SATELLITE EVENTS ***

E TAPS 2011

European Joint Conferences on Theory And Practice of Software

March 26 - April 3, 2011
Saarbruecken, Germany


-- ABOUT ETAPS --

The European Joint Conferences on Theory and Practice of Software
(ETAPS) is the primary European forum for academic and industrial
researchers working on topics relating to Software Science. ETAPS is an
annual event which takes place in Europe each spring since 1998. The
fourteenth conference, ETAPS 2011, takes place between March 28 and
April 2, 2011 in Saarbruecken, Germany. Saarbruecken is a pleasant
and pitoresque federal state capital halfway between Frankfurt and
Paris (2hrs by train each).

The main conferences of ETAPS are:

- FOSSACS: Foundations of Software Science and Computation Structures
- FASE: Fundamental Approaches to Software Engineering
- ESOP: European Symposium on Programming
- CC: International Conference on Compiler Construction
- TACAS: Tools and Algorithms for the Construction and Analysis of
Systems

These conferences take place March 28-April 1, 2011.


-- SATELLITE EVENTS --

The ETAPS 2011 Organizing Committee invites proposals for Satellite
Events (workshops, tutorials, etc.) that will complement the main ETAPS
conferences. They should fall within the scope of ETAPS. This
encompasses all aspects of the system development process, including
specification, design, implementation, analysis and improvement, as well
as the languages, methodologies and tools which support these
activities, covering a spectrum from practically-motivated theory to
soundly-based practice. Satellite Events provide an opportunity to
discuss and report on emerging research approaches and practical
experience relevant to theory and practice of software.

ETAPS 2011 Satellite Events will be held immediately before and after
the main conferences, on March 26-27 and April 2-3, 2011.


-- SUBMISSION OF SATELLITE EVENT PROPOSALS --

Researchers and practitioners wishing to organize Satellite Events are
invited to submit proposals in ASCII, PDF or Postscript format by e-mail
to etaps2011_satellite_events@cs.uni-saarland.de

A proposal should not exceed two pages and should include:

- Satellite Event name / acronym
- the names and contact information of the organizers
- the preferred period: March 26-27 or April 2-3
- the duration of the workshop: one-day or two-day event
- 120-word description of the workshop topic for later use in publicity
material
- a brief explanation of the workshop topic and its relevance to ETAPS
- a schedule for paper submission, notification of acceptance and final
versions
- expected number of participants
- any other relevant information, like event format, invited speakers,
publication policy, demo sessions, special space requirements, etc.

The proposals will be evaluated by the ETAPS 2011 organizing committee
on the basis of their assessed benefit for prospective participants to
ETAPS 2011. The titles and brief information about accepted Satellite
Events will be included in the ETAPS 2011 web site, call for papers and
call for participation.

Satellite Events organizers will be responsible for
- producing the event's call for papers and call for participations
- publicising the event through specialist mailing lists etc. to
complement publicity for ETAPS as a whole
- hosting and maintaining a web site for the event
- reviewing and making acceptance decisions on submitted papers
- producing the event proceedings, if any; facilities for printing will
be made available by the ETAPS organizers
- scheduling workshop activities in consultation with the local
organizers

Prospective organizers may wish to consult the web pages of previous
satellite events as examples:

ETAPS 2010: http://www.etaps10.cs.ucy.ac.cy/
ETAPS 2009: http://www.cs.york.ac.uk/etaps09/
ETAPS 2008: http://etaps08.mit.bme.hu/
ETAPS 2007: http://www.di.uminho.pt/etaps07/
ETAPS 2006: http://www.complang.tuwien.ac.at/etaps06/
ETAPS 2005: http://www.etaps05.inf.ed.ac.uk/
ETAPS 2004: http://www.lsi.upc.es/etaps04/
ETAPS 2003: http://www.mimuw.edu.pl/etaps03/


-- IMPORTANT DATES --

Satellite Event Proposals Deadline: 17 January 2010

Notification of acceptance: 31 January 2010


-- FURTHER INFORMATION AND ENQUIRIES --

Please contact Bernd Finkbeiner
finkbeiner@cs.uni-sb.de


+---------------------------------------------------------------+
| Joost-Pieter Katoen email: my_last_name[at]cs.rwth-aachen.de |
| RWTH Aachen University URL: moves.rwth-aachen.de/~katoen |
| LS2: Software Modeling and Verification tel: +49 241 8021200 |
| D-52056 Aachen, Germany fax: +49-241 8022217 |
+---------------------------------------------------------------+

[DMANET] Stellenausschreibung wissenschaftliche/r MitarbeiterIn 13 TVL in Mathematik/OR an der Uni Trier

Im Fachbereich IV der Universität Trier, Abteilung Mathematik, Professur für
Operations Research, ist zum nächstmöglichen Zeitpunkt die befristete
Stelle (für bis zu 3 Jahre) einer/s

Wissenschaftlichen Mitarbeiterin/Mitarbeiters

mit Lehrverpflichtung von voraussichtlich 2 Wochenstunden zu besetzen. Die
Vergütung erfolgt nach 3/4 Entgeltgruppe 13 TVL.

Voraussetzung für die Einstellung ist ein überdurchschnittlich abgeschlossenes
Hochschulstudium der Mathematik (oder Informatik), möglichst mit Schwerpunkt in
Operations Research (z.B. kombinatorische Optimierung, ganzzahlige Optimierung
oder Auktionen). Programmierkenntnisse sind wünschenswert.

Geboten wird die Chance, in einem hochmotivierten, interdiziplinären, jungen
Team einer neu besetzten Professur mit vielfältigen internationalen
Kooperationen mitzuarbeiten. Dadurch sind exzellente Möglichkeiten zur
Promotion oder weiteren wissenschaftlichen Qualifikation in Mathematik gegeben.

Das Aufgabengebiet umfasst ferner die üblichen Tätigkeiten von
wissenschaftlichen Mitarbeiterinnen und Mitarbeitern, also insbesondere die
Betreuung von Studierenden etwa im Rahmen von Lehrveranstaltungen.

Schwerbehinderte werden bei entsprechender Eignung bevorzugt eingestellt.

Bewerbungen mit den üblichen Unterlagen (Lebenslauf, Zeugnisse) werden erbeten
bis zum 7. Januar 2010 an

Universität Trier
FB IV - Mathematik
Professur für OR
Prof. Dr. S. de Vries
54286 Trier

(oder per e-Mail).

Wir bitten, Bewerbungsunterlagen nicht in Mappen oder Hüllen und auch nur als
unbeglaubigte Kopien vorzulegen, da die Unterlagen nicht zurückgesandt werden;
sie werden nach Abschluss des Auswahlverfahrens vernichtet.
**********************************************************
*
* 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/
*
**********************************************************

Sunday, December 13, 2009

[DMANET] postdoc position in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES
http://www.math.tu-berlin.de/MDS/

funded by the German Science Foundation (DFG) at the three Berlin
Universities will in 2010 offer

one POSTDOC POSITION (BAT IIa)

starting April 2010 or later, for one year (possibly extendible).
We will review applications after January 15.

The salary for this position on the official German BAT IIa
salary scale depends on age, marital status, children, etc.

The scientific program of the MDS program treats combinatorics and
discrete mathematics broadly,
with an emphasis on diverse mathematical methods, such as

Geometric Methods
Algorithmic Methods
Graph Methods
Topological Methods
Enumeration Methods
Probabilistic Methods.

The MDS program is a joint initiative of scientists at the three major

Berlin universities,

Freie Universität Berlin (FU),
Humboldt-Universität zu Berlin (HU), and
Technische Universität Berlin (TU).

Its faculty consists of

Prof. Susanne Albers (HU),
Prof. Martin Aigner (FU),
Prof. Helmut Alt (FU),
Prof. Stefan Felsner (TU),
Prof. Martin Grötschel (TU/ZIB, associated),
Prof. Martin Grohe (HU),
Prof. Rolf Möhring (TU),
Prof. Günter Rote (FU),
Prof. Tibor Szabo (FU),
Prof. Martin Skutella (TU), and
Prof. Günter M. Ziegler (TU, coordinator)

as well as adjoint and junior faculty.

The MDS course program consists of the Monday Afternoon Colloquium
lectures, block courses, summer schools,
regular predoc programs, etc. - all this in a very lively Berlin
discrete mathematics context,
which also includes the DFG Research Center MATHEON
(http://www.matheon.de).

The RTG "Methods for Discrete Structures" is also a registered unit
for the "Phase II" part of
BERLIN MATHEMATICAL SCHOOL (http://www.math-berlin.de),
the joint international graduate program of the three major Berlin
universities.

Applicants, consisting of

- letter of application
- curriculum vitae
- Ph.D. thesis (preliminary version, if not finished)
- research proposal
- leter of reference by thesis advisor, and possibly an additional letter
(to be sent directly to us)

should be directed to

Prof. Günter M. Ziegler, Coordinator
RTG "Methods for Discrete Structures"
Inst. Mathematics, MA 6-2
TU Berlin
D-10623 Berlin, Germany

email: ziegler@math.tu-berlin.de
http://www.math.tu-berlin.de/~ziegler
Tel.: +49 - 30 - 314-25730
Fax: +49 - 30 - 314-21269

Applications by email are welcome!
**********************************************************
*
* 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/
*
**********************************************************

Saturday, December 12, 2009

[DMANET] 15th Estonian Winter School in Comput. Sci., Call for Partic.

[Lecturers: Cockett, Groth, Kiayias, Morgan, Mycroft.
Place/time: Palmse, Estonia, 28 Feb-5 March 2010.
Deadline for application and submission of abstracts for student
talks: ** 15 Jan 2010 **.]


CALL for PARTICIPATION

15th Estonian Winter School in Computer Science, EWSCS '10

Palmse, Estonia, 28 Feb-5 March 2010

http://cs.ioc.ee/ewscs/2010/


BACKGROUND AND OBJECTIVES

EWSCS is a series of regional-scope international winter schools held
annually in Estonia. EWSCS are organized by Institute of Cybernetics,
a research institute of Tallinn University of Technology.

The main objective of EWSCS is to expose Estonian, Baltic, and Nordic
graduate students in computer science (but also interested students
from elsewhere) to frontline research topics usually not covered
within the regular curricula. The working language of the schools is
English.

EWSCS'10 is the fifteenth event of the series.


PROGRAMME

The schools' scientific programme consists of short courses by
renowned specialists and a student session.

Courses of EWSCS'10

* Robin Cockett (University of Calgary, Canada):
Categories and Computability

* Jens Groth (University College London, UK):
Pairing-Based Non-interactive Zero-Knowledge Proofs

* Aggelos Kiayias (University of Connecticut, USA):
Encryption Mechanisms for Digital Content Distribution

* Carroll Morgan (University of New South Wales, Australia):
Security, Probability and Abstraction:

Rigorous Methods for Source-Level Reasoning


* Alan Mycroft (University of Cambridge, UK):
Type-Like Frameworks for Controlling State and Aliasing

The purpose of the student session is to give students an opportunity
to present their work (typically, thesis work) and get
feedback. Registrants are invited to propose short talks (20 min) on
topics of theoretical computer science, broadly understood. The
selection will be based on abstracts of 150-400 words.

The social programme consists of an excursion and a conference dinner.


VENUE

Palmse is a small settlement 80 kms to the east from Tallinn in the
county of Lääne-Viru. It is renowned for a large manor that used to
belong to the von Pahlen family, today hosting the visitors' center of
the Lahemaa National Park, a museum, and a hotel.

Tallinn, Estonia's capital, is famous for its picturesque medieval Old
Town, a UNESCO World Heritage site. There are direct flights to
Tallinn airport from Amsterdam, Berlin Tegel, Brussels, Copenhagen,
Frankfurt, Gothenburg, Helsinki, Kiev, Lappeenranta, London Gatwick
and Stansted, Milan Malpensa, Minsk, Moscow, Munich, Oslo, Prague,
Riga, Stockholm Arlanda, St Petersburg, Turku, Vilnius, ferries from
Stockholm and Helsinki. From Vilnius, Riga, St Petersburg the
Eurolines coach services are the practical travel option.


APPLICATION AND COST

The deadline for application and submission of abstracts is 15 January
2010. All applicants will be notified of admission to the school and
acceptance of their talks by 29 January 2010.

Admitted participants are entitled and expected to attend the courses
and student session of the school. They will also receive a binder
with the course material and access to additional materials on the
school website.

The participation fee is 5000 EEK (320 EUR) and includes full board
accommodation at Palmse, transportation from Tallinn to Palmse, an
excursion and conference dinner (by contributing towards the
corresponding expense).

PROGRAMME COMMITTEE / ORGANISING COMMITTEE

* Tarmo Uustalu (Institute of Cybernetics) (chair)
* Monika Perkmann (Institute of Cybernetics) (secretary)
* Helger Lipmaa (Cybernetica AS)
* Peeter Laud (Cybernetica AS)
* Varmo Vene (University of Tartu)
* Sven Laur (University of Tartu)


SPONSORS

* Tiger University Plus programme

of the Estonian Information Technology Foundation
* Estonian Centre of Excellence in Computer Science, EXCS

(funded mainly by the European Regional Development Fund)


FURTHER INFORMATION

Details on the submission of abstracts, application procedure and cost
are available from the school webpage, http://cs.ioc.ee/ewscs/2010/.

Questions should be sent to ewscs10(at)cs.ioc.ee.
**********************************************************
*
* 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/
*
**********************************************************

15th Estonian Winter School in Comput. Sci., Call for Partic.

[Lecturers: Cockett, Groth, Kiayias, Morgan, Mycroft.
Place/time: Palmse, Estonia, 28 Feb-5 March 2010.
Deadline for application and submission of abstracts for student
talks: ** 15 Jan 2010 **.]


CALL for PARTICIPATION

15th Estonian Winter School in Computer Science, EWSCS '10

Palmse, Estonia, 28 Feb-5 March 2010

http://cs.ioc.ee/ewscs/2010/


BACKGROUND AND OBJECTIVES

EWSCS is a series of regional-scope international winter schools held
annually in Estonia. EWSCS are organized by Institute of Cybernetics,
a research institute of Tallinn University of Technology.

The main objective of EWSCS is to expose Estonian, Baltic, and Nordic
graduate students in computer science (but also interested students
from elsewhere) to frontline research topics usually not covered
within the regular curricula. The working language of the schools is
English.

EWSCS'10 is the fifteenth event of the series.


PROGRAMME

The schools' scientific programme consists of short courses by
renowned specialists and a student session.

Courses of EWSCS'10

* Robin Cockett (University of Calgary, Canada):
Categories and Computability

* Jens Groth (University College London, UK):
Pairing-Based Non-interactive Zero-Knowledge Proofs

* Aggelos Kiayias (University of Connecticut, USA):
Encryption Mechanisms for Digital Content Distribution

* Carroll Morgan (University of New South Wales, Australia):
Security, Probability and Abstraction:
Rigorous Methods for Source-Level Reasoning

* Alan Mycroft (University of Cambridge, UK):
Type-Like Frameworks for Controlling State and Aliasing

The purpose of the student session is to give students an opportunity
to present their work (typically, thesis work) and get
feedback. Registrants are invited to propose short talks (20 min) on
topics of theoretical computer science, broadly understood. The
selection will be based on abstracts of 150-400 words.

The social programme consists of an excursion and a conference dinner.


VENUE

Palmse is a small settlement 80 kms to the east from Tallinn in the
county of Lääne-Viru. It is renowned for a large manor that used to
belong to the von Pahlen family, today hosting the visitors' center of
the Lahemaa National Park, a museum, and a hotel.

Tallinn, Estonia's capital, is famous for its picturesque medieval Old
Town, a UNESCO World Heritage site. There are direct flights to
Tallinn airport from Amsterdam, Berlin Tegel, Brussels, Copenhagen,
Frankfurt, Gothenburg, Helsinki, Kiev, Lappeenranta, London Gatwick
and Stansted, Milan Malpensa, Minsk, Moscow, Munich, Oslo, Prague,
Riga, Stockholm Arlanda, St Petersburg, Turku, Vilnius, ferries from
Stockholm and Helsinki. From Vilnius, Riga, St Petersburg the
Eurolines coach services are the practical travel option.


APPLICATION AND COST

The deadline for application and submission of abstracts is 15 January
2010. All applicants will be notified of admission to the school and
acceptance of their talks by 29 January 2010.

Admitted participants are entitled and expected to attend the courses
and student session of the school. They will also receive a binder
with the course material and access to additional materials on the
school website.

The participation fee is 5000 EEK (320 EUR) and includes full board
accommodation at Palmse, transportation from Tallinn to Palmse, an
excursion and conference dinner (by contributing towards the
corresponding expense).

PROGRAMME COMMITTEE / ORGANISING COMMITTEE

* Tarmo Uustalu (Institute of Cybernetics) (chair)
* Monika Perkmann (Institute of Cybernetics) (secretary)
* Helger Lipmaa (Cybernetica AS)
* Peeter Laud (Cybernetica AS)
* Varmo Vene (University of Tartu)
* Sven Laur (University of Tartu)


SPONSORS

* Tiger University Plus programme
of the Estonian Information Technology Foundation
* Estonian Centre of Excellence in Computer Science, EXCS
(funded mainly by the European Regional Development Fund)


FURTHER INFORMATION

Details on the submission of abstracts, application procedure and cost
are available from the school webpage, http://cs.ioc.ee/ewscs/2010/.
Questions should be sent to ewscs10(at)cs.ioc.ee.

[DMANET] WG 2010 (2nd cfp), 36th International Workshop on Graph-Theoretic Concepts in Computer Science

Second call for papers


*****************************************************************

36th International Workshop on
Graph-Theoretic Concepts in Computer Science
(WG 2010)

Zaros, Crete, Greece
June 28-30, 2010

http://www.math.uoa.gr/wg2010/

*****************************************************************


The WG 2010 conference will be held in Zaros, Creta, Greece. It
continues a long series of 35 previous WG's. Since 1975, it took
place twenty times in Germany, four times in the Netherlands,
twice in Austria, twice in France as well as once in Italy,
Slovakia, Switzerland, Czech Republic, Norway, and in
the United Kingdom.


AIMS AND SCOPE

WG 2010 aims at uniting theory and practice by demonstrating how
Graph-Theoretic concepts can be applied to various areas in
Computer Science, or by extracting new problems from applications.
The goal is to present recent research results and to identify
and explore directions of future research. The conference is
well-balanced with respect to established researchers and young
scientists. For many years now, the proceedings have been
published in the LNCS series of Springer-Verlag. We need the
final version of accepted papers approximately two months after
the conference.

Papers are solicited describing original results on all aspects
of graph-theoretic concepts in Computer Science, e.g. structural
graph theory, sequential, parallel, randomised, parameterized,
and distributed graph and network algorithms and their
complexity, graph grammars and graph rewriting systems, graph-
based modelling, graph-drawing and layout, random graphs, diagram
methods, and support of these concepts by suitable
implementations. The scope of WG includes all applications of
graph-theoretic concepts in Computer Science, including data
structures, data bases, programming languages, computational
geometry, tools for software construction, communications,
computing on the web, models of the web and scale-free networks,
mobile computing, concurrency, computer architectures, VLSI,
artificial intelligence, graphics, CAD, operations research, and
pattern recognition.


SUBMISSION

Authors are invited to submit an extended abstract written in
English, no longer than 10 pages on letter-size or A4-size paper
using at least 11-point font (and preferably LaTeX article style
11pt a4paper). Proofs omitted due to space constraints must be
put into an appendix to be read by the program committee members
at their discretion. Simultaneous submission to other conferences
with published proceedings or to journals is not allowed.

Authors who wish to submit an extended abstract to WG 2010 must
submit a PDF file with their paper by using the electronic
submission system at:
https://www.easychair.org/login.cgi?conf=wg2010


IMPORTANT DATES

*****************************************************************

Paper submission deadline: March 5, 2010
Notification of acceptance: April 30, 2010
Workshop: June 28-30, 2010

*****************************************************************


PROGRAM COMMITTEE

Fedor V. Fomin, University of Bergen, Norway
Pierre Fraigniaud, CNRS and University Paris Diderot, France
Gregory Z. Gutin, Royal Holloway, University of London, UK
Frederic Havet, INRIA Sophia-Antipolis, France
Giuseppe F. Italiano, University of Rome Tor Vergata, Italy
Kazuo Iwama, Kyoto University, Japan
Jan Kratochvil, Charles University, Czech Republic
Jan van Leeuwen, Utrecht University, The Netherlands
Bojan Mohar, Simon Fraser University, Canada
David Peleg, Weizmann Institute of Science, Israel
Prabhakar Ragde, University of Waterloo, Canada
Dieter Rautenbach, Ilmenau University of Technology, Germany
Saket Saurabh, Institute of Mathematical Sciences, India
Ingo Schiermeyer, Freiberg University of Mining & Technology, Germany
Maria Serna, Technical University of Catalonia, Spain
Martin Skutella, Technical University of Berlin, Germany
Dimitrios M. Thilikos (Chair), National & Kapodistrian Univ. of Athens,
Greece
Peter Widmayer, Federal Institute of Technology Zurich, Switzerland
Gerhard J. Woeginger, Eindhoven University of Technology, The
Netherlands


INVITED SPEAKERS

* Dimitris Achlioptas (Department of Computer Science UC Santa Cruz)
* Erik Demaine (MIT Computer Science and Artificial Intelligence
Laboratory)


ORGANIZATION

* Anogia Academic Village
* Department of Mathematics of the National and Kapodistrian University of Athens
**********************************************************
*
* 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/
*
**********************************************************

SPAA 2010 Second Call for Papers

=======================================================================

SPAA 2010 Second Call for Papers

22nd ACM Symposium on Parallelism in Algorithms and Architectures

Santorini, Greece
June 13-15, 2010
http://www.spaa-conference.org


=======================================================================

SCOPE:
Contributed papers are sought in all areas of parallel algorithms and
architectures. SPAA defines the term "parallel" broadly, encompassing
any computational system that can perform multiple operations or tasks
simultaneously.

Topics of interest include, but are not limited to:

- Parallel and Distributed Algorithms and Applications
- Parallel and Distributed Data Structures
- Parallel Complexity Theory
- Parallel and Distributed Architectures
- Multi-Core Architectures
- Instruction Level Parallelism and VLSI
- Compilers and Tools for Concurrent Programming
- Supercomputer Architecture and Computing
- Transactional Memory Hardware and Software
- The Internet and the World Wide Web
- Game Theory and Collaborative Learning
- Routing and Information Dissemination
- Resource Management and Awareness
- Peer-to-Peer Systems
- Mobile Ad-Hoc and Sensor Networks
- Robustness, Self-Stabilization, and Security
- Green Computing and Power-Efficient Architectures
- Management of Massive Data Sets


CONFERENCE PRESENTATION:
Regular presentations will be allotted a 25-minute talk and up to 10
pages in the proceedings. This format is intended for contributions
reporting original research, submitted exclusively to this conference.

Brief announcements will be allotted a 10-minute talk and a 2-page
abstract in the proceedings. This format is a forum for brief
communications, which may be published later in other conferences.

The best regular paper will be given a best paper award.


SUBMISSIONS:

Authors of contributed papers are encouraged to submit their
manuscript electronically. To submit electronically, visit
http://www.spaa-conference.org/submission.html for instructions. This
is the preferred method of submission. Authors unable to submit
electronically should contact the program chair Cynthia Phillips at
caphill@sandia.gov to receive instructions.

The cover page should include (1) title, (2) authors and affiliation,
(3) postal and email address of the contact author, (4) a brief abstract
describing the content of the paper, and (5) an indication if this is a
regular presentation or a brief announcement. If requested by the
authors, an extended abstract that is not selected for a regular
presentation will also be considered for the SPAA brief announcements
session. Such a request will not affect the consideration of the paper
for a regular presentation.

Submissions for regular presentations should include an introduction
understandable to a nonspecialist including motivation and previous
work, and a technical exposition directed to a specialist. A submission
should not exceed 10 printed pages in 11-point type or larger (excluding
cover, figures, and references). More details may be supplied in a
clearly marked appendix to be read at the discretion of the program
committee. A submission for brief announcements should be no longer
than three pages using at least 11-point font.

=======================================================================
IMPORTANT DATES:

Submission deadline: January 13, 2010 11:59 p.m. EST
(for regular papers and brief announcements)

Notification: March 12, 2010
Camera-ready copy: April 1, 2010

=======================================================================
CONFERENCE ORGANIZATION:

SPAA Program Chair
Cynthia Phillips (Sandia National Labs, USA)

SPAA Program Committee
Kunal Agrawal (Washington U. St. Louis, USA)
Hagit Attiya (Technion, Israel)
Jon Berry (Sandia National Labs, USA)
David Bunde (Knox College, USA)
Sandor Fekete (Braunschweig U. of Technology, Germany)
James Goodman (U. of Auckland, New Zealand)
Dan Grossman (U. of Washington, USA)
Torben Hagerup (U. of Augsburg, Germany)
Nectarios Koziris (National Technical U. of Athens, Greece)
Madhav Marathe (Virginia Polytechnic Inst. and State U., USA)
Sotiris Nikoletseas (U. of Patras, Greece)
Alex Pothen (Purdue U., USA)
Yves Robert (Ecole Normale Superieure de Lyon, France)
Jared Saia (U. of New Mexico, USA)
Mike Spear (Lehigh U., USA)
Torsten Suel (Polytechnic Institute of NYU, USA)
Joel Wein (NYU-POLY/Akamai, USA)
Adam Welc (Intel Labs, USA)
Jennifer Welch (Texas A&M, USA)

SPAA Conference Chair
Friedhelm Meyer auf der Heide (U. of Paderborn, Germany)

SPAA Secretary
Christian Scheideler (U. of Paderborn, Germany)

SPAA Treasurer
David Bunde (Knox College, USA)

SPAA Publicity Chair
Andrea Richa (Arizona State U., USA)

SPAA Local Arrangements
Christos Kaklamanis (U. of Patras, Greece)

=======================================================================

--
Prof. Andrea W. Richa |Phone: 480-965-7555
Computer Science & Eng. |FAX: 480-965-2751
Arizona State University |E-mail: aricha@asu.edu
PO Box 878809, Tempe AZ 85287-8809|Homepage:www.public.asu.edu/~aricha
.

Friday, December 11, 2009

Simons Foundation Postdoctoral Fellowship at Cornell

Simons Foundation Postdoctoral Fellowship at Cornell University in Theoretical Computer Science

The Theory of Computation group at Cornell is seeking candidates for a post-doctoral position in the general area of the theory of computation. This fellowship is made possible by a generous gift from the Simons Foundation.

 

The fellowship is a two year position, starting the summer or fall of 2010. The fellowship stipend is gauged to attract the highest caliber of applicants. Fellows will be assigned a faculty member close to their research interests from the group.

 

*Eligibility: *Candidates must receive their PhD during the academic year immediately preceding that in which the fellowship would begin.

 

*Application Process:* Applicants should submit a CV and research statement, and provide the names and contact information for three references who will be contacted electronically. Please send complete applications by January 30th, 2010 to Eva Tardos at eva@cs.cornell.edu. Please include the words "Simons Postdoctoral Fellowship" in the header.

 

 

ICLP-10 Doctoral Consortium Call For Papers

===============================================================================

CALL FOR PAPERS

ICLP-DC 2010

Sixth ICLP Doctoral Student Consortium

http://www.kodak.com/go/iclp10dc

Collocated with the International Conference on Logic Programming 2010

Edinburgh (Scotland, U.K)

July 16-19, 2010

===============================================================================


Introduction
------------
The ICLP Doctoral Consortium (DC) is the sixth doctoral consortium to be
offered as part of the 26th International Conference on Logic Programming. The
DC follows the very positive experience of the previous events held held in
Sitges (Spain) on October 3rd, 2005, in Seattle (WA) on August 21st, 2006,
in Porto (Portugal) on September 8th, 2007, in Udine (Italy) on December 10th, 2008,
and in Pasadena (USA) on July 15th, 2009.

The DC will take place at the end of ICLP 2010 in Edinburgh (Scotland, U.K). The
Doctoral Consortium is designed for doctoral students working in areas related to
logic and constraint programming, with a particular emphasis to students interested
in pursuing a career in academia. The Consortium is also open to exceptional
Master's students developing MS Theses in Logic Programming.
The Doctoral Consortium aims to provide students with an opportunity to present
and discuss their research directions and to obtain feedback from peers as
well as world-renown experts in the field.


General Information
-------------------
This year the Doctoral Consortium will be held at the end if the
regular activities of the ICLP 2010 Conference. The aims of the Doctoral
Consortium are:
* To provide doctoral students working in the field of logic and
constraint programming with a friendly and open forum to present
their research ideas, listen to ongoing work from peer students,
and receive constructive feedback.
* To provide students with relevant information about important
issues for doctoral candidates and future academics.
* To develop a supportive community of scholars and a spirit of
collaborative research.
* To support a new generation of researchers with information and
advice on academic, research, industrial, and non-traditional
career paths.

The Consortium is designed for students currently enrolled in a Ph.D.
program, though we are also open to exceptions (e.g., students
currently in a Masters program and interested in doctoral studies).
Students at any stage in their doctoral studies are encouraged to
apply. Applicants are expected to be conducting research in the field
of Logic Programming; topics of interest include (but are not limited to):
* Theoretical Foundations of Logic and Constraint Logic Programming
* Sequential and Parallel Implementation Technology
* Static and Dynamic Analysis, Abstract Interpretation, Compilation
Technology, Verification
* Logic-based Paradigms (e.g., Answer Set Programming, Concurrent
Logic Programming, Inductive Logic Programming)
* Innovative Applications of Logic Programming

Submissions by students who have presented their work at a previous
ICLP Doctoral Consortiums are allowed, but should occur only if
there are substantial changes or improvements to the student's work.

The Consortium allows participants to interact with established
researchers and with other students, through presentations, question-
answer sessions, panel discussions, and invited presentations. The
Doctoral Consortium will provide the possibility to reflect - through
short activities, information sessions, and discussions - on the
process and lessons of research and life in academia. Each participant
will give a short, critiqued, research presentation.

The Doctoral Consortium will be held on July 21, 2010; the ICLP
conference will run from July 16th to July 19th, 2010.
Doctoral Consortium participants will be offered the opportunity to
have their abstracts published in the ICLP 2010 conference
proceedings. The best paper and presentation from the Doctoral Consortium
will be given the opportunity to present in special session of the main
ICLP conference.

Discussants:

Several renowned faculty members and researchers in the field of Logic
Programming will join in evaluating the submission packets and will
participate in the Doctoral Consortium, providing feedback to the
presenters.


Important Dates
---------------
Submission Deadline: April 11, 2010
Acceptance Notification: April 21, 2010
Last Date to Update Research Summary: April 28, 2010 (tentative)
Doctoral Consortium: July 21, 2010
ICLP 2010 Conference: July 16-19, 2010


Submission Process
------------------

Application Process:
To apply for participation to the ICLP 2010 Doctoral Consortium, prepare a
submission package consisting of a cover letter, a research summary, and a
letter of recommendation (e.g., from your supervisor). The material should
be submitted electronically, in PDF format.

Review Criteria:
The ICLP Doctoral Consortium review committee will select participants based on
their anticipated contribution to the Consortium objectives. Participants
typically have settled on their thesis directions and had their research
proposal accepted by their thesis committee. Students will be selected based on
clarity and completeness of the submission packet, relevance of their research
area w.r.t. the focus of the ICLP Conference, stage of research, advisor's
letter, and evidence of promise towards a successful research and academic
career, such as published papers or technical reports.

Award:
The ICLP Doctoral Consortium Discussants will review the submissions to select
the ones to be presented. The organizing committee is actively seeking support
to offer scholarship packages to accepted participants. We will update the web
site as soon as we have more information regarding this.


Submission Package
------------------
Send the submission package by e-mail to iclp10dc@gmail.com.
Include the three documents as separate pdf files in attachment.

All submissions must be in English. Submissions will not be considered if they
arrive after the deadline. Your submission should not contain any proprietary
or confidential material.

Detailed instructions for each of the documents follow below.


Cover Page:
Please include the following information in the cover page:
1. Statement of interest in participating in the Doctoral Consortium
2. Full name and School and Department in which you are earning your
doctorate degree
3. Contact information - address, telephone number, and email address
4. Title of your research and keywords pertinent to your research
5. The URL of your web page (if any)
6. Name of your supervising professor
7. Current stage in your program of study, e.g. (Master/PhD student,
start date)

Research Summary:
Prepare your research summary as a PDF document, using the same format
style as for the regular submissions to ICLP 2010.
Keep the length of your research summary to no more than two pages, including
figures, tables, and the bibliography.

Make sure to include your complete name, address and affiliation.

The body of you research summary should provide a clear overview of the
research, its potential impact, and its current status. You are encouraged to
include the following sections:
1. Introduction and problem description
2. Background and overview of the existing literature
3. Goal of the research
4. Current status of the research
5. Preliminary results accomplished (if any)
6. Open issues and expected achievements
7. Bibliographical references

Letter of Recommendation:
Include a letter of recommendation written by your Graduate Advisor or Thesis
Advisor. Please, invite your advisor to include an assessment of the current
status of your thesis research and an indication of the expected deadline for
thesis submission. In addition, your advisor should indicate what she/he hopes
you would gain from participation in the Doctoral Consortium.


Chairs
------
Marcello Balduccini
Intelligent Systems Department
Kodak Research Labs
http://marcy.cjb.net

Alessandro Dal Palu'
Dipartimento di Matematica
Universita' degli Studi di Parma
http://www2.unipr.it/~dalpalu/

CCC 2010: Submission deadline approaching!

The submission deadline for the 2010 Conference on Computational Complexity is this Tuesday, December 15th.  To be accepted, a paper must be submitted by 19:59 Eastern Standard Time on the 15th.  The submissions server can be found at https://ccc10.cs.wisc.edu/submit/.  More information on the conference, including local arrangements, is available at http://computationalcomplexity.org/

 

John Rogers

CCC Publicity Chair

jrogers@cs.depaul.edu

http://computationalcomplexity.org/

 

 


Combinatorics, Groups, Algorithms, Complexity conference

Conference Announcement

Combinatorics, Groups, Algorithms, and Complexity

Conference in honor of Laci Babai's 60th birthday

March 21-25, 2010 The Ohio State University, Columbus, Ohio

www. <http://www.babai60.org>babai
<http://www.babai60.org>60.org <http://www.babai60.org>

Organizers: Akos Seress (Ohio State U) and Mario Szegedy (Rutgers)

The meeting will highlight interconnections between the areas in
the title. Confirmed speakers from the FOCS/STOC community include
Scott Aaronson, Bob Beals, Lance Fortnow, Martin Furer, Anna Gal,
Ron Graham, Peter Hajnal, Tom Hayes, Gabor Ivanyos, Subhash Khot,
Satya Lokam, Alex Lubotzky, Gene Luks, Bojan Mohar, Toni Pitassi,
Sasha Razborov, Alex Russell, Janos Simon, Daniel Stefankovic,
Madhu Sudan, Eva Tardos, Gabor Tardos, Gyorgy Turan, Emanuele
Viola, Avi Wigderson; they will be joined by group
theorists and combinatorists.

Please check the website for further details: www.
<http://www.babai60.org>babai <http://www.babai60.org>60.org
<http://www.babai60.org> .
Students and junior researchers are especially encouraged
to attend; some financial assistance is available.

[DMANET] Ph.D. position at MPI, Germany

The group Algorithmic Game Theory and Online Algorithms at the

M A X P L A N C K I N S T I T U T E
for
I N F O R M A T I C S

in Saarbruecken, Germany seeks a

Ph.D. Student

for the Algorithms and Complexity Department

directed by Kurt Mehlhorn

We are seeking an excellent candidate with a master's degree in
mathematics, theoretical computer science or a related field. The
successful applicant should carry out theoretical work in the areas of
algorithmic game theory, online algorithms, and approximation
algorithms. The applicant should be highly motivated and efficient, and
should have a strong interest in research.

The Max-Planck-Institute for Computer Science is located on the campus
of the Universitaet des Saarlandes in Saarbruecken, Germany. Currently,
around 40 researchers from several nationalities work in the Algorithms
and Complexity Department. Our working language is English. The group
collaborates with several of the major research institutions in Europe
and the U.S. and has high international visibility. There is generous
travel support available for all group members.

Applications from disabled applicants are appreciated. Our institute
supports the principle of equal opportunity for men and women, and is
therefore interested in applications from women.

Applications (including curriculum vitae, list of publications if
applicable, list of school grades, list of university grades, and names
of two references with their e-mail addresses) must be sent by email in
PDF format to Rob van Stee (vanstee@mpi-inf.mpg.de) by January 31, 2010.

Rob van Stee
Max-Planck-Institut fuer Informatik
Campus E1 4
D-66123 Saarbruecken
Germany

For further information, also on other offers, please refer to
http://www.mpi-inf.mpg.de/departments/ag1/offers.html

**********************************************************
*
* 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] 2nd CFP: Third International Workshop on Computational Social Choice (COMSOC-2010)

Dear colleagues,

please see the 2nd CFP below & distribute as appropriate.
Please accept our apologies if you receive multiple copies
and note that the submission, notification, final copies due,
and early registration deadlines have slightly changed.

Best,
Joerg & Vince

**********************************************************************

2nd Call for Papers

Third International Workshop on Computational Social Choice
(COMSOC-2010)

Duesseldorf, Germany, September 13--16, 2010

URL: http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/

**********************************************************************
MISSION
**********************************************************************

Computational social choice is a new discipline emerging at the
interface of social choice theory and computer science. It is
concerned with the application of computational techniques to the
study of social choice mechanisms, and with the integration of social
choice paradigms into computing. The aim of this workshop is to bring
together the different communities that have been addressing such
issues: computer scientists interested in computational issues in
social choice; people working in artificial intelligence and multi-
agent systems who are using ideas from social choice to organize
societies of artificial software agents; logicians interested in the
logic-based specification and analysis of social procedures (social
software); and last but not least people coming from social choice
theory itself.

COMSOC-2010 will be held in association with the COST Action
``Algorithmic Decision Theory,'' and will also be accompanied by a
``LogICCC tutorial day'' with general introductory talks. The invited
talks of the workshop and the tutorials will be presented by a number
of prominent scientists. Registration fees will cover both the
workshop and the LogICCC tutorial day and will be kept very low.

**********************************************************************
INVITED SPEAKERS
**********************************************************************

Invited speakers will include Gabrielle Demange (Paris; tentative),
Matthew O. Jackson (Stanford), Bettina Klaus (Lausanne), Herve Moulin
(Rice University), and Hannu Nurmi (Turku).

**********************************************************************
PAPER SUBMISSION
**********************************************************************

Submissions of full papers describing original or recently published
work on all aspects of computational social choice are invited. Topics
of interest include, but are not limited to:

o complexity-theoretic analysis of voting procedures
o computational aspects of fair division
o multiagent resource allocation
o cake-cutting algorithms
o distributed negotiation in multiagent systems
o preference representation in combinatorial domains
o computational aspects of preference aggregation rules
o preference elicitation
o social choice and constraint programming
o social choice and the web: ranking systems
o social networks
o belief and judgement aggregation
o algorithmic game theory
o computational aspects of coalition formation
o social choice under uncertainty
o logics for collective decision making
o logic-based verification of social procedures
o communication complexity of social choice mechanisms
o computational issues in mechanism design

Paper submission is electronic via the workshop website. Papers should
not exceed 14 pages in length (roughly 5000 words) and should be
formatted according to the instructions available at the workshop
website. Accepted papers will be collected in informal workshop notes,
printed copies of which will be available at the workshop. Please
contact either one of the program chairs in case of any questions:

o Vince Conitzer (conitzer@cs.duke.edu)
o Joerg Rothe (rothe@cs.uni-duesseldorf.de)

**********************************************************************
IMPORTANT DATES
**********************************************************************

o Paper submission deadline: May 15, 2010
o Notification of authors: June 20, 2010
o Camera-ready papers due: July 15, 2010
o Early registration deadline: July 15, 2010
o LogICCC tutorial day: September 13, 2010
o Workshop dates: September 14--16, 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/
*
**********************************************************

[DMANET] FUN WITH ALGORITHMS 2010- Second Call for Papers

We apologize if you receive multiple copies of this message.

**************************************************************************
CALL FOR PAPERS

Fifth International Conference on FUN WITH ALGORITHMS

FUN 2010

http://fun2010.dia.unisa.it/

June 2-4, 2010
Ischia, Italy
Deadline for submissions: January 15, 2010
**************************************************************************

The Fifth International Conference on Fun with Algorithms (FUN 2010)
is dedicated to the use, design, and analysis of algorithms and data
structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The previous FUNs were held in Elba Island and in
Castiglioncello, Italy. Special issues of Theoretical Computer Science
(FUN'98), Discrete Applied Mathematics (FUN'01), and Theory of
Computing Systems (FUN'04 and FUN'07) were dedicated to them.
The topics of interest include (but are not limited to):

- FUN with biological algorithms
- FUN with cryptographic algorithms
- FUN with game-theoretic algorithms
- FUN with internet algorithms
- FUN with optimization algorithms
- FUN with robotics algorithms
- FUN with string algorithms
- FUN with combinatorial algorithms
- FUN with distributed algorithms
- FUN with geometrical algorithms
- FUN with mobile algorithms
- FUN with parallel algorithms
- FUN with space-conscious algorithms
- FUN with algorithm visualization

Authors are invited to submit a manuscript by January 15th, 2010 at the
FUN 2010 web site. Manuscripts should not exceed 12 pages. Authors of
accepted papers are expected to present their work at the conference.
Conference proceedings will be published by Springer in the LNCS series.

IMPORTANT DATES:
Paper Submission: January 15, 2010
Acceptance Notification: February 20, 2010
Final version due: March 15, 2010
Conference: June 2-4, 2010

INVITED SPEAKERS:
Roberto Grossi (Universite di Pisa)
Prabhakar Raghavan (Yahoo! Labs and Stanford University)
Paul Spirakis (CTI and University of Patras)

STEERING COMMITTEE:
Elena Lodi (Universite di Siena)
Linda Pagli (Universite di Pisa)
Nicola Santoro (Carleton University)

ORGANIZING COMMITTEE:
Gennaro Cordasco (Universite di Salerno)
Luisa Gargano (Universite di Salerno)
Adele Rescigno (Universite di Salerno)
**********************************************************
*
* 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/
*
**********************************************************

FUN WITH ALGORITHMS 2010- Second Call for Papers

We apologize if you receive multiple copies of this message.

**************************************************************************
CALL FOR PAPERS

Fifth International Conference on FUN WITH ALGORITHMS

FUN 2010

http://fun2010.dia.unisa.it/

June 2-4, 2010
Ischia, Italy
Deadline for submissions: January 15, 2010
**************************************************************************

The Fifth International Conference on Fun with Algorithms (FUN 2010)
is dedicated to the use, design, and analysis of algorithms and data
structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The previous FUNs were held in Elba Island and in
Castiglioncello, Italy. Special issues of Theoretical Computer Science
(FUN'98), Discrete Applied Mathematics (FUN'01), and Theory of
Computing Systems (FUN'04 and FUN'07) were dedicated to them.
The topics of interest include (but are not limited to):

- FUN with biological algorithms
- FUN with cryptographic algorithms
- FUN with game-theoretic algorithms
- FUN with internet algorithms
- FUN with optimization algorithms
- FUN with robotics algorithms
- FUN with string algorithms
- FUN with combinatorial algorithms
- FUN with distributed algorithms
- FUN with geometrical algorithms
- FUN with mobile algorithms
- FUN with parallel algorithms
- FUN with space-conscious algorithms
- FUN with algorithm visualization

Authors are invited to submit a manuscript by January 15th, 2010 at the

FUN 2010 web site. Manuscripts should not exceed 12 pages. Authors of

accepted papers are expected to present their work at the conference.
Conference proceedings will be published by Springer in the LNCS series.

IMPORTANT DATES:
Paper Submission: January 15, 2010
Acceptance Notification: February 20, 2010
Final version due: March 15, 2010
Conference: June 2-4, 2010

PROGRAM COMMITTEE:
Ricardo Baeza-Yates (Universitat Pompeu Fabra and Yahoo! Research)
Anne Bergeron (Université du Québec)
Jean-Claude Bermond (CNRS Sophia-Antipolis)
Paolo Boldi (Università degli Studi di Milano, co-chair)
Erik Demaine (Massachusetts Institute of Technology)
Leah Epstein (University of Haifa)
Luisa Gargano (Università di Salerno, co-chair)
Leszek Gasieniec (University of Liverpool)
Magnus Halldorsson (Reykjavik University)
Evangelos Kranakis (Carleton University)
Fabrizio Luccio (Università di Pisa)
Michael Mitzenmacher (Harvard University)
Muthu Muthukrishnan (Rutgers and Google Inc.)
Gonzalo Navarro (Universidad de Chile)
Rasmus Pagh (IT University of Copenhagen)
David Peleg (Weizmann Institute)
Nadia Pisanti (Università di Pisa)
José Rolim (University of Geneva)
Nicola Santoro (Carleton University)
Eduardo Sany-Laber (Pontifícia Universidade Católica do Rio de Janeiro)
Michael Segal (Ben-Gurion University)
Steven Skiena (State University of New York at Stony Brook)
Shmuel Zaks (Technion)

INVITED SPEAKERS:
Roberto Grossi (Università di Pisa)
Prabhakar Raghavan (Yahoo! Labs and Stanford University)
Paul Spirakis (CTI and University of Patras)

STEERING COMMITTEE:
Elena Lodi (Università di Siena)
Linda Pagli (Università di Pisa)
Nicola Santoro (Carleton University)

ORGANIZING COMMITTEE:
Gennaro Cordasco (Università di Salerno)
Luisa Gargano (Università di Salerno)
Adele Rescigno (Università di Salerno)

Thursday, December 10, 2009

[DMANET] Change in deadline for the Simons Postdoctoral Fellowship at the MIT in Theoretical Compute Science!

Dear All, please note that the deadline is January 31, 2010 instead of
January 1, 2010.
Thanks, Joanne Hanley

*Simons Postdoctoral Fellowship at the Massachusetts Institute of
Technology in Theoretical Computer Science*

The Theory of Computation (TOC) group at the Computer Science and
Artificial Intelligence Laboratory (CSAIL) at MIT is seeking candidates
for a post-doctoral position in the general area of the theory of
computation. Applicants in /all areas/ of theory are encouraged to
apply, including (but not exclusive to) algorithms, complexity theory,
combinatorial optimization, cryptography, distributed computing, game
theory and computation, geometry, parallel computing, and quantum
computing. This fellowship is made possible by a generous gift from the
Simons Foundation.

The fellowship is a two year position, starting the summer or fall of
2010. The fellowship stipend is gauged to attract the highest caliber of
applicants. Generous funds for scientific travel will be available for
use at the fellow's discretion. Fellows will be assigned a faculty
member close to their research interests from the TOC group. Fellows
will be encouraged (although not required) to teach a graduate seminar
in their area of research.

*Eligibility: *Candidates must receive their PhD during the academic
year immediately preceding that in which the fellowship would begin.
There are no other restrictions based on nationality or any other basis.

*Application Process:* Candidate applications should include a
description of professional interests and goals in research. Each
application should include a curriculum vitae and the names and
addresses of three or more individuals who will provide letters of
recommendation. Letter writers should submit their letters directly to
MIT to the address below. Please submit complete applications by
*January 31st, 2010*.

*Address to submit application*: all application materials and
recommendation letters should be sent electronically to
theory-postdoc@csail.mit.edu <mailto:theory-postdoc@csail.mit.edu>. The
candidates name should be included in the subject line of the email.
Alternatively, the materials can be also sent to the following address:
Simons Postdoctoral Fellowship, c/o Joanne Hanley
MIT Computer Science and Artificial Intelligence Laboratory
The Stata Center, Building 32 –G682
32 Vassar Street
Cambridge, MA 02139, 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/
*
**********************************************************

Change in Deadline for the Simons Postdoctoral Fellowship at the MIT in Theoretical Computer Science!

Dear All, please note that the deadline is January 31, 2010 -- instead
of January 1, 2010.
Thanks!

*Simons Postdoctoral Fellowship at the Massachusetts Institute of
Technology in Theoretical Computer Science*

The Theory of Computation (TOC) group at the Computer Science and
Artificial Intelligence Laboratory (CSAIL) at MIT is seeking candidates
for a post-doctoral position in the general area of the theory of
computation. Applicants in /all areas/ of theory are encouraged to
apply, including (but not exclusive to) algorithms, complexity theory,
combinatorial optimization, cryptography, distributed computing, game
theory and computation, geometry, parallel computing, and quantum
computing. This fellowship is made possible by a generous gift from the
Simons Foundation.

The fellowship is a two year position, starting the summer or fall of
2010. The fellowship stipend is gauged to attract the highest caliber of
applicants. Generous funds for scientific travel will be available for
use at the fellow's discretion. Fellows will be assigned a faculty
member close to their research interests from the TOC group. Fellows
will be encouraged (although not required) to teach a graduate seminar
in their area of research.

*Eligibility: *Candidates must receive their PhD during the academic
year immediately preceding that in which the fellowship would begin.
There are no other restrictions based on nationality or any other basis.

*Application Process:* Candidate applications should include a
description of professional interests and goals in research. Each
application should include a curriculum vitae and the names and
addresses of three or more individuals who will provide letters of
recommendation. Letter writers should submit their letters directly to
MIT to the address below. Please submit complete applications by J*anuary
31st, 2010.*

*Address to submit application*: all application materials and
recommendation letters should be sent electronically to
theory-postdoc@csail.mit.edu <mailto:theory-postdoc@csail.mit.edu>. The
candidates name should be included in the subject line of the email.
Alternatively, the materials can be also sent to the following address:
Simons Postdoctoral Fellowship, c/o Joanne Hanley
MIT Computer Science and Artificial Intelligence Laboratory
The Stata Center, Building 32 ?G682
32 Vassar Street
Cambridge, MA 02139, USA.

[DMANET] ARC postdoc position at Georgia Tech

Please post the advertisement below.
The Algorithms, Randomness and Complexity (ARC) Center at Georgia Tech is
seeking a postdoctoral fellow to participate in research investigations.
Candidates with a PhD in Computer Science, Mathematics, Operations Research
or a related field are encouraged to apply. The selected candidate will have
the opportunity to work on any aspect of algorithms and complexity, broadly
interpreted, and collaborate with ARC faculty.
The position is for up to two years, with a start date between July 1 and
September 1. There is no teaching requirement, but the postdoc is encouraged
to lead a research seminar. Interested candidates should send a CV, research
statement, and request 3 letters of recommendation be sent to:
arc-postdoc@cc.gatech.edu<mailto:arc-postdoc@cc.gatech.edu>
Applications should be received by January 10, 2010 for full consideration.
Please contact
Elizabeth Ndongi
(ndongi@cc.gatech.edu<mailto:ndongi@cc.gatech.edu>)
for any further information.
Selection committee: Nina Balcan, Ton Dieker, Chris Peikert, Prasad Tetali
and Santosh Vempala.

Elizabeth Ndongi
Georgia Institute of Technology
College of Computing
School of Computer Science
Klaus Advanced Computing Building
266 Ferst Drive, Atlanta GA 30322-0765
Phone: 404-385-3190
E-Mail: ndongi@cc.gatech.edu<mailto:ndongi@cc.gatech.edu>
http://www.cc.gatech.edu
**********************************************************
*
* 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/
*
**********************************************************