Tuesday, December 20, 2022

[DMANET] PhD Position in Robust Automated Planning in collaboration with the Dutch railways

------------
PhD Position in Robust Automated Planning in collaboration with the Dutch railways

The Algorithmics group at TU Delft is looking for a talented computer science or mathematics master's graduate to join the research into planning algorithms and formal and learning-based methods in the group.

The challenge of this project is to support experts in automated planning systems, so that they could understand the algorithmic decisions, and to support their prompt reaction to real-world disruptions.

We believe in the hidden potential of synergies between formal and learning-based methods and envision the project to have both significant scientific and practical impact for the Dutch railways.

Apply here before February 19, 2023: https://www.academictransfer.com/en/321270/phd-position-in-robust-automated-planning-in-collaboration-with-dutch-railways/
------------

Please forward this announcement to potentially interested students.

Dr. Anna Lukina (she/her)
Assistant Professor
Delft Technology Fellow
www.annalukina.com
TU Delft | Algorithmics

**********************************************************
*
* 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, December 19, 2022

[DMANET] HALG 2023 -- Call for Nominations

Call for Invited Talk Nominations

8th Highlights of Algorithms conference (HALG 2023)

Charles University, Prague, June 2-4, 2023

The HALG 2023 conference seeks high-quality nominations for invited
talks that
will highlight recent advances in algorithmic research.
There are two categories of invited talks:

A. survey (60 minutes): a survey of an algorithmic topic that has seen
exciting developments in last couple of years.

B. paper (30 minutes): a significant algorithmic result appearing in a
paper in 2022 or later.

To nominate, please email raecke@in.tum.de the following information in
plaintext only:
* Basic details: suggested speaker and topic or paper name
* Brief justification: Focus on the benefits to the audience, e.g.,
quality of
results, importance/relevance of topic, clarity of talk, speaker's
presentation skills.

Nominations will be reviewed by the Program Committee to select speakers
that will be invited to the conference.
Nomination deadline: January 13, 2023

Please go to https://highlightsofalgorithms.org/ for general information
on HALG and for information about previous HALG meetings.

Harald Räcke
PC chair for HALG 2023
**********************************************************
*
* 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] PODC 2023: Final Call For Workshops & Tutorials

===============================================
PODC 2023: FINAL CALL FOR WORKSHOPS & TUTORIALS
===============================================

The 42th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed
Computing (PODC 2023) invites proposals for full-day and
half-day workshops and tutorials.
They will take place on Monday, June 19, and Friday, June 23, 2023,
Orlando, Florida

PODC 2023 will be part of the ACM Federated Computing Research Conference,
FCRC 2023.
In particular, it will be co-held with SPAA and STOC.

Website: https://www.podc.org
Twitter: https://twitter.com/podc_disc

===============================================
DATES
===============================================

Workshop/Tutorial proposal deadline: January 31, 2023, at 23:59 AoE.

The notification will be provided shortly after the proposal has been sent.

===============================================
INSTRUCTIONS
===============================================

The proposals should be sent by e-mail to the Workshop Chair, Alkida
Balliu <alkida.balliu@gssi.it>
A proposal should include:

- Title of the workshop or tutorial
- A description of the subject matter and why it would be of interest to
the PODC community
- Name(s) and contact information of the organizer(s)
- Proposed format (e.g., invited speakers only, or peer-reviewed papers
with proceedings, etc.)
- Length: half-day or full-day
- Date preference: June 19 or June 23
- Estimated number of speakers and attendees
- Link to previous editions of the same workshop (if applicable)


We will be accepting proposals until the end of January 2023. We cannot
guarantee to give consideration to proposals arriving after January 31 as
we will begin the process of setting the schedule soon after that point.

===============================================
SCOPE
===============================================

With regards to potential topics, we are looking for proposals related to
the current scope of PODC or are new emerging research fields complementing
or extending it, including but not restricted to:

- distributed algorithms: design, analysis, and complexity
- communication networks: algorithms, architectures, services,
protocols, applications
- multiprocessor and multi-core architectures and algorithms
- shared and transactional memory, synchronization protocols, concurrent
programming
- fault-tolerance, reliability, availability, self-organization,
self-stabilization
- codes and reliable communication
- Internet applications, social networks, recommendation systems
- dynamic, adaptive and machine learning-based distributed algorithms
- distributed operating systems, middleware platforms, databases
- game-theoretic approaches to distributed computing
- distributed mechanisms design
- peer-to-peer systems, overlay networks, distributed data management
- high-performance, cluster, cloud and grid computing
- wireless networks, mobile computing, autonomous agents and robots
- context-aware distributed systems
- security in distributed computing, cryptographic protocols
- distributed cryptocurrencies and blockchain protocols
- quantum and optics-based distributed algorithms
- nanonetworks
- biological distributed algorithms
- sensor, mesh, and ad hoc networks
- specification, semantics, verification of concurrent systems

**********************************************************
*
* 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] Juniorprofessor (W1) for Efficient Algorithms at University of Cologne

In the course of expanding the computer science division the
department Mathematics/Computer Science seeks to strengthen its
competences in the field of efficient algorithms. Possible but not
exclusive research areas include randomized algorithms, approximation
algorithms, sublinear algorithms and computational geometry.

YOUR PROFILE

We are looking for an internationally recognized researcher in the
area of development and analysis of efficient algorithms for discrete
problems. The successful candidate is interested in interdisciplinary
cooperations and actively contributes to the Computer Science
programme and also to the Mathematics and Economathematics programmes
of the department. Contribution to academic self administration is
expected.

OUR OFFER

The University of Cologne provides a stimulating academic environment
with a wide range of career development opportunities as well as
support services for dual career couples and familyfriendly working
conditions.
The position (of a Juniorprofessorin / Juniorprofessor) is available
as of the earliest possible date. Formal requirements are detailed in
Section 36 of the Higher Education Act of North Rhine-Westphalia
(Hochschulgesetz – HG NRW).
In the third year after entering into office, an interim evaluation is
held. This serves as the basis for the decision as to whether an
extension for a further three years will be granted to the candidate.
W1 professorships comprise a teaching load of four hours per week
(i.e., two hours per week is one 90-minute course per semester) in the
first qualification phase and five hours per week in the second
qualification phase.

