default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th SPAA 2003: San Diego, California, USA
- Arnold L. Rosenberg, Friedhelm Meyer auf der Heide:
SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003). ACM 2003, ISBN 1-58113-661-7
Scheduling I
- Micah Adler, Ying Gong, Arnold L. Rosenberg:
Optimal sharing of bags of tasks in heterogeneous clusters. 1-10 - Nir Avrahami, Yossi Azar:
Minimizing total flow time and total completion time with immediate dispatching. 11-18 - Jae-Ha Lee:
Online deadline scheduling: multiple machines and randomization. 19-23
Routing I
- Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke:
A practical algorithm for constructing oblivious routing schemes. 24-33 - Chris Harrelson, Kirsten Hildrum, Satish Rao:
A polynomial-time tree decomposition to minimize congestion. 34-43 - Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson:
Online oblivious routing. 44-49 - Moni Naor, Udi Wieder:
Novel architectures for P2P applications: the continuous-discrete approach. 50-59
Networks I
- Toshinori Yamada, Shuichi Ueno:
Optimal fault-tolerant linear arrays. 60-64 - Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Frederic T. Chong
, Isaac L. Chuang, John Kubiatowicz:
The effect of communication costs in solid-state quantum computing architectures. 65-74 - Akira Matsubayashi:
VLSI layout of trees into grids of minimum width. 75-84
Algorithms 1
- Lars Arge, Laura Toma, Norbert Zeh:
I/O-efficient topological sorting of planar DAGs. 85-93 - Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg:
MST construction in O(log log n) communication rounds. 94-100
Scheduling II
- Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson:
A proportionate fair scheduling rule with good worst-case performance. 101-108 - Susanne Albers, Markus Büttner:
Integrated prefetching and caching in single and parallel disk systems. 109-117
Algorithms II
- Géraud Krawezik:
Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors. 118-127 - Tong Li, Alvin R. Lebeck, Daniel J. Sorin:
Quantifying instruction criticality for shared memory multiprocessors. 128-137 - Roman Dementiev, Peter Sanders:
Asynchronous parallel disk sorting. 138-148
Networks II
- Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman:
Designing overlay multicast networks for streaming. 149-158 - Yossi Azar, Avrim Blum, Yishay Mansour:
Combining online algorithms for rejection and acceptance. 159-163 - Amotz Bar-Noy, Justin Goshi, Richard E. Ladner:
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. 164-173 - Jeff Edmonds, Suprakash Datta, Patrick W. Dymond:
TCP is competitive against a limited adversary. 174-183
Routing II
- Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka:
Compact routing with name independence. 184-192 - Anupam Gupta, Amit Kumar, Mikkel Thorup:
Tree based MPLS routing. 193-199 - Brian Towles, William J. Dally, Stephen P. Boyd:
Throughput-centric routing algorithm design. 200-209
Ad hoc networks
- Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura:
Analysis of link reversal routing algorithms for mobile ad hoc networks. 210-219 - Lujun Jia, Rajmohan Rajaraman, Christian Scheideler:
On local algorithms for topology control and routing in ad hoc networks. 220-229 - Christian Schindelhauer, Tamás Lukovszki, Stefan Rührup, Klaus Volbert:
Worst case mobility in ad hoc networks. 230-239
Revue Papers
- Christopher Caltagirone, Kasi Anantha:
High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA. 240-241 - Christine A. Shoemaker, Rommel G. Regis:
MAPO: using a committee of algorithm-experts for parallel optimization of costly functions. 242-243 - Alexander Kesselman, Yishay Mansour, Zvi Lotker, Boaz Patt-Shamir:
Buffer overflows of merging streams. 244-245 - Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length menger's theorem and reliable optical routing. 246-247 - Jens Gustedt:
Randomized permutations in a coarse grained parallel environment. 248-249 - Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen:
Relaxing the problem-size bound for out-of-core columnsort. 250-251 - Evripidis Bampis, Alexander V. Kononov:
Bicriteria approximation algorithms for scheduling problems with communications. 252-253 - Jason F. Cantin, Mikko H. Lipasti, James E. Smith:
The complexity of verifying memory coherence. 254-255 - Raghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra:
Efficient galois field arithmetic on SIMD architectures. 256-257
Load balancing
- Gagan Aggarwal, Rajeev Motwani, An Zhu:
The load rebalancing problem. 258-265 - Robert Elsässer, Burkhard Monien:
Load balancing of unit size tokens and expansion properties of graphs. 266-273 - Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante:
Cycle stealing under immediate dispatch task assignment. 274-285
Algorithms II
- Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen:
Polynomial time algorithms for network information flow. 286-294 - Esther M. Arkin, Michael A. Bender, Dongdong Ge:
Improved approximation algorithms for the freeze-tag problem. 295-303
Distributed computing
- Jesse D. Bingham, Anne Condon, Alan J. Hu:
Toward a decidable notion of sequential consistency. 304-313 - Victor Luchangco, Mark Moir, Nir Shavit:
Nonblocking k-compare-single-swap. 314-323 - Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Can we elect if we cannot compare? 324-332
Networks III
- Kishore Kothapalli, Christian Scheideler:
Information gathering in adversarial systems: lines and cycles. 333-342 - Adnan Aziz, Amit Prakash, Vijaya Ramachandran:
A near optimal scheduler for switch-memory-switch routers. 343-352 - Alexander Kesselman, Adi Rosén:
Scheduling policies for CIOQ switches. 353-362
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 2025-12-05 22:22 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:
