SPAA Archives

ACM SPAA Participants List

SPAA@LISTSERV.ACM.ORG

Options: Use Classic View

Use Proportional Font
Show HTML Part by Default
Condense Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Message-ID: <[log in to unmask]>
Sender: ACM SPAA Participants List <[log in to unmask]>
From: Michael Bender <[log in to unmask]>
Date: Thu, 18 Feb 2021 10:41:27 -0500
Content-Type: multipart/alternative; boundary="0000000000001a4f8505bb9e2cfa"
MIME-Version: 1.0
Reply-To: Michael Bender <[log in to unmask]>
Parts/Attachments: text/plain (10 kB) , text/html (12 kB)
The submission deadlines for the 2021 SIAM Conference on Applied and
Computational Discrete Algorithms (ACDA21) have been updated. The new
deadlines are:

March 8, 2021: 10-page Archival Proceedings Papers
March 8, 2021: 2-page Extended Talk Abstracts
March 8, 2021: Poster Abstracts


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

First SIAM Conference on Applied and Computational Discrete Algorithms
(ACDA)

https://www.siam.org/conferences/cm/conference/acda21
July 19-21, 2021, Online


OVERVIEW

The SIAM Conference on Applied and Computational Discrete Algorithms is a
new conference that brings together researchers who design and study
combinatorial and graph algorithms motivated by applications. ACDA is
organized by SIAM under the auspices of the SIAM Activity Group on Applied
and Computational Discrete Algorithms. ACDA subsumes the long-running
series of SIAM Workshops on Combinatorial Scientific Computing, and expands
its scope to applications of discrete models and algorithms across all
areas in the physical and life sciences and engineering, the social and
information sciences, and anywhere discrete mathematical techniques are
used to formulate and solve problems in the world. ACDA invites papers on
the formulation of combinatorial problems from applications; theoretical
analyses; design of algorithms; computational evaluation of the algorithms;
and deployment of the resulting software to enable applications.

The conference will include a refereed proceedings and additional submitted
talks that are not part of the proceedings. It will also include invited
talks, an industrial problem session, a poster session, and one or two
minitutorials to introduce general topical areas in applied combinatorics.
Awards will be given for best paper, best poster, and best student
presentation.

TYPES OF CONTRIBUTION