The University of Cologne is committed to equal opportunities and
diversity. Women are especially encouraged to apply and will be
considered preferentially in accordance with the Equal Opportunities
Act of North Rhine-Westphalia (Landesgleichstellungsgesetz – LGG NRW).
We also expressly welcome applications from people with disabilities /
special
needs or of equal status.
Please submit your application via the University of Cologne's
Academic Job Portal (https://professorships.uni-koeln.de) by
January 31, 2023. Your application should be addressed to the Dean of
the Faculty of Mathematics and Natural Sciences.

**********************************************************
*
* 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 positions at MPI for Informatics, Germany

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

seeks several

PhD students

for the Algorithms and Complexity Department
[https://www.mpi-inf.mpg.de/departments/algorithms-complexity/]

directed by Danupon Nanongkai.

We are looking for applicants who are interested in theoretical research in algorithms and complexity, including related areas like mathematical optimization, distributed computing, and algorithm engineering.

Researchers of several nationalities work in the Algorithms and Complexity Department and our working language is English. The department is part of the Max Planck Institute for Informatics, located on the campus of Saarland University in Saarbrücken, Germany. We maintain close collaborations with algorithms and complexity researchers in other institutes on the campus, including the Department of Computer Science, CISPA Helmholtz Center for Information Security, and Max Planck Institute for Software Systems. The group collaborates with several major research institutions in Europe and the U.S. and has high international visibility. There is generous travel support available for all group members. The date for entering the PhD program is negotiable and could be as early as April 2023.

Successful candidates will join the International Max Planck Research School on Trustworthy Computing (IMPRS-TRUST), which is a graduate program jointly run by the Max Planck Institute for Informatics, the Max Planck Institute for Software Systems, Saarland University, and TU Kaiserslautern. The IMPRS-TRUST offers a PhD program upon successful completion of which students receive a Doctoral Degree in Computer Science from Saarland University. The program is open to students with a bachelor's or master's degree in computer science (or an equivalent degree). Successful candidates will typically have ranked at or near the top of their classes, have engaged in research, and be highly proficient in spoken and written English. Admitted students receive full funding to cover their living expenses and tuition fees.

Further information, including instructions on how to apply, can be found here: https://www.imprs-trust.mpg.de/

The current round of applications closes on 31 December 2022.

**********************************************************
*
* 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 position in theoretical quantum algorithms/complexity theory/photonics

Dear colleagues,
we have a PhD position in theoretical quantum algorithms/complexity theory/photonics available in the CS Department of Uni Paderborn, Germany, funded by BMBF project PhoQuant.
Link to ad: https://groups.uni-paderborn.de/fg-qi/data/Kennziffer5653_-_Englisch.pdf [https://groups.uni-paderborn.de/fg-qi/data/Kennziffer5653_-_Englisch.pdf]
Deadline: Jan 10, 2023
Please feel free to share with anyone who may be interested.
Best,
Sev

--
Sevag Gharibian, Ph.D.
Associate Professor
Department of Computer Science
Paderborn University, Germany
http://groups.uni-paderborn.de/fg-qi [http://groups.uni-paderborn.de/fg-qi]
@sevag_gharibian

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

Sunday, December 18, 2022

[DMANET] The 53rd IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2023)

The 53rd IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2023)
Porto, Portugal * June 27-30, 2023

https://dsn.org<https://dsn.org/>

The workshops at DSN'2023 will provide a forum for groups of researchers to discuss topics in dependability-related research and practice. DSN workshops can be on a quite diverse range of topics. Their purpose is to serve as incubators for scientific communities that form and share a particular research agenda. They also provide opportunities for researchers to exchange and discuss scientific ideas at an early stage before they have matured to warrant conference or journal publication.

=============
Important Dates

Submission deadline: Jan. 10, 2023
Notification to the organizers: Jan. 20, 2023

==========
List of Topics

DSN is interested in workshop topics that represent either complementary areas to the main conference or a large, active subarea. Topics from recent DSN workshops include (in alphabetical order):

Adaptive, Mobile, and Ubiquitous System Dependability
Analysis of Reliability and Security Data
Cellular Network Dependability
Clouds, Data Centers, Virtual Machines, and Containers' Dependability
Cyber-physical Systems Dependability
Dependability Assessment of Complex Systems
Dependable and Secure Nanocomputing
Dependability and Security of System Operation
Dependability Issues in Software-Defined Networks
Fault Tolerance for Extreme Scale Systems
Resilient Computing
Safety and Security of Intelligent Vehicles
Trustworthiness of Smart Grids
Blockchains
Distributed ledgers
Infrastructures for Machine Learning

=====================
Acceptance and Publication

Acceptance will be based on an evaluation of the workshop's potential for generating useful results, the timeliness of and expected interest in the topic, and the proposers' ability to lead a successful workshop.

