- 2011
- Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu:
Parallelism in dynamic well-spaced point sets. SPAA 2011: 33-42 - Hrishikesh B. Acharya, Mohamed G. Gouda:
Brief announcement: RedRem: a parallel redundancy remover. SPAA 2011: 267-268 - Susanne Albers, Antonios Antoniadis, Gero Greiner:
On multi-processor speed scaling with migration: extended abstract. SPAA 2011: 279-288 - James Aspnes, Faith Ellen:
Tight bounds for anonymous adopt-commit objects. SPAA 2011: 317-324 - Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to equilibrium of logit dynamics for strategic games. SPAA 2011: 197-206 - Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert:
Brief announcement: reclaiming the energy of a schedule, models and algorithms. SPAA 2011: 135-136 - Yossi Azar, Aviv Nisgav, Boaz Patt-Shamir:
Recommender systems with non-binary grades. SPAA 2011: 245-252 - Grey Ballard, James Demmel, Andrew Gearhart:
Brief announcement: communication bounds for heterogeneous architectures. SPAA 2011: 257-258 - Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication: regular submission. SPAA 2011: 1-12 - Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Scheduling irregular parallel computations on hierarchical caches. SPAA 2011: 355-366 - Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA 2011: 13-22 - Guy E. Blelloch, Richard Peng, Kanat Tangwongsan:
Linear-work greedy parallel approximate set cover and variants. SPAA 2011: 23-32 - Patrick Briest, Christoph Raupach:
The car sharing problem. SPAA 2011: 167-176 - Victoria Caparrós Cabezas, Phillip Stanley-Marbell:
Parallelism and data movement characterization of contemporary application classes. SPAA 2011: 95-104 - George Constantin Caragea, Uzi Vishkin:
Brief announcement: better speedups for parallel max-flow. SPAA 2011: 131-134 - Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Brief announcement: full reversal routing as a linear dynamical system. SPAA 2011: 129-130 - Tyler Crain, Damien Imbs, Michel Raynal:
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. SPAA 2011: 315-316 - Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer:
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. SPAA 2011: 139-148 - David Dice:
Brief announcement: a partitioned ticket lock. SPAA 2011: 309-310 - David Dice, Virendra J. Marathe, Nir Shavit:
Flat-combining NUMA locks. SPAA 2011: 65-74 - David Dice, Oleksandr Otenko:
Brief announcement: multilane - a concurrent blocking multiset. SPAA 2011: 313-314 - Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 - Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee:
On a bounded budget network creation game. SPAA 2011: 207-214 - Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA 2011: 187-196 - Guy Even, Moti Medina:
Online packet-routing in grids with bounded buffers. SPAA 2011: 215-224 - Panagiota Fatourou, Nikolaos D. Kallimanis:
A highly-efficient wait-free universal construction. SPAA 2011: 325-334 - Cyril Gavoille, Christian Sommer:
Sparse spanners vs. compact routing. SPAA 2011: 225-234 - Michael T. Goodrich:
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. SPAA 2011: 379-388 - Michael T. Goodrich, Michael Mitzenmacher:
Brief announcement: large-scale multimaps. SPAA 2011: 259-260 - Vincent Gramoli, Rachid Guerraoui:
Brief announcement: transaction polymorphism. SPAA 2011: 311-312