Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011)

• Graph expansion and communication costs of fast matrix multiplication
  Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 1-11
• Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
  Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 13-22
• Linear-work greedy parallel approximate set cover and variants
  Guy E. Blelloch, Richard Peng, Kanat Tangwongsan
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 23-32
• Parallelism in dynamic well-spaced point sets
  Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoğlu
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 33-42
• A study of transactional memory vs. locks in practice
  Victor Pankratius, Ali-Reza Adl-Tabatabai
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 43-52
• Optimizing hybrid transactional memory: The importance of nonspeculative operations
  Torvald Riegel, Patrick Marlier, Martin Nowack, Pascal Felber, Christof Fetzer
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 53-64
• Flat-combining NUMA locks
  Dave Dice, Virendra J. Marathe, Nir Shavit
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 65-74
• Location-based memory fences
  Edya Ladan-Mozes, I-Ting Angelina Lee, Dmitry Vyukov
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 75-84
• Filtering: A method for solving graph problems in MapReduce
  Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 85-94
• Parallelism and data movement characterization of contemporary application classes
  Victoria Caparrós Cabezas, Phillip Stanley-Marbell
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 95-104
• Work-stealing for mixed-mode parallelism by deterministic team-building
  Martin Wimmer, Jesper Larsson Träff
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 105-115
• The Pochoir stencil compiler
  Yuan Tang, Rezaul Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 117-128
• Full reversal routing as a linear dynamical system
  Bernadette Charron-Bost, Matthias Fuegger, Jennifer L. Welch, Josef Widder
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 129-130
• Better speedups for parallel Max-Flow
  George Constantin Caragea, Uzi Vishkin
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 131-133
• Reclaiming the energy of a schedule, models and algorithms
  Guilaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 135-136
• Paging for multicore processors
  Alejandro López-Ortiz, Alejandro Salinger
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 137-138
• A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
  Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 139-147
• Stabilizing consensus with the power of two choices
  Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 149-158
• Convergence of local communication chain strategies via linear transformations: Or how to trade locality for speed
  Peter Kling, Friedhelm Meyer auf der Heide
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 159-166
• The car sharing problem
  Patrick Briest, Christoph Raupach
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 167-175
• Approximation algorithms for secondary spectrum auctions
  Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 177-186
• Maximising lifetime for fault-tolerant target coverage in sensor networks
  Thomas Erlebach, Tom Grant, Frank Kammer
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 187-196
• Convergence to equilibrium of logit dynamics for strategic games
  Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 197-206
• On a bounded budget network creation game
  Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 207-214
• Online packet-routing in grids with bounded buffers
  Guy Even, Moti Medina
  Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011), 2011, pp. 215-224