Accepted workshops will have a two-page proceedings-format summary (generated by the workshop organizers) published in the Main Proceedings of the conference. Written contributions to the workshop itself (summaries, short papers, etc.) will be included in the supplement to the DSN Proceedings (DSN-W volume) and made available on IEEE Xplore. The workshop web pages will be linked through the main DSN website (www.dsn.org<http://www.dsn.org/>) and the call for papers will be advertised through the DSN mailing lists.

Organizers are expected to perform any additional advertising in related communities outside the main DSN community, create and maintain the workshop website, arrange for the collection and refereeing of submissions, and to coordinate the collection and delivery of camera-ready material and IEEE copyright transfers.

Please submit all workshop proposals by Jan. 10, 2023, preferably as a PDF file, via e-mail to workshops@dsn.org<mailto:workshops@dsn.org>.

Workshop proposers will be notified of the outcome of their submission by Jan. 20, 2023. The timelines for submissions to the accepted workshops will be communicated directly to the proposers.

================
Format of Proposals

A workshop proposal consists of a descriptive proposal that is not more than 4 pages in length and contains the following information:

* Title and description of the workshop including motivations, goals, and relevance to the dependability community.* Title and description of the workshop including motivations, goals, and relevance to the dependability community.

* Names and contact information of the organizers, including a brief statement on their background and past workshop experience.

* A description of the workshop planning processes, including the invitation and selection of participants, the refereeing of papers, a tentative program committee if available, and any other pre-workshop activities.

* A summary of the planned workshop activities including length of time (full day or half day), space required (i.e., room capacity), and the expected workshop outputs. The desired schedule, i.e., the approximate number of papers, invited talks, panels, and/or discussion sessions.

* Whether the workshop is new or an ongoing workshop. Information on past editions of the workshop (if applicable) including:

* History and frequency of the workshop

* Previous conference co-locations

* URLs, if available

* Approximate attendance (for each past edition)

* How papers were published (website, IEEE, ACM, etc.).

* Communities from which participation is expected

==================
WORKSHOP CHAIRS

Dan Dongseong Kim, University of Queensland, Australia
Elias P. Duarte Jr., Federal University of Parana, Brazil

CONTACT
For further information please send an email to workshops@dsn.org<mailto:workshops@dsn.org>


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

[DMANET] SEA 2023: Call for Papers

SEA 2023: 21st Symposium on Experimental Algorithms
Barcelona, July 24-26
https://www.sea2023.cs.upc.edu/

Submission deadline: January 29, 2023 (AoE)
Notification: March 15, 2023
Submission site: https://easychair.org/my/conference?conf=sea2023

SEA aims to attract papers from the Computer Science community, the
Operations Research/Mathematical Programming community and any other
scientific community that is concerned with the main theme of the
symposium, namely the role of experimentation and of algorithm engineering
techniques in the design and evaluation of algorithms and data structures.
Submissions should present significant contributions supported by
experimental evaluation, methodological issues in the design and
interpretation of experiments, the use of (meta-)heuristics, or
application-driven case studies that deepen the understanding of the
complexity of a problem.


*Topics of Interest*

Contributions solicited cover a variety of topics including but not limited
to:
-Algorithm Engineering
-Algorithmic Libraries
-Analysis of Algorithms
-Approximation Techniques
-Bioinformatics and Computational Biology
-Branch-and-Bound Algorithms
-Combinatorial and Irregular Problems
-Combinatorial Structures and Graphs
-Communication Networks
-Computational Geometry
-Computational Optimization
-Data Structures
-Distributed and Parallel Algorithms
-Heuristics for Combinatorial Optimization
-Information Retrieval
-Integer Programming
-Logistics and Operations Management
-Machine Learning and Data Mining
-Mathematical Programming
-Multiple Criteria Decision Making
-Network Analysis
-Online Problems
-Railway Optimization using Algorithmic Methods
-Semidefinite Programming
-Software Repositories and Platforms for using Algorithms
-Telecommunications and Networking

We further emphasize that SEA welcomes submissions that introduce novel
applications of algorithms in other disciplines.


*Submission Guidelines*

The authors should submit a paper not exceeding 12 pages, excluding the
bibliography, the front page (authors, affiliation, keywords, abstract,
...), and brief appendix of up to 5 pages (figures and tables should be
counted as part of the space occupied by the appendix).

At least a 10-point font should be used. Authors are strongly advised to
use the LaTeX style file supplied for the LIPIcs style (
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/).
Final proceedings papers must be camera-ready in this format. We emphasize
that a clearly marked Appendix of up to 5 pages, which will not count
toward the 12 page submission limit, can be included and will be read at
the referees' discretion. All submissions have to be made via the EasyChair
submission page for the conference.

Authors are strongly encouraged to include a link to the source code and/or
datasets to increase confidence in the reproducibility of their
experiments; the code may be read and/or executed at the referees'
discretion.

Papers submitted for review should represent original, previously
unpublished work or surveys of important results. At the time the paper is
submitted to SEA, and for the entire review period, the paper (or
essentially the same paper) should not be under review by any other
conference with published proceedings or by a scientific journal. At least
one author of each accepted paper will be expected to attend the conference
and present the paper.


*Proceedings*

The conference proceedings will be published in the Leibniz International
Proceedings in Informatics (LIPIcs,
https://www.dagstuhl.de/en/publications/lipics/), a series of high-quality
conference proceedings across all fields in informatics established in
cooperation with Schloss Dagstuhl Leibniz Center for Informatics. SEA
Proceedings volumes are published according to the principle of OpenAccess,
i.e., they are available online and free of charge.


*Committees*

Program Committee
-Hideo Bannai, Tokyo Medical and Dental University, Japan
-Gerth Brodal, Aarhus University, Denmark
-Kevin Buchin, Technische Universität Dortmund, Germany
-Mateus De Oliveira Oliveira, Stockholm University, Sweden and University
of Bergen, Norway
-Donatella Firmani, Sapienza University of Rome, Italy
-Loukas Georgiadis, University of Ioannina, Greece (chair)
-Andrew V. Goldberg, Amazon.com, East Palo Alto, USA
-Yan Gu, University of California, Riverside, USA
-Meng He, Dalhousie University, Canada
-Giuseppe Italiano, LUISS, Italy
-Spyros Kontogiannis, University of Patras, Greece
-Luigi Laura, Uninenettuno, Italy
-Leo Liberti, LIX CNRS, École Polytechnique, Institut Polytechnique de
Paris, France
-Matthias Mnich, TUHH - Hamburg University of Technology, Germany
-André Nusser, University of Copenhagen, Denmark
-Charis Papadopoulos, University of Ioannina, Greece
-Vicky Papadopoulou-Lesta, European University, Cyprus
-Nikos Parotsidis, Google Research, Switzerland
-Ignaz Rutter, University of Passau, Germany
-Stavros Sintos, University of Illinois at Chicago, USA
-Przemyslaw Uznanski, Pathway, Poland
-Renato Werneck, Amazon, USA
-Anthony Wirth, University of Melbourne, Australia
-Helen Xu, Lawrence Berkeley National Laboratory, USA

Organizing committee
-Maria J. Blesa, Universitat Politècnica de Catalunya
-Amalia Duch, Universitat Politècnica de Catalunya
-Guillem Rodríguez, Universitat Politècnica de Catalunya
-Maria J. Serna, Universitat Politècnica de Catalunya

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

Saturday, December 17, 2022

[DMANET] PhD Positions in Bielefeld and Paderborn in the new SFB TRR 358

Dear Colleagues,

I want to take the opportunity to let you all know that the DFG just
approved the new SFB-TRR 358 between the universities of Bielefeld and
Paderborn titled "Integral Structures in Geometry and Representation
theory".
Within this CRC there are several PhD and Postdoc positions available at
both universities.

I would like to in particular advertise a PhD position in Bielefeld within
project A7 "Matroids, codes and their q-analogues", co-advised by Prof.
Kai-Uwe Schmid and myself.
The application deadline is 10 January 2023 and further details are given
here:

https://uni-bielefeld.hr4you.org/job/view/2022/research-position?page_lang=en

Moreover, there is another PhD position in the field of algebraic
combinatorics in the project A3 "Codes and Design" advised by Prof. Kai-Uwe
Schmidt in Paderborn (application deadline 6 January 2023):

https://www.uni-paderborn.de/fileadmin/zv/4-4/stellenangebote/Kennziffer5648_-_Englisch.pdf

Candidates are welcome to contact us directly for further information.

All open positions of the CRC are collected on this website:

https://trr358.math.uni-bielefeld.de/JobOpenings

I would be grateful if you drew potential applicants' attention to it.

Many thanks and best wishes,

Lukas Kühne

**********************************************************
*
* 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, December 16, 2022

[DMANET] ScaDL 2023 - Call for Papers

Dear colleague,

apologize for multiple posting

ScaDL 2023: Scalable Deep Learning over Parallel And Distributed
Infrastructure - An IPDPS 2023 Workshop

https://2023.scadl.org<https://2023.scadl.org/>

Scope of the Workshop:
Recently, Deep Learning (DL) has received tremendous attention in the research
community because of the impressive results obtained for a large number of
machine learning problems. The success of state-of-the-art deep learning
systems relies on training deep neural networks over a massive amount of
training data, which typically requires a large-scale distributed computing
infrastructure to run. In order to run these jobs in a scalable and efficient
manner, on cloud infrastructure or dedicated HPC systems, several interesting
research topics have emerged which are specific to DL. The sheer size and
complexity of deep learning models when trained over a large amount of data
makes them harder to converge in a reasonable amount of time. It demands
advancement along multiple research directions such as, model/data
parallelism, model/data compression, distributed optimization algorithms for
DL convergence, synchronization strategies, efficient communication and
specific hardware acceleration.

SCADL seeks to advance the following research directions:
- Asynchronous and Communication-Efficient SGD: Stochastic gradient descent is
at the core of large-scale machine learning. Parallelizing SGD gradient
computation across multiple nodes increases the data processed per iteration,
but exposes the SGD to communication and synchronization delays and
unpredictable node failures in the system. Thus, there is a critical need to
design robust and scalable distributed SGD methods to achieve fast error-
convergence in spite of such system variabilities.
High performance computing aspects: Deep learning is highly compute intensive.
Algorithms for kernel computations on commonly used accelerators (e.g. GPUs),
efficient techniques for communicating gradients and loading data from storage
are critical for training performance.

- Model and Gradient Compression Techniques: Techniques such as reducing
weights and the size of weight tensors help in reducing the compute
complexity. Using lower-bit representations such as quantization and
sparsification allow for more optimal use of memory and communication
bandwidth.

- Distributed Trustworthy AI: New techniques are needed to meet the goal of
global trustworthiness (e.g., fairness and adversarial robustness) efficiently
in a distributed DL setting.

- Emerging AI hardware Accelerators: with the proliferation of new hardware
accelerators for AI such in memory computing (Analog AI) and neuromorphic
computing, novel methods and algorithms need to be introduced to adapt to the
underlying properties of the new hardware (example: the non-idealities of the
phase-change memory (PCM) and the cycle-to-cycle statistical variations).

- The intersection of Distributed DL and Neural Architecture Search (NAS): NAS
is increasingly being used to automate the synthesis of neural networks.
However, given the huge computational demands of NAS, distributed DL is
critical to make NAS computationally tractable (e.g., differentiable
distributed NAS).

This intersection of distributed/parallel computing and deep learning is
becoming critical and demands specific attention to address the above topics
which some of the broader forums may not be able to provide. The aim of this
workshop is to foster collaboration among researchers from distributed/
parallel computing and deep learning communities to share the relevant topics
as well as results of the current approaches lying at the intersection of
these areas.

Areas of Interest
In this workshop, we solicit research papers focused on distributed deep
learning aiming to achieve efficiency and scalability for deep learning jobs
over distributed and parallel systems. Papers focusing both on algorithms as
well as systems are welcome. We invite authors to submit papers on topics
including but not limited to:

- Deep learning on cloud platforms, HPC systems, and edge devices
- Model-parallel and data-parallel techniques
- Asynchronous SGD for Training DNNs
- Communication-Efficient Training of DNNs
- Scalable and distributed graph neural networks, Sampling techniques for
graph neural networks
- Federated deep learning, both horizontal and vertical, and its challenges
- Model/data/gradient compression
- Learning in Resource constrained environments
- Coding Techniques for Straggler Mitigation
- Elasticity for deep learning jobs/spot market enablement
- Hyper-parameter tuning for deep learning jobs
- Hardware Acceleration for Deep Learning including digital and analog
accelerators
- Scalability of deep learning jobs on large clusters
- Deep learning on heterogeneous infrastructure
- Efficient and Scalable Inference
- Data storage/access in shared networks for deep learning
- Communication-efficient distributed fair and adversarially robust learning
- Distributed learning techniques applied to speed up neural architecture
search


Workshop Format:
Due to the continuing impact of COVID-19, ScaDL 2023 will also adopt relevant
IPDPS 2023 policies on virtual participation and presentation. Consequently,
the organizers are currently planning a hybrid (in-person and virtual) event.

Submission Link:
Submissions will be managed through linklings. Submission link available at:
https://2023.scadl.org/call-for-papers

Key Dates
Paper Submission: January 29th, 2023
Acceptance Notification: February 26th, 2023
Camera ready papers due: March 7th, 2023
Workshop Date: May 19th, 2023

Author Instructions
ScaDL 2023 accepts submissions in two categories:
- Regular papers: 8-10 pages
- Short papers/Work in progress: 4 pages
The aforementioned lengths include all technical content, references and
appendices.
We encourage submissions that are original research work, work in progress,
case studies, vision papers, and industrial experience papers.
Papers should be formatted using IEEE conference style, including figures,
tables, and references. The IEEE conference style templates for MS Word and
LaTeX provided by IEEE eXpress Conference Publishing are available for
download. See the latest versions at
https://www.ieee.org/conferences/publishing/templates.html

General Chairs
Kaoutar El Maghraoui, IBM Research AI, USA
Daniele Lezzi, Barcelona Supercomputing Center, Spain

Program Committee Chairs
Misbah Mubarak, NVIDIA, USA
Alex Gittens, Rensselaer Polytechnic Institute (RPI), USA

Publicity Chairs
Federica Filippini, Politecnico di Milano, Italy
Hadjer Benmeziane, Université Polytechnique des Hauts-de-France

Web Chair
Praveen Venkateswaran, IBM Research AI, USA

Steering Committee
Parijat Dube, IBM Research AI, USA
Vinod Muthusamy, IBM Research AI, USA
Ashish Verma, IBM Research AI, USA
Jayaram K. R., IBM Research AI, USA
Yogish Sabharwal, IBM Research AI, India
Danilo Ardagna, Politecnico di Milano, Italy

**********************************************************
*
* 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] APPLICATIONS OF METAHEURISTICS TO LARGE-SCALE PROBLEMS

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in the
special session (workshop) on
"APPLICATIONS OF METAHEURISTICS TO LARGE-SCALE PROBLEMS" at the 13th
International Conference on
Large Scale Scientific Computation - LSSC'23, June 05 - 09, 2023, Sozopol,
Bulgaria,
with arrival: June 04 and departure: noon June 09.

The session is organized by:
Prof. Stefka Fidanova (stefka.fidanova@gmail.com)
from the Institute of Information and Communication Technologies, Bulgarian
Academy of Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Topics

The list of topics includes, but is not limited to:

combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms,
ant colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing techniques
and
other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics, finance,
physics, medicine, biology, engineering etc

Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a
special volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2023
Notification of acceptance of the talks on the basis of the submitted
abstract
January 31, 2023
Deadline for registration
March 01, 2023
Deadline for submission of full papers
March 01, 2023
Notification of acceptance of full papers
April 15, 2023


Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the results)
are to be written in standard LaTeX.
The length of the contributed papers is limited to 8 pages. It is assumed
that ONE participant
will present not more than ONE talk.

