SPAA Archives

ACM SPAA Participants List


Options: Use Forum View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

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

Print Reply
ACM SPAA Participants List <[log in to unmask]>
Fri, 9 Sep 2022 09:42:41 +1000
multipart/alternative; boundary="00000000000044ee5005e832fe5c"
text/plain (5 kB) , text/html (25 kB)
The 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA
’23) <> will run from June 17th to June 19th, 2023.
Workshops and tutorials will be on June 16th. SPAA 2023 will be held as
part of ACM FCRC <> in Orlando, Florida.

Submissions are sought in all areas of parallel and distributed computing,
including algorithms, data structures, computational models, complexity
theory, architectures, performance engineering, languages, runtime systems,
compilers, programming systems, and networking systems. Papers that are
purely theoretical, purely experimental, or contain both theory and
experiments are welcome.  Topics of interest include, but are not limited

   - *Parallel and Distributed Algorithms*
   - *Parallel, Concurrent, and Distributed Data Structures*
   - *Models for Parallel and Distributed Computing*
   - *Parallel and Distributed Architectures*
   - *Parallel Programming Languages*
   - *System Software for Parallel and Concurrent Programming (including
   but not limited to Runtime, Compilers, and Tools)*
   - *Parallel Programming Frameworks and Domain-Specific Languages*
   - *Management of Massive Data Sets*
   - *Transactional Memory Hardware and Software*
   - *Supercomputer Architecture and Computing*
   - *Routing and Information Dissemination*
   - *Peer-to-Peer Systems*
   - *Mobile, Ad-Hoc, and Sensor Networks*
   - *Synergy of Parallelism in Algorithms, Programming and Architecture*
   - *Memory or I/O-efficient algorithms*
   - *Parallel Complexity Theory*
   - *Green Computing & Power-Efficient Architectures*
   - *Instruction Level Parallelism and VLSI*
   - *Scheduling Algorithms for Parallel Machines*

Important Deadlines:
Abstract registration:  January 12, 2023
Full papers submission:  January 16, 2023
Rebuttal:  March 4-7, 2023
Notification:  March 22, 2023
Camera-ready:  April 20, 2023Submission details:

Please indicate in the title of your submission whether this is a regular
paper or a brief announcement. All regular rejected papers automatically
will be considered for brief announcements. Titles of regular papers which
should not be considered for this option should mention “full paper only”
after the title. To help find the appropriate reviewers for your
submission, after the title, please write the letter corresponding to the
category that your submission falls under: purely theoretical (*A*), purely
experimental (*B*), or mix of theory and experiments (*C*).

Submissions must use the final ACM “sigconf” format from More details are
forthcoming at
Regular papers:

A regular paper submission must report on original research that has not
been previously or concurrently published.  Submitted manuscripts may not
exceed ten (10) single-spaced double-column pages excluding bibliography.
All necessary details to substantiate the claims of the paper should be
included in a clearly marked appendix.  However, the reviewers are not
obligated to read the appendix.
Brief announcements:

Examples of good brief announcements include: work in progress,
announcement of tools/libraries, challenge problems posted to the
community, and corrections to earlier results. Brief announcements may also
include smaller results of interest. Submitted manuscripts may not exceed
three (3) single-spaced double-column pages for brief announcements
including bibliography.
Double-Blind Policy:

SPAA 2023 will employ a lightweight double-blind review process. That
means, the submission should omit authors’ names, affiliations, and contact
information. In addition, if the submission refers to prior work done by
the authors, the reference should be made in third person. Any supplemental
materials, if applicable, should also be anonymized. However, authors are
free to disseminate their ideas or draft versions of the paper as they
normally would, such as submitting them to arXiv or giving talks on their
research ideas. The reviewers will be asked to refrain from actively
looking for the identity of the authors via web search.
Conflict of Interest Policy:

To ensure a fair and high-quality reviewing process we ask ALL authors of a
submitted paper to register their conflicts with the PC members at the
submission site.  The following categories are considered as a conflict of

   - Academic advisor or advisee (with no time limit)
   - Postdoctoral mentor or mentee (with no time limit)
   - Collaborators within the past three years, including a joint research
   or development project, a joint paper, or a funding relationship
   - Members of the same institution within the past 3 years
   - Family members or close friends
   - Someone involved in an alleged incident of harassment (not required
   that the incident be reported)
   - Anyone whose relationship with an author would prevent the reviewer
   from being objective in his/her assessment

Note that if the program chair has reason to doubt the validity of the
claim of conflict of interest, then they may request that a ToC advocate
confidentially verify the reason for the conflict.  Falsely declared
conflicts (i.e., do not satisfy one of the listed reasons) risk rejection
without consideration of merit.  If an author believes that he or she has a
valid reason for a conflict of interest not listed above or if he or she is
uncertain, the author is encouraged to contact the program chair.
Additional Notes:
If an author has any further questions regarding the policies listed above,
please contact the PC chair Julian Shun by email (jshun AT mit DOT edu) and
prefix the subject title with “[SPAA 23]”.


Yan Gu
Assistant Professor,
Computer Science and Engineering Department,
University of California, Riverside


You can unsubscribe at any time through this link: