Friday, February 5, 2021

[DMANET] SPAA 2021 Last Call for Papers

SPAA 2021 Call for Papers
33th ACM Symposium on Parallelism in
Algorithms and Architectures
July 6 - 8, 2021
Philadelphia, PA, USA (fully virtual)

Important Deadlines:
Abstract registration: February 8, 2021, 11:59pm AoE
Full papers submission: February 11, 2021, 11:59pm AoE
Rebuttal: April 6-8, 2021
Notification: April 18, 2021
Camera-ready: May 16, 2021

Contributed papers are sought in all areas of parallel algorithms and architectures, encompassing any computational system that can perform multiple operations or tasks simultaneously. Topics of interest include, but are not limited to:

• Parallel and Distributed Algorithms
• Parallel and Distributed Data Structures
• Green Computing & Power-Efficient Architectures
• Management of Massive Data Sets
• Parallel Complexity Theory
• Parallel and Distributed Architectures
• Multi-Core Architectures
• Instruction Level Parallelism and VLSI
• Compilers and Tools for Concurrent Programming
• Supercomputer Architecture and Computing
• Transactional Memory Hardware and Software
• The Internet and the World Wide Web
• Game Theory and Collaborative Learning
• Routing and Information Dissemination
• Resource Management and Awareness
• Peer-to-Peer Systems
• Mobile, Ad-Hoc, and Sensor Networks
• Robustness, Self-Stabilization, and Security
• Synergy of Parallelism in Algorithms, Programming and Architecture


Submission details:

Please indicate in the title of your manuscript 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. Visit this link<http://spaa.acm.org/2021/submit.html> for submission details.

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. The title page and bibliography are not counted toward the ten pages. All necessary details to substantiate the claims of the paper should be included in a clearly marked appendix. If desired, the authors can simply attach a copy of the full paper as an appendix. Regular papers will be allotted 10 pages plus bibliography in the proceedings.

Brief announcements:

Examples of good brief announcements include: work in progress, announcement of tools/libraries, challenge problems posted to the community, corrections to earlier results. Brief announcements may also include smaller results of interest. Submitted manuscripts may not exceed two (2) single-spaced double-column pages for brief announcements. The title page is not counted toward the two pages.

Double-Blind Policy:

Submissions to SPAA 2021 will be double-blind. Additional details are available at this link<http://spaa.acm.org/2021/submit.html>.

Awards:

The program committee will select a set of best and outstanding papers, which will be presented in a special session of the conference.

Safe ToC:

SPAA is proud to be affiliated with the SafeToC<http://safetoc.org/> initiative.

Program Chair
Yossi Azar<https://www.cs.tau.ac.il/~azar/>, Tel Aviv University
Program Committee
Hagit Attiya<https://hagit.net.technion.ac.il/>, Technion
Guy Blelloch<https://www.cs.cmu.edu/~guyb/>, CMU
Rezaul Chowdhury<https://www3.cs.stonybrook.edu/~rezaul/%20target=>, Stony Brook University
Martin Farach-Colton<https://www.cs.rutgers.edu/~farach/>, Rutgers University
Panagiota Fatourou<https://www.cs.tau.ac.il/~azar/>, FORTH and University of Crete
Pierre Fraigniaud<http://users.ics.forth.gr/~faturu/>, Université de Paris and CNRS
Mohsen Ghaffari<https://people.inf.ethz.ch/gmohsen/>, ETH Zurich
Wojciech Golab<https://ece.uwaterloo.ca/~wgolab/>, University of Waterloo
Rachid Guerraoui<https://lpdwww.epfl.ch/rachid/>, EPFL
Sungjin Im<https://faculty.ucmerced.edu/sim3/>, UC Merced
Peter Kling<https://academic.pkling.de/>, University of Hamburg
Fabian Kuhn<http://ac.informatik.uni-freiburg.de/kuhn/>, University of Freiburg
Jing Li<https://web.njit.edu/~jingli/>, NJIT
Friedhelm Meyer auf der Heide<https://www.uni-paderborn.de/person/15523>, Paderborn University
Avery Miller<http://www.cs.umanitoba.ca/~amiller/>, University of Manitoba
Vahab Mirrokni<https://research.google/people/mirrokni/>, Google Research
Benjamin Moseley<http://www.andrew.cmu.edu/user/moseleyb/>, CMU
Gopal Pandurangan<https://sites.google.com/site/gopalpandurangan/>, University of Houston
Boaz Patt-Shamir<https://www.eng.tau.ac.il/~boaz/>, Tel Aviv University
Rajmohan Rajaraman<https://www.ccs.neu.edu/home/rraj/>, Northeastern University
Tao B. Schardl<http://web.mit.edu/neboat/www/>, MIT
Julian Shun<https://people.csail.mit.edu/jshun/>, MIT
Yihan Sun<https://www.cs.cmu.edu/~yihans/>, UC Riverside
Xueyan Tang<https://personal.ntu.edu.sg/asxytang/>, Nanyang Technological University
Kanat Tangwongsan<https://www.philinelabs.net/~ktangwon/>, Mahidol University

SPAA General Chair
Kunal Agrawal<https://www.cse.wustl.edu/~kunal/>, WUSTL
SPAA Treasurer
David Bunde<http://faculty.knox.edu/dbunde/>, Knox College
SPAA Publicity Chairs
Yan Gu<http://people.csail.mit.edu/guyan/>, UC Riverside
Julian Shun<http://people.csail.mit.edu/jshun/>, MIT
SPAA Workshop/Tutorial Chair
Yan Gu<http://people.csail.mit.edu/guyan/>, UC Riverside
SPAA SafeTOC Advocate
Vijaya Ramachandran<http://www.cs.utexas.edu/users/vlr/>, University of Texas at Austin
Local Arrangement Chair
Roberto Palmieri<http://www.cse.lehigh.edu/~palmieri/>, Lehigh University


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