Send the abstracts and papers to special session organizers and conference
organizers,
indicating the name of the special session.
After sending the abstract go to the conference web page and fill in the
registration form (personal data of the participants, minimum one per
paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation,
registration form and conference location you can find at the conference
web page http://parallel.bas.bg/Conferences/SciCom23/


Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

**********************************************************
*
* 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] Assistant/Associate Professor Position in Combinatorial Optimization at Eindhoven University of Technology

The Combinatorial Optimization (CO) Group at Eindhoven University of Technology (TU/e) is looking for a full-time tenure-track assistant/associate professor in Combinatorial Optimization.

The vacancy can be found at https://jobs.tue.nl/en/vacancy/assistant-associate-professor-in-combinatorial-optimization-971771.html

This position is part of the Irène Curie fellowship program dedicated to reach at least 30% female researchers among TU/e's permanent academic staff by 2024 and is only open for female candidates.

Eindhoven University of Technology is an internationally top-ranking university in the Netherlands that combines scientific curiosity with a hands-on attitude. Our spirit of collaboration translates into an open culture and a top-five position in collaborating with advanced industries. Fundamental knowledge enables us to design solutions for the highly complex problems of today and tomorrow.

Research at the CO group spans a wide range of topics, including mathematical programming, polyhedral combinatorics, algebraic combinatorics, matroids, scheduling, graph theory and algorithms, approximation, (mathematics of) operations research, and more. Also, we study applications that range from data science via kidney exchange models to fairness, and more. As a new faculty member, you will strengthen the research in one of these existing topics and/or you will expand CO's research portfolio.

