Monday, January 16, 2017

[DMANET] Spring School "Optimization and Data Science" in Novi Sad, March 13-17, 2017

Dear colleagues,

We would like to announce that the COST Action TD1207 on "Mathematical
Optimization in Decision Support Systems for Efficient and Robust Energy
Networks", http://www.energy-opt.eu/, will be holding a

Spring School on Optimization and Data Science

Date: March 13-17, 2017
Location: Novi Sad, Serbia
Website: http://www.optdata-springschool.com

The training school will highlight the strong algorithmic connections
between the fields of optimization and machine learning and showcase
innovative applications at their interface. The goal is to equip
students both with a theoretical understanding and hands-on programming
experience.

Topics:
- Convex optimization in machine learning
- Mixed-integer programming and exact ML models
- Adaptive general regression and classification in the big data context
- Deep learning software packages: CNTK, Tensorflow, Theano, ...
- Applications in transportation, logistics, and healthcare
- Artificial neural networks in theory and practice
- Genetic algorithms in neural network optimization
- Traditional data analysis techniques: seriation, regression, frequent
itemsets, and their combinatorial structure
- Parallelization methods and their bottlenecks
- Optimization and cloud computing
- ...

Confirmed speakers:
- Tim Conrad, Freie Universität Berlin
- Maria Pia Fanti, Politecnico di Bari
- Robert Gower, Ecole Normale Superieure
- Utz-Uwe Haus, Cray EMEA Research Labs
- Daniel Hulme, SATALIA
- Philipp Hungerländer, Univ. Klagenfurt
- Filip Kulić, University of Novi Sad
- Milan Rapaić, University of Novi Sad
- ...


Registration is FREE and closes on Monday, February 20th, or when all
places are filled. The registration form will open soon.

A limited amount of travel support for students is available. In order
to apply, please send your CV, a brief motivation letter, and a
recommendation of your supervisor to optdata@optdata-springschool.com.


We are looking forward to welcoming you in Novi Sad!

The main organizers:

Milena Petković, Željko Kanović, Zoran Jeličić
Faculty of Technical Sciences, University of Novi Sad

Ambros Gleixner
Zuse Institute Berlin
**********************************************************
*
* 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] Workshop Women in Optimization

Liebe Kolleginnen und Kollegen,

vom 20. - 22. Maerz 2017 findet in Trier der zweite Workshop „Women in
Optimization" statt. Der Workshop richtet sich an
Nachwuchswissenschaftlerinnen, Doktorandinnen und Studentinnen der
Mathematik mit dem Schwerpunkt Optimierung. Das Ziel des Workshops liegt
sowohl in der fachlichen Weiterbildung als auch in der Vernetzung
innerhalb der Optimierungscommunity.

Neben Fachvortraegen eingeladener Referentinnen bietet der Workshop viel
Raum fuer wissenschaftliche Diskussionen und Erfahrungsaustausch. Im
Rahmen von Postersessions wird Nachwuchswissenschaftlerinnen
die Moeglichkeit zur aktiven Teilnahme gegeben.

Detaillierte Informationen finden Sie auf der Workshop-Homepage:

http://alop.uni-trier.de/event/women-in-optimization/

Es wuerde uns freuen, wenn Sie diese Information an
Nachwuchswissenschaftlerinnen (fortgeschrittenes Master-Level bi
Postdoc-Level) der mathematischen Optimierung weiterleiten wuerden.

Mit freundlichen Gruessen

Luise Blank, Universitaet Regensburg
Debora Clever, ABB AG, Forschungszentrum Ladenburg
Mirjam Duer, Universitaet Trier
Barbara Kaltenbacher, Universitaet Klagenfurt
Katja Mombauer, Universitaet Heidelberg
Sonja Steffensen, RWTH Universitaet Aachen
Andrea Walther, Universitaet Paderborn

**********************************************************
*
* 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] CfP&S Telecommunications Stream - IFORS 2017

Call for Presentations and Sessions

Telecommunications Stream
IFORS 2017 - 21st Conference of the International Federation of
Operational Research Societies

Quebec City, July 17 - 21 2017
--------------------------------------------------------------------------------------------------------------------

We invite you and any interested colleagues to organize a session (at
least 3 abstracts/presentations) or a contributed presentation for the
Telecommunications Stream at the IFORS 2017 in Quebec City.

The focus of the Telecommunications Stream is broad and encompasses
applied and theoretical work in computer science, operations research,
management science, information systems, etc. Example topics are, but not
limited to: telecommunications modeling, policy, and technology, network
economics, network design, algorithms and optimization, sensor networks,
wireless and broadband networks, vehicle and mobile computing, semantic
networks, network survivability and reliability, information security and
privacy, quality of service, internet and multimedia, data mining
applications in telecommunications networks.

If you would like to organize a session, please contact Fabio
D'Andreagiovanni, Stan Dimitrov, or Ivana Ljubic (see below) as soon as
possible. If you would like to submit a single presentation, please email
(see below) the title and authors to either of us and you will be sent
information on what to enter in the IFORS conference abstract submission
system. The deadline for entry into that system for the conference is
February 10th, 2017, but you should send us the information before
February 3rd, 2017.

Please submit your abstracts as soon as possible to help in the scheduling
process.

We look forward to seeing you in Quebec City!

The Stream Organizers

Fabio D'Andreagiovanni
CNRS, Sorbonne University - UTC
d.andreagiovanni@hds.utc.fr

Stanko Dimitrov
University of Waterloo
sdimitrov@uwaterloo.ca

Ivana Ljubic
ESSEC Business School
ivana.ljubic@essec.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/
*
**********************************************************

[DMANET] Stellenausschreibung Fraunhofer Institut für Techno- und Wirtschaftsmathematik ITWM

