The SCEAS System
Navigation Menu

Conferences in DBLP

ACM Symposium on Parallel Algorithms and Architectures (SPAA) (spaa)
2003 (conf/spaa/2003)

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