We expect the following qualifications:
- A PhD in mathematics, computer science, operations research or a comparable domain.
- Ability to conduct high-quality academic research reflected in tangible outputs.
- Ability to teach, demonstrated by experience or assistance in teaching.
- Motivation for setting up collaborations and acquiring research funds.
- Good communications skills and good command of English; candidates need not speak Dutch.

We offer a meaningful job in a dynamic and ambitious university, in an interdisciplinary setting and within an international network. You will work on a beautiful, green campus within walking distance of Eindhoven city center. In addition, we offer you:

- A Tenure Track of five years with the prospect of becoming an Associate Professor. If you have a more senior profile, a tailor-made career proposal will be considered.
- The opportunity to focus your career on education, research or impact. You can develop your personal ambitions and objectives within the strategic goals of the university.
- As an Irène Curie Fellow, you are entitled to a substantial start-up package to kick-off your career.
- A salary that is in accordance with the Collective Labour Agreement for Dutch Universities.
- A year-end bonus of 8.3% and annual vacation pay of 8%.
- A dedicated mentoring program to help you get to know the university and the Dutch (research) environment.
- High-quality training programs for academic leadership and teaching.
- An excellent technical infrastructure, on-campus children's day care and sports facilities.
- Partially paid parental leave and an allowance for commuting, working from home and internet costs.
- A Staff Immigration Team is available for international candidates, as are a tax compensation scheme (the 30% facility) and partner career support.


