Please distribute as appropriate, and excuse if you receive multiple copies.
STRING PROCESSING AND COMBINATORIAL ALGORITHMS
a topical issue of Springer Nature Computer Science
ISSN: 2662-995X (Print) 2661-8907 (Online)
Web: https://link.springer.com/journal/42979/topicalCollection/AC_2e871b9b3ae6da50ff307bf47a6d9f87<https://link.springer.com/journal/42979/topicalCollection/AC_2e871b9b3ae6da50ff307bf47a6d9f87>
Aims and scope
The Topical Issue on String Processing and Combinatorial Algorithms aims to facilitate communication between researchers in theoretical computer science who are concerned with the design and analysis of combinatorial algorithms and data structures, especially covering research in all aspects of string processing, information retrieval, computational biology, and related applications.
The Topical Issue welcomes original papers in the area of string processing and in all areas of finite and discrete algorithm analysis and design, also from an empirical perspective, encouraging original submissions that focus on design, implementation, and performance evaluation through a combination of experimentation and classical techniques.
The purpose of this Topical Issue is the presentation and design of new algorithms and data structures, new analysis or comparisons of known algorithms and well-focused review articles of currently-active subject areas. However the Topical Issue also accepts high quality surveys and tutorials that integrate the existing literature and efficaciously put its results in context, aiming on integrating and adding understanding to the existing literature. The Topical Issue on String Processing and Combinatorial Algorithms intends to maintain high quality standards, an openness to all approaches to the subject, a transparent reviewing policy, and a minimal delay between submission and publication.
Guest Editor
Simone Faro, University of Catania, Italy
SN Computer Science is now Indexed in Scopus
All the articles published in the topical issue will be indexed in Scopus.
For more information visit: https://www.springer.com/journal/42979/updates/20207044 <https://www.springer.com/journal/42979/updates/20207044>
Submission
Submission are open (with no deadline)
All submissions should follow the instructions available at https://www.springer.com/journal/42979/submission-guidelines <https://www.springer.com/journal/42979/submission-guidelines>
Submission Link: https://www.editorialmanager.com/sncs/default.aspx <https://www.editorialmanager.com/sncs/default.aspx>
Submission process: At the time of article submission, please select the Topical Issue "String Processing and Combinatorial Algorithms". This Topical Issue section can be found under the "Additional Information" Section.
You can find additional informations at: https://www.dmi.unict.it/faro/spca.php <https://www.dmi.unict.it/faro/spca.php>
**********************************************************
*
* 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 14, 2023
[DMANET] University of Waterloo: MATH Prestigious Postdoc position in the Dept. of Combinatorics & Optimization (C&O)
PRESTIGIOUS PDF IN MATH/CO
The Faculty of Mathematics at the University of Waterloo invites applications from outstanding qualified candidates for two, 2-year, prestigious postdoctoral fellowship (PDF) positions. Applications are solicited from candidates in any of the research areas of the Department of Combinatorics & Optimization: Algebraic Combinatorics, Discrete Optimization, Continuous Optimization, Cryptography, Graph Theory, and Quantum Computing.
A Ph.D. degree and evidence of excellence in research are required. Successful applicants are expected to maintain an active program of research. The annual salary for the position is $75,000, and, in addition, a research stipend of $15,000 per year is provided.
Interested individuals should apply using the MathJobs site (https://www.mathjobs.org). Applications should include a cover letter describing their interest in the position including names of faculty members the applicant would like to work with, a curriculum vitae, research statement, and at least three reference letters.
The deadline for applications is Jan 2, 2024.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Indigenous Initiatives Office (https://uwaterloo.ca/indigenous).
The University values the diverse and intersectional identities of its students, faculty, and staff. The University regards equity and diversity as an integral part of academic excellence and is committed to accessibility for all employees. The University of Waterloo seeks applicants who embrace our values of equity, anti-racism and inclusion. As such, we encourage applications from candidates who have been historically disadvantaged and marginalized, including applicants who identify as Indigenous peoples (e.g., First Nations, Métis, Inuit/Inuk), Black, racialized, people with disabilities, women and/or 2SLGBTQ+.
The University of Waterloo is committed to accessibility for persons with disabilities. If you have any application or workplace accommodation requests, or have questions regarding the position, application process, assessment process, or eligibility, please contact combopt@uwaterloo.ca, or Chaitanya Swamy, Chair, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1.
All qualified candidates are encouraged to apply; however, Canadians and permanent residents will be given priority.
Three reasons to apply: https://uwaterloo.ca/faculty-association/why-waterloo.
**********************************************************
*
* 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] 2nd Call for nominations for the 2024 Beale — Orchard-Hays Prize
2nd Call for nominations for the 2024 Beale — Orchard-Hays Prize
Nominations are hereby invited for the 2024 Beale — Orchard-Hays Prize for Excellence in Computational Mathematical Programming. The prize is sponsored by the Mathematical Optimization Society, in memory of Martin Beale and William Orchard-Hays, pioneers in computational optimization. It is awarded to the authors of work that exemplifies excellence in this field, with a formal presentation ceremony at the International Symposium on Mathematical Programming (ISMP), July 21-26 in Montreal, Canada.
Nominated works must have been appeared in the open literature between January 1, 2018 and December 31, 2023, and may demonstrate excellence in any aspect of computational optimization, including the development of high-quality optimization algorithms and software, the experimental evaluation of optimization algorithms, and the development of new methods for the empirical testing of optimization techniques. Full details of prize criteria and eligibility may be consulted here<
https://www.mathopt.org/?nav=boh>.
The members of the 2024 Beale — Orchard-Hays Prize committee are:
* Jonathan Eckstein, (Chair) Rutgers University, USA
* Serhat Aybat, Pennsylvania State University, USA
* Hande Benson, Drexel University, USA
* Daniel Bienstock, Columbia University, USA
* Hans Mittelmann, Arizona State University, USA
* Paulo J. S. Silva, University of Campinas, Brazil
* Lars Schewe, University of Edinburgh, UK
Nominations should provide publication details, a short summary of the nominated paper, and a case for awarding the prize. The paper's final published version should be included as an attachment. The prize committee may choose to request further supporting material and justification from the nominees.
The deadline for nominations is January 5, 2024.
Nominations should be submitted to Jonathan Eckstein, jeckstei@business.rutgers.edu<mailto:jeckstei@business.rutgers.edu>. The nominating materials should clearly indicate the return addresses to be used for confirmation and further correspondence.
Previous winners of the Beale — Orchard-Hays Prize are listed here<https://www.mathopt.org/?nav=boh#winners>. Further information about the Beale — Orchard-Hays Prize may be found here<https://www.mathopt.org/?nav=boh>.
The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th' ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.
**********************************************************
*
* 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] 3rd Call for Papers SWAT 2024; moved deadline
3rd Call for papers: 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024
June 12 - 14, 2024, Helsinki, Finland
Conference webpage: swat2024.github.io/website/
Paper submission deadline: February 7, 2024 (AoE, anywhere on earth)
On request, the deadline was moved from Februari 1 to February 7
SWAT (Scandinavian Symposium on Algorithm Theory), which alternates with the Algorithms and Data Structures Symposium (WADS), is a forum for researchers in the area of design and analysis of algorithms and data structures.
We invite submissions of papers presenting original research on algorithms and data structures. Though we welcome experiments, the theoretical results in the articles will be the main measure for evaluating their merits.
Algorithmic approaches of interest include, but are not limited to: approximation algorithms, parameterized algorithms, distributed algorithms, parallel algorithms, external-memory algorithms, data structures, exponential time algorithms, online algorithms, randomized algorithms, streaming algorithms, sub-linear algorithms. The algorithmic problems considered may be motivated by applications, e.g. in optimization, geometry and topology, graph analysis, bioinformatics, visualization, string processing, information retrieval, machine learning, algorithmic game theory, or mechanism design.
Contributors must submit their papers using the Easychair system. Submissions should be in LIPIcs format (without font size, margin, or line spacing changes), and not exceed 15 pages including front page and references. See www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren for instructions. Additionally, if full details of proofs do not fit into the page limit, a clearly marked appendix containing the remaining details must be included; this appendix will not be regarded as part of the submission and will be considered only at the discretion of the program committee. Submissions deviating substantially from this format risk rejection without consideration of their merits.
Papers submitted for review should represent original, previously unpublished work. At the time the paper is submitted to the symposium, and for the entire review period, the paper (or essentially the same paper) must not be under review by any other conference with published proceedings or by a scientific journal. However, we encourage authors to make a preprint of their paper available at a public repository such as arXiv. At least one author of every accepted paper is expected to register and present the paper at the symposium. Symposium proceedings will be published in the "Leibniz International Proceedings in Informatics" (LIPIcs) series. A prize will be awarded to the author(s) of the best student-authored paper. A paper is eligible if all of its authors are full-time students at the time of submission. This must be indicated in the paper in the submission process.
Important Dates:
Paper submission deadline: February 1, 2024 (AoE, anywhere on earth)
Notification of acceptance: April 2, 2024
Conference: June 12 - 14, 2024
Invited speakers:
Karen Aardal, Technical University Delft, the Netherlands
Greg Bodwin, University of Michigan, US
Michał Pilipczuk, University of Warsaw, Poland
Committees:
Program Committee:
Anders Aamand, MIT, US
Ahmad Biniaz, University of Windsor, Canada
Hans Bodlaender, Utrecht University, the Netherlands (chair)
Flavia Bonomo, University of Buenos Aires, Argentina
Kevin Buchin, Technical University Dortmund, Germany
Pål Grønås Drange, University of Bergen, Norway
Franziska Eberle, Technische Universität Berlin, Germany
Klim Efremenko, Ben Gurion University, Israel
Gramoz Goranci, University of Vienna, Austria
Kazuo Iwama, National Tsing Hua University, Taiwan
Matthew Johnson, Durham University, UK
Matthew Katz, Ben Gurion University, Israel
Jan Kratochvíl, Charles University, Czech Republic
Stefan Kratsch, Humboldt-Universität zu Berlin, Germany
Łukasz Kowalik, University of Warsaw, Poland
Anil Maheshwari, Carleton University, Canada
George B. Mertzios, Durham University, UK
Yoshio Okamoto, The University of Electro-Communications, Japan
Yota Otachi, Nagoya University, Japan
Sang-il Oum, Institute for Basic Science / KAIST, Korea
Sharath Raghvendra, NCSU, US
Laura Sanita, Bocconi University of Milan, Italy
Subhash Suri, University of California, Santa Barbara, US
Ioan Todinca, University of Orleans, France
Jara Uitto, Aalto University, Finland
Tandy Warnow, University of Illinois at Urbana - Champaign, US
Prudence Wong, University of Liverpool, UK
Meirav Zehavi, Ben Gurion University, Israel
Organizing committee
Jara Uitto Aalto University, Finland (co-chair)
Sándor Kisfaludi-Bak Aalto University, Finland (co-chair)
Alexandru Paler Aalto University, Finland (co-chair)
Contact:
All questions about submissions should be emailed to the PC chair:
Hans Bodlaender (h.l.bodlaender at uu.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/
*
**********************************************************
June 12 - 14, 2024, Helsinki, Finland
Conference webpage: swat2024.github.io/website/
Paper submission deadline: February 7, 2024 (AoE, anywhere on earth)
On request, the deadline was moved from Februari 1 to February 7
SWAT (Scandinavian Symposium on Algorithm Theory), which alternates with the Algorithms and Data Structures Symposium (WADS), is a forum for researchers in the area of design and analysis of algorithms and data structures.
We invite submissions of papers presenting original research on algorithms and data structures. Though we welcome experiments, the theoretical results in the articles will be the main measure for evaluating their merits.
Algorithmic approaches of interest include, but are not limited to: approximation algorithms, parameterized algorithms, distributed algorithms, parallel algorithms, external-memory algorithms, data structures, exponential time algorithms, online algorithms, randomized algorithms, streaming algorithms, sub-linear algorithms. The algorithmic problems considered may be motivated by applications, e.g. in optimization, geometry and topology, graph analysis, bioinformatics, visualization, string processing, information retrieval, machine learning, algorithmic game theory, or mechanism design.
Contributors must submit their papers using the Easychair system. Submissions should be in LIPIcs format (without font size, margin, or line spacing changes), and not exceed 15 pages including front page and references. See www.dagstuhl.de/publikationen/lipics/anleitung-fuer-autoren for instructions. Additionally, if full details of proofs do not fit into the page limit, a clearly marked appendix containing the remaining details must be included; this appendix will not be regarded as part of the submission and will be considered only at the discretion of the program committee. Submissions deviating substantially from this format risk rejection without consideration of their merits.
Papers submitted for review should represent original, previously unpublished work. At the time the paper is submitted to the symposium, and for the entire review period, the paper (or essentially the same paper) must not be under review by any other conference with published proceedings or by a scientific journal. However, we encourage authors to make a preprint of their paper available at a public repository such as arXiv. At least one author of every accepted paper is expected to register and present the paper at the symposium. Symposium proceedings will be published in the "Leibniz International Proceedings in Informatics" (LIPIcs) series. A prize will be awarded to the author(s) of the best student-authored paper. A paper is eligible if all of its authors are full-time students at the time of submission. This must be indicated in the paper in the submission process.
Important Dates:
Paper submission deadline: February 1, 2024 (AoE, anywhere on earth)
Notification of acceptance: April 2, 2024
Conference: June 12 - 14, 2024
Invited speakers:
Karen Aardal, Technical University Delft, the Netherlands
Greg Bodwin, University of Michigan, US
Michał Pilipczuk, University of Warsaw, Poland
Committees:
Program Committee:
Anders Aamand, MIT, US
Ahmad Biniaz, University of Windsor, Canada
Hans Bodlaender, Utrecht University, the Netherlands (chair)
Flavia Bonomo, University of Buenos Aires, Argentina
Kevin Buchin, Technical University Dortmund, Germany
Pål Grønås Drange, University of Bergen, Norway
Franziska Eberle, Technische Universität Berlin, Germany
Klim Efremenko, Ben Gurion University, Israel
Gramoz Goranci, University of Vienna, Austria
Kazuo Iwama, National Tsing Hua University, Taiwan
Matthew Johnson, Durham University, UK
Matthew Katz, Ben Gurion University, Israel
Jan Kratochvíl, Charles University, Czech Republic
Stefan Kratsch, Humboldt-Universität zu Berlin, Germany
Łukasz Kowalik, University of Warsaw, Poland
Anil Maheshwari, Carleton University, Canada
George B. Mertzios, Durham University, UK
Yoshio Okamoto, The University of Electro-Communications, Japan
Yota Otachi, Nagoya University, Japan
Sang-il Oum, Institute for Basic Science / KAIST, Korea
Sharath Raghvendra, NCSU, US
Laura Sanita, Bocconi University of Milan, Italy
Subhash Suri, University of California, Santa Barbara, US
Ioan Todinca, University of Orleans, France
Jara Uitto, Aalto University, Finland
Tandy Warnow, University of Illinois at Urbana - Champaign, US
Prudence Wong, University of Liverpool, UK
Meirav Zehavi, Ben Gurion University, Israel
Organizing committee
Jara Uitto Aalto University, Finland (co-chair)
Sándor Kisfaludi-Bak Aalto University, Finland (co-chair)
Alexandru Paler Aalto University, Finland (co-chair)
Contact:
All questions about submissions should be emailed to the PC chair:
Hans Bodlaender (h.l.bodlaender at uu.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] Second annnouncement: Symposium of Experimental Algorithms 2024 (SEA24): call for papers
***********************************************************
22nd Symposium on Experimental Algorithms (SEA24)
Location: Vienna, Austria
Dates: July 23-26, 2024
Web site: <https://sea2024.univie.ac.at>
Submission: <https://easychair.org/conferences/?conf=sea24>
Important dates:
- paper submission deadline: Jan 29, 2024
- notification of acceptance: Mar 15, 2024
- final version: Apr 28, 2024
***********************************************************
22nd Symposium on Experimental Algorithms (SEA24)
Location: Vienna, Austria
Dates: July 23-26, 2024
Web site: <https://sea2024.univie.ac.at>
Submission: <https://easychair.org/conferences/?conf=sea24>
Important dates:
- paper submission deadline: Jan 29, 2024
- notification of acceptance: Mar 15, 2024
- final version: Apr 28, 2024
***********************************************************
SEA24 CALL FOR PAPERS
The Symposium of Experimental Algorithms 2024 (SEA24) will take place from
23 to 26 July 2024 in Vienna, Austria, at the University of Vienna in the
Sky Lounge, located high above the roofs in the city center.
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 and Software Repositories
Algorithmic Cryptography and Security
Algorithmic Natural Language Processing
Algorithmics for Databases
Analysis of Algorithms
Approximation Algorithms
Bioinformatics and Computational Biology
Branch-and-Bound Algorithms
Combinatorial Problems and Structures
Communication Networks
Computational Geometry
Computational Optimization
Data Structures
Distributed and Parallel Algorithms
Graph Algorithms
Heuristic Algorithms
Integer Programming
Logistics and Operations Management
Machine Learning and Data Mining
Mathematical Programming
Multiple Criteria Decision Making
Network Analysis
Online Problems
Randomized Algorithms
Semidefinite Programming
Streaming and External Memory Algorithms
We emphasize that SEA welcomes submissions that introduce novel
applications of algorithms in other disciplines. Note that the SEA list of
topics was updated with respect to past years.
INVITED SPEAKERS
Nick Higham, University of Manchester <https://nhigham.com/>
Pascal Schweitzer, TU Darmstadt <
https://www.mathematik.tu-darmstadt.de/fb/personal/details/pascal_schweitzer.de.jsp
>
Yllka Velaj, University of Vienna <
https://dm.cs.univie.ac.at/team/person/111869/>
BEST PAPER AWARD
The program committee will identify a submission as the best 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.
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).
Authors are required to use the LaTeX style file supplied for the LIPIcs
style <https://submission.dagstuhl.de/series/details/LIPIcs#author>,
without changing default values nor setting font size options in the
"documentclass" statement. 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 <
https://easychair.org/conferences/?conf=sea24>.
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. Specifically, no accepted paper will be published
unless an author registers to participate in 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.
Full papers must be submitted via EasyChair by January 29, 2024, AoE
Authors will be notified of acceptance status by March 15, 2024, AoE
Final version due: April 28, 2024, AoE
Final versions of accepted papers will be submitted to Dagstuhl's Leibniz
International Proceedings in Informatics (LIPIcs). Details about the
submission server will be communicated to corresponding authors of accepted
papers.
PROGRAM COMMITTEE
Pietro Belotti, Politecnico di Milano, Italy
Ksenia Bestuzheva, ZIB, Germany
Davide Buscaldi, Université Sorbonne Paris Nord, France
Martina Cerulli, Università di Salerno, Italy
Roberto Cordone, Università di Milano, Italy
David Coudert, INRIA, France
Silvia Di Gregorio, Université Sorbonne Paris Nord, France
Simone Faro, Università di Catania, Italy
Irene Finocchi, LUISS University, Italy
Donatella Firmani, Università di Roma La Sapienza, Italy
Kathrin Hanauer, University of Vienna, Austria
Claudio Gentile, IASI-CNR Rome, Italy
Loukas Georgiadis, University of Ioannina, Greece
Daniel Goncalves, CNRS and Université de Montpellier, France
Douglas Goncalves, Federal University of Santa Catarina, Brazil
Marc Goerigk, University of Passau, Germany
Ralf Klasing, CNRS and Université de Bordeaux, France
Susana Ladra, Universidade da Coruña, Spain
Leo Liberti, CNRS and École Polytechnique, France (Chair)
Vicky Papadopoulou-Lesta, European University, Cyprus
Georgios Paschos, Amazon Science, Luxembourg
Cynthia A. Phillips, Sandia National Laboratories, USA
Mustafa Pinar, Bilkent University, Turkey
Pierre-Louis Poirion, RIKEN Institute Tokyo, Japan
Leena Salmela, University of Helsinki, Finland
Melanie Schmidt, HHU Düsseldorf, Germany
Christian Schulz, University of Heidelberg, Germany
Andrea Scozzari, Niccolò Cusano University Rome, Italy
Maria José Serna Iglesias, Universitat Politecnica de Catalunya, Spain
Sabine Storandt, University of Konstanz, Germany
Bora Ucar, CNRS and ENS Lyon, France
Domagoj Vrgoc, Pontificia Universidad Católica, Chile
Annegret Wagler, Université de Clermont Auvergne, France
LOCAL INFORMATION
The chair of the local organizing committee is Kathrin Hanauer.
Conference Website: <https://sea2024.univie.ac.at/>
Write to <sea24.taa@univie.ac.at> for any query about the conference.
Venue address: Oskar-Morgenstern-Platz 1, 1090 Vienna (12th floor).
**********************************************************
*
* 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 13, 2023
[DMANET] =?Windows-1252?Q?[REMINDER]_8th_AIROYoung_Workshop_=96_Rende, _February_14?= -16, 2024
Dear all,
We remind you that the deadline to submit an abstract to present at the 8th AIROYoung Workshop in Rende next February is approaching!
Also, if you haven't done so yet, hurry up to secure a spot!
Best,
The 8th AIROYoung Workshop Organizing Committee and the AIROYoung board
---------------------------------------------------------------------------------------------
Call for Registration and Contributions to the
8th AIROYoung Workshop
"Emerging technologies for decision support systems
and innovative optimization paradigms"
University of Calabria
February, 14-16th, 2024
unical.it/ayw2024<https://www.unical.it/ayw2024/>
--------------------------------------------------------------------------------------------
With this call, we invite all AIROYoung members, Ph.D. students, and early-stage Researchers (Ph.D. degree <= 5 years) in Operations Research and related topics, or anyone with a strong interest in Operations Research with less than 35 years old, to submit an abstract or a short paper as contributions to be presented during the workshop.
ABSTRACT SUBMISSIONS – Deadline: December 23rd, 2023
Abstracts should be sent by filling in the Registration Form<https://docs.google.com/forms/d/e/1FAIpQLSdWhqy7y35GTrNdbGBoC8SnSCdJdxoTwAwpmIEVESds0mjDsQ/viewform>.
Submitted abstracts are limited to one-page length (including references) in PDF format, using the available Word Template<https://drive.google.com/file/d/1LeyHM9BEQ8l2nyBMccz4T0datZwzn3nI/view>. Please name your file as follows: SURNAME_NAME_8AYW.
The acceptance of the contribution will be notified to the author by email by January 8th, 2024.
Please, note that each author can give at most one talk during the event.
SHORT PAPER SUBMISSIONS – Deadline: January 26th, 2024
Submitted short papers are limited to 8-10 pages, including front matter and references.
Short papers will undergo a review process by anonymous referees.
Accepted papers will be included in a special volume of the AIRO Springer Series, indexed in main scientific databases.
Short papers must be prepared in LaTeX or Word using the Springer template<https://www.springer.com/gp/authors-editors/conference-proceedings/conference-proceedings-guidelines> and submitted via Springer's Online Conference Service OCS<https://equinocs.springernature.com/service/7TH_AIROYOUNG2023>.
Authors submitting a short paper are also requested to send the abstract of their contribution, as indicated in the instructions for submitting abstracts and filling in the Registration Form<https://docs.google.com/forms/d/e/1FAIpQLSdWhqy7y35GTrNdbGBoC8SnSCdJdxoTwAwpmIEVESds0mjDsQ/viewform>.
Abstracts accepted for presentation will be notified by email by January 8th, 2024, while acceptance of short papers will be subject to the reviewers' feedback and will be notified successively.
REGISTRATION AND GRANTS
Participants submitting a short paper or an abstract, as well as simple attendees, are required to fill in the Registration Form<https://docs.google.com/forms/d/e/1FAIpQLSdWhqy7y35GTrNdbGBoC8SnSCdJdxoTwAwpmIEVESds0mjDsQ/viewform>.
AIROYoung mission is to involve everyone in its events, independently from their funds. For this reason, our events are free for everyone and we work hard to secure some money to help with accommodation as well. Thanks to the financial support of AIRO and our sponsors, we can offer 10 grants to cover the cost of accommodation for the entire event.
Grants will be awarded on a first-come, first-served basis to participants who have expressed, in the registration process, their willingness to apply for the grant, and who are (or are willing to become) AIROYoung members. If you have been selected as one of the first 10 applicants to receive a grant, you will be notified by email.
To confirm the grant, proof of AIROYoung membership and travel booking must be emailed to airoyw2024@gmail.com<mailto:airoyw2024@gmail.com> by January 15th, 2024.
To become an AIROYoung member, please contact airo.young.researchers@gmail.com<mailto:airo.young.researchers@gmail.com>.
The accommodation will be provided in a double room at Socrates, with check-in on February 14th and check-out on February 17th. More info here: Venue-Socrates area<https://www.unical.it/ayw2024/venue/>.
PLENARY SPEAKERS
- Prof. Daniele Vigo, University of Bologna, Italy
- Prof. Claudio Sterle, University of Naples Federico II, Italy
- Prof. Manlio Gaudioso, University of Calabria, Italy
THE ORGANIZING COMMITTEE
Cristian Belfiore
Alessia Ciacco
Annarita De Maio
Stefania Ferrisi
Martina Luzzi
Giusy Macrina
Chiara Maragò
Veronica Mosca
Francesco Saccomanno
Edoardo Scalzo
Sara Stoia
www.airoyoung.org<http://www.airoyoung.org/>
unical.it/ayw2024<https://www.unical.it/ayw2024/>
Facebook: AIROYoungResearchersChapter<https://www.facebook.com/AIROYoungResearchersChapter/?ref=br_rs>
Instagram: airoyoung<https://www.instagram.com/airoyoung/>
Twitter: AIROyoung<https://twitter.com/AIROyoung>
--
AIROYoung
Website https://www.airoyoung.org/
Twitter @Airoyoung
Facebook /AIROYoungResearchersChapter
Instagram @airoyoung
**********************************************************
*
* 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] LATIN 2024: Call for posters
===============================================================
Call for Posters
LATIN 2024
The 16th Latin American Theoretical Informatics Symposium will be held
in Puerto Varas, Chile. All information about the conference can be
found at https://latin2024.cmm.uchile.cl/.
The conference will feature a poster session and we are soliciting
submissions for posters. We particularly welcome posters from
Ph.D. students and postdocs.
SUBMISSION INSTRUCTIONS
Each poster submission consists of the name and affiliation of the
presenter and an abstract (one page PDF, letter size, 11-point font,
one inch margins). Please use the following form for the submission:
https://forms.gle/MGz7B87BjNUjcWDB9
The organization committee of LATIN 2024 will select the presented
posters, subject to the number of available poster slots. Each presenter
of a poster is required to register for the conference.
Poster submission deadline: January 5, 2024
Poster notification: January 8, 2024
Symposium: March 18-22, 2024
Please contact Victor Verdugo (victor.verdugo@uoh.cl) if you have any
questions.
**********************************************************
*
* 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] EURO 2024 Copenhagen - Session “Ethics of OR and Artificial Intelligence” - in Stream "OR and Ethics"
Dear Colleagues,
Join us at the 33rd European Conference on Operational Research in Copenhagen, Technical University of Denmark (DTU), 30th June – 3rd July 2024 ( https://euro2024cph.dk/registration/important-dates )
Operational Research (OR) is the discipline of applying advanced analytical methods to achieve better decisions – in businesses, governance, societies and especially in crisis times. By using techniques such as problem definition and problem structuring methods as well as mathematical modelling to analyze complex situations, OR allows to make more effective decisions and to build more productive and safer systems. Our " OR and Ethics" EURO Working Group addresses ethical and societal issues, so you may decide which of the sessions fits your research topics.
Conference platform: https://www.euro-online.org/conf/euro33/
Sessions of the stream OR and Ethics: https://euro2024cph.dk/registration/abstract-submission :
"Ethics of OR and Artificial Intelligence" Code: e76c9b0c Prof. Dr. Ulrike Reisach
"Public Service Management Analytics" Code: 9399799c Prof. Dr. Cathal Brugha Swiney
"Ethics and OR and Societal Complexity" Code: 7ce04a33 Prof. Dr. Dorien DeTombe
"Just and Ethical Sustainability Transitions" Code: 28 Dr. Ross Kazakov
The session Abstract of "Ethics of OR and Artificial Intelligence" (Ulrike Reisach)
This session starts with a UNESCO citation: In no other field is the ethical compass more relevant than in artificial intelligence (AI). These general-purpose technologies are re-shaping the way we work, interact, and live. The rapid rise AI has created many opportunities globally, from facilitating healthcare diagnoses to enabling human connections through social media and creating labor efficiencies through automated tasks. Generative AI like language translation or Chat CPT provide additional options, but there are profound ethical concerns on intellectual property rights, inequalities, lack of access or disinformation and hate. Ethics and analytics support a deeper understanding of complex decisions in political, societal, economical, health or other sciences. Ethics comprises identifying frontier challenges in areas such as neurotechnology, climate engineering, or the internet of things. Be it on genetic research, climate change, or scientific research, the AI-driven benefits should maximize the scientific discoveries, while minimizing downside risks, ensuring they contribute to a more inclusive, sustainable, and peaceful world. Without considering those factors by ethical guardrails, it risks reproducing real world biases and discrimination, fueling divisions and threatening fundamental human rights and freedoms. You are welcome to present your specific contribution on those broad and thrilling fields.
If you intend to participate, p lease upload an abstract of max. 1500 characters, including spaces, to the EURO conference submission platform using the following session codes (very important when sub-mitting your abstract) :
Important Dates:
Abstract submission opens: Sunday, 1st October 2023
Registration opens: Sunday, 5th November 2023
Abstract submission closes: Sunday, 3rd March 2024 at hrs. 23:59 CET
Early registration closes: Sunday, 24th March 2024 at hrs. 23:59 CET
Author registration deadline: Sunday, 21st April 2024 at hrs. 23:59 CET
Hope to see you in Copenhagen!
Kind regards, Ulrike Reisach (ulrike.reisach@hnu.de)
**********************************************************
*
* 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 student 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
is looking for
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 interested in theoretical research in algorithms and complexity, including the related areas of 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 from 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 2024.
for
I N F O R M A T I C S
is looking for
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 interested in theoretical research in algorithms and complexity, including the related areas of 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 from 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 2024.
Candidates holding a bachelor's or master's degree should apply via one or more of the following programs. (Information about these programs can be found at https://www.mpi-inf.mpg.de/departments/algorithms-complexity/offers.)
* CS@Max Planck Doctoral Program by 31 December 2023 [https://www.cis.mpg.de/cs-max-planck/]
* International Max Planck Research School for Trustworthy Computing (IMPRS-TRUST) by 31 December 2023 [http://www.imprs-trust.de/]
* Maryland Max Planck program by 15 December 2023 [https://www.cs.umd.edu/maryland-max-planck]
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.
**********************************************************
*
* 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] Copenhagen School of Stochastic Programming 2024 -- before EURO 2024
Dear colleagues,
Please forward the following message to potentially interested PhD students.
We are organizing the 2nd Copenhagen PhD School of Stochastic Programming, which will take place in Copenhagen between June 25th and 28th.
These are the days immediately before the EURO 2024 conference (which also takes place in Copenhagen).
The PhD school provides an introduction to Stochastic Programming and is taught by leading experts on the subject.
Participants have the possibility of earning 5 ECTS upon successful completion of the course.
Confirmed lecturers:
* Francesca Maggioni (University of Bergamo)
* Michal Kaut (Sintef, Trondheim)
* Asgeir Tomasgard (NTNU, Trondheim)
* Alois Pichler (TU Chemnitz)
For registration and more information visit https://www.math.ku.dk/english/calendar/events/cssp_2/ or contact the organizers:
* Giovanni Pantuso: gp@math.ku.dk<mailto:gp@math.ku.dk>
* Trine Boomsma: trine@math.ku.dk<mailto:trine@math.ku.dk>
**********************************************************
*
* 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] IWOCA 2024 - 2nd Call for Papers
*************************************************************************
****************** IWOCA 2024 - 2nd Call for Papers
**************************
*************************************************************************
****************** IWOCA 2024 - 2nd Call for Papers
**************************
*************************************************************************
The 35th International Workshop on Combinatorial Algorithms (IWOCA 2024)
will be held in Ischia, Italy, on July 1-4 2024
http://iwoca2024.di.unisa.it
The topics of interest include (but are not limited to) the following:
Ad Hoc, Dynamic and Evolving Networks
Algorithms and Data Structures
Algorithms on Strings & Graphs
Algorithms for Big Data and Networks Analytics
Algorithmic Game Theory
Approximation Algorithms
Circuits and Boolean Functions
Combinatorial Generation, Enumeration and Counting
Combinatorial Optimization
Complexity Theory
Combinatorics of Words
Computational Algebra and Geometry
Computational Biology
Cryptography and Information Security
Distributed and Parallel Algorithms
Experimental Evaluation of Algorithms
Fine-grained Complexity
Foundations of Cloud Computing
Graph Algorithms for Social Network Analysis
Graph Drawing and Labelling
Graph Theory & Combinatorics
Mobile Agents
New Paradigms of Computation
Online Algorithms
Parameterized and Exact Algorithms
Probabilistic and Randomized Algorithms
Scheduling
Streaming Algorithms
============
Proceedings:
============
The conference proceedings will be published within the "Lecture Notes in
Computer Science" series of Springer, within the ARCoSS subline.
=======================
Journal Special Issues:
=======================
Selected papers accepted to IWOCA will be invited to submit to a Special
Issue of Journal of Computer and System Sciences. Other journal Special
Issues devoted to IWOCA 2024 are planned.
=======
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. The
program committee may decline to make these awards or may split them.
======================
Important dates (AoE):
======================
Abstract submission: February 14, 2024
Paper submission: February 21, 2024
Notification: April 15, 2024
Camera-ready submission: April 26, 2024
Conference: July 1-4, 2024
========================
Submission instructions:
========================
Authors are invited to submit high-quality manuscripts reporting original
unpublished research on the topics related to the symposium. Simultaneous
submission to other conferences or workshops with published proceedings is
not allowed. It is required that each accepted paper be presented at the
conference by one of its authors.
Submissions must be in the form of a single pdf file prepared using the
LNCS latex templates and style files. Springer's proceedings LaTeX
templates are also available on Overleaf. Springer encourages authors to
include their ORCIDs in their papers and requires them to draw the
attention of the contributing conference paper authors to the Code of
Conduct.
Each submission should consist of the central part of the paper, not
exceeding 12 pages (including the title page and excluding the references),
plus an optional clearly marked appendix (to be read at the discretion of
the program committee). Any figure pertaining to the central part of the
paper should be included therein (within the 12-page limit). The first page
must indicate whether the article is eligible for the best student paper
award.
Papers are to be submitted electronically through EasyChair at the link:
https://easychair.org/conferences/?conf=iwoca2024
===============
Program Chairs:
===============
Adele Rescigno, University of Salerno, Italy
Ugo Vaccaro, University of Salerno, Italy
==================
Program Committee:
==================
Bogdan Alecu, University of Leeds, UK
Petra Berenbrink, University of Hamburg, Germany
Tiziana Calamoneri, Sapienza University of Rome, Italy
Yi-Jun Chang, National University of Singapore, Singapore
Gennaro Cordasco, University of Campania "L. Vanvitelli", Italy
Peter Damaschke, Chalmers University, Sweden
Adrian Dumitrescu, Algoresearch L.L.C., USA
Klim Efremenko, Ben-Gurion University of the Negev, Israel
Leah Epstein, University of Haifa, Israel
David Eppstein, University of California, USA
Thomas Erlebach, Durham University, UK
Amedeo Esposito, Institute of Science and Technology, Austria
Henning Fernau, Universität Trier, Germany
Fedor Fomin, University of Bergen, Norway
Travis Gagie, Dalhousie University, Canada
Robert Ganian, Vienna University of Technology, Austria
Leszek Gasieniec, University of Liverpool, UK
Roberto Grossi, University of Pisa, Italy
Ling-Ju Hung, National Taipei University of Business, Taiwan
Yusuke Kobayashi, Kyoto University, Japan
Evangelos Kranakis, Carleton University, Canada
Danny Krizanc, Wesleyan University, USA
Manuel Lafond, University of Sherbrooke, Canada
Chia-Wei Lee, National Taitung University, Taiwan
Kitty Meeks, University of Glasgow, UK
Martin Milanic, University of Primorska, Slovenia
Neeldhara Misra, Indian Institute of Technology Gandhinagar, India
Alantha Newman, University Grenoble Alpes, France
Aris Pagourtzis, National Technical University of Athens, Greece
Ely Porat, Bar-Ilan University, Israel
Dieter Rautenbach, Ulm University, Germany
Saket Saurabh, Institute of Mathematical Sciences, India
Marinella Sciortino, University of Palermo, Italy
Sagnik Sen, Indian Institute of Technology Dharwad, India
Maria Serna, Universitat Politecnica de Catalunya, Spain
Florian Sikora, University Paris Dauphine, France
Ana Silva, Universidade Federal do Ceará, Brazil
Tatiana Starikovskaya, PSL Research University, France
Teresa Anna Steiner, Technical University of Denmark, Denmark
Jukka Suomela, Aalto University, Finland
Michal Wlodarczyk, Ben-Gurion University of the Negev, Israel
Meirav Zehavi, Ben-Gurion University of the Negev, Israel
=================
Invited Speakers:
=================
Ralf Klasing, CNRS and University of Bordeaux, France
Lucia Moura, University of Ottawa, Canada
Nadia Pisanti, University of Pisa, Italy
=====================
Associated Workshops:
=====================
GraphMastersOpen & StringMasters: July 4th, 2024
**********************************************************
*
* 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] [Cryptography] (ISSN 2410-387X, ESCI & Scopus indexed) Annual Recommended Articles in 2022
We are sharing with you some highly viewed papers published in the open
access
journal /Cryptography/ (https://www.mdpi.com/journal/cryptography)
in 2022 volume 6, which are free to access and can be downloaded here:
access
journal /Cryptography/ (https://www.mdpi.com/journal/cryptography)
in 2022 volume 6, which are free to access and can be downloaded here:
1. Variations of QKD Protocols Based on Conventional System Measurements:
A Literature Review
https://www.mdpi.com/2410-387X/6/1/12
2. A Searchable Encryption Scheme with Biometric Authentication and
Authorization for Cloud Environments
https://www.mdpi.com/2410-387X/6/1/8
3. Hardware Limitations of Lightweight Cryptographic Designs for IoT in
Healthcare
https://www.mdpi.com/2410-387X/6/3/45
4. A Review of Blockchain in Fintech: Taxonomy, Challenges, and Future
Directions
https://www.mdpi.com/2410-387X/6/2/18
5. Designing a Practical Code-Based Signature Scheme from Zero-Knowledge
Proofs with Trusted Setup
https://www.mdpi.com/2410-387X/6/1/5
See this full volume via https://www.mdpi.com/2410-387X/6.
Any questions about the journal Cryptography, please contact
cryptography@mdpi.com.
Best regards,
Xue Cheng
Managing Editor
--
MDPI Branch Office, Wuhan
Cryptography Editorial Office
https://www.mdpi.com/journal/cryptography
MDPI, St. Alban-Anlage 66, 4052 Basel, Switzerland
News: Cryptography Receives Its First Impact Factor of 1.6
https://www.mdpi.com/about/announcements/6138
Highly Cited Papers:
Efficient RO-PUF for Generation of Identifiers and Keys in
Resource-Constrained Embedded Systems
https://www.mdpi.com/2410-387X/6/4/51
WPAxFuzz: Sniffing Out Vulnerabilities in Wi-Fi Implementations
https://www.mdpi.com/2410-387X/6/4/53
Twitter: @Cryptogr_MDPI https://twitter.com/Cryptogr_MDPI
LinkedIn: Cryptography-MDPI
**********************************************************
*
* 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 Fellow at Univ. Melbourne in ML (Adaptive Data Analysis, DP)
Postdoctoral research fellow position in machine learning at the University
of Melbourne's School of Computing and Information Systems.
of Melbourne's School of Computing and Information Systems.
Join a world-class team led by Prof. Ben Rubinstein https://www.bipr.net
Topics of interest include adaptive data analysis, differential privacy, or
research in ML+databases.
Application deadline: Jan 11, 2024 (Australian Eastern Daylight Time)
Position details and application: https://go.unimelb.edu.au/8na8
**********************************************************
*
* 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/
*
**********************************************************
Tuesday, December 12, 2023
[DMANET] Postdoc position in algorithms at Houston
One 2-year postdoc position is available in projects related to combinatorial optimization (approximation algorithms, randomized algorithms, and online algorithms) and in parallel and distributed algorithms in the research group of Rathish Das (https://www.rathishdas.com/) at the University of Houston.
Applications are invited from candidates with a Ph.D. (or will complete within a year) who have a solid algorithm design and mathematics background. Publications at top venues in specialized topics, such as SPAA, PODC, SoCG, or top general TCS venues like STOC, FOCS, SODA, ESA, and ICALP are highly appreciated. The start date is flexible.
If you are interested, please send the following to rathish@uh.edu.
1. CV, including the complete list of publications,
2. Names and contact information of at least two references.
Please don't hesitate to reach out to rathish@uh.edu with any informal questions.
There are no teaching obligations. The position will remain open until filled.
UH is a Carnegie Tier One public research university located on a park-like campus a few minutes from the Houston city center. Houston, the fourth largest city in the United States, is an international and multicultural city with world-class restaurants, theaters, museums, and thrilling sports teams. It offers affordable housing and enjoys a low cost of living. The university is close to the Texas Medical Center, the largest in the world, a large industrial base, and NASA Johnson Space Center.
Best,
Rathish
**********************************************************
*
* 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] CiE 2024: CALL FOR PAPERS
CiE 2024: CALL FOR PAPERS
Computability in Europe 2024
Twenty years of theoretical and practical synergies
Amsterdam, The Netherlands
July 08-12, 2024
https://events.illc.uva.nl/CiE/CiE2024/ [1]
Submission link: https://equinocs.springernature.com/service/CiE2024 [2]
IMPORTANT DATES:
Deadline for article submission: February 10, 2024 (AOE)
Notification of acceptance: April 20, 2024
Final versions due: May 1, 2024
Deadline for informal presentations submission: May 15, 2024 (The
notifications of acceptance for informal presentations will be sent a
few days after submission)
Early registration before: May 20, 2024
Conference: July 08-12, 2024
GENERAL INFORMATION
CiE 2024 will be an anniversary event. It is the 20th conference
organized by CiE (Computability in Europe), in the same place as the
first edition, Amsterdam.
CiE is 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), Durham (2019), Salerno
(2020, virtually), Ghent (2021, virtually), Swansea (2022) and Batumi
(2023).
TUTORIAL SPEAKERS
Matthew Harrison-Trainor (University of Illinois Chicago)
Sonja Smets (University of Amsterdam)
INVITED SPEAKERS
Arnold Beckmann (Swansea University)
Rod Downey (Victoria University of Wellington)
Elvira Mayordomo (University of Zaragoza)
Alexandre Miquel (Universidad de la República)
Monika Seisenberger (Swansea University)
Mariya Soskova (University of Wisconsin-Madison)
SPECIAL SESSIONS
There will be 6 special sessions:
- Computable aspects of symbolic dynamics and tilings (chairs: Benjamin
Hellouin and Ilkka Torma)
- Algorithmic randomness and Kolmogorov complexity session (chairs:
Rupert Hölzl abd Denis Hirschfeldt)
- Quantum Computation (chairs: Delaram Kahrobaei and Mehrnoosh
Sadrzadeh)
- History and Philosophy of Computing (HaPoC) (chairs: Ekaterina
Koubychkina and Marianna Girlando)
- Bio-inspired Computation (BiC) (chairs: Gianluca Della Vedova and
Jasmijn Baaijens)
- Computable Structure Theory (chairs: Stefan Vatev and Ekaterina
Fokina)
CONFERENCE TOPICS
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.
PAPER SUBMISSION
THE PROGRAM COMMITTEE cordially invites all researchers, European and
non-European, to submit their papers in all areas related to the above
for presentation at the conference and inclusion in the proceedings of
CiE 2024 at https://equinocs.springernature.com/service/CiE2024
CONFERENCE PROCEEDINGS
Papers submitted to the conference proceedings should represent original
work, not simultaneously submitted to another journal or conference with
formal proceedings.
The Program Committee will rigorously review and select submitted
papers. Accepted papers will be published as a proceedings volume in the
Lecture Notes in Computer Science (LNCS) series from Springer-Verlag.
Papers to be considered in the conferences proceedings must be submitted
in PDF format, using the LNCS style (available at
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines)
and must have a maximum of 12 pages, including references but excluding
a possible appendix in which one can include proofs and other additional
material. Papers building bridges between different parts of the
research community are particularly welcome.
INFORMAL PRESENTATIONS
Continuing the tradition of past CiE conferences, we invite researchers
to present informal presentations of their recent work. A proposal for
an informal presentation must be submitted via e-mail
(e.pimentel@ucl.ac.uk), using the LNCS style file (available at
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines),
and be 1 page long; 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 2024 may appear or may have appeared in other
conferences with formal proceedings and/or in journals.
PROGRAM COMMITTEE
Contributed papers will be selected from submissions received by the
PROGRAM COMMITTEE consisting of:
Bahareh Afshari (University of Amsterdam & University of Gothenburg)
Nathalie Aubrun (CNRS, Université Paris-Saclay)
Marie-Pierre Béal (Université Gustave Eiffel)
Benno van den Berg (University of Amsterdam)
Sebastian Berndt (University of Lübeck)
Patricia Bouyer-Decitre (CNRS)
Jin-Yi Cai (University of Wisconsin-Madison)
Barbara Csima (University of Waterloo)
Gianluca Della Vedova (Università degli Studi di Milano-Bicocca)
Leah Epstein (University of Haifa)
Gilda Ferreira (Universidade Aberta)
Yannick Foster (INRIA, Nantes)
Lorenzo Galeotti (Amsterdam University College)
Mathieu Hoyrup (INRIA, LORIA, Nancy)
Jarkko Kari (University of Turku)
Julia Knight (University of Notre-Dame)
Susana Ladra (Universidade da Coruña)
Timo Lang (Technische Universität Wien)
Karen Lange (Wellesley College)
Florin Manea (University of Göttingen)
Alexander Melnikov (Victoria University of Wellington)
Alberto Naibo (Université Paris 1 Panthéon-Sorbonne)
Ludovic Patey (CNRS, Université Paris-Cité co-Chair)
Elaine Pimentel (University College London co-chair)
Cristóbal Rojas (Universidad Católica)
Viola Schiaffonati (Politecnico di Milano)
Paul Shafer (University of Leeds)
Reed Solomon (University of Connecticut)
Andreas Weiermam (Ghent University)
WOMEN IN COMPUTABILITY
We are very happy to announce that within the framework of the Women in
Computability program, we are able to offer some grants for junior women
researchers who want to participate in CiE 2024. Applications for this
grant should be sent to Lorenzo Galeotti before May 15, 2024 and include
a short cv (at most 2 pages) and contact information for an academic
reference. Preference will be given to junior women researchers who are
presenting a paper (including informal presentations) at CiE 2024.
HOSTED BY
The event will be held in the Amsterdam University College academic
building located at Amsterdam Science Park.
We are grateful for support from the University of Amsterdam.
ORGANIZING COMMITTEE
Bahareh Afshari (University of Gothenburg)
Luis Aguilar Suarez (Amsterdam University College)
Benno van den Berg (University of Amsterdam)
Andrea De Domenico (Vrije Universiteit Amsterdam)
Tamara Dobler (Vrije Universiteit Amsterdam)
Lorenzo Galeotti (Amsterdam University College -- chair)
Yurii Khomskii (Amsterdam University College)
Mattia Panettiere (Vrije Universiteit Amsterdam)
Benjamin Rin (Universiteit Utrecht)
Links:
------
[1] https://events.illc.uva.nl/CiE/CiE2024/
[2] https://equinocs.springernature.com/service/CiE2024
**********************************************************
*
* 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] 15 PhD positions in Marie Skłodowska-Curie Doctoral Network / Joint Doctorate TENORS (Tensor modEliNg, geOmetRy and optimiSation)
TENORS (Tensor modEliNg, geOmetRy and optimiSation) is a Marie Skłodowska-Curie Doctoral Network / Joint Doctorate (2024-2027), offering
15 PhD positions.
The objective of TENORS is to conduct advanced research that addresses critical challenges in the fields of tensor modeling and computation, joining forces from algebraic geometry, global optimisation, numerical computation, high performance computing, data science, quantum physics.
The project aims to feed an innovative and ambitious joint-PhD program to train highly qualified young scientists in new scientific and technological knowledge.
The PhD candidates will obtain joint/double Phd diplomas from reputed universities within TENORS project.
For more information on TENORS: http://tenors-network.eu/
How to apply: https://project.inria.fr/tenors/phd-positions/
Where to submit your application: https://easychair.org/my/conference?conf=tenors2427
Applications received before 31 March 2024 will be given full priority, but later applications may be accepted until all positions will be filled. Positions are expected to start in September/October 2024.
**********************************************************
*
* 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 11, 2023
[DMANET] NETYS 2024 - First Call
This is the first call for papers for the 12th International
Conference on Networked Systems (NETYS).
Conference on Networked Systems (NETYS).
NETYS 2024
For the 12th consecutive year, NETYS (The International Conference on
Networked Systems) aims to bring together researchers and engineers
from the theory and practice of distributed and networked systems. The
scope of the conference covers all aspects related to the design and
the development of these systems, including, but not restricted to,
cloud systems, formal verification, concurrent and distributed
algorithms, data management, data science,
parallel/concurrent/distributed programming, distributed
machine-learning, multi-core architectures, networks, and security.
NETYS will provide a forum to report on best practices, novel
algorithms, results, and techniques on networked systems. Original
research contributions and experience papers on the principles,
design, implementation, modeling, analysis, verification and
application of networked systems are solicited. Topics of interest are
broadly divided into three categories: networked systems, distributed
computing and distributed machine-learning.
Topics of interest include (but are not limited to):
1-Networked systems
Cloud systems and data centers
Cyber-physical systems
Distributed database, embedded and operating systems
Multi-core architectures and multithreaded applications
Distributed ledgers and blockchain technologies
Internet of Things, 5G, URLLC
Mobile, wireless, ad-hoc and sensor networks
Social networks
Overlay and peer-to-peer infrastructures
2-Distributed Computing
Concurrency, synchronization and persistence
Distributed and concurrent data structures
Languages, verification and formal methods for distributed systems
Design and analysis of distributed algorithms
Lower bounds and impossibility results for distributed computing
Game theory, mechanisms design
Fault-tolerance, reliability, self-stabilizing, self-organizing, and
autonomic systems
Collaborative intelligent systems
3-Distributed Machine-Learning
Collaborative/federated learning
Learning on peer-to-peer architecture
Privacy preserving distributed learning
Byzantine-robustness
Communication-efficiency
Personalized learning
Federated ensembling
Model compression
Dates:
Abstract submission deadline: February 29, 2024
Paper submission deadline: March 7, 2024
Accept/Reject notification: April 22, 2024
Camera ready copy due: May 19, 2024
Conference: May 29-31, 2024
Venue:
The conference will be organized in Rabat, the capital of Morocco.
Guidelines for submission:
Submissions must be original papers that contain sufficient detail to
assess the merits and relevance of the contribution. NETYS welcomes
papers on theory, case studies and comparisons with existing
experimental research tools, as well as combinations of new theory
with experimental evaluation.
NETYS is soliciting two forms of submission: full and short papers.
Full papers are allowed a maximum of 15 pages in Springer's LNCS
format, excluding bibliographic references, and will be allowed at
least 15 minutes for presentation at the conference, whereas short
papers are allowed a maximum of 5 pages (in the same format) and will
be allowed at least 5 minutes for presentation at the conference. A
full paper submission might be accepted as such, as a short paper or a
poster. A short paper may be accepted as such or as a poster.
Posters will be presented at the conference to reflect work in
progress and will not lead to a publication in the proceedings.
Authors are given the option to accept or not the type in which their
paper is selected for acceptance.
All submissions must be written in English, follow the LNCS template,
and adhere to the page limits. Papers exceeding these limits may be
rejected without review. A clearly marked appendix can be included for
supplementary materials but the appendix will be read at the
discretion of the reviewers; therefore, the main body of the paper
should contain sufficient details to assess its contributions.
Submission link:
https://easychair.org/cfp/netys2024
Awards:
Awards will be given to the best paper and the best student paper. A
paper is eligible for the best student paper award if at least one of
its authors is a full-time student at the time of submission. This
should be indicated in the submission.
Publication:
It is required that each accepted paper be presented at the conference
by one of its authors.
Conference website:
For more details, please visit the conference website: https://netys.net/
PC co-chairs
Armando Castañeda (UNAM, Mexico), Constantin Enea (Ecole
Polytechnique, LIX, France), Nirupam Gupta (EPFL, Switzerland)
**********************************************************
*
* 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] Faculty positions at Tufts University (review of applications starts December 15)
The Department of Computer Science at Tufts University is seeking candidates for both tenure-track and teaching-track faculty positions to start in Fall 2024. Candidates in theory are encouraged to apply to the Ada Lovelace Professorship (mid-career, leadership potential). Theory represents a priority area for the teaching search as well.
The application deadline is December 15, 2023.
Website: https://engineering.tufts.edu/cs/about/employment-opportunities
Emails: ttsearch@cs.tufts.edu (tenure-track), cssearch@cs.tufts.edu (teaching-track)
Best regards,
Vladimir Podolskii
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] (CALL FOR PAPERS) CHEOPS@EuroSys24 - Abstract submission due January 19, 2024
Call for papers: CHEOPS'24
Deadline for abstract submission: January 19, 2024, 11:59 PM AoE
Deadline for papers: January 26, 2024, 11:59 PM AoE
===============================================================
The fourth Workshop on Challenges and Opportunities of Efficient and Performant Storage Systems (CHEOPS)
https://cheops-workshop.github.io/2024.html <https://cheops-workshop.github.io/2024.html>
April 22, 2024
Athens, Greece
Deadline for abstract submission: January 19, 2024, 11:59 PM AoE
Deadline for papers: January 26, 2024, 11:59 PM AoE
===============================================================
The fourth Workshop on Challenges and Opportunities of Efficient and Performant Storage Systems (CHEOPS)
https://cheops-workshop.github.io/2024.html <https://cheops-workshop.github.io/2024.html>
April 22, 2024
Athens, Greece
Held in conjunction with EuroSys 2024
===============================================================
We are pleased to announce the fourth Workshop on Challenges and Opportunities of Efficient and Performant Storage Systems (CHEOPS'24). CHEOPS'24 will be hosted in conjunction with EuroSys'24.
The fourth workshop on "Challenges and Opportunities of Efficient and Performant Storage Systems" (CHEOPS) is aimed at researchers, developers of scientific applications, engineers and everyone interested in the evolution of storage systems. As the developments of computing power, storage and network technologies continue to diverge, the bandwidth performance gap between them widens. This trend, combined with the ever growing data volumes and data-driven computing such as machine learning, results in I/O and storage limitations, impacting the scalability and efficiency of current and future computing systems. Some of these challenges are quantitative, such as scale to match exascale system requirements, or latency reduction of the software stack to efficiently integrate new generations of hardware like storage class memory (SCM). Some other issues are more subtle and arise with the increased complexity of the storage solutions, like new smarter and more potent data management tools, monitoring systems or interoperability between I/O components or data formats.
The main objective of this workshop is to discuss state-of-the-art research, innovative ideas and experiences that focus on the design and implementation of storage systems in both academic and industrial worlds.
Topics of Interest
------------------------
Submissions may be more hands-on than research papers and we therefore explicitly encourage submissions in the early stages of research. Topics of interest include, but are not limited to:
Operating system optimizations
Kernel and user space file/storage systems
Including virtual file systems
Cloud, parallel and distributed file/storage systems
Network challenges, such as scalability, QoS and partitionability
Approaches for low-latency and heterogeneous storage systems
Such as SCM and NVRAM combined with HDDs
Metadata management
Machine Learning and Artificial Intelligence
Storage requirements of ML and AI applications
Using ML and AI within storage systems (e.g., to replace heuristics)
Hybrid solutions using file systems and databases
Approaches using query and database interfaces, including key-value stores
Optimized indexing techniques
Data organizations to support online workflows
Data privacy and data security
Domain-specific data management solutions
Application I/O characterization
Storage systems modeling and analysis tools
Data reduction techniques
Lossless and lossy compression, deduplication
UI/UX for storage systems
Related experiences from users: what worked, what didn't?
Feedback and empirical evaluation of storage systems
Paper Submissions
---------------------------
In order to guarantee the quality of the submissions, we have formed a globally distributed, diverse program committee. All submissions will be reviewed by the program committee. We will use HotCRP to manage the submissions (https://cheops24.hotcrp.com <https://cheops24.hotcrp.com/>). The reviewing process will be double blind with at least 3 reviews for each submission. An online discussion will determine which papers to accept.
Only original and novel work not currently under review in other venues will be considered for publication. Submissions can either be full papers (6 pages) or short papers (4 pages). The page count includes the title, text, figures, appendices but excludes the references. They must be submitted electronically as PDF files formatted according to the submission rules of EuroSys (https://2024.eurosys.org/cfp.html <https://2024.eurosys.org/cfp.html>). Accepted submissions will have to comply with the EuroSys proceedings format. One author of each accepted paper is required to register for the workshop and present the paper. Extended versions of selected papers will be considered for publication in the ACM SIGOPS Operating Systems Review journal.
Important Dates
----------------------
Abstract Submission: January 19, 2024 (Anywhere on Earth)
Paper Submission: January 26, 2024 (Anywhere on Earth)
Notification to Authors: March 1, 2024
Camera-Ready Deadline: March 11, 2024
Workshop Date: April 22, 2024
Workshop Organizers
------------------------------
Steering Committee:
- Jean-Thomas Acquaviva - DDN, France
- Jalil Boukhobza - National Institute of Advanced Technologies of Brittany (ENSTA Bretagne), France
- Konstantinos Chasapis - DDN, France
- Kira Duwe - École polytechnique fédérale de Lausanne (EPFL), Switzerland
- Shadi Ibrahim - Inria, France
- Michael Kuhn - Otto von Guericke University Magdeburg (OVGU), Germany
General Chair:
- Shadi Ibrahim - Inria, France
Program Co-Chairs:
- Suren Byna - The Ohio State University, USA
- Amelie Chi Zhou - Hong Kong Baptist University, Hong Kong
**********************************************************
*
* 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] ISC High Performance 2024: Call for Tutorials - Deadline Extended to December 18, 2023
UPDATE: Submission deadline for tutorial proposals extended to December 18, 2023 23:59pm AoE
============================================================================================
The ISC High Performance 2024 Conference call for tutorials is now open! (https://www.isc-hpc.com/submissions-tutorials-2024.html <https://www.isc-hpc.com/submissions-tutorials-2024.html>)
============================================================================================
The ISC High Performance 2024 Conference call for tutorials is now open! (https://www.isc-hpc.com/submissions-tutorials-2024.html <https://www.isc-hpc.com/submissions-tutorials-2024.html>)
The ISC tutorials are interactive courses and collaborative learning experiences focusing on key topics of high performance computing, machine learning, data analytics and quantum computing.
Renowned experts in their respective fields will give attendees a comprehensive introduction to the topic as well as providing a closer look at specific problems. Tutorials are encouraged to include a "hands-on" component to allow attendees to practice prepared materials.
Submitted tutorial proposals will be reviewed by the ISC 2024 Tutorials Committee, which is chaired by Shadi Ibrahim, Inria, France, with Diana Moise, HPE, Switzerland as Deputy Chair.
All tutorial attendees require a tutorial pass. For accepted tutorials, ISC will provide a limited number of complimentary tutorial participation passes to tutorial presenters.
ISC 2024 registration fees will be published in early 2024.
AREAS OF INTEREST
-------------------------------
Tutorial submissions are encouraged on the following topics:
- Any area of interest listed in the call for research papers (https://www.isc-hpc.com/submissions-research-papers-2024.html <https://www.isc-hpc.com/submissions-research-papers-2024.html>).
- Additional topics that expand broader community engagement.
- Innovative and emerging HPC technologies, e.g., cloud technologies for HPC, quantum computing, artificial intelligence, and machine learning.
- Introductory tutorials for attendees new to HPC
We encourage tutorials that serve a broad audience over tutorials that focus solely on the research in a limited domain or a particular group. Practical tutorials are preferred to completely theoretical ones and we encourage organizers to incorporate hands-on sessions where appropriate.
REVIEW
------------
- Each tutorial will be reviewed by a minimum of 3 reviewers.
- Criteria for review include originality, significance, timeliness, impact, community interest, attendance in prior years (if applicable), quality, hands-on activity, and clarity of the proposal.
- Reviews will include actionable feedback related to the length of the tutorials and the organization of the content (for example, suggestions to add and remove some contents).
IMPORTANT DATES
----------------------------
Submission Deadline December 8, 2023 December 18, 2023 23:59pm AoE
Notification of Acceptance February 9, 2024
Working Materials for Tutorial Attendees due April 30, 2024
Tutorials May 12, 2024
Half-day: 9:00 am - 1:00 pm, 2:00 pm - 6:00 pm
Full-day: 9:00 am - 6:00 pm
PROGRAM COMMITTEE
-----------------------------------
Shadi Ibrahim, Inria, France (Chair)
Diana Moise, Cray, HPE, Switzerland (Deputy Chair)
Olivier Beaumont, Inria, France
Jalil BOUKHOBZA, ENSTA Bretagne, Lab-STICC CNRS UMR 6285, France
Suren Byna, The Ohio State University, Lawrence Berkeley National Laboratory, United States of America
Philip Carns, Argonne National Laboratory, United States of America
Ewa Deelman, USC Information Sciences Institute, United States of America
Aniello Esposito, HPE, Switzerland
Ana Gainaru, Oak Ridge National Laboratory, United States of America
Bilel Hadri, KAUST Supercomputing Laboratory, Saudi Arabia
Heike Jagode, University of Tennessee Knoxville, United States of America
Michael Kuhn, Otto von Guericke University Magdeburg, Germany
Jay Lofstead, Sandia National Laboratories, United States of America
Sarah Neuwirth, Johannes Gutenberg University Mainz, Jülich Supercomputing Centre (JSC), Germany
Gabriel Noaje, NVIDIA, Singapore
George Pallis, University of Cyprus, Cyprus
Antonio J. Peña, Barcelona Supercomputing Center (BSC), Spain
Anna Queralt, Polytechnic University of Catalonia, Barcelona Supercomputing Center, Spain
Ana-Lucia Varbanescu, University of Twente, University of Amsterdam, Netherlands
Amelie Chi Zhou, Hong Kong Baptist University, Hong Kong
**********************************************************
*
* 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 School of Computer Science of Charles University, Prague
Several PhD positions in theoretical computer science and discrete mathematics
are available at the School of Computer Science of Charles University, Prague,
Czech Republic. Applications are invited from candidates who have a strong
background in computer science and/or mathematics and complete their MSc.
degree by summer 2024.
are available at the School of Computer Science of Charles University, Prague,
Czech Republic. Applications are invited from candidates who have a strong
background in computer science and/or mathematics and complete their MSc.
degree by summer 2024.
* Starting date: Fall 2024.
* Application deadline: January 31, 2024.
The School of Computer Science hosts active research groups in
* algorithms and complexity,
* discrete geometry and computational topology,
* graph theory,
* number theory and combinatorics,
* artificial inteligence,
* operations research, optimization, computational social choice,
as well as other areas of computer science and discrete mathematics. See
https://www.mff.cuni.cz/en/iuuk/people/phd-positions
for more information.
Funding:
For the usual duration of the study (4 years), the School guarantees a total
net income of at least 26,000 CZK/month to doctoral students; this is often
supplemented by the grant funding. Funding from the second year on is
conditioned on the PhD candidate's good progress towards his/her degree based
on a yearly evaluation of doctoral students.
PhD students can take advantage of subsidized meals, discounted public
transport, the possibility of staying in student dormitories, and free "Czech
as foreign language" classes. The national health insurance scheme covers our
doctoral students. There is no tuition or fees for PhD students.
Application:
The application should indicate the area of interest and contain:
* a short letter of motivation (research statement),
* a professional CV,
* a letter of recommendation,
* transcripts of all courses and grades,
* copies of academic certificates (Bc and MSc, if available),
* other optional materials, e.g., copies of English language certificates if
available, published papers, etc.
The application and a letter of recommendation should be sent electronically to
positions@iuuk.mff.cuni.cz. The referees can send their letters directly to the
indicated email. In both cases, make sure that the name of the applicant is
contained in the subject.
Inquiries can be directed to Zdenek Dvorak <rakdver@iuuk.mff.cuni.cz> (PhD
program board chair).
**********************************************************
*
* 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 : Fun with Algorithms 2024
The Twelfth International Conference on Fun with Algorithms (FUN 2024) will be held on the island of La Maddalena, Sardinia, Italy<https://en.wikipedia.org/wiki/La_Maddalena>, in 4-8 June 2024, at Hotel Le Nereidi<https://www.lenereidihotel.com/>.
Webpage: https://sites.google.com/unipi.it/fun2024
FUN is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that are "fun" but also original and scientifically solid. "Fun" can be defined in many ways: we think of fun results as being amusing or entertaining by their display of elegance, simplicity, surprise, originality, or wit. The topics of interest include all aspects of algorithm design and analysis under any computing model. For more details please check Fun w. Algorithms<https://sites.google.com/d/1D9CDYrV8xA6woFfb64vCrbU_PiK4EH_Z/p/1DmARhr7r01WkiyTGs6YwLNgMdDa-kFMw/edit> CFP page.
This year, FUN will host the Computer Science Salon des Refusés (CSSR 2024) as a separate track named after the famous 1863 Salon des Refusés<https://en.wikipedia.org/wiki/Salon_des_Refus%C3%A9s> painting exhibition. It aims to be a "salon" in two senses of the word: First, "salon" as an exhibition of ideas in Computer Science that in their infancy were rejected from a major venue but later proven to be highly influential, and second "salon" as a meeting of convivial people getting together to share both amusement and learning.
The way to participate in the salon is to propose a talk which is a survey of a published CS paper (preferably with an algorithmic bent) and its aftermath. The subject paper must satisfy the following conditions:
1. It should be at least 8 years old and in its initial form should have been rejected (as lacking value) from one or more major conferences or journals in the field.
2. It was later published and proved to be influential as evidenced by citations, prizes, etc.
For more details please check the Salon de Refusés<https://sites.google.com/d/1D9CDYrV8xA6woFfb64vCrbU_PiK4EH_Z/p/1m7mkHxIadE8qCbTNaGVwO8YjQPzJWHL8/edit> CFP page.
Important dates:
* Submission deadline: February 20, 2024 (End of Day, Anywhere on Earth)
* Notification date: April 2, 2024
* Final version due: April 15, 2024
* Conference date: June 4 - 8, 2024
Webpage: https://sites.google.com/unipi.it/fun2024
FUN is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that are "fun" but also original and scientifically solid. "Fun" can be defined in many ways: we think of fun results as being amusing or entertaining by their display of elegance, simplicity, surprise, originality, or wit. The topics of interest include all aspects of algorithm design and analysis under any computing model. For more details please check Fun w. Algorithms<https://sites.google.com/d/1D9CDYrV8xA6woFfb64vCrbU_PiK4EH_Z/p/1DmARhr7r01WkiyTGs6YwLNgMdDa-kFMw/edit> CFP page.
This year, FUN will host the Computer Science Salon des Refusés (CSSR 2024) as a separate track named after the famous 1863 Salon des Refusés<https://en.wikipedia.org/wiki/Salon_des_Refus%C3%A9s> painting exhibition. It aims to be a "salon" in two senses of the word: First, "salon" as an exhibition of ideas in Computer Science that in their infancy were rejected from a major venue but later proven to be highly influential, and second "salon" as a meeting of convivial people getting together to share both amusement and learning.
The way to participate in the salon is to propose a talk which is a survey of a published CS paper (preferably with an algorithmic bent) and its aftermath. The subject paper must satisfy the following conditions:
1. It should be at least 8 years old and in its initial form should have been rejected (as lacking value) from one or more major conferences or journals in the field.
2. It was later published and proved to be influential as evidenced by citations, prizes, etc.
For more details please check the Salon de Refusés<https://sites.google.com/d/1D9CDYrV8xA6woFfb64vCrbU_PiK4EH_Z/p/1m7mkHxIadE8qCbTNaGVwO8YjQPzJWHL8/edit> CFP page.
Important dates:
* Submission deadline: February 20, 2024 (End of Day, Anywhere on Earth)
* Notification date: April 2, 2024
* Final version due: April 15, 2024
* Conference date: June 4 - 8, 2024
Tami Tamir - FUN PC Chair
Andrei Broder - Salon des Refusés PC Chair
**********************************************************
*
* 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] [Scheduling seminar] Céline Swennenhuis (ALGO, TU Eindhoven) | December 13 | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints
Dear scheduling researcher,
We are delighted to announce the talk given by Céline Swennenhuis (ALGO,
TU Eindhoven).
The title is "A Subexponential Time Algorithm for Makespan Scheduling of
Unit Jobs with Precedence Constraints".
The seminar will take place on Zoom on Wednesday, December 13 at 14:00 UTC.
We are delighted to announce the talk given by Céline Swennenhuis (ALGO,
TU Eindhoven).
The title is "A Subexponential Time Algorithm for Makespan Scheduling of
Unit Jobs with Precedence Constraints".
The seminar will take place on Zoom on Wednesday, December 13 at 14:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/98061412979?pwd=UVVmTnhnOHpiMUg2bW5pVFlHSENXdz09
Meeting ID: 980 6141 2979
Passcode: 208805
You can follow the seminar online or offline on our Youtube channel as well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A
The abstract follows.
In a classical scheduling problem, we are given a set of n jobs of unit
length along with precedence constraints, and the goal is to find a
schedule of these jobs on m identical parallel machines that minimizes
the makespan. Using the standard 3-field notation, it is known as
Pm|prec, p_j=1|Cmax. Settling the complexity of Pm|prec, p_j=1|Cmax even
for m=3 machines is, together with Subgraph Isomorphism, among the last
two open problems from the book of Garey and Johnson [GJ79] for which
the computational complexity remains a mystery. We present an algorithm
for this problem that runs in (1 + n/m)^{O(√(nm))} time, which is
subexponential when m=o(n). For m=3, this equals a runtime of
2^{O(√(n)log(n))} time.
The next talk in our series will be in January. Stay tuned.
For more details, please visit https://schedulingseminar.com/
With kind regards
Zdenek, Mike and Guohua
--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/
**********************************************************
*
* 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