S T E L L E N A U S S C H R E I B U N G Die Abteilung Optimierung des
Fraunhofer Institut für Techno- und Wirtschaftsmathematik ITWM in
Kaiserslautern entwickelt individuelle Lösungen zur Planung und
Entscheidungsunterstützung für Probleme der Logistik,
Ingenieurwissenschaften und Lebenswissenschaften in Zusammenarbeit mit
Wissenschaftlern und Industriekunden. Dabei wird eine enge Integration
von Modellierung, Simulation, Optimierung und Entscheidungsunterstützung
realisiert. Wir suchen zum nächstmöglichen Zeitpunkt *WISSENSCHAFTLICHE
MITARBEITERINNEN / WISSENSCHAFTLICHE MITARBEITER IM BEREICH
„MODELLIERUNG, SIMULATION, OPTIMIERUNG VON KONTINUIERLICHEN
PRODUKTIONSPROZESSEN" *WISSENSCHAFTLICHE MITARBEITERINNEN /
WISSENSCHAFTLICHE MITARBEITER IM BEREICH „MODELLIERUNG, SIMULATION,
OPTIMIERUNG VON DISKRETEN PRODUKTIONS- UND PLANUNGSPROZESSEN"
Voraussetzungen sind * ein überdurchschnittlicher Hochschulabschluss in
(Techno-/ Wirtschafts-) Mathematik, Physik, Statistik oder Informatik, *
eine starke Neigung zu angewandter Mathematik im gewählten
Themenbereich, * Programmierkenntnisse (Matlab, C++, C#, oder Java) oder
die Bereitschaft sich diese eigenverantwortlich anzueignen, * sichere
Sprach- und Präsentationskompetenz in Deutsch und Englisch. Die genauen
Themenbeschreibungen können Sie unseren Stellenausschreibungen
entnehmen. Was Sie erwarten können Die Tätigkeit wird in einem kreativen
Team stattfinden, das unterschiedlichste Probleme aus der Praxis
hochmotiviert und innovativ löst. Die Ergebnisse der Arbeit können mit
Industriepartnern direkt in der Praxis erprobt und umgesetzt werden.
Anstellung, Vergütung und Sozialleistungen basieren auf dem Tarifvertrag
für den öffentlichen Dienst (TVöD). Zusätzlich kann Fraunhofer
leistungs- und erfolgsabhängige variable Vergütungsbestandteile
gewähren. Die Stelle ist zunächst auf zwei Jahre befristet. Die
wöchentliche Arbeitszeit beträgt 39 Stunden. Schwerbehinderte Menschen
werden bei gleicher Eignung bevorzugt eingestellt. Die
Fraunhofer-Gesellschaft legt Wert auf die berufliche Gleichstellung von
Frauen und Männern. Das Fraunhofer-ITWM zeigt ein außerordentliches
Engagement für ein familienfreundliches Arbeitsumfeld seiner
Mitarbeiterinnen und Mitarbeiter: *Flexible Arbeits- und Elternzeiten,
*Kindertagesstätte, *die Möglichkeit zum Homeoffice, *die Organisation
von Gesundheitstagen und Sportangeboten *sowie ein Eltern-Kind-Büro
machen das Fraunhofer ITWM in Kaiserslautern zu einem attraktiven
Arbeitgeber. Fraunhofer ist die größte Organisation für
anwendungsorientierte Forschung in Europa. Unsere Forschungsfelder
richten sich nach den Bedürfnissen der Menschen: Gesundheit, Sicherheit,
Kommunikation, Mobilität, Energie und Umwelt. Wir sind kreativ, wir
gestalten Technik, wir entwerfen Produkte, wir verbessern Verfahren, wir
eröffnen neue Wege. Die detaillierten Stellenausschreibungen finden Sie
unter

https://recruiting.fraunhofer.de/Vacancies/29505/Description/1
https://recruiting.fraunhofer.de/Vacancies/29765/Description/1

Bitte wenden Sie sich mit Fragen an:

Fraunhofer Institut für Techno- und Wirtschaftsmathematik ITWM

Abteilung Optimierung

Prof. Dr. Karl-Heinz Küfer

Fraunhofer-Platz 1

D-67663 Kaiserslautern

https://www.itwm.fraunhofer.de/abteilungen/optimierung/mitarbeiter/prof-dr-karl-heinz-kuefer.html
<http://www.itwm.fraunhofer.de/en/departments/optimization/employees/prof-dr-karl-heinz-kuefer.html>

Weitere Informationen finden Sie außerdem auf unserer Webseite

- Fraunhofer ITWM: https://www.itwm.fraunhofer.de/
<http://www.itwm.fraunhofer.de/>

- Abteilung Optimierung
https://www.itwm.fraunhofer.de/abteilungen/optimierung.html
<http://www.itwm.fraunhofer.de/en/departments/optimization.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] CP2017: Call for Workshops

CP2017: Call for Workshops
--------------------------

The CP conference is the premier annual international conference on constraint
programming. It is concerned with all aspects of computing with constraints,
including but not limited to algorithms, environments, languages, models,
systems, theory, and applications such as decision making, resource allocation,
configuration, planning, and scheduling.

We invite proposals for workshops associated to the main conference program of
CP 2017, which will be held in Melbourne (Australia) from August 28 to
September 1, 2017, colocated with SAT 2017 (http://sat2017.github.io) and ICLP
2017 (http://iclp2017.a4lp.org), and following IJCAI 2017
(http://ijcai-17.org).

The purpose of the CP workshops is to provide an informal venue in which
participants can:

- explore specific research areas in depth,
- discuss new research directions,
- study specific application areas of CP, or
- bring together researchers from different fields with shared interests.

In previous years, workshop topics included data analytics, smart cities,
packing & placement, cloud computing, configuration, teaching, testing &
verification, bioinformatics, constraint-based modelling, CP solvers,
cross-fertilisation with other solving technologies, etc. We encourage
proposals for workshops on new topics, especially multi-disciplinary ones.

Based on successful experiments made in the last three years, we particularly
encourage workshops that break away from the tradition of reviewing
("publishing") and presenting submitted papers: instead, the better attended
workshops tended to foster much more interaction by having several invited
talks, if not introductory or specialist tutorials, and/or presentations
selected only on the basis of brief submitted abstracts. We encourage any other
innovations that are likely to increase the audience and interaction.

All workshops will take place at the site of the main conference, and follow
either a half-day format or a full-day format.

Incubator Workshop
------------------

The Association for Constraint Programming (ACP) will provide a sponsorship for
an Incubator Workshop. An Incubator Workshop should address a promising novel
topic, be multi-disciplinary in nature, and have the aim to broaden the
application of CP or deepen its methodologies. The ACP will make 1,500 euros
available for this purpose.

The call for Incubator Workshop will be issued by the ACP. Workshop organizers
who want to apply as an Incubator Workshop should check the ACP specific call
and follow its guidelines, and also submit their Workshop as described below.

Important Dates (for proposers of Workshop)
-------------------------------------------

- March 27, Workshop proposal submission deadline
- April 10, Workshop acceptance notification
- May 13, Workshop webpage available on CP website
- May 13, First call for papers (or abstracts, participation...)
- July 2017, Early registration deadline (accepted speakers must have received
notifications)
- August 28, CP 2017 Workshops

The exact schedule for workshops will be confirmed in due time.

Proposal Format
---------------

Each workshop proposal should include the following information, in a single
PDF file or in plain text

- Title
- Abstract outlining the goals and scope of the workshop
- Description of the target audience
- Motivation for running the workshop at CP 2017
- If the workshop also applies as Incubator workshop, motivation for this
- Estimate of the number/list of (invited) speakers, tutors, and participants
- History of the workshop (if applicable), with the number of applications and
the number of attendees (if available)
- Tentative duration of the workshop: half day or full day
- Relevant chairing experience of the main organizers (if any)
- Organizing committee members (if already known)
- Contact information of the main organizers

The Workshop Chair will acknowledge receipt of the proposal.

Responsibilities of the Workshop Organizers
-------------------------------------------

1. Creating several calls for abstracts (or papers) and calls for
participation, and distributing them on specialist channels not used by the
Publicity Chair of CP 2017.
2. The call for abstracts (or papers), if any, must clearly describe the review
& selection process and indicate that at least one author of every accepted
abstract (or paper) must attend the workshop and pay the workshop fee;
otherwise the presentation (and paper) will be withdrawn from the
proceedings, if any, and program.
3. Creating and publishing, in a timely manner, a webpage at the CP 2017
website, including all the relevant calls and information pertaining to the
workshop.
4. Providing a short description for the conference program.
5. Reviewing and selecting abstract (or paper) submissions.
6. Scheduling the presentations within the workshop.

It should be noted that the conference organization does not budget for free
registration, accommodation, or travel expenses for the workshop organizers or
their invited speakers. The workshop organizers should therefore secure any
source of funding or sponsorship deemed necessary for their invited speakers
(if any).

Responsibilities of the CP 2017 Organizing Committee
----------------------------------------------------

- Provide publicity for the workshop program as a whole.
- Provide logistics at the conference venue (meeting room, catering, etc.).
- Coordinate the allocation of time blocks for each workshop.
- Collect the workshop fees covering the rental and catering costs.
- Publicize the workshop calls with the help of the Publicity Chair.

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

Please send your proposal of Workshop by email to the CP 2017 Workshop Chair
(Charlotte Truchet, Charlotte.Truchet@univ-nantes.fr).


**********************************************************
*
* 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, January 15, 2017

[DMANET] 8th International Network Optimization Conference (INOC2017) ( 2nd announcement for extended abstracts)

International Network Optimization Conference 2017, INOC 2017

February 26-28, Lisboa, Portugal

[http://inoc2017.fc.ul.pt<http://inoc2017.fc.ul.pt/]http://inoc2017.fc.ul.pt<http://inoc2017.fc.ul.pt/>


Call for papers:
The paper submission for the Electronic Notes in Discrete Mathematics (ENDM) number is now closed but the authors are invited to submit 1-2 pages Extended Abstracts. The accepted Extended Abstracts will be available in the conference material.

Important dates:
- ENDM (full) paper submission deadline: (closed)
- Extended abstract submission deadline: January 20, 2017
- Acceptance Notification: January 25, 2017
- Early Registration: January 31, 2017


The 8th International Network Optimization Conference will take place in Lisbon, Portugal, February 26-28, 2017. The aim of this conference is to provide researchers from different areas of Operations Research, with the opportunity to present and discuss their results and research on the field of Network Optimization, in an inspiring and bridge building environment where fruitful ideas may flow freely.

INOC is the conference of the European Network Optimization Group (ENOG), a working group of EURO and the previous editions were held in Warsaw (2015), Tenerife (2013), Hamburg (2011), Pisa (2009), Spa (2007), Lisboa (2005) and Paris (2003). The conference is also part of the activities of the CMAFCIO (the Centro de Matemática e Aplicações Fundamentais e Centro de Investigação Operacional), University of Lisbon.

Conference Chairs:
Luis Gouveia (Faculty of Sciences, University of Lisbon-CMAFCIO)
Pedro Moura (Faculty of Sciences, University of Lisbon-CMAFCIO)

Keynote speakers:
W. Cook, University of Waterloo (Canada)
A. Martin, Friedrich-Alexander-Universität (Germany)
R. Möhring, TU Berlin (Germany)
A. Schrijver, Univ. of Amsterdam (The Netherlands)

Contact email: contactinoc2017@fc.ul.pt<mailto:contactinoc2017@fc.ul.pt>


Looking forward to seeing you in Lisboa,

Luís Gouveia and Pedro Moura

**********************************************************
*
* 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] TTCS - First CFP

=========================================
Topics in Theoretical Computer Science (TTCS 2017)
http://www.ttcs.ir/

Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
September 12-14, 2017

*** Abstract Submission Deadline: May 1, 2017 ***
=========================================

TTCS is a bi-annual conference series, serving as a forum for novel
and high-quality research in all areas of Theoretical Computer
Science. The proceedings will be published in Springer LNCS
series. The conference is sponsored by EATCS and IEEE (Iran section).

------------------------------
Keynote Speakers
------------------------------

- Mahdi Cheraghchi, Imperial College, UK
- Jaco van de Pol, University of Twente, The Netherlands
- Stefano Leonardi, Sapienza University of Rome, Italy

------------------------------
Important Dates
------------------------------

- Abstract Submission: May 1, 2017
- Full Paper Submission: May 8, 2017
- Author notification: June 26, 2017
- Camera ready paper: July 31, 2017
- Conference: September 12-14, 2017

------------------------------
Submissions
------------------------------

For the main conference, we solicit research papers in all areas of
theoretical computer science. All papers will undergo a rigorous
review process and will be judged based on their originality,
soundness, significance of the results, and relevance to the theme of
the conference.

Papers should be written in English. Research papers should not exceed
15 pages in the LNCS style format. All technical details necessary
for a proper evaluation of a submission must be included in the
submission or in a clearly-labelled appendix, to be consulted at the
discretion of program committee members. Multiple and/or concurrent
submission to other scientific venues is not allowed and will result
in rejection as well as notification to the other venue. Any case of
plagiarism (including self-plagiarism from earlier publications) will
result in rejection as well as notification to the the authors'
institutions.

Papers should be submitted to the appropriate track through our EasyChair
submission website:
https://www.easychair.org/conferences/?conf=ttcs2017 .
The web site is open for submissions.

------------------------------
Scope
------------------------------

TTCS is organized in 2 tracks. Topics of interest include but are not
limited to:

Track A: Algorithms and Complexity

- algorithms and data structures,
- algorithmic coding theory,
- algorithmic graph theory and combinatorics,
- approximation algorithms,
- computational complexity,
- computational geometry,
- computational learning theory,
- economics and algorithmic game theory,
- fixed parameter algorithms,
- machine learning,
- optimization,
- parallel and distributed algorithms,
- quantum computing,
- randomness in computing,
- theoretical cryptography.

Track B: Logic, Semantics, and Programming Theory

- algebra and co-algebra in computer science,
- concurrency theory,
- coordination languages,
- formal verification and model-based testing,
- logic in computer science,
- methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems,
- stochastic and probabilistic specification and reasoning,
- theoretical aspects of other CS-related research areas, e.g., computational science, databases, information retrieval, and networking,
- theory of programming languages,
- type theory and its application in program verification.

------------------------------
Program Committee
------------------------------

Track A: Algorithms and Complexity

- Amitabha Bagchi, IIT Delhi, India
- Samuel R. Buss, University of California, San Diego, USA
- Jaroslaw Byrka, University of Wroclaw, Poland
- Amir Daneshgar, Sharif University of Technology, Iran
- Anna Gal, University of Texas at Austin, USA
- Mohammad T. Hajiaghayi, University of Maryland, USA
- Amit Kumar, IIT Delhi, India
- Mohammad Mahmoody, University of Virginia, USA
- Rolf Niedermeier, TU Berlin, Germany
- Giuseppe Persiano, University of Salerno, Italy
- Jorg-Rudiger Sack, Carleton University, Ottawa, Canada
- Rahul Santhanam, University of Oxford, United Kingdom
- Jiri Sgall, Charles University, Prague, Czech Republic (Co-Chair)
- Vijay Vazirani, Georgia Institute of Technology, Atlanta, USA
- Gerhard Woeginger, RWTH Aachen, Germany
- Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran

Track B: Logic, Semantics, and Programming Theory

- Farhad Arbab, CWI and Leiden University, The Netherlands
- Ilaria Castellani, INRIA Sophia Antipolis, France
- Fatemeh Ghassemi, University of Tehran, Iran
- Hossein Hojjat, Rochester Institute of Technology, USA
- Mohammad Izadi, Sharif University of Technology, Iran
- Sung-shik Jongmans, Open University, The Netherlands
- Ramtin Khosravi, University of Tehran, Iran
- Jan Kretinsky, Munich University of Techology, Germany
- Bas Luttik, Eindhoven University of Technology, The Netherlands
- Larry Moss, Indiana University, USA
- Mohammad Reza Mousavi, Halmstad University, Sweden (Co-Chair)
- Mehrnoosh Sadrzadeh, Queen Mary University of London, UK
- Gerardo Schneider, Chalmers and University of Gothenburg, Sweden
- Subodh Sharma, IIT Delhi, India
- Mirco Tribastone, IMT Institute for Advanced Studies, Itay
- Kazunori Ueda, Waseda University, Japan
**********************************************************
*
* 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/
*
**********************************************************

Several associate and assistant professorships in CS (including TCS) at KTH Royal Institute of Technology

​The School of Computer Science and Communication at KTH Royal Institute of Technology invites applications for a tenured associate professorship in computer science with a broad profile, covering all research areas currently represented at the school including theoretical computer science.

 

KTH is the leading technical university in Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research environment covering a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. The group has a consistent track record of publishing in the leading theoretical computer science conferences and journals worldwide, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The working language of the TCS group is English, and knowledge of English is also fully sufficient to navigate life in Sweden in general. It might also be worth mentioning that Sweden routinely scores at the absolute top in rankings of quality of life such as, e.g., the OECD Better Life Index (http://www.oecdbetterlifeindex.org/).

 

The application deadline is February 17, 2017. See http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:96024/where:4/ for the full announcement with more information and instructions how to apply. Informal enquiries about this position (and possibly about how to navigate the application procedure at KTH) are welcome and may be sent to Johan Hastad at johan@kth.se or Jakob Nordstrom at jakobn@kth.se.

 

It should also be pointed out that this is only one of several openings in computer science at KTH, including also, for instance:

 

- One tenured associate professorship in computer science with a specialization in software engineering http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118880/where:4/

 

- One tenure-track assistant professorship in computer science with a specialization in software engineering http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118874/where:4/

 

- One tenure-track assistant professorship in computer science with a specialization in machine learning http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:118778/where:4/

 

All of these positions have an application deadline of February 17, 2017.​


[DMANET] [GECCO 2017] Two weeks left CFP - Genetic and Evolutionary Computation Conference 2017

*2017 Genetic and Evolutionary Computation Conference (GECCO 2017)*
July, 2017, Berlin, Germany
http://gecco-2017.sigevo.org/

*Call for Papers *

The Genetic and Evolutionary Computation Conference (GECCO 2017) will
present the latest high-quality results in genetic and evolutionary
computation. Topics include: genetic algorithms, genetic programming,
evolution strategies, evolutionary programming, memetic algorithms,
hyper heuristics, real-world applications, evolutionary machine
learning, evolvable hardware, artificial life, adaptive behavior, ant
colony optimization, swarm intelligence, biological applications,
evolutionary robotics, coevolution, artificial immune systems, and more.

The GECCO 2017 Program Committee invites the submission of technical
papers describing your best work in genetic and evolutionary
computation. Abstracts need to be submitted by January 30, 2017. Full
papers are due by the non-extensible deadline of February 6, 2017. Note
that*the submission system is online* on the official site.

Each paper submitted to GECCO will be rigorously evaluated in a
double-blind review process. The evaluation is on a per-track basis,
ensuring high interest and expertise of the reviewers. Review criteria
include significance of the work, technical soundness, novelty, clarity,
writing quality, and sufficiency of information to permit replication,
if applicable. All accepted papers will be published in the ACM Digital
Library. Researchers are invited to submit abstracts of their work
recently published in top-tier conferences and journals to the Hot Off
the Press track. Contributions will be selected based on quality and
interest to the GECCO community.

By submitting a paper, the author(s) agree that, if their paper is
accepted, they will:

- Submit a final, revised, camera-ready version to the publisher on or
before the camera ready deadline
- Register at least one author to attend the conference on or before
the advance registration deadline
- Attend the conference (at least one author)
- Present the accepted paper at the conference

*Important Dates:*

Abstract Deadline: January 30, 2017
Submission of Full Papers: February 6, 2017
Conference:15-19 July, 2017


GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).

--
Javier Ferrer
E.T.S. Ingeniería Informática
University of Málaga
Tel: +34 95213 2815
Fax: +34 95213 1397
ferrer [at] lcc.uma.es
http://neo.lcc.uma.es/staff/javi/

*********************************
Publicity Chair for GECCO 2017
*********************************


**********************************************************
*
* 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, January 14, 2017

Job: Associate Professor/Professor of Automated Verification, with Tutorial Fellowship at St. John's College, University of Oxford

[Please forward to anyone interested. Apologies for multiple mailing.]

-----------------
Associate Professorship & Tutorial Fellowship of Automated Verification
Department of Computer Science, University of Oxford

Salary from: £45,562 p.a. (plus substantial benefits)

http://www.cs.ox.ac.uk/news/1237-full.html

Applications are invited for the post of Associate Professor (or
Professor) of Automated Verification to be held in the Department of
Computer Science starting as soon as possible. The successful candidate
will also be appointed as Fellow and Tutor in Computer Science at St.
John's College.

The Department of Computer Science is a vibrant and growing academic
department, which has a research profile across the entire spectrum of
contemporary computing. The Department is seeking to recruit an
Associate Professor in Computer Science, with a research specialism in
automated verification and synthesis, ideally complementing existing
expertise. This is an area of fundamental importance in the design,
evaluation and construction of software and systems (design flaws in
applications such as autonomous vehicles can have devastating
consequences, for example). The Associate Professor's research will
focus on developing theories and techniques to ensure system correctness
and employing them in novel application domains. The appointee will also
contribute to teaching on the Department's highly successful
undergraduate and graduate programmes.

The Associate Professor will be a member of both the University and the
St John's College community. They will be part of a lively and
intellectually stimulating research community which performs to the
highest international levels in research and publications and will have
access to the excellent research facilities which Oxford offers. They
will have a role to play in the running of the College as a member of
the Governing Body and a trustee of the College as a charity.

The successful candidate will hold a doctorate in Computer Science or a
cognate discipline. They will have the ability to teach across a range
of computer science subjects, and will also have a proven research
record of high quality at international level in the area of Automated
Verification and experience of research collaborations at both national
and international level.
Closing date for applications:
*** 12.00 noon on 3 March 2017. ***
Interviews will be held on 18 April – please allow a full day for these.
Further details:

http://www.cs.ox.ac.uk/news/1237-full.html

--
Professor Marta Kwiatkowska
Fellow of Trinity College
Department of Computer Science
University of Oxford
Wolfson Building, Parks Road
Oxford, OX1 3QD

Tel: +44 (0)1865 283509
Email: Marta.Kwiatkowska@cs.ox.ac.uk
URL: http://www.cs.ox.ac.uk/people/marta.kwiatkowska/

Personal Assistant: Jordan Summers Young
Email: Jordan.Summers@cs.ox.ac.uk
Tel: +44 (0)1865 610650

Friday, January 13, 2017

Recent Advances in Algorithms School: St. Petersburg, May 22=?UTF-8?Q?=E2=80=9326=2C_?=2017

Recent Advances in Algorithms
International Computer Science Student School
May 22–26, 2017, St. Petersburg, Russia


AIM OF THE SCHOOL

The school offers the unique opportunity to learn about recent breakthroughs 
in several domains of algorithms: from classical areas like network flow algorithms 
and longest paths in graphs to recently emerged areas like streaming algorithms 
and algorithms for high dimensional data. The lectures will be taught by the leading
researchers in these areas. Each of the tutorials will provide an introduction to the 
area and gradually bring to the current research frontiers.

The primarily audience consists of PhD students interested in Algorithms. 
Bright master students, postdocs, young researchers and even faculty 
are also very welcome.


LECTURERS

Michael Kapralov (EPFL)
Streaming Algorithms

Aleksander Mądry (MIT)
Graph Algorithms and Continuous Optimization

Ilya Razenshteyn (MIT)
Algorithms for High-Dimensional Data

Saket Saurabh (IMSc)
Longest Paths in Graphs: Parameterized Algorithms


VENUE

The school is hosted by St. Petersburg Department of V.A. Steklov Institute of Mathematics 
of the Russian Academy of Sciences which is located in the very center of St. Petersburg. 
St. Petersburg is particularly beautiful in the late spring — early summer, the white nights 
season. The city is surrounded by wonderful tsar parks and palaces; an excursion to one 
of them will be a social program of the school.


STAY TUNED

More details will be available soon. Please subscribe to the mailing list to receive the updates:

[DMANET] Recent Advances in Algorithms School: St. Petersburg, May 22–26, 2017

Recent Advances in Algorithms
International Computer Science Student School
May 22–26, 2017, St. Petersburg, Russia
http://raa-school.org


AIM OF THE SCHOOL

The school offers the unique opportunity to learn about recent
breakthroughs
in several domains of algorithms: from classical areas like network flow
algorithms
and longest paths in graphs to recently emerged areas like streaming
algorithms
and algorithms for high dimensional data. The lectures will be taught by
the leading
researchers in these areas. Each of the tutorials will provide an
introduction to the
area and gradually bring to the current research frontiers.

The primarily audience consists of PhD students interested in Algorithms.
Bright master students, postdocs, young researchers and even faculty
are also very welcome.


LECTURERS

Michael Kapralov (EPFL)
Streaming Algorithms

Aleksander Mądry (MIT)
Graph Algorithms and Continuous Optimization

Ilya Razenshteyn (MIT)
Algorithms for High-Dimensional Data

Saket Saurabh (IMSc)
Longest Paths in Graphs: Parameterized Algorithms


VENUE

The school is hosted by St. Petersburg Department of V.A. Steklov Institute
of Mathematics
of the Russian Academy of Sciences which is located in the very center of
St. Petersburg.
St. Petersburg is particularly beautiful in the late spring — early summer,
the white nights
season. The city is surrounded by wonderful tsar parks and palaces; an
excursion to one
of them will be a social program of the school.


STAY TUNED

More details will be available soon. Please subscribe to the mailing list
to receive the updates:
http://raa-school.org

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

[DMANET] HotSpot 2017 - Deadline Extension

HotSpot 2017 - Deadline Extension
---------------------------------

*Submission Deadline Extended to January 31st, 2017*


HotSpot 2017
5th Workshop on Hot Issues in Security Principles and Trust
===========================================================

Affiliated with ETAPS 2017 ( http://www.etaps.org/2017/ )
Uppsala, Sweden
April 23rd, 2017

https://infsec.uni-trier.de/events/hotspot2017

Important Dates
===============
NEW Deadline for submissions: *January 31st, 2017*
Notification: February 13th, 2017
Final version for informal proceedings (optional): February 20th, 2017
Workshop: April 23rd, 2017

Invited Speaker
===============
Andrei Sabelfeld, Chalmers University of Technology, Sweden

Taint Tracking without Tracking Taints

Scope
=====
This workshop is intended to be a less formal counterpart to the
Principles of Security and Trust (POST) conference at ETAPS with an
emphasis on "hot topics", both of security and of its theoretical
foundations and analysis.

Submissions about new and emerging topics (for example, those that have
not appeared prominently in conferences and workshops until now) are
particularly encouraged. Submissions of preliminary, tentative work are
also encouraged.

This workshop is organized by the IFIP WG 1.7: Theoretical Foundations
of Security Analysis and Design (http://www.dsi.unive.it./IFIPWG1_7/)


Program Committee Chair
=======================

Ralf Küsters, University of Trier, Germany


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

Aslan Askarov, Aarhus University, Denmark
David Basin, ETH Zurich, Switzerland
Véronique Cortier, CNRS, Loria, France
Cas Cremers, University of Oxford, UK
Riccardo Focardi, Ca' Foscari University, Italy
Joshua Guttman, Worcester Polytechnic Institute, USA
Boris Köpf, IMDEA Software Institute, Spain
Ninghui Li, Purdue University, USA
Frank Piessens, Katholieke Universiteit Leuven, Belgium
Tamara Rezk, INRIA, France
Peter Ryan, University of Luxembourg, Luxembourg
Mark Ryan, University of Birmingham, UK
Geoffrey Smith, Florida International University, USA
Nikhil Swamy, MSR Redmond, USA


Submissions
===========
Submissions are via
EasyChair: https://easychair.org/conferences/?conf=hotspot2017

There is no page limit. Given the informal setting of the workshop,
one page abstracts may already suffice.

There will be no formal proceedings. Inclusion in informal proceedings
is optional.

Contact
=======
Ralf Küsters (PC chair): kuesters@uni-trier.de


Registration, accommodation, and travel
=======================================
See ETAPS web site http://www.etaps.org/2017/
**********************************************************
*
* 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] Computational Methods for Business Analytics (CMBA 2017)

Call for Papers

*Computational Methods for Business Analytics
<http://cmba2017.dps.uminho.pt/> (CMBA 2017
<http://cmba2017.dps.uminho.pt/>)* http://cmba2017.dps.uminho.pt

CMBA 2017 International Workshop will be held in the 17th International
Conference on Computational Science and its Applications (ICCSA 2017)
http://www.iccsa.org/

Trieste, Italy, July 3 - 6, 2017


*TOPICS*

A non-exhaustive list of topics for the CMBA 2017 is as follows:

· Integer linear programming and combinatorial optimization
approaches

· Exact optimization algorithms: branch-and-bound, polyhedral
approaches, decomposition-based methods, reformulations

· Heuristics, meta-heuristics, matheuristics and model based
metaheuristics for integer linear programming and combinatorial optimization

· Real-world applications in industry and services: operations
management, supply chain management, logistics and transportation,
scheduling, production management and distribution, warehousing, location,
energy, telecommunications, project management, healthcare

· Optimization software and decision support systems

*IMPORTANT DATES*

- March 15, 2017: Full paper submission
- April 15, 2017: Acceptance notification
- May 15, 2017: Early-bird Registration ends
- May 15, 2017: Submission for the final version of the papers
- July 3-6, 2017: CMBA 2017 International Workshop (will be held in the
ICCSA 2017)


*SUBMISSION DETAILS*


Accepted papers will appear in the Conference proceedings to be published
by Springer-Verlag in Lecture Notes for Computer Science.
To submit a paper, please connect to the *Submission site
<http://ess.iccsa.org/>*. The submitted paper must be between 10 to 16
pages long for LNCS
<http://www.springer.com/computer/lncs?SGWID=0-164-0-0-0> publication, and
should be formatted according to the LNCS
<http://www.springer.com/computer/lncs?SGWID=0-164-0-0-0> rules.

​Please see the *Instructions for Authors page
<http://www.iccsa.org/instructions-for-authors>* for formatting information
and templates. Each paper must deal with original and unpublished work, not
submitted for publication elsewhere.


*CONTACTS*

- TELMO PINTO (co-chair), University of Minho, Portugal (
telmo@dps.uminho.pt)
- CLÁUDIO ALVES (co-chair), University of Minho, Portugal (
claudio@dps.uminho.pt)


**********************************************************
*
* 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] CPM 2017, July 4-6, 2017, Warsaw, Poland - Second Call for Papers

This is a second call for papers for:

*** CPM 2017, the 28th Annual Symposium on Combinatorial Pattern Matching
***

The deadline for submissions is:

*** Tuesday February 7, 2017, anywhere on Earth ***

Submissions should be sent in the LIPIcs format (10 pages excluding
references) via EasyChair:

https://easychair.org/conferences/?conf=cpm2017

Below is the first call for papers. We are looking forward to your
submissions.

Best regards,
Juha Kärkkäinen, Jakub Radoszewski, and Wojciech Rytter

---

28th Annual Symposium on Combinatorial Pattern Matching
July 4-6, 2017, Warsaw, Poland

http://cpm2017.mimuw.edu.pl/

SCOPE: Papers on original research unpublished elsewhere in all areas
related to combinatorial pattern matching and its applications are welcome,
including, but not limited to: Bioinformatics and computational biology,
Coding and data compression, Combinatorics on words, Data mining,
Information retrieval, Natural language processing, Pattern discovery,
String algorithms, String processing in databases, Symbolic computing, and
Text searching and indexing.

The authors should submit an extended abstract not exceeding 10 pages in
LIPIcs (Dagstuhl series) format, including figures, title, authors,
affiliations, e-mail addresses, and a short abstract. References will not
be counted in the page limit. At least 10-point font should be used.
Additional material intended for the referee but not for publication in the
final version—for example details of proofs—may be placed in a clearly
marked appendix that is not included in the page limit.

An Alberto Apostolico best paper award will be presented during the
conference.

IMPORTANT DATES:

Deadline: Tuesday February 7, 2017, anywhere on Earth
Notification: March 23, 2017
Camera-Ready: April 13, 2017
Symposium: July 4-6, 2017

INVITED SPEAKERS:

Artur Jeż (University of Wrocław, Poland)
Giovanni Manzini (University of Piemonte Orientale, Italy)
Marcin Mucha (University of Warsaw, Poland)

PROGRAMME COMMITTEE:

Hideo Bannai (Kyushu University, Japan)
Philip Bille (Technical University of Denmark, Denmark)
Maxime Crochemore (King's College London, UK, and Université Paris-Est,
France)
Gabriele Fici (University of Palermo, Italy)
Johannes Fischer (TU Dortmund, Germany)
Jan Holub (Czech Technical University in Prague, Czech Republic)
Stepan Holub (Charles University in Prague, Czech Republic)
Juha Kärkkäinen (University of Helsinki, Finland), Co-Chair
Moshe Lewenstein (Bar Ilan University, Israel)
Gonzalo Navarro (University of Chile, Chile)
Kunsoo Park (Seoul National University, South Korea)
Marcin Piątkowski (Nicolaus Copernicus University in Toruń, Poland)
Nadia Pisanti (University of Pisa, Italy, and Erable Team INRIA, France)
Simon Puglisi (University of Helsinki, Finland)
Jakub Radoszewski (King's College London, UK, and University of Warsaw,
Poland), Co-Chair
Eric Rivals (CNRS and Université de Montpellier, France)
Wojciech Rytter (University of Warsaw, Poland), Co-Chair
Cenk Sahinalp (Indiana University, Bloomington, USA)
Rahul Shah (Louisiana State University, USA)
Ayumi Shinohara (Tohoku University, Japan)
Arseny Shur (Ural Federal University, Russia)
Tatiana Starikovskaya (Paris Diderot University, France)
Gabriel Valiente (Technical University of Catalonia, Spain)

ORGANIZING COMMITTEE:

Tomasz Kociumaka
Jakub Radoszewski
Wojciech Rytter
Tomasz Waleń

STEERING COMMITTEE:

Amihood Amir (Bar-Ilan University, Israel)
Maxime Crochemore (King's College London, UK, and Université Paris-Est,
France)
Zvi Galil (Georgia Institute of Technology, USA)
Roberto Grossi (University of Pisa, Italy)
Gad M. Landau (University of Haifa, Israel)
Esko Ukkonen (University of Helsinki, Finland)

Further details are available at the symposium website:
http://cpm2017.mimuw.edu.pl
Contact: cpm2017@mimuw.edu.pl

**********************************************************
*
* 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] Research school on "Aperiodicity and Hierarchical Structures in Tilings" in Lyon, Sept 18-22 2017

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

Dear Colleagues,

This is the first announcement for the research school on "Aperiodicity
and Hierarchical Structures in Tilings", to be held in ENS de Lyon, on
September 18-22, 2017.

This school is part of the thematic semester "Graphs, Groups and
Dynamics" (September, 2017 to February, 2018).

This one-week research school will be composed of four mini-courses,
given by internationally reputed lecturers:

- Laurent Bartholdi (ENS, Paris and University of Göttingen)
- Edmund Harris (University of Arkansas)
- Jarkko Kari (University of Turku)
- Lorenzo Sadun (University of Texas at Austin).

Registration is free of charge but compulsory.

For further information regarding this school, please visit
https://tilingslyon2017.sciencesconf.org/

Looking forward to seeing you in there,
Nathalie Aubrun, on behalf of the organizing committee


--
===============================
Nathalie Aubrun

CNRS, LIP, Équipe MC2
École Normale Supérieure de Lyon
Tél : +33(0)4.26.23.39.32
nathalie.aubrun@ens-lyon.fr

http://perso.ens-lyon.fr/nathalie.aubrun/


**********************************************************
*
* 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] Call For Papers: ParLearning 2017

**************************************************************************
The 6th International Workshop on Parallel and Distributed Computing
for Large Scale Machine Learning and Big Data Analytics
http://parlearning.ecs.fullerton.edu/
May 29, 2017

In Conjunction with
31st IEEE International Parallel & Distributed Processing Symposium
May 29 - June 2, 2017
Buena Vista Palace Hotel
Orlando, Florida USA
**************************************************************************

Call for Papers

Scaling up machine-learning (ML), data mining (DM) and reasoning algorithms
from Artificial Intelligence (AI) for massive datasets is a major technical
challenge in the times of "Big Data". The past ten years has seen the rise
of multi-core and GPU based computing. In parallel and distributed
computing, several frameworks such as OpenMP, OpenCL, and Spark continue to
appear to facilitate scaling up ML/DM/AI algorithms using higher levels of
abstraction. We invite novel works that advance the trio-fields of ML/DM/AI
through development of scalable algorithms or computing frameworks. Ideal
submissions would be characterized as scaling up X on Y, where potential
choices for X and Y are provided below.

Scaling up

recommender systems
gradient descent algorithms
deep learning
sampling/sketching techniques
clustering (agglomerative techniques, graph clustering, clustering
heterogeneous data)
classification (SVM and other classifiers)
SVD
probabilistic inference (bayesian networks)
logical reasoning
graph algorithms and graph mining

On

Multi-core architectures/frameworks (OpenMP)
Many-core (GPU) architectures/frameworks (OpenCL, OpenACC, CUDA, Intel TBB)
Distributed systems/frameworks (GraphLab, MPI, Hadoop, Spark, Storm, Mahout
etc.)

Proceedings of the ParLearning workshop will be distributed at the
conference and will be submitted for inclusion in the IEEE Xplore Digital
Library after the conference.

Journal publication

Selected papers from the workshop will be published in a Special Issue of
Future Generation Computer Systems, Elsevier's International Journal of
eScience. Special Issue papers will undergo additional review.

Awards
Best Paper Award: The program committee will nominate a paper for the Best
Paper award. In past years, the Best Paper award included a cash prize.
Stay tuned for this year!

Travel awards:Students with accepted papers have a chance to apply for a
travel award. Please find details on the IEEE IPDPS web page.

Organization

General chair: Anand Panangadan (California State University,
Fullerton, USA)
Technical Program co-chairs: Henri Bal (Vrije Universiteit, The
Netherlands) and Arindam Pal (TCS Research, India)
Publicity chair: Charalampos Chelmis (University at Albany, State
University of New York, USA)
Steering Committee chair: Yinglong Xia (Huawei Research, USA)

Technical Program Committee

Brojeshwar Bhowmick, TCS Research, India
Danny Bickson, GraphLab Inc., USA
Vito Giovanni Castellana, Pacific Northwest National Laboratory, USA
Tanushyam Chattopadhyay, TCS Research, India
Daniel Gerardo Chavarria, Pacific Northwest National Laboratory, USA
Sutanay Choudhury, Pacific Northwest National Laboratory, USA
Valeriu Codreanu, SURFsara, The Netherlands
Lipika Dey, TCS Research, India
Zhihui Du, Tsinghua University, China
Anand Eldawy, University of Minnesota, USA
Dinesh Garg, IBM Research, India
Saptarshi Ghosh, IIEST Shibpur, India
Dianwei Han, Northwestern University, USA
Renato Porfirio Ishii, Federal University of Mato Grosso do Sul (UFMS),
Brazil
Ananth Kalyanaraman, Washington State University, USA
Gwo Giun (Chris) Lee, National Cheng Kung University, Taiwan
Carson Leung, University of Manitoba, Canada
Animesh Mukherjee, IIT Kharagpur, India
Debnath Mukherjee, TCS Research, India
Francesco Parisi, University of Calabria, Italy
Himadri Sekhar Paul, TCS Research, India
Aske Plaat, Leiden University, The Netherlands
Chandan Reddy, Wayne State University, USA
Rekha Singhal, TCS Research, India
Weiqin Tong, Shanghai University, China
Cedric van Nugteren, TomTom International BV
Zhuang Wang, Facebook, USA
Qingsong Wen, Georgia Institute of Technology, USA
Bo Zhang, IBM, USA
Jianting Zhang, City College of New York, USA

Important Dates

Paper submission: January 20, 2017 AoE
Notification: February 10, 2017
Camera Ready: March 10, 2017

Paper Guidelines

Submitted manuscripts should be upto 10 single-spaced double-column pages
using 10-point size font on 8.5x11 inch pages (IEEE conference style),
including figures, tables, and references. Format requirements are posted
on the IEEE IPDPS web page.

All submissions must be uploaded electronically at
https://www.easychair.org/conferences/?conf=parlearning2017

Regards,
Arindam Pal, Ph.D.
Research Scientist
TCS Research
http://www.cse.iitd.ac.in/~arindamp/

**********************************************************
*
* 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/
*
**********************************************************

Thursday, January 12, 2017

[DMANET] CFP: DCOSS 2017 *EXTENDED DEALINE* - January 20th, 2017

===================================================
Call-For-Papers:
13th DCOSS 2017
Ottawa, Canada, June 5 - 7, 2017
http://www.dcoss.org/
====================================================
IMPORTANT:
Paper Submission (Extended): January 20th, 2017
===================================================

------

DCOSS 2017 is the 13th International Conference on Distributed Computing in
Sensor Systems to be hosted in Ottawa, Canada in June 5-7, 2017. Due to
their potential of impacting an entire host of application areas,
distributed sensor systems have become a highly visible research area. The
focus of DCOSS series of conferences is on distributed computing issues in
large scale networked sensor systems, including, but not limited to,
algorithms and applications, systems design techniques and tools, and
in-network signal and information processing. DCOSS puts together a highly
selective program where it primes for quality and innovation on works.

Potential authors are invited to submit original unpublished manuscripts
that demonstrate current research on computational aspects of distributed
sensor systems. Topics of interest include but are not limited to:

Social networks and applications
Sensors for smart grid systems, green networks and sustainability
Computation and programming models
Energy models, minimization, awareness
Distributed collaborative information processing
Detection and tracking
Theoretical performance analysis: complexity, correctness, scalability
Abstractions for modular design
Fault tolerance and security
Task allocation, reprogramming and reconfiguration
Dynamic resource management
Scalable, heterogeneous architectures (node and system-level)
Middleware interfaces, communication and processing primitives
Design, simulation and optimization tools for deployment and operation
Design automation and application synthesis techniques
Closed-loop control for sensing and actuation
Case studies: lessons from real world deployments
Network coding and compression


Paper Submission and Publication:

High-quality original papers are solicited. Papers must be unpublished and
must not be submitted for publication elsewhere. All papers will be
reviewed by Technical Program Committee members and other experts active in
the field to ensure high quality and relevance to the conference.

Please submit your paper through EDAS link (https://edas.info/N23046). More
detailed instructions about paper submissions can be fount at the link
below.
- http://www.dcoss.org/


Important Dates:

Paper Submission Deadline (Extended): January 20th, 2017


Organizing Committee:

GENERAL CHAIR
Azzedine Boukerche, University of Ottawa, Canada

PROGRAM CO-CHAIRS
Salil Kanhere, University of New South Wales, Australia
Soumaya Charkaoui, University of Sherbrooke, Canada

**********************************************************
*
* 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] CanaDAM -- 2017 Call for submissions

CanaDAM -- 2017 Call for submissions

The sixth Canadian Discrete and Algorithmic Mathematics conference (CanaDAM) https://canadam.math.ca/2017/ <https://canadam.math.ca/2017/> will be held June 12-15, 2017 at Ryerson University in Toronto, Ontario, Canada.

The general topic of the conference is the theory and applications of discrete structures. Its goal is to highlight the most salient trends in the field. The conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact. The CanaDAM conference is held in odd numbered years using a format similar to the SIAM conference on Discrete Mathematics. Particular areas of interest include graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity, and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, communication networks and information processing.

Invited Speakers:
Tanya Berger-Wolf (U. Illinois at Chicago)
Peter Keevash (Oxford)
Robert Kleinberg (Cornell)
Bojan Mohar (Simon Fraser)
Shubhangi Saraf (Rutgers)
Andrew Suk (U Illinois at Chicago)
Lauren Williams (Berkeley)
Julia Wolf (Bristol)

Public Interest Lecture:
Jordan Ellenberg (Wisconsin)
CanaDAM 2017 is now open to contributed minisymposia and contributed talks.

Submission instructions and deadlines

• Contributed minisymposia proposals, including titles and abstracts for all speakers: March 1, 2017 (acceptance notification by March 8, 2017).

A minisymposium consists of four or five 25-minute presentations. Prospective minisymposium organizers are asked to submit a proposal consisting of a title, a description (not to exceed 150 words), and a list of speakers and titles of their presentations. Please visit: https://canadam.math.ca/2017/ms/Create/ <https://canadam.math.ca/2017/ms/Create/> to submit a contributed minisymposium.

• Titles and abstracts of contributed talks: March 1, 2017 (acceptance notification by March 8, 2017).

Contributed presentations in lecture format are invited in all areas consistent with the conference themes. Talks are normally 25 minutes, including discussion. Each contributor must submit a title and a brief abstract not to exceed 150 words as well as the names of the authors and that of the speaker. Please visit: https://canadam.math.ca/2017/abs/Create/ <https://canadam.math.ca/2017/abs/Create/> to submit a contributed talk.

CanaDAM 2017 – Appel de soumissions

Le sixième Congrès canadien de mathématiques discrètes et algorithmiques (CanaDAM) se tiendra du 12 au 15 juin 2017 à l'Université Ryerson à Toronto, Ontario, Canada.

Le sujet général du congrès est la théorie et les applications de structures discrètes. Son but est de souligner les tendances les plus saillantes du domaine. Le congrès réunira les chercheurs des diverses disciplines avec lesquelles les mathématiques discrètes et algorithmiques interagissent. Le congrès CanaDAM a lieu les années impaires dans un format semblable à celui de la SIAM conference on Discrete Mathematics. Les sujets d'intérêt particuliers comprennent : graphes et hypergraphes, matroïdes, ensembles ordonnés, designs, théorie des codes, énumération, combinatoire des mots, optimisation discrète, géométrie discrète et algorithmique, énumération des points de treillis, algorithmes combinatoires, complexité algorithmique, ainsi que les applications de mathématiques discrètes et algorithmiques comprenant (sans exclusivité) graphes de la toile, biologie algorithmique, réseaux de communication et traitement d'information.

Conférenciers invités:

Tanya Berger-Wolf (U. Illinois at Chicago)
Peter Keevash (Oxford)
Robert Kleinberg (Cornell)
Bojan Mohar (Simon Fraser)
Shubhangi Saraf (Rutgers)
Andrew Suk (U Illinois at Chicago)
Lauren Williams (Berkeley)
Julia Wolf (Bristol)

Conférence grand public :
Jordan Ellenberg (Wisconsin)
Dates limites et instructions pour les soumissions

• Propositions de minisymposia libres, comprenant les titres et les résumés de leurs présentations : 1er mars 2017 (réponse le 8 mars 2017 au plus tard)

Un minisymposium libre consiste en quatre ou cinq présentations de 25 minutes. Les organisateurs potentiels d'un minisymposium devraient soummetre une proposition contenant le titre, une description d'au plus 150 mots et la liste de conférenciers avec le titre de leur présentation. Voir https://canadam.math.ca/2017/ms/Create/ <https://canadam.math.ca/2017/ms/Create/> afin de soummetre une proposition (site en anglais).

• Titres et résumés de présentations libres: 1er mars 2017 (réponse le 8 mars 2017 au plus tard))

Des conférences libres sont sollicitées dans les domaines du congrès. Les présentation sont de 25 minutes y compris la discussion. Chaque proposition doit contenir le titre et un bref résumé (150 mots maximum) ainsi que le(s) nom(s) de(s) auteur(s) et celui de la personne qui présente. Voir https://canadam.math.ca/2017/abs/Create/ <https://canadam.math.ca/2017/abs/Create/> afin de soumettre une proposition (site en anglais).
**********************************************************
*
* 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] CALL FOR PARTICIPATION: 4th Day on Computational Game Theory, ETH Zurich, Feb 17, 2017

