Novel Architectures for P2P Applications: the Continuous-Discrete
 Approach, Moni Naor and Udi Wieder.

Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks,
 Costas Busch and Srikanth Surapaneni and Srikanta Tirthapura.

A Near Optimal Scheduler for Switch-Memory-Switch Routers,
 Adnan Aziz and Amit Prakash and Vijaya Ramachandran.

Minimizing Total Flow Time and Total Completion Time with Immediate
 Dispatching.

NonBlocking k-Compare-Single-Swap,
 Victor Luchangco and Mark Moir and Nir Shavit.

Compact Routing with Name Independence,
 M. Arias and L. Cowen and K. Laing and R. Rajaraman and O. Taka.

A Proportionate Fair Scheduling Rule with Good Worst-case Performance,
 Micah Adler and Petra Berenbrink and Tom Friedetzky and Leslie Goldberg and Paul Goldberg and Mike Paterson.

The Load Rebalancing Problem,
 Gagan Aggarwal and Rajeev Motwani and An Zhu.

I/O-Efficient Topological Sorting of Planar DAGs,
 Lars Arge and Laura Toma and Norbert Zeh.

Throughput-Centric Routing Algorithm Design,
 Brian Towles and William J. Dally and Stephen P. Boyd.

Designing Overlay Multicast Networks for Streaming,
 Konstantin Andreev and Bruce Maggs and Adam Meyerson and Ramesh Sitaraman.

Optimal Fault-Tolerant Linear Arrays,
 Toshinori Yamada and Shuichi Ueno.

Asynchronous Parallel Disk Sorting,
 Roman Dementiev and Peter Sanders.

Polynomial Time Algorithms for Network Information Flow,
 Peter Sanders and Sebastian Egner and Ludo Tolhuizen.

A Polynomial-time Tree Decomposition to Minimize Congestion,
 Chris Harrelson and Kirsten Hildrum and Satish Rao.

Information Gathering in Adversarial Systems: Lines and Cycles, 
 Kishore Kothapalli and Christian Scheideler.

Quantifying Instruction Criticality for Shared Memory Multiprocessors,
 Tong Li and Alvin R. Lebeck and Daniel J. Sorin.

Tree Based MPLS Routing,
Anupam Gupta and Amit Kumar and Mikkel Thorup.

Scheduling Policies for CIOQ Switches,
 Alex Kesselman and Adi Rosen.

Optimal Sharing of Bags of Tasks in Heterogeneous Clusters,
 Micah Adler and Ying Gong and Arnold L. Rosenberg.
 
Load Balancing of Unit Size Tokens and Expansion Properties of Graphs,
 Robert Elsaesser and Burkhard Monien.

Toward A Decidable Notion of Sequential Consistency,
 Jesse D. Bingham and Anne Condon and Alan J. Hu.

Online Oblivious Routing,
 Nikhil Bansal and Avrim Blum and Shuchi Chawla and Adam Meyerson.

Combining online algorithms for rejection and acceptance,
 Yossi Azar and Avrim Blum and Yishay Mansour.

A Practical Algorithm for Constructing Oblivious Routing Schemes,
  Marcin Bienkowski and Miroslaw Korzeniowski and Harald Racke.

Integrated Prefetching and Caching in Single and Parallel Disk Systems,
Susanne Albers and Markus Buettner.

Cycle Stealing under Immediate Dispatch Task Assignment
 Mor Harchol-Balter and Cuihong Li and Takayuki Osogami and Alan Scheller-Wolf and Mark Squillante.

 Off-line and On-line Guaranteed Start-up Delay for Media-on-Demand with
  Stream Merging, Amotz Bar-Noy and Justin Goshi and Richard E. Ladner.

Worst Case Mobility in Ad Hoc Networks,
 Christian Schindelhauer and Tamas Lukovszki and Stefan Ruehrup and KlausVolbert.

TCP is competitive agaist a limited adversary,
 Jeff Edmonds and Suprakash Datta and Patrick Dymond.

The Effect of Communication Costs in Solid-State Quantum Computing
 Architectures, Dean Copsey and Mark Oskin and Tzvetan Metodiev and Frederic T. Chong and Isaac Chuang.

Can we elect if we cannot compare?,
 Lali Barriere and Paola Flocchini and Pierre Fraigniaud and Nicola Santoro.

VLSI Layout of Trees into Grids of Minimum Width,
 Akira Matsubayashi.

Improved Approximation Algorithms for the Freeze-Tag Problem,
 Esther M. Arkin and Michael A. Bender and Dongdong Ge and Simai He and Joseph S. B. Mitchell.

Performance Comparison of MPI and three OpenMP Programming Styles on
 Shared Memory Multiprocessors, Geraud P. Krawezik and Franck Cappello.

On Local Algorithms for Topology Control and Routing in Ad Hoc Networks,
 Lujun Jia and Rajmohan Rajaraman and Christian Scheideler.

MST Construction in O(loglog n) Communication Rounds,
 Zvi Lotker and Boaz Patt-Shamir and Elan Pavlov and David Peleg.

Online deadline scheduling: multiple machines and randomization,
 Jae-Ha Lee.

High Throughput, Parallelized 128-bit AES Encryption in a
 Resource-Limited FPGA, Christopher Caltagirone and Kasi Anantha.

MAPO: using a committee of algorithm-experts for parallel optimization
 of costly functions, Christine Shoemaker and Rommel Regis.

The Complexity of Verifying Memory Coherence,
 Jason F. Cantin and Mikko H. Lipasti and James E. Smith.

Randomized Permutations in a Coarse Grained Parallel Environment,
 Jens Gustedt.

Proxy Caching of Streaming Sessions Supported by Shared Running Buffers
 (SRB), Songqing Chen and Bo Shen and Yong Yan and Xiaodong Zhang.

Relaxing the Problem-Size Bound for Out-of-Core Columnsort,
 Geeta Chaudhry and Elizabeth A. Hamon and Thomas H. Cormen.

Bicriteria approximation algorithms for scheduling problems with
 communication delays, Evripidis Bampis and Alexander Kononov.

Buffer Overflows of Merging Streams,
 Alexander Kesselman and Zvi Lotker and Yishay Mansour and Boaz Patt-Shamir.

Efficient Galois Field Arithmetic on SIMD Architectures,
 Raghav Bhaskar and Pradeep K. Dubey and Vijay Kumar and Atri Rudra and Animesh Sharma.

Short Length Menger's Theorem and it's Relation to Reliable Optical
 Routing, Amitabha Bagchi and Amitabh Chaudhary and Petr Kolman.