Awards of the ACM Symposium on Parallelism in Algorithms and Architectures

The SPAA conference is giving annual awards for the best regular paper(s). The paper selection is done by the program committee. Past awards are:

• 2015:
  • Yossi Azar, Nikhil Devanur, Zhiyi Huang and Debmalya Panigrahi
    Speed Scaling in the Non-clairvoyant Model
• 2014:
  • Justin Thaler, Michael Mitzenmacher, and Jiayang Jiang
    Parallel Peeling Algorithms
• 2013:
  • Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii and Andrea Vattani
    Fast Greedy Algorithms in MapReduce and Streaming
    
    
  • Martina Eikel and Christian Scheideler
    IRIS: A Robust Information System Against Insider DoS-Attacks
• 2012:
  • I-Ting Lee, Aamir Shafi, and Charles Leiserson
    Memory-Mapping Support for Reducer Hyperobjects
• 2011:
  • Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz
    Graph Expansion and Communication Costs of Fast Matrix Multiplication
• 2010:
  • Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi and Tom Leighton
    Basic Network Creation Games
• 2009:
  • Matteo Frigo, Pablo Halpern, Charles E. Leiserson, and Stephen Lewin-Berlin
    Reducers and Other Cilk++ Hyperobjects
• 2008:
  • Zvika Guz, Idit Keidar, Avinoam Kolodny and Uri C. Weiser
    Utilizing Shared Data in Chip Multiprocessors with the Nahalal Architecture
• 2007:
  • Pierre Fraigniaud, Cyril Gavoille, Emmanuelle Lebhar, Zvi Lotker and Adrian Kosowski
    Universal Augmentation Schemes for Network Navigability: Overcoming the \sqrt{n}-Barrier
    
    
  • Fabian Kuhn, Thomas Locher and Roger Wattenhofer
    Tight Bounds for Distributed Selection