==============================================
CALL FOR PARTICIPATION
4th Day on Computational Game Theory
February 17, 2017
ETH Zurich, Switzerland
URL: http://paulduetting.com/agtday/
==============================================

The 4th Day on Computational Game Theory will take place on
Friday, February 17, 2017 at ETH Zurich.
The event will be preceded by a reception and an open problem
session in the afternoon of Thursday, February 16.

The goal of the workshop is to provide an opportunity to
present research, exchange ideas and foster collaboration
among researchers interested in computational aspects of
game theory, social choice, and related areas, at an informal
level.

The scientific program will consist of two invited lectures
plus 6-7 contributed 20-minutes presentations. To submit a talk,
please send an email including title and short abstract to
Paul Duetting (p.d.duetting@lse.ac.uk).

There is no registration fee. But for organizational purposes,
please register on the workshop webpage.

The organizers,

Paul Duetting (London School of Economics)
Peter Widmayer (ETH Zurich)
Sven Sueken (University of Zurich)
Paolo Penna (ETH Zurich)


**********************************************************
*
* 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/
*
**********************************************************

CfP: MARS 2017 - Models for Formal Analysis of Real Systems [deadline extended]

Final Call for Papers - DEADLINE EXTENDED:

Workshop on
Models for Formal Analysis of Real Systems
(MARS 2017)

