The 25th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2020)
The University Club of Western Australia, Perth, Australia
December 1-4, 2020
http://prdc.dependability.org/PRDC2020/
Call for papers
PRDC 2020 is the twenty-fifth event in the series of symposia started in 1989 that are
devoted to dependable and fault-tolerant computing. PRDC is recognized as the main event
in the Pacific area that covers many dimensions of dependability and fault tolerance,
encompassing fundamental theoretical approaches, practical experimental projects, and
commercial components and systems. As applications of computing systems have permeated
into all aspects of daily life, the dependability of computing systems has become increasingly
critical. This symposium provides a forum for countries around the Pacific Rim and other areas
of the world to exchange ideas for improving the dependability of computing systems.
Topics of interest include (but are not limited to):
• Software and hardware reliability, testing, verification, and validation
• Dependability measurement, modeling, evaluation, and tools
• Self-healing, self-protecting, and fault-tolerant systems
• Software aging and rejuvenation
• Safety-critical systems and software
• Architecture and system design for dependability
• Fault-tolerant algorithms and protocols
• Reliability in cloud computing, Internet, and web systems and applications
• Cloud computing security and privacy
• Software defined networks architectures and protocols
• Internet of things architectures, protocols, security and privacy
• Dependability issues in artificial intelligence and its applications
• Dependability issues in computer networks and communications
• Dependability issues in high performance computing
• Dependability issues in real-time systems
• Dependability issues in storage and databases systems
• Dependability issues in cyber-physical systems
• Dependability issues in socio-technical systems
• Dependability and security in machine learning systems
• Blockchain and smart contracts
Submission and Publication Information
Manuscripts should be submitted in the following two categories: Regular Papers and
Practical Experience Reports. Regular Papers should describe original research (not submitted
or published elsewhere) and be not more than 10 pages using IEEE Computer Society camera-ready
8.5"x11" two-column format. Practical Experience Reports (max 6 pages using IEEE format
guidelines) should describe an experience or a case study, such as the design and deployment
of a system or actual failure and recovery field data.
All submissions must be made electronically (in PDF format) on the submission website
(https://www.easychair.org/conferences/?conf=prdc2020). Please note that all submissions will
undergo a double-blind review. Please ensure that you have removed any references that could
lead to identifying the authors of the paper. Failure to do so may result in rejection of the
paper regardless of the paper contributions. Papers will be reviewed internationally and selected
based on their originality, significance, relevance, and clarity of presentation. All accepted
papers will be published by IEEE Computer Society Press (EI Indexed). One outstanding paper will
be selected to receive the Best Paper Award, and one outstanding paper first authored by a
student will receive the Best Student Paper Award.
Important Dates
Submission: 18 July 2020
Notification of Acceptance: 22 August 2020
General Chair
Jin B. Hong U. of Western Australia, Australia
Program Co-Chairs
Fumio Machida U. of Tsukuba, Japan
Mengmeng Ge Deakin University, Australia
Local Arrangement Chair
Naveed Akhtar U. of Western Australia, Australia
Publicity Co-Chairs
Simon Yusuf-Enoch U. of Queensland, Australia
Zeyi Wen U. of Western Australia, Australia
Finance Chair
Susan Marie U. of Western Australia, Australia
Steering Committee
Yennun Huang Academia Sinica (Chair)
Leon Alkalai California Institute of Technology
Takashi Nanya University of Tokyo
Nobuyasu Kanekawa Hitachi Research Lab
Jin Song Dong National University of Singapore
Karthik Pattabiraman University of British Columbia
Gernot Heiser University of New South Wales
Sy-Yen Kuo National Taiwan University
Michael Lyu Chinese University of Hong Kong
Zhi Jin Peking University
DongSeong Kim University of Queensland
Sponsors
IEEE Computer Society
University of Western Australia
Business Events Perth
Tourism Western Australia
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, April 27, 2020
[DMANET] Call for Papers (DEADLINE EXTENDED): First IJCAI-PRICAI Workshop on AI for Connected Mobility (AICoMo 2020)
First IJCAI-PRICAI Workshop on AI for Connected Mobility (AICoMo 2020)
Date: 11-13 July 2020 (exact date to be announced)
Location: Yokohama, Japan (co-located with IJCAI-PRICAI 2020)
Extended Deadline:
Submission Date: 25 April 2020 10 May 2020
Notification Date: 25 May 2020 11 June 2020
Workshop Website: http://autotrust.org.uk/aicomo/
Call for Papers
Artificial intelligence will play a major role in the future of transportation. Vehicles are increasingly connected through the Internet of Vehicles and becoming increasingly autonomous. From routing and intersection management to multi-modal transportation and autonomous vehicles, this will change the way we use limited resources such as roads and vehicles, as well as public transportation. At the same time, it is important that the human stays in the loop when automated decisions are made, posing additional challenges as how to best design the interaction between the human and the intelligent system and how to elicit user preferences to best make decisions on their behalf. Moreover, it will be vital that ethical aspects and incentives are considered, so that humans can trust the system, e.g., in terms of the private data being used and making micro decisions on the user's behalf such as routing decisions and platooning (in case of autonomous vehicles).
This workshop aims to bring together researchers and practitioners from a range of areas within AI around the transportation domain, including areas such as machine learning, multi-agent systems, human-agent interaction, as well as ethical aspects of AI.
We invite long and short papers. Short papers are mainly intended to be work in progress and application papers. We especially encourage industry to apply for these. Long papers are up to 14 pages in Springer lecture notes format, and will get peer-reviewed. Accepted papers will receive a long presentation slot. Short papers are up to 4 pages, and will be mainly assessed on the basis of their relevance to the workshop. They will receive a short presentation slot and the opportunity to present a poster.
Topics
Topic include but are not limited to:
* Multi-modal transportation
* Game theory and mechanism design for transportation systems
* Ethical issues in connected and autonomous vehicles
* Decentralised decision making
* Fairness and trust
* Privacy and security
* Machine learning for transportation systems
* Human-agent interaction
* Ride and car sharing
* Green transportation
* Electric vehicles
* Emerging ownership models
* User preference modelling
Submission Instructions
Submission Site: https://cmt3.research.microsoft.com/AICOMO2020
Papers should be formatted using Springer lecture notes format. For templates see:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
Long papers should be up to 14 pages. Short papers can be up to 4 pages.
Organisation Committee
Enrico Gerding, University of Southampton, UK
Sebastian Stein, University of Southampton, UK
Dengji Zhao, ShanghaiTech University, China
Tatsuya Iwase, Toyota Motor Europe NV/SA
Contact: Enrico Gerding at eg@ecs.soton.ac.uk<mailto:eg@ecs.soton.ac.uk>
Program Committee
Ana Bazzan, Universidade Federal do Rio Grande do Sul, Brazil
Anh Tuan, University of Warwick, UK
Atsushi, Kawamoto, Toyota Motor Corporation, Japan
Bo An, Nanyang Technological University, Singapore
Dan Fowler, University of Warwick, UK
Emmanouil Rigas, Aristotle University of Thessaloniki, Greece
Hu Yuan, University of Warwick, UK
Huan Vu, Universite de Lyon, France
Karthik Abinav Sankararaman, Facebook
Mathijs de Weerdt, Delft University of Technology, the Netherlands
Phuriwat (Turk) Worrawichaipat, University of Southampton, UK
Shih-Fen Cheng, Singapore Management University, Singapore
Sylwia Kaduk, University of Southampton, UK
Taiki Todo, Kyushu University, Japan
Valentin Robu, Heriot-Watt University, UK
Steering Committee
Prof m.c. schraefel, University of Southampton, UK
Prof Carsten Maple, Warwick Manufacturing Group (WMG), The University of Warwick, UK
—
Dr Sebastian Stein
Associate Professor - Artificial Intelligence / Multi-Agent Systems
University of Southampton, UK
Electronics and Computer Science
Building 32, Room 4023
Tel: +44 (0) 23 8059 7645
**********************************************************
*
* 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/
*
**********************************************************
Date: 11-13 July 2020 (exact date to be announced)
Location: Yokohama, Japan (co-located with IJCAI-PRICAI 2020)
Extended Deadline:
Submission Date: 25 April 2020 10 May 2020
Notification Date: 25 May 2020 11 June 2020
Workshop Website: http://autotrust.org.uk/aicomo/
Call for Papers
Artificial intelligence will play a major role in the future of transportation. Vehicles are increasingly connected through the Internet of Vehicles and becoming increasingly autonomous. From routing and intersection management to multi-modal transportation and autonomous vehicles, this will change the way we use limited resources such as roads and vehicles, as well as public transportation. At the same time, it is important that the human stays in the loop when automated decisions are made, posing additional challenges as how to best design the interaction between the human and the intelligent system and how to elicit user preferences to best make decisions on their behalf. Moreover, it will be vital that ethical aspects and incentives are considered, so that humans can trust the system, e.g., in terms of the private data being used and making micro decisions on the user's behalf such as routing decisions and platooning (in case of autonomous vehicles).
This workshop aims to bring together researchers and practitioners from a range of areas within AI around the transportation domain, including areas such as machine learning, multi-agent systems, human-agent interaction, as well as ethical aspects of AI.
We invite long and short papers. Short papers are mainly intended to be work in progress and application papers. We especially encourage industry to apply for these. Long papers are up to 14 pages in Springer lecture notes format, and will get peer-reviewed. Accepted papers will receive a long presentation slot. Short papers are up to 4 pages, and will be mainly assessed on the basis of their relevance to the workshop. They will receive a short presentation slot and the opportunity to present a poster.
Topics
Topic include but are not limited to:
* Multi-modal transportation
* Game theory and mechanism design for transportation systems
* Ethical issues in connected and autonomous vehicles
* Decentralised decision making
* Fairness and trust
* Privacy and security
* Machine learning for transportation systems
* Human-agent interaction
* Ride and car sharing
* Green transportation
* Electric vehicles
* Emerging ownership models
* User preference modelling
Submission Instructions
Submission Site: https://cmt3.research.microsoft.com/AICOMO2020
Papers should be formatted using Springer lecture notes format. For templates see:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
Long papers should be up to 14 pages. Short papers can be up to 4 pages.
Organisation Committee
Enrico Gerding, University of Southampton, UK
Sebastian Stein, University of Southampton, UK
Dengji Zhao, ShanghaiTech University, China
Tatsuya Iwase, Toyota Motor Europe NV/SA
Contact: Enrico Gerding at eg@ecs.soton.ac.uk<mailto:eg@ecs.soton.ac.uk>
Program Committee
Ana Bazzan, Universidade Federal do Rio Grande do Sul, Brazil
Anh Tuan, University of Warwick, UK
Atsushi, Kawamoto, Toyota Motor Corporation, Japan
Bo An, Nanyang Technological University, Singapore
Dan Fowler, University of Warwick, UK
Emmanouil Rigas, Aristotle University of Thessaloniki, Greece
Hu Yuan, University of Warwick, UK
Huan Vu, Universite de Lyon, France
Karthik Abinav Sankararaman, Facebook
Mathijs de Weerdt, Delft University of Technology, the Netherlands
Phuriwat (Turk) Worrawichaipat, University of Southampton, UK
Shih-Fen Cheng, Singapore Management University, Singapore
Sylwia Kaduk, University of Southampton, UK
Taiki Todo, Kyushu University, Japan
Valentin Robu, Heriot-Watt University, UK
Steering Committee
Prof m.c. schraefel, University of Southampton, UK
Prof Carsten Maple, Warwick Manufacturing Group (WMG), The University of Warwick, UK
—
Dr Sebastian Stein
Associate Professor - Artificial Intelligence / Multi-Agent Systems
University of Southampton, UK
Electronics and Computer Science
Building 32, Room 4023
Tel: +44 (0) 23 8059 7645
**********************************************************
*
* 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] Open PhD position in Vienna: Algorithms for Reliable Networks
Dear all,
We are looking for a motivated student interested in pursuing a PhD on
developing the foundations of a next generation of reliable networks:
networks which are highly automated, and verify and correct themselves
autonomously, relying on algorithms and formal methods. Communication
networks have become a critical infrastructure of our society and hence
come with stringent requirements on dependability. We believe that
automation can improve reliability: many network outages these days are due
to human errors.
The research position is at the Faculty of Computer Science at the
University of Vienna and is fully funded. The candidate also has the
opportunity to collaborate with Aalborg University, Denmark, and engage
into longer visits, if she/he is interested: Aalborg University is a
project partner.
The candidate should have a strong background in algorithms in particular
and theoretical computer science in general. Knowledge about. formal
methods, model checking, and communication networks is a plus.
We offer a productive research environment and excellent contacts to other
universities as well as industry interested in this application domain.
For an idea on the kind of research we are doing in this area, please see
the sample publications attached below.
To apply, please send your CV, motivation letter and reference letters to
me by email, or use the online portal at
https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibung-flow?_flowExecutionKey=_c9BBE3230-D8C0-763D-1475-5A5B068607F1_k02E5A25D-BE56-414D-61FF-F71AB6115CC3&tid=78403.28
Please do not hesitate to contact me for any further information, And
please do distribute this email to colleagues and students who may be
interested.
Thank you,
Stefan Schmid (in collaboration with Kim G. Larsen and Jiri Srba at Aalborg
University)
PS: More information about our research group at:
https://ct.cs.univie.ac.at/
Some related papers:
P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures
Jesper Stenbjerg Jensen, Troels Beck Krogh, Jonas Sand Madsen, Stefan Schmid,
Jiri Srba, and Marc Tom Thorgersen.
14th ACM International Conference on emerging Networking EXperiments and
Technologies (CoNEXT), Heraklion/Crete, Greece, December 2018.
https://www.univie.ac.at/ct/stefan/conext18.pdf
Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks
Stefan Schmid and Jiri Srba.
37th IEEE Conference on Computer Communications (INFOCOM), Honolulu,
Hawaii, USA, April 2018.
https://www.univie.ac.at/ct/stefan/infocom18prefixnet.pdf
--
Stefan Schmid
Professor, Computer Science
University of Vienna, Austria
Research Group: https://ct.cs.univie.ac.at/
Personal: https://www.univie.ac.at/ct/stefan/
**********************************************************
*
* 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/
*
**********************************************************
We are looking for a motivated student interested in pursuing a PhD on
developing the foundations of a next generation of reliable networks:
networks which are highly automated, and verify and correct themselves
autonomously, relying on algorithms and formal methods. Communication
networks have become a critical infrastructure of our society and hence
come with stringent requirements on dependability. We believe that
automation can improve reliability: many network outages these days are due
to human errors.
The research position is at the Faculty of Computer Science at the
University of Vienna and is fully funded. The candidate also has the
opportunity to collaborate with Aalborg University, Denmark, and engage
into longer visits, if she/he is interested: Aalborg University is a
project partner.
The candidate should have a strong background in algorithms in particular
and theoretical computer science in general. Knowledge about. formal
methods, model checking, and communication networks is a plus.
We offer a productive research environment and excellent contacts to other
universities as well as industry interested in this application domain.
For an idea on the kind of research we are doing in this area, please see
the sample publications attached below.
To apply, please send your CV, motivation letter and reference letters to
me by email, or use the online portal at
https://univis.univie.ac.at/ausschreibungstellensuche/flow/bew_ausschreibung-flow?_flowExecutionKey=_c9BBE3230-D8C0-763D-1475-5A5B068607F1_k02E5A25D-BE56-414D-61FF-F71AB6115CC3&tid=78403.28
Please do not hesitate to contact me for any further information, And
please do distribute this email to colleagues and students who may be
interested.
Thank you,
Stefan Schmid (in collaboration with Kim G. Larsen and Jiri Srba at Aalborg
University)
PS: More information about our research group at:
https://ct.cs.univie.ac.at/
Some related papers:
P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures
Jesper Stenbjerg Jensen, Troels Beck Krogh, Jonas Sand Madsen, Stefan Schmid,
Jiri Srba, and Marc Tom Thorgersen.
14th ACM International Conference on emerging Networking EXperiments and
Technologies (CoNEXT), Heraklion/Crete, Greece, December 2018.
https://www.univie.ac.at/ct/stefan/conext18.pdf
Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks
Stefan Schmid and Jiri Srba.
37th IEEE Conference on Computer Communications (INFOCOM), Honolulu,
Hawaii, USA, April 2018.
https://www.univie.ac.at/ct/stefan/infocom18prefixnet.pdf
--
Stefan Schmid
Professor, Computer Science
University of Vienna, Austria
Research Group: https://ct.cs.univie.ac.at/
Personal: https://www.univie.ac.at/ct/stefan/
**********************************************************
*
* 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] Computability in Europe 2020 SECOND CALL FOR INFORMAL PRESENTATIONS
COMPUTABILITY IN EUROPE 2020 SECOND CALL FOR INFORMAL PRESENTATIONS
CiE 2020:
Virtually in Salerno, Italy
Due to the Covid-19 outbreak, this edition will be an online conference.
June 29 - July 3, 2020
https://www.acie.eu/cie-conference-series/cie2020
https://www.acie.eu
IMPORTANT DATES:
Deadline for informal presentations submission: 31 May 2020
(The notifications of acceptance for informal presentations will be sent
a few days after submission.)
CiE 2020 is the 16th conference organized by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world.
Previous meetings have taken place in Amsterdam (2005), Swansea (2006),
Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010),
Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest
(2015), Paris (2016), Turku (2017), Kiel (2018), and Durham (2019).
TUTORIALS
_Fine-Grained Complexity_ - Virginia Vassilevska Williams (MIT)
_Computable Analysis_ - Martin Ziegler (Korea Advanced Institute of
Science and Technology)
INVITED TALKS:
_Centralities in Network Analysis_ -- Paolo Boldi (University of Milan)
_A game-theoretic approach for the automated synthesis of complex
systems _-- Véronique Bruyère (University of Mons)
On-the-fly classification of structures -- Ekatarina Fokina (Vienna
University of Technology)
_A Survey on Analog Models of Computation_ -- Amaury Pouly (CNRS Paris)
_On the Repetitive Structure of Words_ -- Antonio Restivo (University of
Palermo)
_Molecular algorithms using reprogrammable DNA self-assembly_ -- Damien
Woods (Maynooth University)
HOSTED BY:
Department of Computer Science, University of Salerno
Due to the Covid-19 outbreak, this edition will be an online conference.
SPECIAL SESSIONS:
Algorithmic Learning Theory
Combinatorial String Matching
Computable Topology
HAPOC session on Fairness in Algorithms
Large scale Bioinformatics and Computational Sciences
Modern aspects of Formal Languages
Contributed papers will be selected from submissions received by the
PROGRAMME COMMITTEE consisting of:
Marcella Anselmo University of Salerno (co-chair)
Veronica Becher Universidad de Buenos Aires
Paola Bonizzoni University of Milano-Bicocca
Laura Crosilla University of Oslo
Liesbeth De Mol Université de Lille 3
Gianluca Della Vedova University of Milano-Bicocca
Jérôme Durand-Lose Université d'Orléans
Pawel Gawrychowski University of Wroclaw
Mathieu Hoyrup LORIA
Juliette Kennedy University of Helsinki
Karoliina Lehtinen University of Liverpool
Benedikt Loewe Universiteit van Amsterdam
Florin Manea Universität Göttingen
Timothy McNicholl Iowa State University
Klaus Meer BTU Cottbus-Senftenberg
Turlough Neary University of Zurich
Daniel Paulusma Durham University
Arno Pauly Swansea University (co-chair)
Karin Quaas University of Leipzig
Viola Schiaffonati Politecnico di Milano
Markus L. Schmid Humboldt University Berlin
Thomas Schwentick Universität Dortmund
Marinella Sciortino University of Palermo
Victor Selivanov Institute on Informatics Systems
Mariya Soskova University of Wisconsin-Madison
Peter Van Emde Boas Universiteit van Amsterdam
Linda Brown Westrick Pennsylvania State University
The CiE conferences serve as an interdisciplinary forum for research in
all aspects of computability, foundations of computer science, logic,
and theoretical computer science, as well as the interplay of these
areas with practical issues in computer science and with other
disciplines such as biology, mathematics, philosophy, or physics.
Continuing the tradition of past CiE conferences, the Program Committee
cordially invites all researchers (European and non-European) to submit
informal presentations of their recent work. A proposal for an informal
presentation must be submitted via EasyChair
(https://easychair.org/conferences/?conf=cie2020), using the LNCS style
file (available at
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines)
and be 1 page; a brief description of the results suffices and an
abstract is not required. Informal presentations will not be published
in the LNCS conference proceedings.
Results presented as informal presentations at CiE 2020 may appear or
may have appeared in other conferences with formal proceedings and/or in
journals.
**********************************************************
*
* 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, April 26, 2020
[DMANET] RW 2020 - Call for Applications for the 16th Reasoning Web Summer School
[apologies for multiple postings]
=================================================================
******************************************************
CALL FOR APPLICATIONS
The 16th Reasoning Web Summer School (RW 2020)
24-26 June, 2020
Virtual event (free registration)
https://2020.declarativeai.net/events/rw-summer-school
Part of "Declarative AI 2020: Rules, Reasoning, Decisions and Explanations"
(DeclarativeAI 2020, https://2020.declarativeai.net)
******************************************************
The purpose of the Reasoning Web Summer School is to disseminate recent
advances on reasoning techniques and related issues that are of particular
interest to Semantic Web and Linked Data applications. It is primarily
intended
for postgraduate (PhD or MSc) students, postdocs, young researchers, and
senior
researchers wishing to deepen their knowledge. In 2020, the broad theme of
the
school is:
“Declarative Artificial Intelligenceâ€
As in the previous years, lectures in the summer school will be given by a
distinguished group of expert lecturers.
This year the school is part of Declarative AI 2020
(https://2020.declarativeai.net),
an event which is co-organised by SINTEF AS, University of Oslo, and
Norwegian University of Science and Technology, under the umbrella of the
SIRIUS Centre for Scalable Data Access. Due to the current situation
regarding the spread of the COVID-19 coronavirus, Declarative AI 2020 will
be held as an ONLINE event.
The school is co-located with:
- RuleML+RR: International Joint Conference on Rules and Reasoning, Virtual
29 June - 1 July, 2020
http://2020.ruleml-rr.org
- DecisionCAMP, Virtual
29 June - 1 July, 2020
https://decisioncamp2020.home.blog
The students attending the RW school are particularly encouraged to apply
to the Doctoral Consortium of RuleML+RR (deadline: 22 May, 2020).
== CONFIRMED LECTURES ==
- Stream Reasoning: From Theory to Practice
Emanuele Della Valle (Politecnico di Milano), Riccardo Tommasini
(University of
Tartu)
- Aggregates and Generalized Atoms in Answer Set Programming
Wolfgang Faber (University of Klagenfurt)
- Knowledge Graphs: Past, Present and Future Research Directions
Aidan Hogan (University of Chile)
- Declarative Data Analysis using Limit Datalog Programs
Egor V. Kostylev (University of Oxford)
- Reasoning with Learned Knowledge
Loizos Michael (Open University of Cyprus)
- Learning Description Logic Ontologies
Ana Ozaki (Free University of Bozen-Bolzano & University of Bergen)
- Introduction to Probabilistic Ontologies
Rafael Penaloza (University of Milano-Bicocca)
- Explanation via Machine Arguing
Francesca Toni, Oana Cocarascu, Antonio Rago (Imperial College London)
- Ontology-Mediated Query Answering over Temporal Data
Michael Zakharyaschev (Birkbeck University of London)
== APPLICATIONS ==
The number of attendees will be limited and participation will depend on
submitting an application which will undergo a reviewing process.
Applications have to be submitted by filling the following form:
https://forms.gle/bDupPJyBrse1vFgP7
== IMPORTANT DATES ==
Application deadline: 1 June, 2020
Notification: 8 June, 2020
Summer school: 24-26 June, 2020
== COMMITTEE ==
Chairs
- Marco Manna, University of Calabria, Italy
- Andreas Pieris, University of Edinburgh, UK
Scientific Advisory Board
- Leopoldo Bertossi, Universidad Adolfo Ibanez, Chile
- Thomas Eiter, TU Wien, Austria
- Birte Glimm, University of Ulm, Germany
- Markus Krotzsch, TU Dresden, Germany
- Yuliya Leierler, University of Nebraska Omaha, US
- Carsten Lutz, University of Bremen, Germany
- Emanuel Sallinger, University of Oxford, UK
== CONTACT ==
For further information please contact the chairs:
- Marco Manna: marco.manna@unical.it
- Andreas Pieris: apieris@inf.ed.ac.uk
**********************************************************
*
* 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] Postdoc position on “Machine Learning in Economics and Decision Sciences” at Copenhagen Business School
Dear colleagues,
See below a post for a 2-year postdoc position on "Machine Learning in Economics and Decision Sciences" at Copenhagen Business School, Denmark.
https://www.cbs.dk/cbs/jobs-paa-cbs/ledige-stillinger/postdoc-in-machine-learning-in-economics-and-decision-sciences. We look forward to receiving your application by May 15, 2020.
Best,
Dolores.
--
Dr Dolores Romero Morales
Professor in Operations Research
&
Editor-in-Chief of TOP, the Operations Research Journal of the Spanish Society of Statistics and Operations Research
Department of Economics
Copenhagen Business School
Denmark
E: drm.eco@cbs.dk
H: http://www.doloresromero.com
T: +45 38153823
**********************************************************
*
* 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, April 25, 2020
[DMANET] Conference on "Algorithmic and Enumerative Combinatorics"
===================================================
Conference on "Algorithmic and Enumerative Combinatorics" (AEC 2020)
TU Wien, Vienna, Austria, June 29-July 3, 2020
===================================================
Due to the corona epidemic, this conference cannot take place as planned.
Instead, it has been postponed by one year.
The new dates are June 28 - July 2, 2021, see
https://www.risc.jku.at/conferences/aec2021/
The conference will feature invited lectures by
George Andrews (Penn State University, University Park)
Alin Bostan (INRIA Saclay Ile-de-France)
Mireille Bousquet-Melou (CNRS, Universite de Bordeaux)
Sylvie Corteel (to be confirmed) (University of California at Berkeley)
Marni Mishna (Simon Fraser University)
Marc Noy (Universitat Politècnica de Catalunya, Barcelona)
Greta Panova (University of Southern California)
Kilian Raschel (Université de Tours)
Bruno Salvy (INRIA, École normale supérieure de Lyon)
Anne Schilling (University of California at Davis)
Michael Singer (North Carolina State University)
Richard Stanley (Massachusetts Institute of Technology)
N.N.
Algorithmic and Enumerative Combinatorics is the general research area
which is defined by the interplay of the fields of Enumerative
Combinatorics, Analytic Combinatorics, and Algorithmics. It is a very
active research area, which, aside from the three fields fueling each
other mutually, receives constant impetus from outside, by its
interaction with algebra, probability, statistical physics, and
computer science.
There will be time for a limited number of contributed talks by
participants (about 25 minutes each talk). If you are interested,
please submit an extended abstract to
Christian.Krattenthaler@univie.ac.at.
There are limited funds available for participant support.
Participants who require support should send an application
with CV and a letter of support to
hui-chun.julia.cheng@univie.ac.at.
Important deadlines:
Submission of contributed talks/posters: March 31, 2021
Acceptance of contributed talks/posters: April 15, 2021
Application for participant support: May 1, 2021
Registration: May 15, 2021
Organisers:
Michael Drmota (TU Vienna)
Ilse Fischer (Uni Vienna)
Bernhard Gittenberger (TU Vienna)
Manuel Kauers (Institute of Algebra, JKU Linz)
Christian Krattenthaler (Uni Vienna)
Christoph Koutschan (RICAM, ÖAW)
Peter Paule (RISC, JKU Linz)
Veronika Pillwein (RISC, JKU Linz)
Michael Schlosser (Uni Vienna)
Carsten Schneider (RISC, JKU Linz)
**********************************************************
*
* 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/
*
**********************************************************
Conference on "Algorithmic and Enumerative Combinatorics" (AEC 2020)
TU Wien, Vienna, Austria, June 29-July 3, 2020
===================================================
Due to the corona epidemic, this conference cannot take place as planned.
Instead, it has been postponed by one year.
The new dates are June 28 - July 2, 2021, see
https://www.risc.jku.at/conferences/aec2021/
The conference will feature invited lectures by
George Andrews (Penn State University, University Park)
Alin Bostan (INRIA Saclay Ile-de-France)
Mireille Bousquet-Melou (CNRS, Universite de Bordeaux)
Sylvie Corteel (to be confirmed) (University of California at Berkeley)
Marni Mishna (Simon Fraser University)
Marc Noy (Universitat Politècnica de Catalunya, Barcelona)
Greta Panova (University of Southern California)
Kilian Raschel (Université de Tours)
Bruno Salvy (INRIA, École normale supérieure de Lyon)
Anne Schilling (University of California at Davis)
Michael Singer (North Carolina State University)
Richard Stanley (Massachusetts Institute of Technology)
N.N.
Algorithmic and Enumerative Combinatorics is the general research area
which is defined by the interplay of the fields of Enumerative
Combinatorics, Analytic Combinatorics, and Algorithmics. It is a very
active research area, which, aside from the three fields fueling each
other mutually, receives constant impetus from outside, by its
interaction with algebra, probability, statistical physics, and
computer science.
There will be time for a limited number of contributed talks by
participants (about 25 minutes each talk). If you are interested,
please submit an extended abstract to
Christian.Krattenthaler@univie.ac.at.
There are limited funds available for participant support.
Participants who require support should send an application
with CV and a letter of support to
hui-chun.julia.cheng@univie.ac.at.
Important deadlines:
Submission of contributed talks/posters: March 31, 2021
Acceptance of contributed talks/posters: April 15, 2021
Application for participant support: May 1, 2021
Registration: May 15, 2021
Organisers:
Michael Drmota (TU Vienna)
Ilse Fischer (Uni Vienna)
Bernhard Gittenberger (TU Vienna)
Manuel Kauers (Institute of Algebra, JKU Linz)
Christian Krattenthaler (Uni Vienna)
Christoph Koutschan (RICAM, ÖAW)
Peter Paule (RISC, JKU Linz)
Veronika Pillwein (RISC, JKU Linz)
Michael Schlosser (Uni Vienna)
Carsten Schneider (RISC, JKU Linz)
**********************************************************
*
* 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 SOFSEM 2021
SOFSEM 2021
47th International Conference on Current Trends in Theory and Practice
of Computer Science
Bozen-Bolzano, Italy, January 25-28, 2021
http://sofsem2021.inf.unibz.it
47th International Conference on Current Trends in Theory and Practice
of Computer Science
Bozen-Bolzano, Italy, January 25-28, 2021
http://sofsem2021.inf.unibz.it
--------------------------------------------------------------------
We all hope that in January 2021 the situation is back to normal and
that SOFSEM 2021 can be hold in Bozen-Bolzano. However, the PC will
monitor the situation, and for the case that the standard organization
is impossible, the conference will be virtual (as many other
conferences in these days). Therefore, the paper selection and
reviewing process will run as usual, and the accepted papers will be
published by Springer in the ARCoSS/LNCS series, independent of the
way the conference will be hold.
--------------------------------------------------------------------
--------------------------------------------------------------------
IMPORTANT DATES:
- abstract submission: July 13, 2020
- paper submission: July 20, 2020
- notification: September 21, 2020
- camera-ready copy: October 26, 2020
- submission site: http://sofsem2021.inf.unibz.it/submission.html
--------------------------------------------------------------------
SOFSEM (SOFtware SEMinar) is an annual international winter conference
devoted to the theory and practice of computer science, where the
latest results and developments in academic and industrial research in
leading areas of computer science are presented. SOFSEM has a
long-standing tradition of facilitating discussions and collegial
interactions. It is well-known for its familiar and inspiring
atmosphere and as a meeting place for active and leading computer
scientists. The program will consist of invited talks by prominent
researchers, contributed talks selected from the submitted papers, and
the Student Research Forum.
TRACKS
SOFSEM 2021 consists of four tracks covering major sub-areas of
computer science. Each track has its own program chair and program
committee for peer review and feedback to authors. Please select the
appropriate track of SOFSEM 2021 for your contribution.
Track: Foundations of Computer Science
--------------------------------------
- Algorithms and data structures
- Automata and formal languages
- Complexity theory
- Computability theory
- Cryptography and security
- Graphs and networks
- Machine learning
- Non-classical models of computing
- Theory of databases, semi-structured data, and finite model theory
- Theory of programming languages
Track: Foundations of Software Engineering
------------------------------------------
- Methods and tools for improved software processes
- Software architecture of complex software-intensive systems
- Requirements Engineering
- Model-based software engineering methods and tools
- Data-driven improvement of methods, models, and tools
- Methods and tools for software engineering applications
- Empirical Software Engineering
- Software architectures for self-adaptive and self-optimizing systems
- Methods and models for cloud and edge-cloud systems
- AI in modern software systems
- Trustworthiness and qualities of modern software systems
Track: Foundations of Data Science and Engineering
--------------------------------------------------
- Data Models and Query Languages
- Data Integration and Interoperability
- Query Processing and Optimization
- Spatial, Temporal, Multimedia Data
- Web- and Graph-based Data
- Probabilistic and Uncertain Data
- Information Extraction and Retrieval
- Data Privacy, Security, and Trust
- Distributed, Parallel, and P2P Data Processing and Management
- Data Semantics and Linked Data
Track: Foundations of Algorithmic Computational Biology
-------------------------------------------------------
- Alignment and assembly of sequences
- Biological networks
- Cancer genomics
- Comparative genomics
- Gene expression
- Phylogenetics
- Sequence analysis
- System biology
SUBMISSION GUIDELINES
We solicit papers that describe original research works that are
relevant to the tracks listed above and not published or under review
elsewhere. Papers must be submitted electronically via Easychair in
Springer format (max 12 pages). Submitted papers will undergo a peer
review process. Detailed submission guidelines are here:
https://sofsem2021.inf.unibz.it/submission.html
PROCEEDINGS
The proceedings will be published by Springer in the ARCoSS/LNCS series.
VENUE
The SOFSEM 2021 Conference will be hosted at the Free University of
Bozen-Bolzano, Italy. Bozen-Bolzano is the capital city of the
Province of South Tyrol located in the heart of the Alps. The city is
famous for the 5000 year old iceman "Ötzi" in the archaeological
museum and as an entrance to the Dolomites, a UNESCO World Heritage
Site.
We very much look forward to your submissions:
GENERAL CHAIRS
- Johann Gamper, Free University of Bozen-Bolzano, IT
- Claus Pahl, Free University of Bozen-Bolzano, IT
TRACK CHAIRS
Foundations of Computer Science:
- Tomasz Jurdziński, University of Wroclaw, PL
- Prudence Wong, University Liverpool, UK
Foundations of Software Engineering:
- Tomáš Bureš, Charles University Prague, CZ
Foundations of Data Science and Engineering:
- Giovanna Guerrini, University of Genua, IT
Foundations of Algorithmic Computational Biology:
- Riccardo Dondi, University of Bergamo, IT
- Florian Sikora, Université Paris-Dauphine, FR
STEERING COMMITTEE
- Julius Stuller, Academy of Sciences, Prague, CZ (chair)
- Barbara Catania, University of Genova, IT
- Miroslaw Kutylowski, Wroclaw University of Technology, PL
- Tiziana Margaria-Steffen, University of Limerick, IE
- Branislav Rovan, Comenius University, Bratislava, SK
- Petr Saloun, Technical University of Ostrava, CZ
- Jan van Leeuwen, Utrecht University, Utrecht, NL
**********************************************************
*
* 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] Final call for papers: DISC 2020
DISC 2020 is now accepting submissions at https://disc2020.hotcrp.com/
Note that submissions must be registered by May 7, 2020.
The conference Corona contingency plan (see below) ensures that papers accepted to DISC 2020 will published by LIPIcs, regardless of whether the conference is rescheduled or held (semi-)virtually.
Stay healthy and safe,
DISC 2020 Program committee
---
DISC 2020: CALL FOR PAPERS
34th International Symposium on Distributed Computing
October 12-16, 2020
Freiburg, Germany
http://www.disc-conference.org/wp/disc2020/
Twitter: https://twitter.com/podc_disc
* Corona contingency plan
The steering committee is monitoring the situation with COVID19 and is
considering measures to ensure a safe environment for all participants.
Announcements will be published on the conference's website.
If the situation warrants it, the conference will either be
postponed or held virtually. Several conferences are exploring
possibilities and we will be learning from their experience.
LIPIcs assured us that they will publish the proceedings even if the
conference is virtual.
* DATES
Registration (regular papers and brief announcements): May 7, 2020 (AoE)
Submission (regular papers and brief announcements): May 14, 2020 (AoE)
Notification (regular papers): July 20, 2020
Notification (brief announcements): July 27, 2020
Final version for proceedings: August 10, 2020
Main conference: October 13-15, 2020
Workshops: October 12 and 16, 2020
* SCOPE
Original contributions to theory, design, implementation, modeling,
analysis, or application of distributed systems and networks are
solicited. Topics of interest include, but are not limited to:
- Biological and nature-inspired distributed algorithms
- Blockchain protocols
- Communication networks: protocols, architectures and applications
- Distributed and concurrent data structures, replication and consistency
- Distributed computing: Algorithms and upper bounds
- Distributed computing: Lower bounds and impossibility results
- Distributed graph algorithms
- Distributed machine learning and data science
- Distributed operating systems, middleware, database systems
- Experimental evaluation of distributed algorithms and systems
- Fault tolerance, reliability, availability
- Formal methods for distributed computing: verification, synthesis and testing
- Game-theoretic and knowledge-based approaches to distributed computing
- Internet and Web applications, social networks and recommendation systems
- Massively-parallel, high-performance, cloud and grid computing
- Mobile agents, autonomous distributed systems, swarm robotics
- Multiprocessor and multi-core architectures and algorithms
- Population protocols and chemical reaction networks
- Security in distributed computing, cryptographic protocols
- Self-stabilizing, self-organizing, and autonomous systems
- Synchronization, persistence and transactional memory
- System-on-chip and network-on-chip architectures
- Wireless, mobile, sensor and ad-hoc networks
* SUBMISSIONS
Papers are to be submitted electronically at https://disc2020.hotcrp.com/
Submissions must be in English in pdf format and they must be
prepared using the LaTeX style template for LIPIcs
(https://submission.dagstuhl.de/documentation/authors) with
\documentclass[a4paper,anonymous,USenglish]{lipics-v2019}.
Submissions must be anonymous, without any author names,
affiliations, or email addresses. The contact information of the
authors will be entered separately in HotCRP.
Submissions not conforming to the submission guidelines and papers
outside of the scope of the conference will be rejected without
consideration.
* NOTES ON DOUBLE-BLIND PEER REVIEW
We will use a fairly relaxed implementation of double-blind peer
review in DISC 2020. You are free to disseminate your work through
arXiv and other online repositories and give presentations on your
work as usual.
However, please make sure you do not mention your own name or
affiliation in the submission, and please do not include obvious
references that reveal your identity. A reviewer who has not
previously seen the paper should be able to read it without
accidentally learning the identity of the authors.
Brief announcements should also be submitted without author names
and affiliations so that a reviewer can form an initial judgment
without bias, but they can contain a reference to the full version
of the work in the bibliography.
Please feel free to ask the PC chair if you have any questions
about the double-blind policy of DISC 2020.
* REGULAR PAPERS
Regular submission must report on original research that has not
previously appeared and is not currently under review for or
concurrently submitted to a journal or a conference with published
proceedings. Any overlap with a published or concurrently submitted
paper must be clearly indicated.
A submission must not exceed 15 pages, excluding the references.
All of the ideas necessary for an expert to fully verify the
central claims in the paper, including experimental results, should
be included, some of which may be placed in a clearly marked
appendix that will be read at the discretion of the program
committee.
* BRIEF ANNOUNCEMENTS
Brief announcements may describe work in progress or work presented
elsewhere.
The length of a brief announcement should be at most 3 pages
(including everything). The title of a brief announcement must
begin with "Brief Announcement:".
A regular submission that is not selected for a regular presentation
may be invited by the PC for the brief announcements track.
* PUBLICATION
The proceedings will be published by LIPIcs. The final version of
the paper has to be formatted following the LIPIcs guidelines.
Regular papers will have 15 pages in the final proceedings
(excluding references), and brief announcements will have 3 pages
in the proceedings (including everything). If more space is needed,
the authors are encouraged to post the full version e.g. on arXiv
and refer to it in their paper.
Accepted papers and brief announcements must be presented by one of
the authors, with a full registration, at the conference site, and
according to the final schedule. Any submission accepted into the
technical program but not presented on-site will be withdrawn from
the final proceedings.
* AWARDS
Awards will be given to the best paper and the best student paper.
To be eligible for the best student paper award at least one of the
paper authors must be a full-time student at the time of
submission, and the student(s) must have made a significant
contribution to the paper.
* PROGRAM COMMITTEE
- James Aspnes, Yale (USA)
- Hagit Attiya (chair), Technion (Israel)
- Leonid Barenboim, Open University of Israel (Israel)
- Petra Berenbrink, Universität Hamburg (Germany)
- Armando Castañeda, UNAM (Mexico)
- Keren Censor-Hillel, Technion (Israel)
- Tudor David, Oracle Labs (Switzerland)
- Carole Delporte-Gallet, Université Paris Diderot (France)
- David Doty, University of California, Davis (USA)
- Aleksandar Dragojevic, Microsoft (UK)
- Constantin Enea, Université Paris Diderot (France)
- Matthias Fitzi, IOHK (Switzerland)
- Paola Flocchini, University of Ottawa (Canada)
- Sebastian Forster, University of Salzburg (Austria)
- Luisa Gargano, Università di Salerno (Italy)
- Eric Goubault, École Polytechnique (France)
- Guy Gueta, VMware Research (Israel)
- Joe Izraelevitz, University of Colorado, Boulder (USA)
- Anne-Marie Kermarrec, EPFL (Switzerland)
- Alex Kogan, Oracle Labs (USA)
- Dariusz R. Kowalski, Augusta University (USA)
- Moti Medina, Ben Gurion University (Israel)
- Alessia Milani, LaBRI – Bordeaux INP (France)
- Adam Morrison, Tel Aviv University (Israel)
- Lata Narayanan, Concordia University (Canada)
- Thomas Nowak, Université Paris-Saclay (France)
- Dominik Pająk, Wroclaw University of Science and Technology (Poland)
- Boaz Patt-Shamir, Tel Aviv University (Israel)
- Andrzej Pelc, Université du Québec en Outaouais (Canada)
- Christian Scheideler, University of Paderborn (Germany)
- Jennifer Welch, Texas A&M University (USA)
- Moti Yung, Google & Columbia University (USA)
* ORGANIZING COMMITTEE
General chair:
Fabian Kuhn, University of Freiburg, Germany
Web co-chairs:
Philipp Bamberger and Philipp Schneider, University of Freiburg, Germany
Program committee chair:
Hagit Attiya, Technion, Israel
Workshops and tutorials chair:
Moti Medina, Ben-Gurion University, Israel
* STEERING COMMITTEE
- Hagit Attiya, Technion, Israel
- Fabian Kuhn, University of Freiburg, Germany
- Yoram Moses, Technion, Israel (chair)
- Merav Parter, Weizmann Institute, Israel
- Andrea Richa, Arizona State University, USA (vice chair)
- Ulrich Schmid, TU Wien, Austria
- Jukka Suomela, Aalto University, Finland
**********************************************************
*
* 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/
*
**********************************************************
Friday, April 24, 2020
[DMANET] ESA 2020 Extended Submission Deadline April 29th
Due to the current situation with COVID-19, ESA2020 PC decided to
extend the submission deadline by 5 days. The new deadline is:
extend the submission deadline by 5 days. The new deadline is:
April 29th AoE
We will do our best to stick to our timeline for notification.
****************************
ESA 2020 Call for papers
The 28th Annual European Symposium on Algorithms
September 7-9, 2020, Pisa, Italy
http://algo2020.di.unipi.it/ESA2020/index.html
OVERVIEW
The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. It is organized in collaboration with the
European Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2020 (http://algo2020.di.unipi.it/).
The symposium seeks original algorithmic contributions for problems with
relevant theoretical and/or practical applications. Papers with a strong
emphasis on the theoretical analysis of algorithms should be submitted to
Track A, while papers reporting on the results of extensive experimental
evaluations and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to Track B.
There will be a Best Student Paper Award as well as a Best Paper Award,
both sponsored by EATCS. In order for a paper to be considered for the Best
Student Paper Award, all of its authors are required to be students.
TOPICS
Papers presenting original research in all areas of algorithmic research
are sought, including but not limited to:
- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- Online algorithms
- Parameterized algorithms
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms
SUBMISSION AND PROCEEDINGS
Papers should be submitted electronically via the EasyChair submission
system.
Track A: https://easychair.org/my/conference?conf=esa2020tracka
Track B: https://easychair.org/conferences/?conf=esa2020trackb
ESA 2020 proceedings will be published in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. The
proceedings chair is Grzegorz Herman, Jagiellonian University, Poland.
SUBMISSION GUIDELINES
Authors are invited to submit an extended abstract or full paper of at
most 11 pages excluding the title page, references, and an optional
appendix. The submission should be typeset using a 10-point or larger
font in a single-column format with ample spacing throughout and 2cm
margins all around on A4-size paper. We recommend, but not strictly
require, making your initial submission adhere to LIPIcs publication
guidelines. Proofs omitted due to space constraints must be placed in
an appendix. This appendix can even comprise an entire full version of
the paper. The appendix will be read by the program committee members
at their discretion. In particular, appendices of accepted papers are
not going to be published in the proceedings. The main part of the
submission should therefore contain a clear technical presentation of
the merits of the paper, including a discussion of the paper's
importance within the context of prior work and a description of the
key technical and conceptual ideas used to achieve its main claims.
These guidelines are strict: submissions deviating significantly from
these guidelines risk being rejected without consideration of their
merits. Papers should be submitted electronically via the EasyChair
submission system. Results previously published (or scheduled for
publication) in another conference proceedings or journal will not be
accepted at ESA. Simultaneous submission to other conferences with
published proceedings, or to both tracks of ESA 2020, is also not
permitted. By submitting a paper the authors acknowledge that in case
of acceptance, at least one of the authors must register at ALGO 2020
or ESA 2020 and present the paper.
DOUBLE-BLIND REVIEWING
The conference will employ a lightweight double-blind reviewing
process. Submissions should not reveal the identity of the authors in
any way. In particular, authors' names, affiliations, and email
addresses should not appear at the beginning or in the body of the
submission. Authors should ensure that any references to their own
related work is in the third person (e.g., not "We build on our
previous work ..." but rather "We build on the work of ..."). The
purpose of the double-blind reviewing is to help PC members and
external reviewers come to an initial judgment about the paper without
bias, not to make it impossible for them to discover the authors if
they were to try. Nothing should be done in the name of anonymity that
weakens the submission or makes the job of reviewing the paper more
difficult. In particular, important references should not be omitted
or anonymized. In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally would.
For example, authors may post drafts of their papers on the web,
submit them to arXiv, and give talks on their research ideas. In case
there exist publicly available versions of the submission online, the
authors might mention this in their submission (without providing
references/links), and briefly explain the differences if any.
Alternatively, they might communicate the details to the chairs, who
will keep them confidential unless revealing them to the PC is needed
for a fair judgment. Authors with further questions on double-blind
reviewing are encouraged to contact the PC chairs.
COVID-19
The Organization Committee (OC) is committed to ALGO 2020 and aware of
the pandemic situation for the COVID-19 outbreak, announced by the
World Health Organization. As already happened for other conferences,
the OC is preparing backup plans such as moving the events or
(partially) running them in a virtual way. What is most important is
that the scientific activity of the Programme Committees of the ALGO
conferences is not suspended or stopped: peer review, accepted papers,
camera ready and proceedings will be accomplished as usual. As for the
talks and the participation, the health and safety of our community is
our priority: attending and giving the talks will be safe, and virtual
presence will be possible in case of remaining safety concerns or
travel restrictions.
IMPORTANT DATES
- Submission deadline: April 29, 2020 (23:59 AoE)
- Notification deadline: June 18, 2020
- Final version deadline: June 28, 2020
- ESA Symposium: September 7-9, 2020
PROGRAM COMMITTEE: TRACK A (DESIGN AND ANALYSIS)
Amir Abboud, IBM Almaden Research Center
Gregory Bodwin, Georgia Tech
Karl Bringmann, MPII
Deeparnab Chakrabarty, Dartmouth College
Daniel Dadush, CWI
Michael Elkin, Ben-Gurion University of the Negev
Leah Epstein, University of Haifa
Manuela Fisher, ETHZ
Fabrizio Frati, Roma Tre University
Fabrizio Grandoni (chair), IDSIA
Kasper Green Larsen, Aarhus University
Jacob Holm, University of Copenhagen
Michael Kapralov, EPFL
Petteri Kaski, Aalto University
Telikepalli Kavitha, TIFR
Tomasz Kociumaka, Bar-Ilan University
Moshe Lewenstein, Bar-Ilan University
Shi Li, University at Buffalo
Yury Makarychev, TTIC
Krzysztof Onak, IBM T.J. Watson Research Center
Seth Pettie, University of Michigan
Marcin Pilipczuk, University of Warsaw
Thomas Rothvoss, University of Washington
Laura Sanità, University of Waterloo
Saket Saurabh, Institute of Mathematical Sciences
Chris Schwiegelshohn, Sapienza University of Rome
Vera Traub, ETHZ
Carmine Ventre, King's College London
David Wajc, Carnegie Mellon University
Andreas Wiese, Universidad de Chile
David P. Woodruff, Carnegie Mellon University
Meirav Zehavi, Ben-Gurion University of the Negev
PROGRAM COMMITTEE: TRACK B (ENGINEERING AND APPLICATIONS)
Armin Biere, Linz University
Maike Buchin, Bochum University
Markus Chimani, University of Osnabrück
Irene Finocchi, LUISS University, Rome
Travis Gagie, Dalhousie University
Rolf Niedermeier, TU Berlin
Kunihiko Sadakane, University of Tokyo
Peter Sanders (chair), KIT Karlsruhe
Yihan Sun, UC Riverside
Sivan Toledo, Tel-Aviv University
Jesper Träff, TU Vienna
Renato Werneck, Amazon
STEERING COMMITTEE
Yossi Azar (2017-2020), Tel-Aviv University
Hannah Bast (2017-2020, chair 2018-), Albert-Ludwigs-Universität Freiburg
Michael Bender (2018-2021), Stony Brook University
Artur Czumaj (2015-2019), University of Warwick
Fabrizio Grandoni (2019-2022), IDSIA, USI-SUPSI
Monika Henzinger (2016-2020), Universität Wien
Robert Krauthgamer (2017-2021), The Weizmann Institute of Science
Aleksander Madry (2015-2019), MIT
Peter Sanders (2019-2022), Karlsruhe Institute of Technology
Ola Svensson (2018-2021), EPFL Lausanne
**********************************************************
*
* 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] Postdoc position in Algorithmic Game Theory/Economics and Computation (University of Zurich)
The Computation and Economics Research Group
<https://www.ifi.uzh.ch/en/ce.html> of the Department of
Informatics at the University of Zurich (UZH), led by Prof. Dr. Sven
Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>
<https://www.ifi.uzh.ch/en/ce/people/seuken.html>
Sven Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>, is
inviting applications for:
**1 Postdoc position in Algorithmic Game Theory/Economics and
Computation**
About us: The group currently consists of one professor and 4 PhD
students. All group members have a strong background in
mathematics/computer science and work on market design research
questions. Market design is a research field that combines
techniques from computer science, game theory, operations research,
and other fields. Its goal is to design new, well-functioning
marketplaces or repair ones that are broken. In our research group,
we study foundational market design questions from an
algorithmic/computational and game-theoretic perspective. Current
group members work on a variety of projects including machine
learning-powered combinatorial auctions, cloud computing markets,
equilibrium finding algorithms, and adoption marketplaces. We
publish our research in the top international conferences and
journals in the areas of AI and Economics and Computation. In some
projects, we also collaborate with industrial partners such as
Google Research and Microsoft Research.
We offer:
- a team of young and highly motivated colleagues who are
passionate about topics at the intersection of computer science and
game theory (in particular: market design)
- a competitive salary of approximately 90,000 Euro per year and
generous social benefits
- generous support for professional travel and research needs
- no teaching requirements: but if desired, opportunities to gain
teaching and mentoring experience and strong support for your
career development
- an attractive work environment both within the research group and
beyond: the University of Zurich is one of Switzerland's leading
universities in the middle of a vibrant, cosmopolitan city that
regularly ranks as one of the cities with the highest quality of
life in the world.
You have:
- a PhD degree in computer science or a related field (e.g.,
mathematics or operations research)
- an excellent publication record in your field
a passion for research at the intersection of computer science
and game theory
excellent communication skills in English (German speaking skills
are not necessary)
For the Postdoc in Economics and Computation/
Algorithmic Game Theory we accept applications from all
candidates with a PhD in the area of Economics and
Computation/Algorithmic Game Theory. This includes candidates
who do theory, AI, OR, empirical or experimental work. The exact
starting date is flexible/negotiable. The duration of this position
is between 1 and 6 years, depending on the candidate's
background and career plans.
If you fit this profile, like challenging tasks, and are
passionate about research, then we would love to hear from you.
Women are particularly encouraged to apply. To submit your
application, please go to:
http://www.ifi.uzh.ch/en/ce/jobs/postdoc.html
The position will be open until filled. To receive full
consideration, applications should be submitted by May 10, 2020.
Further information about the research group is available online
at: http://www.ifi.uzh.ch/ce. For inquiries about the positions,
please contact seuken@ifi.uzh.ch.
--
Prof. Dr. Sven Seuken
Head of Computation and Economics Research Group
University of Zurich
Phone: +41 44 635 67 48
Web: https://www.ifi.uzh.ch/en/ce/people/seuken.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/
*
**********************************************************
<https://www.ifi.uzh.ch/en/ce.html> of the Department of
Informatics at the University of Zurich (UZH), led by Prof. Dr. Sven
Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>
<https://www.ifi.uzh.ch/en/ce/people/seuken.html>
Sven Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>, is
inviting applications for:
**1 Postdoc position in Algorithmic Game Theory/Economics and
Computation**
About us: The group currently consists of one professor and 4 PhD
students. All group members have a strong background in
mathematics/computer science and work on market design research
questions. Market design is a research field that combines
techniques from computer science, game theory, operations research,
and other fields. Its goal is to design new, well-functioning
marketplaces or repair ones that are broken. In our research group,
we study foundational market design questions from an
algorithmic/computational and game-theoretic perspective. Current
group members work on a variety of projects including machine
learning-powered combinatorial auctions, cloud computing markets,
equilibrium finding algorithms, and adoption marketplaces. We
publish our research in the top international conferences and
journals in the areas of AI and Economics and Computation. In some
projects, we also collaborate with industrial partners such as
Google Research and Microsoft Research.
We offer:
- a team of young and highly motivated colleagues who are
passionate about topics at the intersection of computer science and
game theory (in particular: market design)
- a competitive salary of approximately 90,000 Euro per year and
generous social benefits
- generous support for professional travel and research needs
- no teaching requirements: but if desired, opportunities to gain
teaching and mentoring experience and strong support for your
career development
- an attractive work environment both within the research group and
beyond: the University of Zurich is one of Switzerland's leading
universities in the middle of a vibrant, cosmopolitan city that
regularly ranks as one of the cities with the highest quality of
life in the world.
You have:
- a PhD degree in computer science or a related field (e.g.,
mathematics or operations research)
- an excellent publication record in your field
a passion for research at the intersection of computer science
and game theory
excellent communication skills in English (German speaking skills
are not necessary)
For the Postdoc in Economics and Computation/
Algorithmic Game Theory we accept applications from all
candidates with a PhD in the area of Economics and
Computation/Algorithmic Game Theory. This includes candidates
who do theory, AI, OR, empirical or experimental work. The exact
starting date is flexible/negotiable. The duration of this position
is between 1 and 6 years, depending on the candidate's
background and career plans.
If you fit this profile, like challenging tasks, and are
passionate about research, then we would love to hear from you.
Women are particularly encouraged to apply. To submit your
application, please go to:
http://www.ifi.uzh.ch/en/ce/jobs/postdoc.html
The position will be open until filled. To receive full
consideration, applications should be submitted by May 10, 2020.
Further information about the research group is available online
at: http://www.ifi.uzh.ch/ce. For inquiries about the positions,
please contact seuken@ifi.uzh.ch.
--
Prof. Dr. Sven Seuken
Head of Computation and Economics Research Group
University of Zurich
Phone: +41 44 635 67 48
Web: https://www.ifi.uzh.ch/en/ce/people/seuken.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] Postdoc position in Machine Learning in ERC project (University of Zurich)
The Computation and Economics Research Group
<https://www.ifi.uzh.ch/en/ce.html> of the Department of
Informatics at the University of Zurich (UZH), led by Prof. Dr. Sven
Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>
<https://www.ifi.uzh.ch/en/ce/people/seuken.html>
Sven Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>, is
inviting applications for:
**1 Postdoc position in Machine Learning**
About us: The group currently consists of one professor and 4 PhD
students. All group members have a strong background in
mathematics/computer science and work on market design research
questions. Market design is a research field that combines
techniques from computer science, game theory, operations research,
and other fields. Its goal is to design new, well-functioning
marketplaces or repair ones that are broken. In our research group,
we study foundational market design questions from an
algorithmic/computational and game-theoretic perspective. Current
group members work on a variety of projects including machine
learning-powered combinatorial auctions, cloud computing markets,
equilibrium finding algorithms, and adoption marketplaces. We
publish our research in the top international conferences and
journals in the areas of AI and Economics and Computation. In some
projects, we also collaborate with industrial partners such as
Google Research and Microsoft Research.
We offer:
- a team of young and highly motivated colleagues who are
passionate about topics at the intersection of computer science and
game theory (in particular: market design)
- a competitive salary of approximately 90,000 Euro per year and
generous social benefits
- generous support for professional travel and research needs
- no teaching requirements: but if desired, opportunities to gain
teaching and mentoring experience and strong support for your
career development
- an attractive work environment both within the research group and
beyond: the University of Zurich is one of Switzerland's leading
universities in the middle of a vibrant, cosmopolitan city that
regularly ranks as one of the cities with the highest quality of
life in the world.
You have:
- a PhD degree in computer science or a related field (e.g.,
mathematics or operations research)
- an excellent publication record in your field
a passion for research at the intersection of computer science
and game theory
excellent communication skills in English (German speaking skills
are not necessary)
For the Postdoc in Machine Learning we accept applications from all
candidates with a PhD who have a strong background in Machine
Learning. The successful candidate will join the ERC project on
"Machine Learning-based Market Design (MIAMI)" led by Prof. Dr.
Sven Seuken. On a high level, the research question to be
investigated in this project is how we can combine techniques from
machine learning with market design to develop better market
mechanisms. The ideal candidate has already published papers in the
top ML/AI conferences such as ICML, NeurIPS, KDD, AAAI and IJCAI.
Prior research experience in Algorithmic Game Theory is desirable
but not required. The exact starting date is flexible/negotiable.
The duration of the position is between 1 and 4 years, depending on
the candidate's career plans.
If you fit this profile, like challenging tasks, and are
passionate about research, then we would love to hear from you.
Women are particularly encouraged to apply. To submit your
application, please go to:
http://www.ifi.uzh.ch/en/ce/jobs/postdoc.html
The position will be open until filled. To receive full
consideration, applications should be submitted by May 10, 2020.
Further information about the research group is available online
at: http://www.ifi.uzh.ch/ce. For inquiries about the positions,
please contact seuken@ifi.uzh.ch.
--
Prof. Dr. Sven Seuken
Head of Computation and Economics Research Group
University of Zurich
Phone: +41 44 635 67 48
Web: https://www.ifi.uzh.ch/en/ce/people/seuken.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/
*
**********************************************************
<https://www.ifi.uzh.ch/en/ce.html> of the Department of
Informatics at the University of Zurich (UZH), led by Prof. Dr. Sven
Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>
<https://www.ifi.uzh.ch/en/ce/people/seuken.html>
Sven Seuken <https://www.ifi.uzh.ch/en/ce/people/seuken.html>, is
inviting applications for:
**1 Postdoc position in Machine Learning**
About us: The group currently consists of one professor and 4 PhD
students. All group members have a strong background in
mathematics/computer science and work on market design research
questions. Market design is a research field that combines
techniques from computer science, game theory, operations research,
and other fields. Its goal is to design new, well-functioning
marketplaces or repair ones that are broken. In our research group,
we study foundational market design questions from an
algorithmic/computational and game-theoretic perspective. Current
group members work on a variety of projects including machine
learning-powered combinatorial auctions, cloud computing markets,
equilibrium finding algorithms, and adoption marketplaces. We
publish our research in the top international conferences and
journals in the areas of AI and Economics and Computation. In some
projects, we also collaborate with industrial partners such as
Google Research and Microsoft Research.
We offer:
- a team of young and highly motivated colleagues who are
passionate about topics at the intersection of computer science and
game theory (in particular: market design)
- a competitive salary of approximately 90,000 Euro per year and
generous social benefits
- generous support for professional travel and research needs
- no teaching requirements: but if desired, opportunities to gain
teaching and mentoring experience and strong support for your
career development
- an attractive work environment both within the research group and
beyond: the University of Zurich is one of Switzerland's leading
universities in the middle of a vibrant, cosmopolitan city that
regularly ranks as one of the cities with the highest quality of
life in the world.
You have:
- a PhD degree in computer science or a related field (e.g.,
mathematics or operations research)
- an excellent publication record in your field
a passion for research at the intersection of computer science
and game theory
excellent communication skills in English (German speaking skills
are not necessary)
For the Postdoc in Machine Learning we accept applications from all
candidates with a PhD who have a strong background in Machine
Learning. The successful candidate will join the ERC project on
"Machine Learning-based Market Design (MIAMI)" led by Prof. Dr.
Sven Seuken. On a high level, the research question to be
investigated in this project is how we can combine techniques from
machine learning with market design to develop better market
mechanisms. The ideal candidate has already published papers in the
top ML/AI conferences such as ICML, NeurIPS, KDD, AAAI and IJCAI.
Prior research experience in Algorithmic Game Theory is desirable
but not required. The exact starting date is flexible/negotiable.
The duration of the position is between 1 and 4 years, depending on
the candidate's career plans.
If you fit this profile, like challenging tasks, and are
passionate about research, then we would love to hear from you.
Women are particularly encouraged to apply. To submit your
application, please go to:
http://www.ifi.uzh.ch/en/ce/jobs/postdoc.html
The position will be open until filled. To receive full
consideration, applications should be submitted by May 10, 2020.
Further information about the research group is available online
at: http://www.ifi.uzh.ch/ce. For inquiries about the positions,
please contact seuken@ifi.uzh.ch.
--
Prof. Dr. Sven Seuken
Head of Computation and Economics Research Group
University of Zurich
Phone: +41 44 635 67 48
Web: https://www.ifi.uzh.ch/en/ce/people/seuken.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] IFIP WG 7.3 PERFORMANCE 2020 (Call for Papers)
*** IFIP WG 7.3 PERFORMANCE 2020 ***
38th International Symposium on
Computer Performance, Modeling, Measurement and Evaluation
38th International Symposium on
Computer Performance, Modeling, Measurement and Evaluation
November 2nd-6th, 2020, Milan, Italy
https://www.performance2020.deib.polimi.it/
Apologies if you receive multiple copies of this message.
** UPDATE: COVID-19 **
IFIP WG 7.3 PERFORMANCE 2020 conference organizers are continuously
monitoring the COVID-19 situation from local authorities and the World
Health Organization. The conference is seven-month away, and we hope
that COVID-19 emergency will pass over and the conference will be held
in November, as planned. However, if necessary, alternative solutions,
such as postponement, remote presentations, etc. will be looked into
and identified.
** UPDATE: SPECIAL ISSUES **
Regular papers will be published in a special issue of the Elsevier
journal Performance Evaluation (PEVA). Alternatively, authors may
opt-out in favor of submission to other special issues in journals
related to Performance Evaluation and Operations Research.
Special Issues will appear in:
- ACM Transactions on Modeling and Performance Evaluation of Computing
Systems
(TOMPECS, https://tompecs.acm.org)
- Queueing Systems: Theory and Applications
(QUESTA, https://link.springer.com/journal/11134)
- Stochastic Systems
(https://pubsonline.informs.org/journal/stsy)
** UPDATE: TUTORIALS **
The following tutorials have also been announced:
- Reliability and Availability Modeling in Practice, by
Prof. Kishor Trivedi (Duke University, North Carolina, USA) and
Prof. Andrea Bobbio (Università del Piemonte Orientale, Italy)
- Load balancing, redundancy, and multi-type job and server systems, by
Prof. Urtzi Ayesta (IRIT, Toulouse, France)
- AI4NETS – AI/ML for data communication Networks by
Dr. Pedro Casas (Austrian Institute of Technology, Leoben, Austria)
** CONFERENCE TOPICS **
The IFIP Performance conference aims to bring together researchers
interested in understanding and improving the performance of computing
and communication systems by means of state-of-the-art quantitative
models and solution techniques. Research papers on the design of
algorithms, mathematical analysis and modeling, simulation and
measurement techniques for computer systems or communication networks
are solicited.
Topics of interest include the following.
Performance-oriented methodologies including:
- Stochastic modelling, statistical analysis and simulation
- Capacity planning, resource allocation, routing, scheduling and
Quality of Service
- Energy-efficient computing and networking
- Computer architectures and operating systems
- Network architectures, protocols and congestion control
- Storage systems and datacenters
Evaluation techniques, and algorithms for:
- Artificial Intelligence and Machine Learning
- Blockchains and crypto-currency
- Cyber-physical systems, Internet of Things, fog computing
- Data centers, content delivery, cloud computing and virtualization
- Internet and web services
- Network economics and markets
- Security systems
- Social networks, multimedia systems and smart grid
- Wireless, ad-hoc and cellular networks
** IMPORTANT DATES **
Abstract submission: May 10th, 2020
Full paper submission: May 17th, 2020
Notification to authors: July 19th, 2020
** PAPER SUBMISSION **
Performance 2020 accepts submissions in two categories:
- Regular papers: 12 pages
- Short papers: 6 pages
Regular papers should not exceed 12 pages double-column and
single-spaced including figures, tables and references in standard ACM
format. Short papers are limited to 6 pages. In addition (both for
regular and short paper submissions), a 2-page appendix is permitted,
which is not included in the page-count. Papers must be submitted
electronically in printable pdf form. Templates for the standard ACM
format can be found at
https://www.acm.org/publications/proceedings-template. Both the strict
and alternate styles are acceptable for submission. No changes to
margins, spacing or font sizes are allowed from those specified by the
style files. Papers violating the formatting guidelines will be
returned without review.
Authors of rejected Sigmetrics 2020 papers are invited to submit a
revised version of their paper, which would then be reviewed again as
new by at least one of its Sigmetrics reviewers to aid consistency.
The authors are allowed to include a response to the Sigmetrics
reviews in a clearly-marked appendix that will not count against the
page limit.
Papers can be submitted at
https://easychair.org/conferences/?conf=performance2020
All submissions will be reviewed using a double-blind review process.
The identity of authors and referees will not be revealed to each
other. To ensure double-blind reviewing, authors names and
affiliations should not appear in the paper and bibliographic
references should be made in such a way as to preserve author
anonymity.
Warning: It is ACM policy not to allow double submissions, where the
same paper is submitted to more than one conference/journal
concurrently. Any double submissions detected will be rejected
immediately from all conferences/journals involved.
Accepted short papers (limited to 6 pages ) and abstracts of accepted
regular papers will be published in a special issue of the ACM
Performance Evaluation Review (PER).
** SPECIAL ISSUES **
Regular papers will be published in a special issue of the Elsevier
journal Performance Evaluation (PEVA).
Alternatively, authors may opt-out in favor of submission to other
special issues in journals related to Performance Evaluation and
Operations Research.
Eligible papers are:
- extensions of short-papers and
- long papers that opt-out of publication in Performance Evaluation (PEVA).
Authors need to make sure that their work falls within the scope of
the respective journal. All the papers will be reviewed according to
the standards of the journal.
Special Issues will appear in:
1. ACM Transactions on Modeling and Performance Evaluation of
Computing Systems (TOMPECS).
The editors will invite the authors of a few papers (short or long) to
submit a full-length manuscript. Prepare your manuscript using the
same manuscript preparation guidelines as the ones for regular TOMPECS
submissions.
2. Queueing Systems: Theory and Applications (QUESTA)
All conference papers (short and long papers that opt-out of PEVA) may
submit to the SI. The conference version of the paper published in
PER should be no more than 6 pages. Accepted full papers that opt out
of PEVA will have to be shortened by the authors if they wish to have
their paper submitted to Queueing Systems. Prepare your manuscript
using the same manuscript preparation guidelines as the ones for
regular QUESTA submissions.
3. Stochastic Systems
The conference version of the paper published in PER should be no more
than 6 pages. Accepted full papers that opt out of PEVA will have to
be shortened by the authors if they wish to have their paper submitted
to Stochastic Systems. Prepare your manuscript using the same
manuscript preparation guidelines as the ones for regular stochastic
systems submissions.
** ORGANIZING COMMITTEE **
General Chair: Danilo Ardagna (Politecnico di Milano, Italy)
Program Committee Co-Chairs:
Jim Dai (CUHK, Shenzhen, China and Cornell University, USA)
Peter Harrison (Imperial College London, UK)
Nidhi Hegde (University of Alberta, Canada)
Steering Committee:
Sem Borst , Vice-Chair, IFIP WG 7.3, TU Eindhoven and Bell Labs NOKIA
Mark S. Squillante, Chair, IFIP WG 7.3, IBM Research
Benny Van Houdt, Secretary, IFIP WG 7.3, University of Antwerp
Publication Chair
Zhenhua Liu, Stony Brook University, USA
Workshop Chair
Leana Golubchik, University of Southern California, USA
Marco Paolieri, University of Southern California, USA
Tutorial Chairs
Michela Meo, Politecnico Torino, Italy
Marco Mellia, Politecnico Torino, Italy
Travel grant Chairs
Marco Gribaudo, Politecnico di Milano, Italy
Riccardo Lancellotti, Università di Modena e Reggio Emilia, Italy
Ana Paula Couto da Silva, Universidade Federal de Minas Gerais, Brazil
Publicity Chairs
Cristina Rottondi, Politecnico Torino, Italy
Daniel Sadoc Menasche, Federal University of Rio de Janeiro, Brazil
Weina Wang, Carnegie Mellon University, USA
Technical Program Committee:
TPC available at the Performance 2020 web site at
https://www.performance2020.deib.polimi.it/?page_id=89
**********************************************************
*
* 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] Online Seminar on Frontiers of Parameterized Complexity: April 30, 2020 -- Daniel Lokshtanov
We are excited to announce a new online seminar series on Frontiers of
Parameterized Complexity with talks scheduled weekly on Thursdays at
17.00 GMT+2 (Bergen time). Individuals and viewing party groups from
around the world can attend these online talks and interact with the
speaker and other attendees remotely via Zoom.
More details about the seminar series can be found here:
https://frontpc.blogspot.com/2020/04/talks-schedule.html
The (next) second talk of the series will be held on April 30, 2020 at
17:00 GMT+2.
The link to join the meeting on Zoom is https://uib.zoom.us/j/4231169675
Meeting ID: 423 116 9675
Password: Name of the W[1]-complete problem, 6 letters, all capital.
Also known as a set of pairwise adjacent vertices.
Speaker: Daniel Lokshtanov, UCSB
Title: A Parameterized Approximation Scheme for Min k-Cut
Abstract: In the Min k-Cut problem, input is an edge weighted graph G
and an integer k, and the task is to partition the vertex set into k
non-empty sets, such that the total weight of the edges with endpoints
in different parts is minimized. When k is part of the input, the
problem is NP-complete and hard to approximate within any factor less
than 2. Recently, the problem has received significant attention from
the perspective of parameterized approximation. Gupta {\em et al.}
[SODA 2018] initiated the study of FPT-approximation for the Min
k-Cut problem and gave an 1.9997-approximation algorithm running in
time 2^{O(k^6}n^{O(1)}. Later, the same set of authors~[FOCS 2018]
designed an (1 +\epsilon)-approximation algorithm that runs in time
(k/\epsilon)^{O(k)}n^{k+O(1)}, and a 1.81-approximation algorithm
running in time 2^{O(k^2)}n^{O(1)}. More, recently, Kawarabayashi and
Lin~[SODA 2020] gave a (5/3 + \epsilon)-approximation for Min k-Cut
running in time 2^{O(k^2 \log k)}n^{O(1)}.
In this paper we give a parameterized approximation algorithm with
best possible approximation guarantee, and best possible running time
dependence on said guarantee (up to Exponential Time Hypothesis (\ETH)
and constants in the exponent). In particular, for every \epsilon > 0,
the algorithm obtains a (1 +\epsilon)-approximate solution in time
(k/\epsilon)^{O(k)}n^{O(1)}. The main ingredients of our algorithm
are: a simple sparsification procedure, a new polynomial time
algorithm for decomposing a graph into highly connected parts, and a
new exact algorithm with running time s^{O(k)}n^{O(1)} on unweighted
(multi-) graphs. Here, s denotes the number of edges in a minimum
k-cut. The later two are of independent interest.
********************************************************
Other upcoming talks in the series include:
May 07 2020:
Speaker: Jason Li, CMU
Title: To be announced
May 14 2020:
Speaker: Vincent Cohen-Addad, Google Z\"urich
Title: On the Parameterized Complexity of Various Clustering Problems
For more details please contact one of the following.
Roohani Sharma: roohani@imsc.res.in
Saket Saurabh: saket@imsc.res.in
Fedor Fomin: Fedor.Fomin@uib.no
Best regards and cheers!
**********************************************************
*
* 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/
*
**********************************************************
Parameterized Complexity with talks scheduled weekly on Thursdays at
17.00 GMT+2 (Bergen time). Individuals and viewing party groups from
around the world can attend these online talks and interact with the
speaker and other attendees remotely via Zoom.
More details about the seminar series can be found here:
https://frontpc.blogspot.com/2020/04/talks-schedule.html
The (next) second talk of the series will be held on April 30, 2020 at
17:00 GMT+2.
The link to join the meeting on Zoom is https://uib.zoom.us/j/4231169675
Meeting ID: 423 116 9675
Password: Name of the W[1]-complete problem, 6 letters, all capital.
Also known as a set of pairwise adjacent vertices.
Speaker: Daniel Lokshtanov, UCSB
Title: A Parameterized Approximation Scheme for Min k-Cut
Abstract: In the Min k-Cut problem, input is an edge weighted graph G
and an integer k, and the task is to partition the vertex set into k
non-empty sets, such that the total weight of the edges with endpoints
in different parts is minimized. When k is part of the input, the
problem is NP-complete and hard to approximate within any factor less
than 2. Recently, the problem has received significant attention from
the perspective of parameterized approximation. Gupta {\em et al.}
[SODA 2018] initiated the study of FPT-approximation for the Min
k-Cut problem and gave an 1.9997-approximation algorithm running in
time 2^{O(k^6}n^{O(1)}. Later, the same set of authors~[FOCS 2018]
designed an (1 +\epsilon)-approximation algorithm that runs in time
(k/\epsilon)^{O(k)}n^{k+O(1)}, and a 1.81-approximation algorithm
running in time 2^{O(k^2)}n^{O(1)}. More, recently, Kawarabayashi and
Lin~[SODA 2020] gave a (5/3 + \epsilon)-approximation for Min k-Cut
running in time 2^{O(k^2 \log k)}n^{O(1)}.
In this paper we give a parameterized approximation algorithm with
best possible approximation guarantee, and best possible running time
dependence on said guarantee (up to Exponential Time Hypothesis (\ETH)
and constants in the exponent). In particular, for every \epsilon > 0,
the algorithm obtains a (1 +\epsilon)-approximate solution in time
(k/\epsilon)^{O(k)}n^{O(1)}. The main ingredients of our algorithm
are: a simple sparsification procedure, a new polynomial time
algorithm for decomposing a graph into highly connected parts, and a
new exact algorithm with running time s^{O(k)}n^{O(1)} on unweighted
(multi-) graphs. Here, s denotes the number of edges in a minimum
k-cut. The later two are of independent interest.
********************************************************
Other upcoming talks in the series include:
May 07 2020:
Speaker: Jason Li, CMU
Title: To be announced
May 14 2020:
Speaker: Vincent Cohen-Addad, Google Z\"urich
Title: On the Parameterized Complexity of Various Clustering Problems
For more details please contact one of the following.
Roohani Sharma: roohani@imsc.res.in
Saket Saurabh: saket@imsc.res.in
Fedor Fomin: Fedor.Fomin@uib.no
Best regards and cheers!
**********************************************************
*
* 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] PhD/Postdoc Position in Algorithms
The Algorithms and Complexity Group at Goethe University Frankfurt/Main
invites applications for a
PhD Student or PostDoc in Algorithms
The post is a full-time position (TVL-13 100% scale) in the DFG project
"Algorithms for Fair Allocation of Indivisible Goods" on fairness
criteria and algorithm design for markets. We offer an inspiring
research environment at Goethe University, plenty of opportunity for
scientific collaborations, and generous travel allowance.
We expect an excellent Master's degree (or equivalent) in Computer
Science, Mathematics, or a related discipline. Applicants should have a
theoretical/mathematical background, enthusiasm for mathematical
problems and scientific work, and preferably an interest in at least one
of the following areas:
* Algorithms for fair division and fair allocation
* Algorithmic game theory and mechanism design
* Design and analysis of efficient algorithms
* Randomized and approximation algorithms
* Online algorithms
All applications should include
* a cover letter describing the interest in the position
* a detailed CV
* list of publications (PostDocs), or
list of courses and grades (PhD students)
* a copy of the Master thesis (if available)
* Please mention names and contact details of one or two references --
preferably one from your thesis advisor.
Interested candidates should send their application to Martin Hoefer
<mhoefer@cs.uni-frankfurt.de> via email, preferably as a single PDF.
Review of applications will start on May 20, 2020, and continue until
the position is filled.
**********************************************************
*
* 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/
*
**********************************************************
invites applications for a
PhD Student or PostDoc in Algorithms
The post is a full-time position (TVL-13 100% scale) in the DFG project
"Algorithms for Fair Allocation of Indivisible Goods" on fairness
criteria and algorithm design for markets. We offer an inspiring
research environment at Goethe University, plenty of opportunity for
scientific collaborations, and generous travel allowance.
We expect an excellent Master's degree (or equivalent) in Computer
Science, Mathematics, or a related discipline. Applicants should have a
theoretical/mathematical background, enthusiasm for mathematical
problems and scientific work, and preferably an interest in at least one
of the following areas:
* Algorithms for fair division and fair allocation
* Algorithmic game theory and mechanism design
* Design and analysis of efficient algorithms
* Randomized and approximation algorithms
* Online algorithms
All applications should include
* a cover letter describing the interest in the position
* a detailed CV
* list of publications (PostDocs), or
list of courses and grades (PhD students)
* a copy of the Master thesis (if available)
* Please mention names and contact details of one or two references --
preferably one from your thesis advisor.
Interested candidates should send their application to Martin Hoefer
<mhoefer@cs.uni-frankfurt.de> via email, preferably as a single PDF.
Review of applications will start on May 20, 2020, and continue until
the position is filled.
**********************************************************
*
* 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] ONLINE VERSION OF ISCO 2020
ONLINE VERSION OF ISCO 2020 - MAY 4-6, 2020
An online version of ISCO 2020, consisting only of the long papers accepted for publication in the conference proceedings, will take place May 4-6, 2020. The schedule is now available :
https://symposia.cirrelt.ca/ISCO2020/en/schedule
All talks will take place via Zoom. The links will be communicated prior to the conference.
Everyone attending the conference needs to register (for FREE) at:
https://symposia.cirrelt.ca/ISCO2020/en/register
**********************************************************
*
* 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/
*
**********************************************************
An online version of ISCO 2020, consisting only of the long papers accepted for publication in the conference proceedings, will take place May 4-6, 2020. The schedule is now available :
https://symposia.cirrelt.ca/ISCO2020/en/schedule
All talks will take place via Zoom. The links will be communicated prior to the conference.
Everyone attending the conference needs to register (for FREE) at:
https://symposia.cirrelt.ca/ISCO2020/en/register
**********************************************************
*
* 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, April 23, 2020
[DMANET] EXTENDED DEADLINE: Postdoctoral fellowship in graph theory at the Université de Montréal
>
> The Department of Computer Science and Operations Research at the
University of Montreal (Département d'informatique et de recherche
opérationnelle, Université de Montréal) invites applications for a
postdoctoral fellowship in graph theory for the 2020-21 academic year.
> The Department of Computer Science and Operations Research at the
University of Montreal (Département d'informatique et de recherche
opérationnelle, Université de Montréal) invites applications for a
postdoctoral fellowship in graph theory for the 2020-21 academic year.
*The research team*
The graph theory research group at the University of Montreal is led by
Prof. Geňa Hahn and Dr. Ben Seamone. The primary interests of the group
are, broadly speaking, graph structure, graph colouring, games on graphs,
and infinite graphs. The current group also includes three graduate
students, two undergraduate students, as well as visitors.
*Requirements*
- Candidates must hold a Ph.D. obtained within 5 years of the position's
start date, in either theoretical computer science or mathematics. This
includes applicants who have not yet obtained their degree but are certain
to finish before the position's start date.
- Fluent English is a requirement for the position. Note that the
Université de Montréal is a francophone institution, so a working knowledge
of French is an asset.
- Research experience, as evidenced by a history of relevant
publications, is expected.
*The position*
- The successful candidate will have the opportunity to further
establish their own research program, and will be expected to collaborate
with other members of the research group on theirs.
- Co-supervision of undergraduate and/or graduate students is
anticipated.
- No teaching responsibilities are included with the position.
*Conditions*
The appointment is for a period of 12 months at a salary competitive with
other postdoctoral fellowships in Canada, and includes employment benefits
(pension, employment insurance, etc). Extensions beyond this time period
are subject to available funds, but are not anticipated to be likely at
this time. In order to facilitate research collaborations and/or
presentation of results at conferences/colloquia, travel support will also
be provided. The start date is negotiable and subject to travel
restrictions due to the COVID-19 pandemic, but we hope that the position
would begin as close to September 1, 2020 as possible.
For further information, you may consult the collective agreement (French
<https://rh.umontreal.ca/fileadmin/ressourceshumaines/documents/conventions_et_ententes/Convention_collective_stagiaires_postdoctoraux.pdf>)
and the postdoctoral fellow guide (English
<https://esp.umontreal.ca/fileadmin/esp/documents/PDF/GuideStagiairePostoctoral_Eng.pdf>
| French
<https://esp.umontreal.ca/fileadmin/esp/documents/PDF/PolitiqueSPDmai2015.pdf>
).
*Application Process*
Applicants should prepare the following materials:
- Full CV
- Research statement, detailing past contributions, future plans, and
how these fit with the research interests of the group (2-3 pages)
- Three (3) reference letters, which should be submitted directly to the
email address below by the referees.
Applications and inquiries should be sent to diropostdoc2020@gmail.com.
Complete applications should be received by *May 8, 2020* in order to
receive full consideration.
Best regards,
Ben Seamone & Geňa Hahn
--
Dr. Benjamin Seamone
Professeur associé
Département d'informatique et de recherche operationnelle
Université de Montréal
Pavillon André-Aisenstadt
2920, chemin de la Tour
Montreal, QC, CANADA
H3T 1J4
*https://benseamone.wordpress.com/ <https://benseamone.wordpress.com/>*
**********************************************************
*
* 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: IEEE Int. Conferences (ISPA, BDCloud, SocialCom, SustainCom) in Exeter, England, UK, 15-17 October 2020
[Please accept our apologies if you receive multiple copies of this email]
*** IEEE (ISPA-2020, BDCloud-2020, SocialCom-2020, SustainCom-2020
International Conferences ***
To be held in Exeter, England, UK, 15-17 October 2020.
The 18th IEEE International Symposium on Parallel and Distributed
Processing with Applications (ISPA-2020)
https://hpcn.exeter.ac.uk/ispa2020
The 10th IEEE International Conference on Big Data and Cloud Computing
(BDCloud-2020)
https://hpcn.exeter.ac.uk/bdcloud2020
The 13th IEEE International Symposium on Social Computing and Networking
(SocialCom-2020)
https://hpcn.exeter.ac.uk/socialcom2020
The 10th IEEE International Conference on Sustainable Computing and
Communications (SustainCom-2020)
https://hpcn.exeter.ac.uk/sustaincom2020
Sponsored by
IEEE, IEEE Computer Society, and IEEE Technical Committee of Scalable
Computing (TCSC)
IMPORTANT DATES
===============
Workshop/Special Session Proposal Due: 1 May 2020
Paper Submission Deadline: 1 June 2020
Authors Notification: 10 August 2020
Camera-Ready Paper Due: 8 September 2020
Early Registration Due: 8 September 2020
Conference Date: 15-17 October 2020
PAPER SUBMISSION GUIDELINE
==========================
All papers need to be submitted electronically through the conference
websites with PDF format. The materials presented in the papers should not
be published or under submission elsewhere. Each paper is limited to 8
pages (or 10 pages with over length charge) including figures and
references using IEEE Computer Society Proceedings Manuscripts style (two
columns, single-spaced, 10 fonts). You can confirm the IEEE Computer
Society Proceedings Author Guidelines at the following web page:
http://www.computer.org/web/cs-cps/
Manuscript Templates for Conference Proceedings can be found at
https://www.ieee.org/conferences_events/conferences/publishing/templates.html
Once accepted, the paper will be included into the IEEE conference
proceedings published by IEEE Computer Society Press (indexed by EI). The
authors of selected papers will be invited to extend their contributions
for special issues of prestigious journals.
**********************************************************
*
* 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/
*
**********************************************************
*** IEEE (ISPA-2020, BDCloud-2020, SocialCom-2020, SustainCom-2020
International Conferences ***
To be held in Exeter, England, UK, 15-17 October 2020.
The 18th IEEE International Symposium on Parallel and Distributed
Processing with Applications (ISPA-2020)
https://hpcn.exeter.ac.uk/ispa2020
The 10th IEEE International Conference on Big Data and Cloud Computing
(BDCloud-2020)
https://hpcn.exeter.ac.uk/bdcloud2020
The 13th IEEE International Symposium on Social Computing and Networking
(SocialCom-2020)
https://hpcn.exeter.ac.uk/socialcom2020
The 10th IEEE International Conference on Sustainable Computing and
Communications (SustainCom-2020)
https://hpcn.exeter.ac.uk/sustaincom2020
Sponsored by
IEEE, IEEE Computer Society, and IEEE Technical Committee of Scalable
Computing (TCSC)
IMPORTANT DATES
===============
Workshop/Special Session Proposal Due: 1 May 2020
Paper Submission Deadline: 1 June 2020
Authors Notification: 10 August 2020
Camera-Ready Paper Due: 8 September 2020
Early Registration Due: 8 September 2020
Conference Date: 15-17 October 2020
PAPER SUBMISSION GUIDELINE
==========================
All papers need to be submitted electronically through the conference
websites with PDF format. The materials presented in the papers should not
be published or under submission elsewhere. Each paper is limited to 8
pages (or 10 pages with over length charge) including figures and
references using IEEE Computer Society Proceedings Manuscripts style (two
columns, single-spaced, 10 fonts). You can confirm the IEEE Computer
Society Proceedings Author Guidelines at the following web page:
http://www.computer.org/web/cs-cps/
Manuscript Templates for Conference Proceedings can be found at
https://www.ieee.org/conferences_events/conferences/publishing/templates.html
Once accepted, the paper will be included into the IEEE conference
proceedings published by IEEE Computer Society Press (indexed by EI). The
authors of selected papers will be invited to extend their contributions
for special issues of prestigious journals.
**********************************************************
*
* 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] Tenure-Track Faculty Position in Mathematics
*Tenure-Track Faculty Position in Mathematics*
The Department of Mathematics-Physics-Computer Science of the University of
Haifa at Oranim College invites applications for a tenure-track
faculty position in all areas of mathematics, to begin October 1st 2020 or
March 1st 2021.
The department seeks individuals with excellent research experience and
strong commitment to undergraduate teaching. A Ph.D. in mathematics and
postdoctoral experience are required, as well as the ability to teach in
Hebrew.
Applications should include a detailed C.V. including a list of
publications, a research statement and a teaching statement including
teaching experience and students surveys if exist.
Applicants should also arrange for three letters of recommendations, as
well as the application, to be sent to the department head by e-mail at:
Dr. Eyal Ackerman
ackerman@sci.haifa.ac.il
There is no fixed deadline, applications will be considered as they arrive
until the position is filled.
**********************************************************
*
* 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/
*
**********************************************************
The Department of Mathematics-Physics-Computer Science of the University of
Haifa at Oranim College invites applications for a tenure-track
faculty position in all areas of mathematics, to begin October 1st 2020 or
March 1st 2021.
The department seeks individuals with excellent research experience and
strong commitment to undergraduate teaching. A Ph.D. in mathematics and
postdoctoral experience are required, as well as the ability to teach in
Hebrew.
Applications should include a detailed C.V. including a list of
publications, a research statement and a teaching statement including
teaching experience and students surveys if exist.
Applicants should also arrange for three letters of recommendations, as
well as the application, to be sent to the department head by e-mail at:
Dr. Eyal Ackerman
ackerman@sci.haifa.ac.il
There is no fixed deadline, applications will be considered as they arrive
until the position is filled.
**********************************************************
*
* 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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
