Navigation and communication

• 
  Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Time vs. space trade-offs for rendezvous in trees. 1-10
• 
  Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan: Allowing each node to communicate only once in a distributed system: shared whiteboard models. 11-17
• 
  Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide: Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. 18-26
• 
  Christian Ortolf, Christian Schindelhauer: Online multi-robot exploration of grid graphs with rectangular obstacles. 27-36

Keynote adress

• 
  Ravi Rajwar: In search of parallel dimensions. 37

Concurrency

• 
  Yujie Liu, Stephan Diestelhorst, Michael F. Spear: Delegation and nesting in best-effort hardware transactional memory. 38-47
• 
  Jun Shirako, Nick Vrvilo, Eric G. Mercer, Vivek Sarkar: Design, verification and applications of a new read-write lock algorithm. 48-57
• 
  Anastasia Braginsky, Erez Petrank: A lock-free B+tree. 58-67

Brief Announcements

• 
  Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan: Brief announcement: the problem based benchmark suite. 68-70
• 
  Claire C. Ralph, Vitus J. Leung, Will McLendon III: Brief announcement: subgraph isomorphism on a multithreaded shared memory architecture. 71-73
• 
  Neeraj Sharma, Sandeep Sen: Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model. 74-76
• 
  Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz: Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. 77-79
• 
  Henry Lin, Frans Schalekamp: Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane. 80-81

Parallel algorithms

• 
  Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan: Parallel and I/O efficient set covering algorithms. 82-90
• 
  Fengguang Song, Jack Dongarra: A scalable framework for heterogeneous GPU-based clusters. 91-100
• 
  Richard Peng, Kanat Tangwongsan: Faster and simpler width-independent parallel algorithms for positive semidefinite programming. 101-108

Communication

• 
  Stephan Holzer, Thomas Locher, Yvonne Anne Pignolet, Roger Wattenhofer: Deterministic multi-channel information exchange. 109-120
• 
  Darko Petrovic, Omid Shahmirzadi, Thomas Ropars, André Schiper: High-performance RMA-based broadcast on the intel SCC. 121-130
• 
  Adrian Ogierman, Robert Elsässer: The impact of the power law exponent on the behavior of a dynamic epidemic type process. 131-139
• 
  Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun: Discovery through gossip. 140-149

Keynote address 2

• 
  Doug Lea: Abstraction failures in concurrent programming. 150

Concurrent objects

• 
  Elad Gidron, Idit Keidar, Dmitri Perelman, Yonathan Perez: SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer pools. 151-160
• 
  Shane V. Howley, Jeremy Jones: A non-blocking internal binary search tree. 161-171
• 
  James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler: Lower bounds for restricted-use objects: extended abstract. 172-181

Brief announcements II

• 
  Aparna Chandramowlishwaran, JeeWhan Choi, Kamesh Madduri, Richard W. Vuduc: Brief announcement: towards a communication optimal fast multipole method and its implications at exascale. 182-184
• 
  Ahmed Elnably, Peter J. Varman: Brief announcement: application-sensitive QoS scheduling in storage servers. 185-187
• 
  Kamil Rocki, Reiji Suda: Brief announcement: a GPU accelerated iterated local search TSP solver. 188-189
• 
  James Alexander Edwards, Uzi Vishkin: Brief announcement: speedups for parallel graph triconnectivity. 190-192

Parallel algorithms II

• 
  Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz: Communication-optimal parallel algorithm for strassen's matrix multiplication. 193-204
• 
  Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan: Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. 205-213
• 
  Nodari Sitchinava, Norbert Zeh: A parallel buffer tree. 214-223

Scheduling

• 
  Klaus Jansen: A_(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks. 224-235
• 
  Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo: Cache-conscious scheduling of streaming applications. 236-245
• 
  Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu: Non-clairvoyant weighted flow time scheduling with rejection penalty. 246-254
• 
  Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv: Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. 255-266

Games

• 
  Moran Feldman, Liane Lewin-Eytan, Joseph Naor: Hedonic clustering games. 267-276
• 
  John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis: Enforcing efficient equilibria in network design games via subsidies. 277-286

Parallel algorithms and data structures

• 
  I.-Ting Angelina Lee, Aamir Shafi, Charles E. Leiserson: Memory-mapping support for reducer hyperobjects. 287-297
• 
  Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa: On the cost of composing shared-memory algorithms. 298-307
• 
  Guy E. Blelloch, Jeremy T. Fineman, Julian Shun: Greedy sequential maximal independent set and matching are parallel on average. 308-317

Networks

• 
  Atish Das Sarma, Michael Dinitz, Gopal Pandurangan: Efficient computation of distance sketches in distributed networks. 318-326
• 
  Johannes Dams, Martin Hoefer, Thomas Kesselheim: Scheduling in wireless networks with rayleigh-fading interference. 327-335

last updated on Sat May 18 05:37:12 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page