Affiliated With ETAPS 2017

April 29, 2017 Uppsala, Sweden

http://mars-workshop.org/mars2017/

AIM:
Logics and techniques for automated reasoning have often been
developed with formal analysis and formal verification in mind.
To show applicability, toy examples or tiny case studies are
typically presented in research papers. Since the theory needs
to be developed first, this approach is reasonable.
However, to show that a developed approach actually scales to
real systems, large case studies are essential. The development
of formal models of real systems usually requires a perfect
understanding of informal descriptions of the system - sometimes
found in RFCs or other standard documents - which are usually just
written in English. Based on the type of system, an adequate
specification formalism needs to be chosen, and the informal
specification translated into it. Examples for such formalisms
include process and program algebra, Petri nets, variations of
automata, as well as timed, stochastic and probabilistic
extensions of these formalisms. Abstraction from unimportant
details then yields an accurate, formal model of the real system.
The process of developing a detailed and accurate model usually
takes a large amount of time, often months or years; without even
starting a formal analysis. When publishing the results on a formal
analysis in a scientific paper, details of the model have to be skipped
due to lack of space, and often the lessons learnt from modelling are
not discussed since they are not the main focus of the paper.
The workshop aims at discussing exactly these unmentioned lessons.
Examples are:
* Which formalism is chosen, and why?
* Which abstractions have to be made and why?
* How are important characteristics of the system modelled?
* Were there any complications while modelling the system?
* Which measures were taken to guarantee the accuracy of the model?

