• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 50 matches

• 2021
• 
  Gal Sela, Erez Petrank:
  Durable Queues: The Second Amendment. SPAA 2021: 385-397
• 
  Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
  Efficient Load-Balancing through Distributed Token Dropping. SPAA 2021: 129-139
• 
  Yifan Xu, Kunal Agrawal, I-Ting Angelina Lee:
  Efficient Parallel Determinacy Race Detection for Structured Futures. SPAA 2021: 398-409
• 
  Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl:
  Efficient Access History for Race Detection. SPAA 2021: 449-451
• 
  Rui Li, Yufan Xu, Aravind Sukumaran-Rajam, Atanas Rountev, P. Sadayappan:
  Efficient Distributed Algorithms for Convolutional Neural Networks. SPAA 2021: 439-442
• 
  Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
  Parallel Network Mapping Algorithms. SPAA 2021: 410-413
• 
  Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Mohammad Mahdi Javanmard:
  Low-Span Parallel Algorithms for the Binary-Forking Model. SPAA 2021: 22-34
• 
  Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu:
  Fast Stencil Computations using Fast Fourier Transforms. SPAA 2021: 8-21
• 
  James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang:
  Provable Advantages for Graph Algorithms in Spiking Neural Networks. SPAA 2021: 35-47
• 
  Susanne Albers, Jens Quedenfeld:
  Algorithms for Right-Sizing Heterogeneous Data Centers. SPAA 2021: 48-58
• 
  Daniel Anderson, Guy E. Blelloch:
  Parallel Minimum Cuts in O(m log²n) Work and Low Depth. SPAA 2021: 71-82
• 
  Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar:
  Efficient Parallel Self-Adjusting Computation. SPAA 2021: 59-70
• 
  Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
  Speed Scaling with Explorable Uncertainty. SPAA 2021: 83-93
• 
  Nikhil Bansal, Joseph (Seffi) Naor, Ohad Talmon:
  Efficient Online Weighted Multi-Level Paging. SPAA 2021: 94-104
• 
  Nathan Beckmann, Phillip B. Gibbons, Charles McGuffey:
  Block-Granularity-Aware Caching. SPAA 2021: 414-416
• 
  Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter, Guido Tagliavini, Janet Vorobyeva, Evan West:
  Paging and the Address-Translation Problem. SPAA 2021: 105-117
• 
  Andrew Berns:
  Network Scaffolding for Efficient Stabilization of the Chord Overlay Network. SPAA 2021: 417-419
• 
  Subhash Bhagat, Anisur Rahaman Molla:
  Min-Max Gathering of Oblivious Robots. SPAA 2021: 420-422
• 
  Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
  Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA 2021: 118-128
• 
  Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick:
  SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. SPAA 2021: 1-7
• 
  Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
  Finding Subgraphs in Highly Dynamic Networks. SPAA 2021: 140-150
• 
  Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
  On Sparsity Awareness in Distributed Computations. SPAA 2021: 151-161
• 
  Diego Cepeda, Wojciech M. Golab:
  PHPRX: An Efficient Hash Table for Persistent Memory. SPAA 2021: 423-425
• 
  Yi-Jun Chang, Ran Duan, Shunhua Jiang:
  Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. SPAA 2021: 162-172
• 
  Sakib Chowdhury, Wojciech M. Golab:
  A Scalable Recoverable Skip List for Persistent Memory. SPAA 2021: 426-428
• 
  Dave Dice, Alex Kogan:
  Hemlock: Compact and Scalable Mutual Exclusion. SPAA 2021: 173-183
• 
  Xiaojun Dong, Yan Gu, Yihan Sun, Yunming Zhang:
  Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. SPAA 2021: 184-197
• 
  Michael Elkin, Shaked Matar:
  Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work. SPAA 2021: 198-207
• 
  Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid:
  Toward Self-Adjusting Networks for the Matching Model. SPAA 2021: 429-431
• 
  Alexander Fedorov, Nikita Koval, Dan Alistarh:
  A Scalable Concurrent Algorithm for Dynamic Connectivity. SPAA 2021: 208-220

skipping 20 more matches