Looking forward to seeing you (virtually) on July 6-8! More information is
available on our homepage: http://spaa.acm.org/.
*SPAA 2021 Accepted Papers*
Xiaojun Dong, Yan Gu <https://www.cs.ucr.edu/~ygu/>, Yihan Sun
<https://www.cs.ucr.edu/~yihans/> and Yunming Zhang
<https://yunmingzhang17.github.io/>. Efficient Stepping Algorithms and
Implementations for Parallel Shortest Paths
Vijaya Ramachandran and Elaine Shi. Data Oblivious Algorithms for Multicores
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrović and
Yasamin Nazari. Massively Parallel Algorithms for Distance Approximation
and Spanners
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela
<https://jukkasuomela.fi/> and Jara Uitto. Efficient Load-Balancing through
Distributed Token Dropping
Janardhan Kulkarni, Stefan Schmid and Pawel Schmidt. Scheduling
Opportunistic Links in Two-Tiered Reconfigurable Datacenters
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost
<http://www.matthias-rost.de/>, Stefan Schmid
<http://www.net.t-labs.tu-berlin.de/~stefan/> and Philipp Zschoche. Optimal
Virtual Network Embeddings for Tree Topologies
Keren Censor-Hillel <http://www.cs.technion.ac.il/~ckeren/>, Victor Kolobov
and Gregory Schwartzman. Finding Subgraphs in Highly Dynamic Networks
Susanne Albers and Jens Quedenfeld. Algorithms for Right-Sizing
Heterogeneous Data Centers
Sungjin Im <http://faculty.ucmerced.edu/sim3/>, Ravi Kumar, Mahshid
Montazer Qaem and Manish Purohit. Non-Clairvoyant Scheduling with
Predictions
Gal Sela and Erez Petrank. Durable Queues: The Second Amendment
Yi-Jun Chang, Ran Duan and Shunhua Jiang. Near-Optimal Time-Energy
Trade-Offs for Deterministic Leader Election
Mohammadtaghi Hajiaghayi <http://www.cs.umd.edu/~hajiagha/>, Hamed Saleh
<https://www.cs.umd.edu/~hamed/>, Saeed Seddighin
<https://sites.google.com/view/saeedrezaseddighin> and Xiaorui Sun
<https://www.cs.uic.edu/~xiaorui/>. String Matching with Wildcards in the
Massively Parallel Computation Model
Barun Gorain <https://sites.google.com/site/barungorainiitg/home>, Avery
Miller <http://cs.umanitoba.ca/~amiller/> and Andrzej Pelc
<http://w3.uqo.ca/pelc/main.html>. Four Shades of Deterministic Leader
Election in Anonymous Networks
Mozhengfu Liu and Xueyan Tang. Analysis of Busy-Time Scheduling on
Heterogeneous Machines
Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu,
Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta and Torsten
Hoefler. Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O
Lower Bounds for Statically Analyzable Programs
Daniel Anderson <https://danielanderson.net/> and Guy Blelloch
<http://www.cs.cmu.edu/~guyb/>. Parallel Minimum Cuts in O(m log2(n)) Work
and Low Depth
Keren Censor-Hillel, Dean Leitersdorf and Volodymyr Polosukhin. On Sparsity
Awareness in Distributed Computations
Daniel Anderson <https://danielanderson.net/>, Guy Blelloch
<http://www.cs.cmu.edu/~guyb/>, Anubhav Baweja and Umut Acar
<http://www.umut-acar.org/>. Efficient Parallel Self-adjusting Computation
Lukas Gianinazzi, Maciej Besta, Yannick Schaffner and Torsten
Hoefler. Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Nikhil Bansal, Seffi Naor and Ohad Talmon. Efficient Online Weighted
Multi-Level Paging
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory
and Mohammad Javanmard. Low-Depth Parallel Algorithms for the
Binary-Forking Model
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory
and Yimin Zhu. Fast Stencil Computations using Fast Fourier Transforms
Yannic Maus. Distributed Graph Coloring Made Easy
Dave Dice and Alex Kogan. Hemlock : Compact and Scalable Mutual Exclusion
Andrés López-Martínez, Sagnik Mukhopadhyay <http://www.csc.kth.se/~sagnik/>
and Danupon Nanongkai <https://sites.google.com/site/dannanongkai/>.
Work-Optimal
Parallel Minimum Cuts for Non-Sparse Graphs
Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner,
Anna Melnichenko, Jannik Peters, Daniel Stephan and Michael
Vaichenker. Efficiency and Stability in Euclidean Network Design
Seth Gilbert, Uri Meir, Ami Paz <https://sites.google.com/view/amipaz/> and
Gregory Schwartzman. On the Complexity of Load Balancing in Dynamic Networks
Michael Elkin and Shaked Matar. Deterministic PRAM Approximate Shortest
Paths in Polylogarithmic Time and Slightly Super-Linear Work.
Nikita Koval, Alexander Fedorov and Dan Alistarh
<http://people.csail.mit.edu/alistarh/>. A Scalable Concurrent Algorithm
for Dynamic Connectivity
Dariusz Kowalski and Miguel A. Mosteiro. Supervised Consensus in Anonymous
Dynamic Networks
Konstantinos Dogeas, Evripidis Bampis, Fanny Pascual, Giorgio Lucarelli and
Alexander Kononov. Speed-scaling with explorable uncertainty
James Aimone, Yang Ho, Ojas Parekh, Cynthia Phillips
<http://www.cs.sandia.gov/~caphill/>, Ali Pinar
<http://www.sandia.gov/~apinar>, William Severa and Yipu Wang. Provable
Advantages for Graph Algorithms in Spiking Neural Networks
Michael Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton,
Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Don
Porter, Guido Tagliavini, Janet Vorobyeva and Evan West. Paging and the
Address Translation Problem
Yifan Xu, Kunal Agrawal and I-Ting Angelina Lee. Efficient Parallel
Determinacy Race Detection for Structured Futures
Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dhulipala, Yan Gu
and Charles McGuffey. The Processing-in-Memory Model
*SPAA 2021 Accepted Brief Announcement*
Gali Sheffi, Maurice Herlihy and Erez Petrank. VBR: Version Based
Reclamation
Nathan Beckmann, Phillip B. Gibbons <http://www.cs.cmu.edu/~gibbons/> and
Charles McGuffey. Block-Granularity-Aware Caching
Sakib Chowdhury and Wojciech Golab <https://ece.uwaterloo.ca/~wgolab/>.
Brief Announcement: A Scalable Recoverable Skip List for Persistent Memory
Diego Cepeda and Wojciech Golab. PHPRX: An Efficient Hash Table for
Persistent Memory
Adam Gancorz, Tomasz Jurdzinski, Mateusz Lewko and Andrzej Pelc
<http://w3.uqo.ca/pelc/main.html>. Deterministic Size Discovery and
Topology Recognition in Radio Networks with Short Labels
Ramtin Afshar, Michael T. Goodrich, Pedro Matias and Martha C. Osegueda.
Parallel Network Mapping Algorithms
David Gureya, João Barreto and Vladimir Vlassov. BALM: QoS-Aware Memory
Bandwidth Partitioning for Multi-Socket Cloud Nodes
Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov,
Iosif Salem <https://sites.google.com/site/iosifsalem/> and Stefan Schmid
<http://www.net.t-labs.tu-berlin.de/~stefan/>. Lazy Self-Adjusting
Bounded-Degree Networks for the Matching Model
Yifan Xu, Anchengcheng Zhou, Grace Yin, Kunal Agrawal, I-Ting Angelina Lee
and Tao B. Schardl. Efficient Access History for Race Detection
Yaodong Sheng, Ahmed Hassan and Michael Spear. Semantic Conflict Detection
for Transactional Data Structure Libraries
Andrew Berns <http://www.cs.uni.edu/~adberns/>. Network Scaffolding for
Efficient Stabilization of the Chord Overlay Network
Rui Li, Yufan Xu, Aravind Sukumaran-Rajam, Atanas Rountev and P Sadayappan.
Efficient distributed algorithms for Convolutional Neural Networks
Subhash Bhagat and Anisur Rahaman Molla
<https://sites.google.com/site/mollaanisurrahaman/>. Brief Announcement:
Min-Max Gathering of Oblivious Robots
------
Yan Gu
Assistant Professor,
Computer Science and Engineering Department,
University of California, Riverside
https://www.cs.ucr.edu/~ygu
############################
Unsubscribe:
https://optout.acm.org/unsubscribe.cfm?rl=SPAA&RE=&UEMAIL;
|