Abstract is missing.
- Tell me who I am: an interactive recommendation systemNoga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir. 1-10 [doi]
- Publish and perish: definition and analysis of an ::::n::::-person publication impact gameZvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle. 11-18 [doi]
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functionsAlexis C. Kaporis, Paul G. Spirakis. 19-28 [doi]
- Network design with weighted playersHo-Lin Chen, Tim Roughgarden. 29-38 [doi]
- Towards automatic parallelization of tree reductions in dynamic programmingKiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi. 39-48 [doi]
- A general approach for partitioning N-dimensional parallel nested loops with conditionalsArun Kejariwal, Alexandru Nicolau, Hideki Saito, Xinmin Tian, Milind Girkar, Utpal Banerjee, Constantine D. Polychronopoulos. 49-58 [doi]
- Astronomical real-time streaming signal processing on a Blue Gene/L supercomputerJohn W. Romein, P. Chris Broekema, Ellen van Meijeren, Kjeld van der Schaaf, Walther H. Zwart. 59-66 [doi]
- Exponential separation of quantum and classical online space complexityFrançois Le Gall. 67-73 [doi]
- Smooth scheduling under variable rates or the analog-digital confinement gameAmi Litman, Shiri Moran-Schein. 74-83 [doi]
- On the price of heterogeneity in parallel systemsBrighten Godfrey, Richard M. Karp. 84-92 [doi]
- Reconfigurable resource schedulingC. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick Vin. 93-102 [doi]
- Minimizing the stretch when scheduling flows of biological requestsArnaud Legrand, Alan Su, Frédéric Vivien. 103-112 [doi]
- Why Intel is designing multi-core processorsGeoff Lowney. 113 [doi]
- An empirical study to compare two parallel programming modelsLorin Hochstein, Victor R. Basili. 114 [doi]
- The FG programming environment: good and good for youElena Riccio Davidson. 115 [doi]
- Introducing the hydra parallel programming systemFranklin E. Powers Jr., Gita Alaghband. 116 [doi]
- An envolutionary path towards virtual shared memory with random accessJonathan Leighton Brown, Sue Goudy, Mike Heroux, Shan Shan Huang, Zhaofang Wen. 117 [doi]
- Efficient parallel algorithms for dead sensor diagnosis and multiple access channelsMichael T. Goodrich, Daniel S. Hirschberg. 118-127 [doi]
- Conflict-free coloring for intervals: from offline to onlineAmotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky. 128-137 [doi]
- Packet-mode emulation of output-queued switchesHagit Attiya, David Hay, Isaac Keslassy. 138-147 [doi]
- On the communication complexity of randomized broadcasting in random-like graphsRobert Elsässer. 148-157 [doi]
- Modeling instruction placement on a spatial architectureMartha Mercaldi, Steven Swanson, Andrew Petersen, Andrew Putnam, Andrew Schwerin, Mark Oskin, Susan J. Eggers. 158-169 [doi]
- Translating between itanium and sparc memory consistency modelsLisa Higham, LillAnne Jackson. 170-179 [doi]
- Strip packing with precedence constraints and strip packing with release timesJohn Augustine, Sudarshan Banerjee, Sandy Irani. 180-189 [doi]
- Power-aware scheduling for makespan and flowDavid P. Bunde. 190-196 [doi]
- Tight bounds for the Min-Max boundary decomposition cost of weighted graphsDavid Steurer. 197-206 [doi]
- On space-stretch trade-offs: lower boundsIttai Abraham, Cyril Gavoille, Dahlia Malkhi. 207-216 [doi]
- On space-stretch trade-offs: upper boundsIttai Abraham, Cyril Gavoille, Dahlia Malkhi. 217-224 [doi]
- Towards small world emergencePhilippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. 225-232 [doi]
- Compact routing with additive stretch using distance labelingsArthur Brady, Lenore Cowen. 233 [doi]
- Semi-oblivious routingMohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton. 234 [doi]
- An implementation report for parallel triangular decompositionsMarc Moreno Maza, Yuzhen Xie. 235 [doi]
- The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluationRezaul Alam Chowdhury, Vijaya Ramachandran. 236 [doi]
- A distributed ::::O::::(1)-approximation algorithm for the uniform facility location problemJoachim Gehweiler, Christiane Lammersen, Christian Sohler. 237-243 [doi]
- Playing push vs pull: models and algorithms for disseminating dynamic data in networksR. C. Chakinala, Abishek Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman. 244-253 [doi]
- A performance analysis of local synchronizationJulia Lipman, Quentin F. Stout. 254-260 [doi]
- Symmetric network computationDavid Pritchard, Santosh Vempala. 261-270 [doi]
- The cache complexity of multithreaded cache oblivious algorithmsMatteo Frigo, Volker Strumpen. 271-280 [doi]
- Fault-tolerant semifast implementations of atomic read/write registersChryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman. 281-290 [doi]
- Fair online load balancingNiv Buchbinder, Joseph Naor. 291-298 [doi]
- Deterministic load balancing and dictionaries in the parallel disk modelMette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann. 299-307 [doi]
- Distributed random digraph transformations for peer-to-peer networksPeter Mahlmann, Christian Schindelhauer. 308-317 [doi]
- Towards a scalable and robust DHTBaruch Awerbuch, Christian Scheideler. 318-327 [doi]
- Chip-level integration: the new frontier for microprocessor architectureJaime H. Moreno. 328 [doi]
- Energy implications of multiprocessor synchronizationTali Moreshet, R. Iris Bahar, Maurice Herlihy. 329 [doi]
- Parallel depth first vs. work stealing schedulers on CMP architecturesVasileios Liaskovitis, Shimin Chen, Phillip B. Gibbons, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Michael Kozuch, Todd C. Mowry, Chris Wilkerson. 330 [doi]
- Minimizing peak energy on mesh-connected systemsQuentin F. Stout. 331 [doi]
- Promoting cooperation in selfish gridsKrzysztof Rzadca, Denis Trystram. 332 [doi]