Papers should be submitted electronically via the EasyChair submission
system (https://easychair.org/conferences/?conf=acda21). There are three
types of submissions to ACDA, as follows. We strongly encourage making code
and data available as well.

ARCHIVAL PROCEEDINGS PAPERS

Submissions may be up to 10 pages in length, excluding references, and must
present original research that is not published or submitted elsewhere.
Submissions will be refereed, and authors will receive reviews and
notification of acceptance or rejection by approximately May 5, with final
camera-ready copy due June 1. Accepted papers will be included in the
proceedings published by SIAM. Submissions should use the LaTeX macros at
the bottom of the following web page:
http://www.siam.org/proceedings/macros.php. An author of an accepted
proceedings paper will be expected to register and present the paper at
ACDA.

Authors may, at their option, include an appendix containing proofs,
details, or additional experimental results. The appendix will be read by
the program committee members at their discretion, and will not be included
in the proceedings. The main part of the submission should therefore
contain a clear technical presentation of the merits of the paper,
including a discussion of the paper's importance within the context of
prior work and a description of the key technical and conceptual ideas used
to achieve its main claims.

DOUBLE-BLIND REVIEWING OF ARCHIVAL PROCEEDINGS PAPERS

ACDA will employ a lightweight double-blind reviewing process for
proceedings papers (but not for the other two submission categories).
Proceedings submissions should not reveal the identity of the authors in
any way. In particular, authors' names, affiliations, and email addresses
should not appear at the beginning or in the body of the submission.
Authors should ensure that any references to their own related work is in
the third person (e.g., not "We build on our previous work ..."; but rather
"We build on the work of ..."). The purpose of the double-blind reviewing
is to help PC members and external reviewers come to an initial judgment
about the paper without bias, not to make it impossible for them to
discover the authors if they were to try. Nothing should be done in the
name of anonymity that weakens the submission or makes the job of reviewing
the paper more difficult. In particular, important references should not be
omitted or anonymized. In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally would. For
example, authors may post drafts of their papers on the web, submit them to
arXiv, and give talks on their research ideas. Authors with further
questions on double-blind reviewing are encouraged to contact the PC chairs.

We strongly encourage also making code and data available; please keep in
mind the double-blind nature of the review process. We recommend including
a link to an anonymized version that makes a 'best effort' to avoid
revealing the identity of the authors (e.g., using Anonymous Github or an
anonymous Dropbox/Google Drive folder)

NON-ARCHIVAL EXTENDED ABSTRACTS FOR PRESENTATION

Submissions are 2-page extended abstracts, are not considered archival
publications, and will not appear in the proceedings. Reviewing of extended
abstracts will not be double-blind. Authors will be notified of acceptance
or rejection by approximately May 5. Rejected extended abstracts may also
be considered for poster presentation, unless the author specifies "talk
only". Submissions should use the LaTeX macros at the bottom of the
following web page: http://www.siam.org/proceedings/macros.php. An author
of an accepted abstract will be expected to register and present at ACDA.
Talks for extended abstracts will be the same length as talks for
proceedings papers.

ACDA seeks to cast a wide net for extended abstracts, emphasizing talks
that are closely connected to applications. Abstracts may describe work in
progress or work of interest to the ACDA community that is being published
archivally elsewhere. An abstract should specify the source of the problem
it describes: Is it from a paper in the literature? A newly invented
problem? From a project or person (in academia, labs, industry) that will
use the results in practice? Will the community have access to real or
surrogate data for the problem? ACDA welcomes all abstracts, but there will
be a preference for work that is motivated by specific real-world problems.
ACDA is particularly interested in descriptions of industrial problems and
applications.

POSTERS

A poster submission is in the form of a 2-page (maximum) abstract. Posters
are not considered archival, and reviewing of posters will not be
double-blind. Authors will be notified of acceptance or rejection by
approximately May 5.

THEMES

Topics of interest for ACDA include but are not limited to discrete or
combinatorial problems and algorithms arising in:

* Algorithm engineering
* Algorithmic differentiation (AD)
* Combinatorial optimization and mathematical programming, including
scheduling and resource allocation problems
* Combinatorial scientific computing (CSC) including models, algorithms,
applications, numerical methods, and problems arising in data analysis
* Computational biology and bioinformatics
* Data Management and Data Science
* Design and analysis of application-inspired exact, randomized, streaming,
and approximation algorithms
* Graph and hypergraph algorithms, including problems arising in Network
Science and Complex Networks
* Interaction between algorithms and modern computing platforms, including
challenges arising from memory hierarchies, accelerators, and novel memory
technologies
* Machine learning and statistical methods for solving combinatorial
problems
* Numerical linear algebra, including sparse matrix computations and
randomized approaches
* Parallel and distributed computing, including algorithms, architectures,
distributed systems, and all parallelism ranging from instruction-level and
multi-core all the way to clouds and exascale
* Other applications arising from security, computational finance,
computational chemistry/physics, quantum computing, etc.

INVITED SPEAKERS

* Lenore Cowen (Tufts University)
* Andrew V. Goldberg (Amazon)
* Dorit Hochbaum (University of California, Berkeley)
* Madhav Marathe (University of Virginia)
* Henning Meyerhenke (Humboldt-Universität zu Berlin)
* Uwe Naumann (RWTH Aachen)

PROGRAM COMMITTEE

* Michael A. Bender (Stony Brook University), co-chair
* John Gilbert (University of California, Santa Barbara), co-chair
* David Bader (New Jersey Institute of Technology)
* Austin Benson (Cornell University)
* Jon Berry (Sandia National Laboratories)
* Aydin Buluc (Lawrence Berkeley National Laboratory)
* Ümit Çatalyürek (Georgia Institute of Technology)
* Tzu-Yi Chen (Pomona College)
* Alex Conway (VMware Research)
* Tim Davis (Texas A & M University)
* Maryam Dehnavi (University of Toronto)
* Lori Diachin (Livermore National Laboratory)
* Anne Driemel (University of Bonn)
* Martin Farach-Colton (Rutgers University)
* Sándor Fekete (TU Braunschweig)
* Assefaw Gebremedhin (Washington State University)
* Phil Gibbons (Carnegie Mellon University)
* Michael Goodrich (University of California)
* Oded Green (NVIDIA)
* Laura Grigori (INRIA)
* Paul Hovland (Argonne National Laboratory)
* Rob Johnson (VMware Research)
* Jeremy Kepner (MIT Lincoln Laboratory)
* Stephen Kobourov (University of Arizona)
* Sherry Li (Lawrence Berkeley National Laboratory)
* Ivana Ljubic (ESSEC Paris)
* Kamesh Madduri (Penn State University)
* Fredrik Manne (University of Bergen)
* Samuel McCauley (Williams College)
* Nicole Megow (University of Bremen)
* Michael Mitzenmacher (Harvard University)
* Jose Moreira (IBM)
* Ben Moseley (Carnegie Mellon University)
* Jelani Nelson (University of California)
* Guillaume Pallez (INRIA)
* Rob Patro (University of Maryland)
* Richard Peng (Georgia Institute of Technology)
* Ali Pinar (Sandia National Laboratories)
* Alex Pothen (Purdue University)
* Emilie Purvine (Pacific Northwest National Laboratory)
* Eva Rotenberg (Technical University of Denmark)
* Peter Sanders (Karlsruhe Institute of Technology)
* TB Schardl (Massachusetts Institute of Technology)
* Julian Shun (Massachusetts Institute of Technology)
* Sabine Storandt (University of Konstanz)
* Yihan Sun (University of California)
* David Tench (Stony Brook University)
* Shanghua Teng (University of Southern California)
* Sivan Toledo (Tel Aviv University)
* Denis Trystam (Grenoble Institute of Technology)
* Rich Vuduc (Georgia Tech)
* Andrea Walther (Humboldt-Universität zu Berlin)
* Ulrike Yang (Livermore National Laboratory)

ORGANIZING COMMITTEE

* Bruce Hendrickson (Lawrence Livermore National Laboratory), co-chair
* Blair Sullivan (University of Utah), co-chair
* Rob Bisseling (University of Utrecht)
* Christine Heitsch (Georgia Institute of Technology)
* Monika Henzinger (University of Vienna)
* Cynthia Phillips (Sandia National Labs)
* Cliff Stein (Columbia University)
* David Williamson (Cornell University)

CO-LOCATED MEETINGS

The following meetings are co-located during the week of July 19-23, 2021:

* SIAM Annual Meeting (AN21)
* SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21)
* SIAM Conference on Control and Its Applications (CT21)
* SIAM Conference on Discrete Mathematics (DM21)
* SIAM Conference on Optimization (OP21)

############################

Unsubscribe:

https://optout.acm.org/unsubscribe.cfm?rl=SPAA&RE=&UEMAIL;


ATOM RSS1 RSS2