Table of Contents

• Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrierPierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker. 1-7 [doi]
• On triangulation of simple networksRobert Krauthgamer. 8-15 [doi]
• Strong-diameter decompositions of minor free graphsIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder. 16-24 [doi]
• Approximation algorithms for multiprocessor scheduling under uncertaintyGuolong Lin, Rajmohan Rajaraman. 25-34 [doi]
• Scheduling DAGs on asynchronous processorsMichael A. Bender, Cynthia A. Phillips. 35-45 [doi]
• Scheduling to minimize gaps and power consumptionErik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam. 46-54 [doi]
• Feasibility study of MPI implementation on the heterogeneous multi-core cell BE:::TM::: architectureArun Kumar, Naresh Jayam, Ashok Srinivasan, Ganapathy Senthilkumar, Pallav K. Baruah, Shakti Kapoor, Murali Krishna, Raghunath Sharma. 55-56 [doi]
• Evaluating synchronization techniques for light-weight multithreaded/multicore architecturesSrinivas Sridharan, Arun Rodrigues, Peter M. Kogge. 57-58 [doi]
• Towards soft optimization techniques for parallel cognitive applicationsWoongki Baek, JaeWoong Chung, Chi Cao Minh, Christos Kozyrakis, Kunle Olukotun. 59-60 [doi]
• Optimal sparse matrix dense vector multiplication in the I/O-modelMichael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari. 61-70 [doi]
• The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluationRezaul Alam Chowdhury, Vijaya Ramachandran. 71-80 [doi]
• Cache-oblivious streaming B-treesMichael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson. 81-92 [doi]
• An experimental comparison of cache-oblivious and cache-conscious programsKamen Yotov, Thomas Roeder, Keshav Pingali, John A. Gunnels, Fred G. Gustavson. 93-104 [doi]
• Scheduling threads for constructive cache sharing on CMPsShimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, Chris Wilkerson. 105-115 [doi]
• Supermatrix out-of-order scheduling of matrix operations for SMP and multi-core architecturesErnie Chan, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí, Robert A. van de Geijn. 116-125 [doi]
• Proximity-aware directory-based coherence for multi-core processor architecturesJeffery A. Brown, Rakesh Kumar, Dean M. Tullsen. 126-134 [doi]
• A parallel dynamic programming algorithm on a multi-core architectureGuangming Tan, Ninghui Sun, Guang R. Gao. 135-144 [doi]
• Tight bounds for distributed selectionFabian Kuhn, Thomas Locher, Roger Wattenhofer. 145-153 [doi]
• Local MST computation with short advicePierre Fraigniaud, Amos Korman, Emmanuelle Lebhar. 154-160 [doi]
• Distributed approximation of capacitated dominating setsFabian Kuhn, Thomas Moscibroda. 161-170 [doi]
• Packing to angles and sectorsPiotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar. 171-180 [doi]
• Conflict-free coloring for rectangle ranges using ::::O::::(::::n:::::::.382:::) colorsDeepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray. 181-187 [doi]
• Balanced allocations with heterogenous binsUdi Wieder. 188-193 [doi]
• Weakening the online adversary just enough to get optimal conflict-free colorings for intervalsAmotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky. 194-195 [doi]
• On the truthfulness and the approximation for scheduling selfish tasksEric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia. 196-197 [doi]
• Optimal bit-reversal using vector permutationsAnton Lokhmotov, Alan Mycroft. 198-199 [doi]
• The notion of a timed register and its application to indulgent synchronizationMichel Raynal, Gadi Taubenfeld. 200-209 [doi]
• Nonblocking transactions without indirection using alert-on-updateMichael F. Spear, Arrvindh Shriraman, Luke Dalessandro, Sandhya Dwarkadas, Michael L. Scott. 210-220 [doi]
• Time-based transactional memory with scalable time basesTorvald Riegel, Christof Fetzer, Pascal Felber. 221-228 [doi]
• Deadlock-free scheduling of X10 computations with bounded resourcesShivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick. 229-240 [doi]
• Online frequency allocation in cellular networksJoseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang. 241-249 [doi]
• Energy efficient randomised communication in unknown AdHoc networksPetra Berenbrink, Colin Cooper, Zengjian Hu. 250-259 [doi]
• Local strategies for maintaining a chain of relay stations between an explorer and a base stationMiroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Jonas Schrieb. 260-269 [doi]
• Maximizing total upload in latency-sensitive P2P applicationsJohn R. Douceur, Jay R. Lorch, Thomas Moscibroda. 270-279 [doi]
• Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systemsJack Dongarra, Emmanuel Jeannot, Erik Saule, Zhiao Shi. 280-288 [doi]
• Speed scaling on parallel processorsSusanne Albers, Fabian Müller, Swen Schmelzer. 289-298 [doi]
• Cilk provides the best overall productivity for high performance computing: (and won the HPC challenge award to prove it)Bradley C. Kuszmaul. 299-300 [doi]
• PRAM-on-chip: first commitment to siliconXingzhi Wen, Uzi Vishkin. 301-302 [doi]
• Transactional memory and the birthday paradoxCraig B. Zilles, Ravi Rajwar. 303-304 [doi]
• Rate vs. buffer size: greedy information gathering on the lineAdi Rosén, Gabriel Scalosub. 305-314 [doi]
• Online collaborative filtering with nearly optimal dynamic regretBaruch Awerbuch, Thomas P. Hayes. 315-319 [doi]
• Truthful unsplittable flow for large capacity networksYossi Azar, Iftah Gamzu, Shai Gutner. 320-329 [doi]
• On the convergence of multicast games in directed networksAngelo Fanelli, Michele Flammini, Luca Moscardelli. 330-338 [doi]
• Sparse parallel Delaunay mesh refinementBenoît Hudson, Gary L. Miller, Todd Phillips. 339-347 [doi]
• Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithmsTimothy Furtak, José Nelson Amaral, Robert Niewiadomski. 348-357 [doi]
• A tight bound on online buffer management for two-port shared-memory switchesKoji Kobayashi, Shuichi Miyazaki, Yasuo Okabe. 358-364 [doi]