Abstract is missing.
- Fast greedy algorithms in mapreduce and streamingRavi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani. 1-10 [doi]
- Reduced hardware transactions: a new approach to hybrid transactional memoryAlexander Matveev, Nir Shavit. 11-22 [doi]
- Recursive design of hardware priority queuesYehuda Afek, Anat Bremler-Barr, Liron Schiff. 23-32 [doi]
- Drop the anchor: lightweight memory management for non-blocking data structuresAnastasia Braginsky, Alex Kogan, Erez Petrank. 33-42 [doi]
- Scalable statistics countersDave Dice, Yossi Lev, Mark Moir. 43-52 [doi]
- Storage and search in dynamic peer-to-peer networksJohn Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal. 53-62 [doi]
- Broadcasting in logarithmic time for ad hoc network nodes on a line using mimoThomas Janson, Christian Schindelhauer. 63-72 [doi]
- Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstractEvangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. 73-82 [doi]
- On dynamics in selfish network creationBernd Kawald, Pascal Lenzner. 83-92 [doi]
- Brief announcement: truly parallel burrows-wheeler compression and decompressionJames Alexander Edwards, Uzi Vishkin. 93-96 [doi]
- Brief announcement: locality in wireless schedulingMagnús M. Halldórsson. 97-98 [doi]
- Brief announcement: universally truthful secondary spectrum auctionsMartin Hoefer, Thomas Kesselheim. 99-101 [doi]
- Brief announcement: online batch scheduling for flow objectivesSungjin Im, Benjamin Moseley. 102-104 [doi]
- Brief announcement: set it and forget it - approximating the set once strip cover problemAmotz Bar-Noy, Ben Baumer, Dror Rawitz. 105-107 [doi]
- Brief announcement: between all and nothing - versatile aborts in hardware transactional memoryStephan Diestelhorst, Martin Nowack, Michael F. Spear, Christof Fetzer. 108-110 [doi]
- Brief announcement: towards a fully-articulated pessimistic distributed transactional memoryKonrad Siek, Pawel T. Wojciechowski. 111-114 [doi]
- Brief announcement: a game-theoretic model motivated by the darpa network challengeRajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee. 115-118 [doi]
- IRIS: a robust information system against insider dos-attacksMartina Eikel, Christian Scheideler. 119-129 [doi]
- SybilCast: broadcast on the open airwaves (extended abstract)Seth Lewis Gilbert, Chaodong Zheng. 130-139 [doi]
- On-the-fly pipeline parallelismI.-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang. 140-151 [doi]
- Reducing contention through priority updatesJulian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons. 152-163 [doi]
- HEX: scaling honeycombs is easier than scaling clock treesDanny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid. 164-175 [doi]
- Coalescing-branching random walks on graphsChinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott Roche. 176-185 [doi]
- Parallel rotor walks on finite graphs and applications in discrete load balancingHoda Akbari, Petra Berenbrink. 186-195 [doi]
- Parallel graph decompositions using random shiftsGary L. Miller, Richard Peng, Shen Chen Xu. 196-203 [doi]
- A constant factor approximation algorithm for the storage allocation problem: extended abstractReuven Bar-Yehuda, Michael Beder, Dror Rawitz. 204-213 [doi]
- Work-efficient matrix inversion in polylogarithmic timePeter Sanders, Jochen Speck, Raoul Steffen. 214-221 [doi]
- Communication optimal parallel multiplication of sparse random matricesGrey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo. 222-231 [doi]
- Communication efficient gaussian elimination with partial pivoting using a shape morphing data layoutGrey Ballard, James Demmel, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo. 232-240 [doi]
- Optimal patrolling of fragmented boundariesAndrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Russell Martin, Oscar Morales Ponce. 241-250 [doi]
- Profitable scheduling on multiple speed-scalable processorsPeter Kling, Peter Pietrzyk 0001. 251-260 [doi]
- Nonclairvoyant sleep management and flow-time scheduling on multiple processorsSze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu. 261-270 [doi]
- Reallocation problems in schedulingMichael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert. 271-279 [doi]
- Efficient scheduling to minimize calibrationsMichael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, Cynthia A. Phillips. 280-287 [doi]
- Non-monetary fair scheduling: a cooperative game theory approachPiotr Skowron, Krzysztof Rzadca. 288-297 [doi]
- Cloud scheduling with setup costYossi Azar, Naama Ben-Aroya, Nikhil R. Devanur, Navendu Jain. 298-304 [doi]
- Efficient online scheduling for deadline-sensitive jobs: extended abstractBrendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv. 305-314 [doi]
- Locality-aware task management for unstructured parallelism: a quantitative limit studyRichard M. Yoo, Christopher J. Hughes, Changkyu Kim, Yen-Kuang Chen, Christos Kozyrakis. 315-325 [doi]
- Balls-into-bins with nearly optimal load distributionPetra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre Stauffer. 326-335 [doi]