Do you recognize yourself in this profile and would you like to know more? Please contact prof. dr. Frits Spieksma, f.c.r.spieksma[at]tue.nl or Dr. Aida Abiad, a.abiad.monge[at]tue.nl

Visit our website for more information about the application process (https://www.tue.nl/en/working-at-tue/why-tue/application-process/). You can also contact Hella Ploegmakers, Senior Recruiter, h.a.m.ploegmakers[at]tue.nl or +31 6 43559625.


We invite you to submit a complete application at https://jobs.tue.nl/en/vacancy/assistant-associate-professor-in-combinatorial-optimization-971771.html.

The application should include:

- A cover letter in which you describe your motivation and qualifications for the position.
- A Curriculum vitae, including a list of your publications and the contact information of three references.
- A research statement (1-2 pages).
- A teaching statement (1-2 pages).

We look forward to receiving your application and will screen it as soon as possible! The vacancy will remain open 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] Assistant Professors in Computer Science at Aalto University, Finland

The Department of Computer Science at Aalto University – in the top 20 young universities worldwide – invites applications for tenure-track positions at the assistant professor level. We welcome applications in ALL AREAS of computer science. Women and others underrepresented in computer science are especially encouraged to apply.

The Department of Computer Science (https://www.aalto.fi/en/department-of-computer-science) is home to world-class research in modern computer science, combining research on foundations and innovative applications. An international community with 46 professors and more than 400 employees from 50 countries, it is the largest department at Aalto University and the largest computer science unit in Finland. The department consistently ranks high in global rankings, for example, the first in Nordic countries and Northeastern Europe and the 73rd overall in Times Higher Education ranking for 2023.

For more information and the application form visit:
https://www.aalto.fi/en/open-positions/assistant-professors-computer-science

For more information on our CS Theory group, see:
https://research.cs.aalto.fi/theory/

The call is open until January 15, 2023.


**********************************************************
*
* 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] CIMPA Research School on Graph Structure and Complex Network Analysis - June 4-16, 2023 - Turkey

Dear colleagues and students,

CIMPA Research School on Graph Structure and Complex Network Analysis will
take place at the Nesin Mathematics Village
<https://nesinkoyleri.org/en/nesin-villages/> , Şirince, İzmir, Turkey on
June 4-16, 2023. The school website is:
https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/

Registration is open at https://application.cimpa.info until February 21,
2023. Application for financial support for students from emerging countries
can be made on the registration website. Please, encourage your PhD students
and postdocs to participate and help us to spread the word.

We will offer 9 lectures on two main axes:

1. Exploiting graph structure to efficiently solve combinatorial problems

2. Extending graph structural analysis to complex network studies

Lectures

Martin Milanic <https://osebje.famnit.upr.si/~martin.milanic/> (University
of Primorska, Slovenia): Fragments of domination theory in graphs --
invariants, interrelations, and algorithmic aspects
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/MartinMilanic-Fragme
ntsOfDominationTheoryInGraphs.pdf
>

Tina Eliassi-Rad <http://eliassi.org/> (Northeastern University, USA):
Geometric and Topological Graph Analysis for Machine Learning Applications
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/TinaEliassiRad-Geome
tric%20and%20Topological%20Graph%20Analysis%20for%20Machine%20Learning%20App

lications.pdf>

Bernard Ries <https://www.unifr.ch/inf/dsor/en/group/bernard-ries.html>
(Université de Fribourg, Switzerland): Modifying Graph Parameters via Graph
Operations
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/BernardRies-Modifyin
gGraphParametersViaGraphOperations.pdf
>

Didem Gözüpek <https://bilmuh.gtu.edu.tr/~dgozupek/> (Gebze Technical
University, Turkey): Dominating Sequences in Graphs
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/DidemGözüpek-Dominat
ingSequencesInGraphs.pdf
>

Ernesto Estreda <https://sites.google.com/view/ernestoestrada> (IFISC,
Palma de Mallorca, Spain): Diffusive Models on Graphs and Networks
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/ErnestoEstrada-Diffu
siveModelsOnGraphsAndNetworks.pdf
>

Clémence Magnien <https://lip6.fr/Clemence.Magnien/> (LIP6, Paris, CNRS,
France): Algorithms for the Analysis of Interaction Streams
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/ClemenceMagnien-Algo
rithmsForTheAnalysisOfInteractionStreams.pdf
>

Christophe Crespelle <https://perso.ens-lyon.fr/christophe.crespelle/>
(University Claude Bernard, Lyon, France): Algorithmic Techniques for Edge
Modification Problems
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/ChristopheCrespelle-
AlgorithmicTechniquesForEdgeModificationProblems.pdf
>

Joanna Raczek <https://mostwiedzy.pl/pl/joanna-raczek,19024-1> (Gdansk
University of Technology, Poland): Domination Parameters in Graphs
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/JoannaRaczek-Dominat
ionParametersInGraphs.pdf
>

Fabio Furini <https://www.researchgate.net/profile/Fabio-Furini> (Sapienza
Università di Roma, Italy): Integer Programming Formulations and Exact
Algorithms for Hard Combinatorial Optimization Problems on Graphs
<https://bilmuh.gtu.edu.tr/~dgozupek/cimpa2023/lectures/FabioFurini-IntegerP
rogrammingFormulations.pdf
>

Organizing Committee:

Tınaz Ekim, BoÄŸaziçi University, TR (local coordinator)

Bertrand Jouve, Centre National de la Recherche Scientifique, FR (external
coordinator)

Didem Gözüpek, Gebze Technical University, TR

Afshin Behmaram, Tabriz University, IRAN

Aslı Can Korkmaz, Nesin Mathematics Village, TR

-------------------------------------

Tınaz Ekim, PhD

BoÄŸaziçi University

Department of Industrial Engineering

34342, Bebek-İstanbul, Turkey

<http://www.ie.boun.edu.tr/~tinaz> http://www.ie.boun.edu.tr/~tinaz

<https://twitter.com/tinazekim> https://twitter.com/tinazekim

Tel : + 90 (212) 359 66 76

-------------------------------------

**********************************************************
*
* 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, December 15, 2022

[DMANET] Research Associate in Green Maritime Transport

Dear Colleagues,

We are looking for a Research Associate to work on an interdisciplinary research project on clean maritime transport with multiple academic and industrial partners, funded by Department for Transport (DfT) through Innovate UK.

The post is full-time at the Centre for Logistics and Heuristics Optimisation (CLHO) at Kent Business School and will have a duration of up to 8 months, with potentials for further extension. Part-time applications and remote/hybrid work options may be also considered.

Applicants with background in Operational Research, Management Science, Business Analytics, Mathematics, Energy Systems, Management Engineering, Economics, Transport Engineering, Energy Management, Electrical Engineering or other related fields are invited to apply.

To see more details about the role, click on the link below and get in touch if you have any questions:

https://jobs.kent.ac.uk/Vacancy.aspx?id=5661&forced=1

All the best,
Ramin


Dr Ramin Raeesi | Senior Lecturer in Management Science
Director of the Centre for Logistics and Heuristic Optimisation (CLHO)
Department of Analytics, Operations & Systems, Kent Business School, University of Kent
Room M3-17, Medway Building
University of Kent, Chatham Maritime,
ME4 4AG, UK
Tel: +44 (0)1634888487

**********************************************************
*
* 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] Conference Ann. and Call: Albany, New York Apr. 28-30, 2023 Women in Alg. and Combinatorics, NE Conf. AWM...

Dear Colleagues,

The Department of Mathematics at the State University of New York at Albany, in cooperation with the Association for Women in Mathematics, is organizing the following event:

Women in Algebra and Combinatorics. Northeast Conference Celebrating the Association for Women in Mathematics: 50 Years and Counting.

The conference will take place on the SUNY Albany campus between April 28-30, 2023. It follows the related online event on November 20-21, 2021. See the conference website for more details, including about possible funding:

https://www.albany.edu/~sdc/AWM21/

We are currently soliciting titles and abstracts for poster presentations. Please use the submission form on the above website.

With best regards, and happy holidays!

Seth Chaiken, Laura Colmenarejo, Cristian Lenart, Antun Milas, Karin Reinhold, Lauren Rose, Changlong Zhong


**********************************************************
*
* 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] RAMOO 2023 Workshop - Rome, September 14th 2023 - Call for Registration

Dear colleagues,

We are pleased to announce the *RAMOO 2023, *the annual workshop on *"Recent
Advances in Multi-Objective Optimization" *at its 10th edition.

*RAMOO 2023* will take place at the* Department of Statistical Sciences of
Sapienza University of Rome, *on *14th September 2023*.


Keynote talks will be given by:


Matthias Ehrgott <https://www.lancaster.ac.uk/lums/people/matthias-ehrgott>,
Lancaster University

*Gabriele Eichfelder*
<https://www.tu-ilmenau.de/mmor/team/gabriele-eichfelder/>, Technical
University Ilmenau

*Registration is free of charge* *but required* in order to attend the
workshop.

*Registration* is now possible by filling in *this Google form.*
<https://docs.google.com/forms/d/e/1FAIpQLSdnaBKaidziDbnKcZOzlCDXjXTPe_lk-vC2tMIslfQ3t7i4YA/viewform?usp=sf_link>


Registration closes on July 14th 2023.