The workshop emphasises modelling over verification. In particular,
we invite papers that present full Models of Real Systems, which may
lay the basis for future formal analysis. The workshop will bring
together researchers from different communities that all aim at verifying
real systems and are developing formal models for such systems. Areas where
large models often occur are within networks, (trustworthy) systems and
software verification (from byte code up to programming- and specification
languages). An aim of the workshop is to present different modelling
approaches and discuss pros and cons for each of them.


SUBMISSION:

Submissions must be unpublished and not be submitted for publication elsewhere.
Contributions are limited to 12 pages EPTCS style (not counting the appendices),
but shorter extended abstracts are welcome. Appendices (of arbitrary length) can
be used to present all details of a formalised model; the appendices will be part
of the proceedings. In case a formal model is presented that is modelled in some
formalism or tool, such as timed automata for Uppaal or formal proofs for Isabelle/HOL,
these models have to be submitted as well. They will be published as part of the
proceedings, and will be made available in our Repository of Models for Formal
Analysis of Real Systems (http://mars-workshop.org/repository.html).
Submissions must be in English and submitted in PDF format via EasyChair
(https://easychair.org/conferences/?conf=mars2017).
All submissions will be peer reviewed by at least three referees based on their
novelty, relevance and technical merit. The proceedings (including the electronic
models) will be published as part of the open access series Electronic Proceedings
in Theoretical Computer Science (EPTCS).


IMPORTANT DATES (AoE):

* Submission: Friday 20 January 2017 (extended deadline)
* Notification: Monday 13 February 2017
* Final version: Monday 27 February 2017
* Workshop: Saturday 29 April 2017


PROGRAMME COMMITTEE:

Hubert Garavel (INRIA, France)
Jan Friso Groote (Eindhoven University of Technology, The Netherlands)
Holger Hermanns (co-chair) (Saarland University, Germany)
Peter Hoefner (co-chair) (Data61, CSIRO, Australia)
Gerard Holzmann (NASA/JPL, USA)
Pavel Krcal (Lloyd's Register, Sweden)
Kim G. Larsen (Aalborg University, Denmark)
David Parker (University of Birmingham, United Kingdom)
Frits Vaandrager (Radboud University, The Netherlands)
Marcel Verhoef (European Space Agency, ESTEC, The Netherlands)
Josef Widder (TU Wien, Austria)


CONTACT:

mars2017@mars-workshop.org

[DMANET] Matheuristics@MIC - call for abstracts

***********************************************************
CALL FOR ABSTRACTS
***********************************************************

Metaheuristic International Conference (MIC 2017)
Barcelona, Spain, July 4th-7th 2015

Abstract submission deadline: 23 January 2017 (tell me if you need
reasonable extensions)
Special Session webpage: http://mic2017.upf.edu/special-sessions/

Scope of the session
Matheuristics are a means to get model grounded good quality feasible
solutions for complex optimization problems. The range of problems for
which matheuristic techniques have proved effective has widened, going
from the most theoretic ones to actual real-world case studies. This has
been possible because the range of matheuristic techniques has similarly
widened, showing the high research potential of studies aimed at the
design of generic heuristic methods based on mathematical formulations
of the problem of interest.
This session aims at bringing together the researchers exploiting
mathematical programming (MP) techniques in a metaheuristic framework or
working on granting to mathematical programming approaches the
constrained-CPU-time effectiveness which characterizes metaheuristics.

Topics of interest for the session include but are not limited to
studies on:
* Novel matheuristic frameworks;
* Dual information and decomposition in metaheuristics;
* Hybridizing metaheuristics with exact methods;
* Experimental analysis and modeling of matheuristics;
* Real world case histories of matheuristic applications.
* Metaheuristics as exact method components.


Abstract submission
Submissions to the special sessions will be through the same submission
site as for the main conference with the rules detailed below. Abstracts
can be submitted in any of these forms:
S1) Original research contributions for publication in the conference
proceedings of a maximum of 10 pages.
S2) Extended abstracts of work-in-progress of a maximum of 3 pages.
S3) High-quality manuscripts that have recently, within the last six
months, been submitted or accepted for journal publication.
All contributed paper submissions will be peer reviewed. Accepted papers
will be published in the online proceedings that will be available at
the conference. Accepted contributions of categories S1 and S2 will be
published in the MIC 2017 conference proceedings. Accepted
contributions of category S3 will be orally presented at the conference,
but not be included into the conference proceedings.

