The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

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

  1. Adi Rosén, Michael S. Tsirkin
    On delivery times in packet networks under adversarial traffic. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:1-10 [Conf]
  2. Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles
    Adaptive channel queue routing on k-ary n-cubes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:11-19 [Conf]
  3. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
    Compact name-independent routing with minimum stretch. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:20-24 [Conf]
  4. Kirsten Hildrum, Robert Krauthgamer, John Kubiatowicz
    Object location in realistic networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:25-35 [Conf]
  5. David R. Karger, Matthias Ruhl
    Simple efficient load balancing algorithms for peer-to-peer systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:36-43 [Conf]
  6. Baruch Awerbuch, Christian Scheideler
    Consistent and compact data management in distributed storage systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:44-53 [Conf]
  7. John W. Byers, Jeffrey Considine, Michael Mitzenmacher
    Geometric generalizations of the power of two choices. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:54-63 [Conf]
  8. Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
    Fighting against two adversaries: page migration in dynamic networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:64-73 [Conf]
  9. Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
    Online hierarchical cooperative caching. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:74-83 [Conf]
  10. Susanne Albers
    New results on web caching with request reordering. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:84-92 [Conf]
  11. Dan Guez, Alexander Kesselman, Adi Rosén
    Packet-mode policies for input-queued switches. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:93-102 [Conf]
  12. Fan R. K. Chung, Ronald L. Graham, George Varghese
    Parallelism versus memory allocation in pipelined router forwarding engines. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:103-111 [Conf]
  13. Gary L. Miller, Peter C. Richter
    Lower bounds for graph embeddings and combinatorial preconditioners. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:112-119 [Conf]
  14. Konstantin Andreev, Harald Räcke
    Balanced graph partitioning. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:120-124 [Conf]
  15. Pierre-François Dutot, Lionel Eyraud, Grégory Mounié, Denis Trystram
    Bi-criteria algorithm for scheduling jobs on cluster platforms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:125-132 [Conf]
  16. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
    On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:133-144 [Conf]
  17. Aaron Windsor
    An NC algorithm for finding a maximal acyclic set in a graph. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:145-150 [Conf]
  18. Stefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide
    Scheduling against an adversarial network. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:151-159 [Conf]
  19. Yi Cui, Baochun Li, Klara Nahrstedt
    On achieving optimized capacity utilization in application overlay networks with multiple competing sessions. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:160-169 [Conf]
  20. Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober
    Pagoda: a dynamic overlay network for routing, data management, and multicasting. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:170-179 [Conf]
  21. Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo
    Sharing the cost of multicast transmissions in wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:180-187 [Conf]
  22. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Selfish load balancing and atomic congestion games. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:188-195 [Conf]
  23. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano
    How to route and tax selfish unsplittable traffic. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:196-205 [Conf]
  24. Danny Hendler, Nir Shavit, Lena Yerushalmi
    A scalable lock-free stack algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:206-215 [Conf]
  25. Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.
    DCAS is not a silver bullet for nonblocking algorithm design. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:216-224 [Conf]
  26. John Oliver, Venkatesh Akella, Frederic T. Chong
    Efficient orchestration of sub-word parallelism in media processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:225-234 [Conf]
  27. Guy E. Blelloch, Phillip B. Gibbons
    Effectively sharing a cache among threads. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:235-244 [Conf]
  28. Rezaul Alam Chowdhury, Vijaya Ramachandran
    Cache-oblivious shortest paths in graphs using buffer heap. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:245-254 [Conf]
  29. Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
    Online algorithms for prefetching and caching on parallel disks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:255-264 [Conf]
  30. David P. Bunde, Yishay Mansour
    Improved combination of online algorithms for acceptance and rejection. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:265-266 [Conf]
  31. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
    Time complexity of practical parallel steiner point insertion algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:267-268 [Conf]
  32. Hagit Attiya, David Hay
    The inherent queuing delay of parallel packet switches. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:269-270 [Conf]
  33. Vicent Cholvi, Pascal Felber, Ernst W. Biersack
    Efficient search in unstructured peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:271-272 [Conf]
  34. Yuu Tanaka, Toshinori Sato, Takenori Koushiro
    The potential in energy efficiency of a speculative chip-multiprocessor. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:273-274 [Conf]
  35. Adam Meyerson
    Online algorithms for network design. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:275-280 [Conf]
  36. Alessandro Panconesi, Jaikumar Radhakrishnan
    Expansion properties of (secure) wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:281-285 [Conf]
  37. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The effect of faults on network expansion. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:286-293 [Conf]
  38. Fabian Kuhn, Roger Wattenhofer
    Dynamic analysis of the arrow distributed protocol. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:294-301 [Conf]
  39. Philippe Raipin Parvédy, Michel Raynal
    Optimal early stopping uniform consensus in synchronous systems with process omission failures. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:302-310 [Conf]
  40. Dariusz R. Kowalski, Alexander A. Shvartsman
    Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:311-320 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002