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 [2]	Hilfe

Suche: Booktitle=Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montr{\'e}al, Qu{\'e}bec, Canada, July 23-25, 2013)

• Fast greedy algorithms in MapReduce and streaming
  Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 1-10
• Reduced hardware transactions: A new approach to hybrid transactional memory
  Alexander Matveev, Nir Shavit
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 11-22
• Recursive design of hardware priority queues
  Yehuda Afek, Anat Bremler-Barr, Liron Schiff
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 23-32
• Drop the anchor: Lightweight memory management for non-blocking data structures
  Anastasia Braginsky, Alex Kogan, Erez Petrank
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 33-42
• Scalable statistics counters
  Dave Dice, Yossi Lev, Mark Moir
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 43-52
• Storage and search in dynamic peer-to-peer networks
  John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 53-62
• Broadcasting in logarithmic time for ad hoc network nodes on a line using MIMO
  Thomas Janson, Christian Schindelhauer
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 63-72
• Expected sum and maximum of displacement of random sensors for coverage of a domain
  Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil Shende
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 73-82
• On dynamics in selfish network creation
  Bernd Kawald, Pascal Lenzner
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 83-92
• Truly parallel Burrows-Wheeler compression and decompression
  James Alexander Edwards, Uzi Vishkin
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 93-96
• Locality in wireless scheduling
  Magnús M. Halldórsson
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 97-98
• Universally truthful secondary spectrum auctions
  Martin Hoefer, Thomas Kesselheim
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 99-101
• Online batch scheduling for flow objectives
  Sungjin Im, Benjamin Moseley
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 102-104
• Set it and forget it - Approximating the Set Once Strip Cover problem
  Amotz Bar-Noy, Ben Baumer, Dror Rawitz
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 105-107
• Between all and nothing - Versatile aborts in hardware transactional memory
  Stephan Diestelhorst, Martin Nowack, Michael Spear, Christof Fetzer
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 108-110
• Towards a fully-articulated pessimistic distributed transactional memory
  Konrad Siek, Paweƚ T. Wojciechowski
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 111-114
• A game-theoretic model motivated by the DARPA Network Challenge
  Rajesh Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 115-118
• IRIS: A robust information system against insider DoS-attacks
  Martina Eikel, Christian Scheideler
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 119-129
• SybilCast: Broadcast on the open airwaves
  Seth Lewis Gilbert, Chaodong Zheng
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 130-139
• On-the-fly pipeline parallelism
  I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 140-151
• Reducing contention through priority updates
  Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 152-163
• HEX: Scaling honeycombs is easier than scaling clock trees
  Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 164-175
• Coalescing-branching random walks on graphs
  Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott Roche
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 176-185
• Parallel rotor walks on finite graphs and applications in discrete load balancing
  Hoda Akbari, Petra Berenbrink
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 186-195
• Parallel graph decompositions using random shifts
  Gary L. Miller, Richard Peng, Shen Chen Xu
  Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013), 2013, pp. 196-203