default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th SPAA 2013: Montreal, QC, Canada
- Guy E. Blelloch, Berthold Vöcking:
25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013. ACM 2013, ISBN 978-1-4503-1572-2
Session 1
- Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast greedy algorithms in mapreduce and streaming. 1-10 - Alexander Matveev, Nir Shavit:
Reduced hardware transactions: a new approach to hybrid transactional memory. 11-22 - Yehuda Afek, Anat Bremler-Barr, Liron Schiff:
Recursive design of hardware priority queues. 23-32 - Anastasia Braginsky, Alex Kogan, Erez Petrank:
Drop the anchor: lightweight memory management for non-blocking data structures. 33-42 - Dave Dice, Yossi Lev, Mark Moir:
Scalable statistics counters. 43-52
Session 2
- John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan
, Peter Robinson, Eli Upfal:
Storage and search in dynamic peer-to-peer networks. 53-62 - Thomas Janson, Christian Schindelhauer:
Broadcasting in logarithmic time for ad hoc network nodes on a line using mimo. 63-72 - Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract. 73-82 - Bernd Kawald, Pascal Lenzner:
On dynamics in selfish network creation. 83-92
Session 3: brief announcements
- James Alexander Edwards, Uzi Vishkin:
Brief announcement: truly parallel burrows-wheeler compression and decompression. 93-96 - Magnús M. Halldórsson:
Brief announcement: locality in wireless scheduling. 97-98 - Martin Hoefer, Thomas Kesselheim:
Brief announcement: universally truthful secondary spectrum auctions. 99-101 - Sungjin Im, Benjamin Moseley:
Brief announcement: online batch scheduling for flow objectives. 102-104 - Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Brief announcement: set it and forget it - approximating the set once strip cover problem. 105-107 - Stephan Diestelhorst, Martin Nowack, Michael F. Spear, Christof Fetzer:
Brief announcement: between all and nothing - versatile aborts in hardware transactional memory. 108-110 - Konrad Siek, Pawel T. Wojciechowski:
Brief announcement: towards a fully-articulated pessimistic distributed transactional memory. 111-114 - Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee:
Brief announcement: a game-theoretic model motivated by the darpa network challenge. 115-118
Session 4
- Martina Eikel, Christian Scheideler:
IRIS: a robust information system against insider dos-attacks. 119-129 - Seth Lewis Gilbert, Chaodong Zheng:
SybilCast: broadcast on the open airwaves (extended abstract). 130-139 - I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang:
On-the-fly pipeline parallelism. 140-151 - Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. 152-163 - Danny Dolev, Matthias Függer, Christoph Lenzen, Martin Perner, Ulrich Schmid:
HEX: scaling honeycombs is easier than scaling clock trees. 164-175
Session 5
- Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-branching random walks on graphs. 176-185 - Hoda Akbari, Petra Berenbrink:
Parallel rotor walks on finite graphs and applications in discrete load balancing. 186-195 - Gary L. Miller, Richard Peng, Shen Chen Xu:
Parallel graph decompositions using random shifts. 196-203 - Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A constant factor approximation algorithm for the storage allocation problem: extended abstract. 204-213
Session 6
- Peter Sanders, Jochen Speck, Raoul Steffen:
Work-efficient matrix inversion in polylogarithmic time. 214-221 - Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication optimal parallel multiplication of sparse random matrices. 222-231 - Grey Ballard, James Demmel, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout. 232-240 - Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Russell Martin, Oscar Morales-Ponce:
Optimal patrolling of fragmented boundaries. 241-250
Session 7
- Peter Kling, Peter Pietrzyk:
Profitable scheduling on multiple speed-scalable processors. 251-260 - Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu:
Nonclairvoyant sleep management and flow-time scheduling on multiple processors. 261-270 - Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. 271-279 - Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, Cynthia A. Phillips:
Efficient scheduling to minimize calibrations. 280-287 - Piotr Skowron, Krzysztof Rzadca:
Non-monetary fair scheduling: a cooperative game theory approach. 288-297
Session 8
- Yossi Azar, Naama Ben-Aroya, Nikhil R. Devanur, Navendu Jain:
Cloud scheduling with setup cost. 298-304 - Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Efficient online scheduling for deadline-sensitive jobs: extended abstract. 305-314 - Richard M. Yoo, Christopher J. Hughes, Changkyu Kim, Yen-Kuang Chen, Christos Kozyrakis:
Locality-aware task management for unstructured parallelism: a quantitative limit study. 315-325 - Petra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre Stauffer:
Balls-into-bins with nearly optimal load distribution. 326-335
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-11 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
