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. call for nominations: 2018 Flajolet Lecture Prize
(Mark Daniel Ward)
2. Special Issue GO X - Discrete Applied Mathematics (RIES Bernard)
3. SPAA 2017 Call for Papers (Nodari Sitchinava)
4. faculty positions at Istanbul Technical University
(m. oguzhan kulekci)
5. Scholarships for Master's Study in Logic and Computation at
TU Wien, Vienna, Austria (Stefan Szeider)
----------------------------------------------------------------------
Message: 1
Date: Thu, 27 Oct 2016 08:47:01 -0600
From: Mark Daniel Ward <mdw@purdue.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] call for nominations: 2018 Flajolet Lecture Prize
Message-ID: <7f6cc2f0-cec8-4962-28fa-cc3607f06355@purdue.edu>
Content-Type: text/plain; charset=utf-8; format=flowed
2018 FLAJOLET LECTURE PRIZE
Call for Nominations
The Philippe Flajolet Lecture Prize for outstanding contributions to
analytic combinatorics and analysis of algorithms is awarded every two
years by the Analysis of Algorithms (AofA) community that owes its
existence to Philippe Flajolet. The first Flajolet Lecture was presented
by D. E. Knuth at the 2014 AofA International Conference on
Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of
Algorithms, Paris, France, and the second one by Bob Sedgewich at the
2016 AofA Conference in Krakow, Poland.
The prize is named in honor and recognition of the extraordinary
accomplishments of late Philippe Flajolet, who spent most of his
scientific life at INRIA, France. Philippe is best known for
fundamental advances in mathematical methods for the analysis of
algorithms. His research laid the foundation of a subfield of
mathematics, now known as analytic combinatorics. Analytic
combinatorics is a modern basis for the quantitative study of
combinatorial structures (such as words, trees, mappings, and graphs),
with applications to probabilistic study of algorithms that are based on
these structures. It also strongly influences research in other
scientific domains, such as statistical physics, computational biology,
and information theory. Flajolet's work takes the field forward by
introducing original approaches in combinatorics based on two types of
methods: symbolic and analytic. The symbolic side is based on the
automation of decision procedures in combinatorial enumeration to derive
characterizations of generating functions. The analytic side treats
those functions as functions in the complex plane and leads to precise
characterization of limit distributions. Beyond these foundational
contributions, Philippe's research opened new avenues in various domains
of applied computer science, including streaming algorithms,
communication protocols, database access methods, data mining, symbolic
manipulation, text-processing algorithms, and random generation.
The next Flajolet Lecture will be delivered at the 2018 AofA Conference
in Uppsala, Sweden. Nominations are due on February 28, 2017. The
winner will be selected by a Prize Committee consisting of:
Michael Drmota, Chair (TU Wien)
Mireille Bousquet-Melou (Univ. Bordeaux)
Peter Winkler (Dartmouth College)
Bob Sedgewick, ex officio (Princeton University)
The nomination letter should summarize his/her contributions in one or
two pages. All nominations should be sent to Michael Drmota at
michael.drmota@tuwien.ac.at .
In selecting the Flajolet-Prize winner, the Committee will pay
particular attention to a sustained record of high-impact, seminal
contributions to the research areas most directly impacted by the work
of Flajolet: the foundations of analysis of algorithms and/or analytic
combinatorics. The selection may also be based partly on educational
accomplishments and contributions such as fundamental textbooks and
high-quality students. The final selection will be approved by the
Steering Committee of the AofA.
------------------------------
Message: 2
Date: Thu, 27 Oct 2016 17:28:58 +0200
From: RIES Bernard <bernard.ries@unifr.ch>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Special Issue GO X - Discrete Applied Mathematics
Message-ID: <B49697EA-0930-46FE-B8A1-5CCFBBE53AC2@unifr.ch>
Content-Type: text/plain; charset=utf-8
We are preparing a special issue of the journal Discrete Applied Mathematics devoted to the 10th International Colloquium on Graphs & Optimization that was held in Rigi Kaltbad, July 10 - July 14, 2016, to honor Martine Labbé, Jacek Blazewicz and Pavol Hell.
All interested researchers are invited to contribute to this special issue. Submissions of contributions not presented at the workshop are also welcome. The topics should relate to the themes of the workshop: Graph Theory, Scheduling and Optimization.
All submissions will be thoroughly refereed according to the high standards of Discrete Applied Mathematics.
The full papers must be submitted through the Elsevier Editorial System (http://ees.elsevier.com/dam <http://ees.elsevier.com/dam>). When submitting your paper, be sure to specify that the paper is a contribution for the special issue of GO X, so that your paper is assigned to the guest editors, by selecting the article type "SI:GO X, Rigi Kaltbad, 2016". Please see the author instructions on the site for any additional information.
The deadline for submission is 28.02.2017.
Accepted papers will be published online individually, before print publication.
We are looking forward to receiving your contribution.
The Guest Editors,
Yves CRAMA
Bernard GENDRON
Bernard RIES
----------------------------------------------------------------------------------
Bernard Ries - Associate Professor
University of Fribourg - Department of Informatics
Decision Support & Operations Research Group <http://diuf.unifr.ch/main/ds/>
Bd. de Pérolles 90, 1700 Fribourg
Phone : +41 26 300 83 33 - Fax: +41 26 300 97 26
Email: bernard.ries@unifr.ch <mailto:bernard.ries@unifr.ch>
Homepage: http://diuf.unifr.ch/ds/bries <http://diuf.unifr.ch/ds/bries>
----------------------------------------------------------------------------------
------------------------------
Message: 3
Date: Thu, 27 Oct 2016 15:00:45 -1000
From: Nodari Sitchinava <nodari@hawaii.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SPAA 2017 Call for Papers
Message-ID: <8e64e9bb-853c-dc7f-73e0-b0c38341fd8b@hawaii.edu>
Content-Type: text/plain; charset=utf-8; format=flowed
==================================================================
SPAA 2017 Call for Papers
==================================================================
29th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2017)
July 24 - 26, 2017
Washington D.C., USA
https://spaa.acm.org/
This year, SPAA is co-located with PODC 2017.
==================================================================
Important Dates:
Submission deadlines:
- Regular papers: February 9, 11:59pm EDT
- Brief announcements: February 9, 11:59pm EDT
These are firm deadlines. No extensions will be granted.
- Rebuttal period: March 27-30, 11:59pm EDT
- Notification: April 23
- Camera-ready copy due: May 23
==================================================================
Submissions are sought in all areas of parallel algorithms and
architectures, broadly construed, including both theoretical and
experimental perspectives. Topics of interest include, but are not
limited to:
- Parallel and Distributed Algorithms
- Parallel and Distributed Data Structures
- Algorithmic Game Theory
- Scheduling in Parallel Systems
- Parallel/Distributed Issues in Big Data
- Parallel and Distributed Architectures and I/O
- Streaming Algorithms
- Collaborative Learning Algorithms
- Network Algorithms
- Algorithms for Social Networks
- Multiprocessor and Multicore Architectures
- Transactional Memory Hardware and Software
- Algorithms for GPUs and Other Alternative Parallel Architectures
- High-Performance Parallel Computing and Architectures
- Green & Power-Efficient Algorithms and Architectures
- Instruction Level Parallelism and VLSI
- Biological Distributed Algorithms
- Mobile, Ad-Hoc, Wireless and Sensor Networks
- Algorithms for Routing and Information Dissemination
- Peer-to-Peer Systems
- Compilers and Tools for Concurrent Programming
- Fault-tolerance and Reliability
- Self-stabilization and Self-organization
- Security and Privacy in Distributed and Parallel Systems
- Parallel/Distributed Computational Learning
- Parallel Complexity Theory
- Specification and Verification of Concurrent Systems
- Resource Management and Awareness
Regular Papers:
Regular papers should report on original research, submitted exclusively
to this conference. Submissions may not exceed ten (10) single-spaced
double-column pages. (Papers will be judged based on their quality and
not their length — short papers are welcome.) The title page,
bibliography and designated figure pages (containing only figures) are
not counted toward the ten pages. (Illustrative figures are encouraged.)
All necessary details to substantiate the main claims of the paper
should be included in a clearly marked appendix. Regular papers will be
allotted up to 10 pages in the proceedings.
Brief announcements:
SPAA also solicits brief announcements that raise issues of interest to
the SPAA community. Brief announcements may not exceed three pages and
their titles should start with ``Brief Announcement:''. Examples of good
brief announcements include: (i) papers previously published elsewhere
of interest to SPAA, (ii) work in progress, (iii) announcement of
tools/libraries, (iv) challenge problems posed to the community, (v)
corrections to earlier results. Brief announcements may also include
smaller results of interest.
All regular rejected papers automatically will be considered for brief
announcements. Titles of regular papers which do not want to be
considered for this option should start with ``Full Paper ONLY:''. Brief
announcements will be allotted up to 3 pages in the proceedings.
Paper Submissions:
Submitted manuscripts may not exceed ten (10) single-spaced
double-column pages for regular papers and three (3) single-spaced
double-column pages for brief announcements, using 10-point size font on
8.5x11 inch pages, not counting the title page, bibliography and
designated figure pages ). The title page should contain the title,
author names and affiliations, followed by a brief abstract. See
http://www.acm.org/sigs/publications/proceedings-templates (version 2.8,
May 2015)
for details, including the sig-alternate-05-2015.cls style file and a
sample file. Additional details may be added in a clearly marked
appendix that will be read at the discretion of the program committee.
Please indicate in the title of your manuscript whether this is a
regular paper or a brief announcement.
Regular papers submitted to SPAA may not be under simultaneous
consideration for a journal or any conference or workshop with published
proceedings (other than as a brief announcement for a previous conference).
Authors are encouraged to post full versions of their submissions in a
freely accessible on-line repository such as the arxiv, the ECCC, or the
Cryptology ePrint archive. We expect that authors of accepted regular
papers will make full versions of their papers, with proofs, available
by the camera-ready deadline. (This should be done in a manner
consistent with the ACM Copyright Policy.)
The deadline for ALL submissions is February 9.
Rebuttal Period:
There will be a rebuttal period during which the authors can point out
misunderstandings or comment on critical questions that the PC members
may have. It will take place on March 27-30.
Notification:
Authors will be sent notification of acceptance or rejection by e-mail
on or before April 23. A camera-ready copy of each accepted abstract
must be prepared according to the ACM guidelines for inclusion in the
proceedings of the conference and must be received by the date to be
determined later.
Awards:
Every regular paper is eligible for the best paper award. The program
committee may decline to make this award or may split the award among
multiple papers.
==================================================================
Program Committee:
PC Chair: Mohammad T. Hajiaghayi, University of Maryland, College Park
Umut Acar Carnegie Mellon University
Susanne Albers Technical University of Munich
Hossein Asadi Sharif University of Technology
Nikhil Bansal Eindhoven University of Technology
Hossein Bateni Google Research
Petra Berenbrink Simons Fraser University
Keren Censor-Hillel Technion
Hubert Chan The University of Hong Kong
Rajesh Chitnis Weizmann Institute of Science
Frank Dehne Carleton University
Martin Farach-Colton Rutgers University
Pierre Fraigniaud CNRS and University Paris Diderot
Mohsen Ghaffari ETH Zurich
Michael Goodrich University of California, Irvine
Fabrizio Grandoni IDSIA
Mohammad Hajiaghayi (chair) University of Maryland, College Park
Martin Hoefer MPI Informatik, Saarbrücken
Samir Khuller University of Maryland
Ravi Kumar Google Research
Silvio Lattanzi Google Research
Aleksander Madry MIT
Friedhelm Meyer auf der Heide Paderborn University
Vahab Mirrokni Google Research
Morteza Monemizadeh Rutgers University
Seffi Naor Technion
Boaz Patt-Shamir Tel Aviv University
Giuseppe Persiano Università di Salerno
Cynthia A Phillips Sandia National Laboratories
Yuval Rabani The Hebrew University of Jerusalem
Rachid Guerraoui EPFL
Harald Raecke TU München
Rajmohan Rajaraman Northeastern University
Mauricio Resende Amazon
Laura Sanità University of Waterloo
Alex Slivkins Microsoft Research, NYC
Peter Varman Rice University
Roger Wattenhofer ETH Zurich
Ryan Williams Stanford University and MIT
David Woodruff IBM Almaden Research Center
==================================================================
Conference Committee:
General Chair
Christian Scheideler, University of Paderborn
Secretary
Jeremy Fineman, Georgetown University
Treasurer
David Bunde, Knox College
Publicity Chair
Nodari Sitchinava, University of Hawaii at Manoa
Local Arrangements Chair
Jeremy Fineman, Georgetown University
Calvin Newport, Georgetown University
==================================================================
--
Nodari Sitchinava
Assistant Professor
Department of ICS
University of Hawaii at Manoa
http://www2.hawaii.edu/~nodari
------------------------------
Message: 4
Date: Fri, 28 Oct 2016 09:30:02 +0300
From: "m. oguzhan kulekci" <oguzhankulekci@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] faculty positions at Istanbul Technical University
Message-ID:
<CAEdZDBWcUYxtQg3-g-eq2rxai3OhSrExArtAMpFcjwZtKSXVMQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear colleagues,
Two positions (assistant/associate or full professor) with a main focus on
algorithmic aspects of data science at the Computer Science graduate
program of the Informatics Institute, Istanbul Technical University,
Istanbul, Turkey, are available for "international" applicants.
We are looking for candidates particularly with a research interest in
data management, data analysis, data security with applications. The
previous research records of an ideal applicant should demonstrate a
balanced background in between the theory and practice of algorithms.
The responsibilities include teaching graduate courses (the institute runs
only MS and PhD programs, no undergraduate), advising graduate students,
publishing research results, and participation in research projects/grant
applications. The program is currently under a change in terms of the
curriculum, and candidates are expected to help this reshaping.
Please notice that the pay scale of the international professors are
flexible, and thus, will be decided according to their experience.
In-campus housing might also be provided.
Interested candidates can send their applications containing the CV,
research statement, and teaching statement to kulekci@itu.edu.tr. Questions
and comments are surely very welcome.
M. Oğuzhan Külekci
Assoc. Prof. @ Informatics Institute.
Istanbul Technical University, Turkey
web.itu.edu.tr/kulekci
------------------------------
Message: 5
Date: Fri, 28 Oct 2016 11:59:22 +0200
From: Stefan Szeider <stefan@szeider.net>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Scholarships for Master's Study in Logic and
Computation at TU Wien, Vienna, Austria
Message-ID: <9925385B-F16B-4694-BF52-C7421C003DED@szeider.net>
Content-Type: text/plain; charset=utf-8
We offer scholarships to support outstanding students for the Master's Program in Logic and Computation at TU Wien, Vienna, Austria. Among the program's seven focus areas are the topics Algorithms and Complexity Theory.
Details can be found at http://logic-cs.at/master/grants-and-scholarships/
Application deadline is November 30, 2016.
—-
Stefan Szeider
Algorithms and Complexity Group
Institute of Computer Graphics and Algorithms
TU Wien, Vienna, Austria
https://www.ac.tuwien.ac.at
------------------------------
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 105, Issue 1
**************************************
No comments:
Post a Comment