As authors of an invited session, you will submit the paper as follows.
1) Access the easychair web: https://easychair.org/conferences/?conf=mic2017
2) Choose the first option (12nd Metaheuristics International Conference):
3) fill the form and at the end choose the corresponding invited session
(Matheuristics).
Submission guidelines can also be found here:
http://mic2017.upf.edu/submission/

Important dates
**********************************************************************
* Submission deadline: January 23, 2017
* Notification of acceptance: February 27, 2017
* Camera-ready papers: March 6, 2017
* Early registration due date: March 31, 2017
* Conference: July 4-7 2017
**********************************************************************

Special session organizer
Vittorio Maniezzo (Dept. Computer Science, University of Bologna, Italy)
Vittorio.maniezzo@unibo.it


--
________________________________________________________________
Vittorio Maniezzo, prof. || vittorio.maniezzo@unibo.it
Department of Computer Science || tel. +39 331 6382417
University of Bologna || skype: vittorio.maniezzo
via Sacchi, 3, 47521 Cesena, Italy || www.csr.unibo.it/~maniezzo

**********************************************************
*
* 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/
*
**********************************************************

Wednesday, January 11, 2017

SPAA 2017 2nd Call for Papers

==================================================================
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
Richard Peng Georgia Institute of Technology
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

[DMANET] SPAA 2017 2nd Call for Papers

==================================================================
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
Richard Peng Georgia Institute of Technology
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

**********************************************************
*
* 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/
*
**********************************************************