| 2014 | Scheduling shared continuous resources on many-cores. | Andr Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sren Riechers, Tim S |
| 2014 | Brief announcement: deadline-aware scheduling of big-data processing jobs. | Peter Bodk, Ishai Menache, Joseph Naor, Jonathan Yaniv |
| 2014 | Locality-based network creation games. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2014 | On computing maximal independent sets of hypergraphs in parallel. | Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan |
| 2014 | Simple dynamics for plurality consensus. | Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan |
| 2014 | A note on multiprocessor speed scaling with precedence constraints. | Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli |
| 2014 | Ephemeral networks with random availability of links: diameter and connectivity. | Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis |
| 2014 | Provably good scheduling for parallel programs that use data structures through implicit batching. | Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, Robert Utterback |
| 2014 | Brief announcement: cache-oblivious scheduling of streaming pipelines. | Kunal Agrawal, Jeremy T. Fineman |
| 2013 | Locality-aware task management for unstructured parallelism: a quantitative limit study. | Richard M. Yoo, Christopher J. Hughes, Changkyu Kim, Yen-Kuang Chen, Christos Kozyrakis |
| 2013 | Non-monetary fair scheduling: a cooperative game theory approach. | Piotr Skowron, Krzysztof Rzadca |
| 2013 | Brief announcement: towards a fully-articulated pessimistic distributed transactional memory. | Konrad Siek, Pawel T. Wojciechowski |
| 2013 | Reducing contention through priority updates. | Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons |
| 2013 | Work-efficient matrix inversion in polylogarithmic time. | Peter Sanders, Jochen Speck, Raoul Steffen |
| 2013 | Parallel graph decompositions using random shifts. | Gary L. Miller, Richard Peng, Shen Chen Xu |
| 2013 | Reduced hardware transactions: a new approach to hybrid transactional memory. | Alexander Matveev, Nir Shavit |
| 2013 | Efficient online scheduling for deadline-sensitive jobs: extended abstract. | Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv |
| 2013 | On-the-fly pipeline parallelism. | I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Jim Sukha, Zhunping Zhang |
| 2013 | Fast greedy algorithms in mapreduce and streaming. | Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani |
| 2013 | Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract. | Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende |
| 2013 | Profitable scheduling on multiple speed-scalable processors. | Peter Kling, Peter Pietrzyk |
| 2013 | On dynamics in selfish network creation. | Bernd Kawald, Pascal Lenzner |
| 2013 | Broadcasting in logarithmic time for ad hoc network nodes on a line using mimo. | Thomas Janson, Christian Schindelhauer |
| 2013 | Brief announcement: online batch scheduling for flow objectives. | Sungjin Im, Benjamin Moseley |
| 2013 | Brief announcement: universally truthful secondary spectrum auctions. | Martin Hoefer, Thomas Kesselheim |