The event and further info (detailed program, social event, etc.) will be
also published on the RAMOO 2023 website (https://moo.univie.ac.at)

We hope you will be able to join us!


The organizing committee:

Lavinia Amorosi (Sapienza University of Rome)

Marianna De Santis (Sapienza University of Rome)

--
Lavinia Amorosi
PhD
Dipartimento di Scienze Statistiche
Universita' di Roma -- La Sapienza
P.le Aldo Moro, 5
00185 - Rome, Italy
e-mail: lavinia.amorosi@uniroma1.it

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

[DMANET] Call for Postdoctoral Fellows in the Foundations of Quantum Computing & Cryptography at SFU

Location: Simon Fraser University (SFU), Department of Mathematics
Project lead: Nadish de Silva

At SFU, we seek to fill a postdoctoral position. The selected candidate will work on foundational questions of quantum computation such as: precisely how, and for which class of problems, is quantum advantage achieved? The position is open to a researcher in quantum computation with strong mathematical abilities or to a mathematical researcher interested in quantum computation.

Our team is an interdisciplinary and international consortium that seeks to make foundational advances in the understanding and development of quantum computing. Our view is that the future success of quantum computing critically depends on advances at the most fundamental level, and that large-scale investments in quantum implementations will only pay off if they can draw on additional foundational insights and ideas. While several powerful quantum algorithms are known, the basic techniques they employ are few and far between. Largely, it still remains to be discovered how to systematically harness the quantum for computation.

Within quantum computation, the topics covered will include fault-tolerant quantum computation, classical simulation algorithms of quantum circuits, and nonlocality/contextuality. Mathematical techniques will potentially be drawn from abstract algebra, functional analysis, representation theory, number theory, and logic. (Experience in all these topics is not a prerequisite for applying.

Fellows will benefit from integration into a team of Canada-wide and international scientists. The position offers a highly competitive salary and travel budget. We strive to promote equity, diversity, and inclusion in all our activities.

Target start date: ASAP
Duration: 3 years, renewable yearly
Applications are considered on a continuous basis until the position is filled. Apply ASAP.

Please see the following link for further information and instructions for applications: https://www.sfu.ca/~ndesilva/postdoc/


**********************************************************
*
* 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] ICFCA 2023 - Call for Workshops and Tutorials

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


ICFCA 2023

17th International Conference on Formal Concept Analysis

July 17-21, 2023, Kassel, Germany

Web: https://www.kde.cs.uni-kassel.de/icfca2023/
Mail: icfca2023@lists.cs.uni-kassel.de

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


# Call for Workshops and Tutorials

The ICFCA 2023 Organizing Committee invites proposals for
workshops/tutorials to be held on the first day of the conference (July
17, 2023), which will take place in Kassel, Germany. We invite proposals
for both **full- and half-day workshops/tutorial** in current and
emerging topics in (or related to) Formal Concept Analysis. The workshop
and tutorials provide an opportunity to discuss novel topics in an
interactive atmosphere. They can concentrate in-depth on research
topics, but can also be devoted to application issues.

ICFCA 2023 will be a hybrid conference with a strong emphasis on on-site
interaction. Therefore all contributors are required to present their
work locally in Kassel.

# Duration & format

We welcome both full- and half-day workshop/tutorial proposals. We would
like to encourage proposers to aim for a program that is both varied and
interesting. For workshops, especially where the format is concerned, we
would like you to think about ways of going beyond the usual list of
presentations of accepted papers. Another way of extending the usual
format is to include a specific challenge problem that can be addressed
by the workshop participants, with a dedicated challenge session in the
workshop program. Note, however, that the challenge should be only one
of the components of the workshop, targeting a problem which is specific
to the workshop topic(s).

# Combined Tutorial & Workshop

Especially for a relatively novel but rapidly maturing topic, giving an
introduction of the state-of-the-art may go beyond the scope of an
invited presentation. In this case, a half day tutorial followed by a
half day workshop could be a good format.

# Guidelines for proposals

When proposing a workshop or a tutorial, please provide (at least) the
following information:
- A brief description of
  - the specific issues that will be addressed,
  - the reasons why the workshop/tutorial is of interest in these times,
  - the main research areas involved,
  - and what the workshop/tutorial will add to the conference (e.g., do
you expect papers of a theme that would not fit the main conference?).
- For workshops,
  - a draft of the Call for Papers, including information on accepted
formats (e.g., regular papers, extended abstracts, oral-only
presentations of relevant recently published or submitted contributions,
etc.)
  - and expected format of the workshop (e.g., invited talks,
presentations, poster sessions, panel discussions, challenge sessions,
or other ideas for ensuring an interactive atmosphere).
  - In the case of a combined tutorial-workshop, please clearly
indicate the format.
- Any special requirements regarding logistics (e.g., poster stands,
audio equipment), if applicable.

# Submission
For applying or if you have any questions, please do not hesitate to
contact the Program Chairs Domingo López Rodríguez and Dominik
Dürrschnabel: icfca2023@lists.cs.uni-kassel.de. We are looking forward
to your proposals.

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

Wednesday, December 14, 2022

[DMANET] ICPP 2023 - Call for Workshop Proposals

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

Call for Workshop Proposals at the ICPP 2023 Conference

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

52nd International Conference on Parallel Processing

https://icpp23.sci.utah.edu/

Parallel and distributed computing is a central topic in science,
engineering, and societal applications. ICPP, the International Conference
on Parallel Processing, provides a forum for engineers and scientists in
academia, industry, and government to exchange ideas and present results of
state-of-the-art research in all aspects of parallel and distributed
computing.

The Workshop Committee of ICPP 2023 welcomes proposals for half or full-day
workshops to be held at ICPP 2023 on topics of interest to ICPP 2023
attendees. The purpose of these workshops is to create opportunities for
presenting novel ideas on specific topics of interest, creating a
specialized forum that may open new opportunities for collaboration and
discussion.

ICPP 2023 will be held in Salt Lake City, Utah, from August 7th to 10th,
2023. Unless the pandemic worsens, the conference will be held in an
in-person format.

Workshop organizers will be responsible for advertising the workshop,
forming the program committees, reviewing and selecting the papers, and
guaranteeing a high quality worthy of the prestige and breadth of the
conference. All papers accepted for workshops will be included in the
Workshop Proceedings published by ACM. Workshops should cover at least a
single session (4 regular papers presented at the workshop). Workshop
organizers should ensure the registration and presence of authors of
accepted papers.


Important Dates

• Workshop proposal submissions: January 16th, 2023

• Workshop proposal notifications: January 27th, 2023


Workshop proposal guidelines

Proposals should be written in English and include the following
information:

1. Title/Acronym for the workshop;

2. Short biography of the workshop organizers (5-10 lines);

3. Abstract on the workshop theme;

4. Discussion of the topic's relevance and workshop goals;

5. A description of the target audience;

6. Expected length (half-day or full-day);

7. Publicity plan for attracting submissions;

8. If applicable, details on previous instantiations of the workshop;

9. Tentative list of PC members with their respective affiliations.

The ICPP Workshop Committee will evaluate workshop proposals. The decision
will be made based on the overall quality of the proposal and its match
with the topics of interest to ICPP 2023.


Workshop Proposal Submission

Workshop proposals (in pdf format) should be sent by email to one of the
workshop chairs, Veronika Sonigo <veronika.sonigo@univ-fcomte.fr> or Daniel
Cordeiro <daniel.cordeiro@usp.br>.

Please do not hesitate to contact us for any inquiries.

Daniel Cordeiro (University of São Paulo, Brazil)

Veronika Rehn-Sonigo (FEMTO-ST Institute, University of Franche-Comté,
France)


--
Prof. Dr. Daniel Cordeiro
School of Arts, Sciences and Humanities
University of São Paulo
http://www.each.usp.br/dc/

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