dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Research Fellow (Applied Modelling and Optimisation) at
Monash University (Guido Tack)
2. STOC 2017 Call for Papers (Valerie King)
3. EATCS Fellows 2017 Call for Nominations (Laura Marmor)
----------------------------------------------------------------------
Message: 1
Date: Wed, 5 Oct 2016 09:22:21 +1100
From: Guido Tack <guido.tack@monash.edu>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Research Fellow (Applied Modelling and Optimisation)
at Monash University
Message-ID: <DF9624BD-40D6-48EB-B81F-67AFC6CC2E15@monash.edu>
Content-Type: text/plain; charset=us-ascii
The Faculty of Information Technology at Monash University, Melbourne, Australia, has strong research programs across many aspects of modelling and optimisation. The faculty is expanding its joint research with industry and other research disciplines, applying advanced analytics and decision support to solve scientific and industrial problems.
In this role you will conduct joint applications-oriented research with external industry and research partners applying advanced methods developed by the Monash optimisation team. You will also be involved in the implementation of software solutions that realise the benefits of our optimisation research in practical applications.
As the successful applicant, you will have a PhD in a relevant field of information technology or engineering and an excellent record of innovative research and development in software for resource optimisation. You will also have a demonstrated capacity to apply optimisation methods to real-world problems. If you believe you match this profile, we look forward to receiving your application.
This is a three year fixed-term full-time position, at $64,450 - $87,471 pa (Level A) or $92,074 - $109,339 pa (Level B), plus 17% employer superannuation. Applications close Thursday 10 November 2016, 11:55pm AEDT.
For full details please see
http://careersmanager.pageuppeople.com/513/cw/en/job/551138/research-fellow-applied-modelling-and-optimisation <http://careersmanager.pageuppeople.com/513/cw/en/job/551138/research-fellow-applied-modelling-and-optimisation>
Best regards,
Guido
--
GUIDO TACK
Senior Lecturer
Information Technology
Monash University
Level 6, Room 6.40, Building H, Caulfield Campus
900 Dandenong Road
Caulfield East VIC 3145
Australia
T: +61 3 9903 1214
E: guido.tack@monash.edu <mailto:guido.tack@monash.edu>
http://www.csse.monash.edu/~guidot/ <http://www.csse.monash.edu/~guidot/>
------------------------------
Message: 2
Date: Wed, 5 Oct 2016 06:18:00 -0700
From: Valerie King <val@uvic.ca>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] STOC 2017 Call for Papers
Message-ID: <405117df-dadf-2c99-cda8-a9b0530e29cb@uvic.ca>
Content-Type: text/plain; charset="utf-8"; format=flowed
Call for
Papers
STOC 2017
Theory Fest
June 19-23, 2017
Montreal, Quebec, Canada
Submission Deadline: Wednesday, November 2, 2016, 11:59pm PDT
*The 49th ACM Symposium on Theory of Computing (STOC 2017)*, sponsored
by the ACM Special Interest Group on Algorithms and Computation Theory
(SIGACT <http://www.sigact.org/>), will be held in Montreal, Quebec,
Canada. This year, STOC will be part of *Theory Fest
<http://acm-stoc.org/stoc2017/>*, an expanded program of invited talks,
tutorials, poster sessions, and workshops from *Monday, June 19 *to
*Friday, June 23, 2017.* Papers presenting new and original research on
the theory of computation are sought. Topics of interest include, but
are not limited to: algorithms and data structures, computational
complexity, randomness in computing, algorithmic graph theory and
combinatorics, approximation algorithms, cryptography, computational
learning theory, economics and computation, parallel and distributed
algorithms, quantum computing, algorithmic coding theory, computational
geometry, computational applications of logic, optimization, algebraic
algorithms, and theoretical aspects of areas such as networks, privacy,
computational biology, and databases. Papers that extend the reach of
the theory of computing, or raise important problems that can benefit
from theoretical investigation and analysis, are encouraged. The program
committee will make every effort to consider a broad range of areas.
*Submission format:* Submissions should start with a title page
consisting of the title of the paper; each author's name, affiliation,
and email address; and an abstract of 1-2 paragraphs summarizing the
paper's contributions. There is no page limit and authors are encouraged
to use the "full version" of their paper as the submission. The
submission should contain within the initial ten pages following the
title page a clear presentation of the merits of the paper, including a
discussion of the paper's importance within the context of prior work
and a description of the key technical and conceptual ideas used to
achieve its main claims. The submission should be addressed to a broad
spectrum of theoretical computer science researchers. Proofs must be
provided which can enable the main mathematical claims of the paper to
be fully verified. Although there is no bound on the length of a
submission, material other than the abstract, references, and the first
ten pages will be read at the committee's discretion. Authors are
encouraged to put the references at the very end of the submission. The
submission should be typeset using 11-point or larger fonts, in a
single-column, single-space (between lines) format with ample spacing
throughout and 1-inch margins all around, on letter-size (8 1/2 x 11
inch) paper. Submissions deviating significantly from these guidelines
risk rejection without consideration of their merits.
*Submission Instructions:* Authors are required to submit their papers
electronically, in PDF (without security restrictions on copying or
printing). The submission server <https://stoc17.hotcrp.com> is now open.
Authors are encouraged to also make full versions of their submissions
freely accessible in an online repository such as the arXiv
<http://arxiv.org/>, ECCC <http://www.eccc.uni-trier.de/>, or the
Cryptology ePrint archive <http://eprint.iacr.org/>. (Papers that are
not written well enough for public dissemination are probably also not
ready for submission to STOC.) It is expected that authors of accepted
papers will make their full papers, with proofs, publicly available by
the camera-ready deadline.
*Prior and Simultaneous Submissions:* The conference will follow
SIGACT's policy on prior publication and simultaneous submissions. Work
that has been previously published in another conference proceedings or
journal, or which is scheduled for publication prior to July 2017, will
not be considered for acceptance at STOC 2017. The only exception to
this policy are prior or simultaneous publications appearing in the
Science and Nature journals. SIGACT policy does not allow simultaneous
submissions of the same (or essentially the same) material to another
conference with published proceedings. The program committee may consult
with program chairs of other (past or future) conferences to find out
about closely related submissions.
Dates:
*Extended Abstract Submission:* Wednesday, November 2, 2016 (11:59pm PDT).
*Notification:* by email on or before February 8, 2017.
*Deadline for accepted papers:* A camera-ready copy of each accepted
paper is required by March 16, 2017.
*STOC talks:* Monday morning June 19 to Thursday afternoon June 22, 2017
*Theory Fest activities:* Monday morning June 19 to Friday afternoon
June 23, 2017
*Presentation of Accepted Papers:* One author of each accepted paper
will be expected to present the work in the form of a talk at the
conference. In addition, one or more authors will be expected to present
the work in an evening poster session.
*Best Paper Award:* The program committee may designate up to three
papers accepted to the conference as STOC Best Papers. Every submission
is automatically eligible for this award. Rules for the award can be
found at http://www.sigact.org/Prizes/BestPaper.
*Danny Lewin Best Student Paper Award:* A prize of $500 will be given to
the author(s) of the best student authored paper (or split between more
than one paper if there is a tie). A paper is eligible if all of its
authors are full-time students at the time of submission. To inform the
program committee about a paper's eligibility, check the appropriate box
in the web form on the submission server. The list of past winners can
be found at http://www.sigact.org/Prizes/Student.
Program Committee:
Nina Balcan (Carnegie Mellon University)
Keren Censor-Hillel (Technion)
Edith Cohen (Google and Tel Aviv University)
Artur Czumaj (University of Warwick)
Yevgeniy Dodis (New York University)
Andrew Drucker (University of Chicago)
Nick Harvey (University of British Columbia)
Monika Henzinger (University of Vienna)
Russell Impagliazzo (University of California, San Diego)
Ken-ichi Kawarabayashi (National Institute of Informatics, Tokyo)
Valerie King (chair) (University of Victoria)
Ravi Kumar (Google)
James R. Lee (University of Washington)
Katrina Ligett (California Institute of Technology and Hebrew University)
Aleksander Ma̧dry (Massachusetts Institute of Technology)
Cristopher Moore (Santa Fe Institute)
Jelani Nelson (Harvard University)
Christos Papadimitriou (University of California, Berkeley)
Eric Price (University of Texas, Austin)
Amit Sahai (University of California, Los Angeles)
Jared Saia (University of New Mexico)
Shubhangi Saraf (Rutgers University)
Alexander Sherstov (University of California, Los Angeles)
Mohit Singh (Microsoft Research and Georgia Institute of Technology)
Gábor Tardos (Rényi Institute, Budapest)
*General Co-Chairs:* Hamed Hatami (McGill University), Pierre McKenzie
(Université de Montréal)
The committee intends to provide registered attendees with internet
access to the Proceedings on a password-protected site that will be
available from about two weeks before the conference until the end of
the conference. Authors can opt out of this online distribution by
contacting the program committee chair by March 16.
SIGACT provides travel awards to students without available support, and
researchers from developing countries. More information on the award
process will be posted shortly.
------------------------------
Message: 3
Date: Wed, 5 Oct 2016 13:59:48 +0000
From: Laura Marmor <laura.marmor@cs.ox.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] EATCS Fellows 2017 Call for Nominations
Message-ID:
<1636200A87934545AD099B492F7BB465AC9FD9C1@MBX03.ad.oak.ox.ac.uk>
Content-Type: text/plain; charset="us-ascii"
The official call for nominations is at this URL at the European Association
for Theoretical Computer Science (EATCS) http://bit.ly/2dIL4Sf
Deadline: December 31, 2016
- VERY IMPORTANT: all nominees and nominators must be EATCS Members
- Proposals for Fellow consideration in 2017 should be submitted by DECEMBER 31st,
2016 by email to the EATCS Secretary (secretary "at" eatcs "dot" org).
The subject line of the email should read
"EATCS Fellow Nomination - <surname of candidate>".
The EATCS Fellows Program is established by the Association to recognise
outstanding EATCS Members for their scientific achievements in the field of
Theoretical Computer Science. The Fellow status is conferred by the EATCS
Fellows-Selection Committee upon a person having a track record of intellectual
and organisational leadership within the EATCS community. Fellows are expected
to be "model citizens" of the TCS community, helping to develop the standing
of TCS beyond the frontiers of the community.
In order to be considered by the EATCS Fellows-Selection Committee, candidates
must be nominated by at least four EATCS Members. Please verify your membership
at www.eatcs.org.
The EATCS Fellows-Selection Committee consists of
- Rocco De Nicola (IMT Lucca, Italy)
- Paul Goldberg (Oxford, UK, chair)
- Anca Muscholl (Bordeaux, France)
- Dorothea Wagner (Karlsruhe, Germany)
- Roger Wattenhofer (ETH Zurich, Switzerland)
INSTRUCTIONS: A nomination should consist of details on the items below.
It can be co-signed by several EATCS members. At least two nomination letters
per candidate are recommended. If you are supporting the nomination from
within the candidate's field of expertise, it is expected that you will be
specific about the individual's technical contributions.
To be considered, nominations for 2016 must be received by December 31, 2016.
1. Name of candidate, Candidate's current affiliation and position, Candidate's
email address, postal address and phone number, Nominator(s) relationship to
the candidate
2. Short summary of candidate's accomplishments (citation - 25 words or less)
3. Candidate's accomplishments: Identify the most important contributions that
qualify the candidate for the rank of EATCS Fellow according to the following
two categories:
A) Technical achievements
B) Outstanding service to the TCS community. Please limit your comments to at
most three pages.
4. Nominator(s): Name(s) Affiliation(s), email and postal address(es), phone number(s)
Please note: all nominees and nominators must be EATCS Members.
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 104, Issue 4
**************************************
No comments:
Post a Comment