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)
2001 (conf/spaa/2001)

  1. Mikkel Thorup, Uri Zwick
    Compact routing schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:1-10 [Conf]
  2. Costas Busch, Maurice Herlihy, Roger Wattenhofer
    Routing without flow control. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:11-20 [Conf]
  3. Ami Litman, Shiri Moran-Schein
    Fast, minimal and oblivious routing algorithms on the mesh with bounded queues. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:21-31 [Conf]
  4. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    One-to-Many routing on the mesh. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:31-37 [Conf]
  5. Petr Kolman, Christian Scheideler
    Simple on-line algorithms for the maximum disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:38-47 [Conf]
  6. Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos
    Stability and non-stability of the FIFO protocol. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:48-52 [Conf]
  7. Ellen L. Hahne, Alexander Kesselman, Yishay Mansour
    Competitve buffer management for shared-memory switches. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:53-58 [Conf]
  8. Anders Dessmark, Andrzej Pelc
    Tradeoffs between knowledge and time of communication in geometric radio networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:59-66 [Conf]
  9. Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis
    Attack propagation in networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:67-76 [Conf]
  10. Shay Kutten, David Peleg, Uzi Vishkin
    Deterministic resource discovery in distributed networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:77-83 [Conf]
  11. Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic
    Latency effects on reachability in large-scale peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:84-92 [Conf]
  12. Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin
    Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:93-102 [Conf]
  13. Francisca Quintana, Jesús Corbal, Roger Espasa, Mateo Valero
    A cost effective architecture for vectorizable numerical and multimedia applications. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:103-112 [Conf]
  14. Anne Condon, Alan J. Hu
    Automatable verification of sequential consistency. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:113-121 [Conf]
  15. Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons
    Room synchronizations. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:122-133 [Conf]
  16. Philippas Tsigas, Yi Zhang
    A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:134-143 [Conf]
  17. Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
    Computational power of pipelined memory hierarchies. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:144-152 [Conf]
  18. Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev
    Optimal semi-oblique tiling. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:153-162 [Conf]
  19. Hadas Shachnai, Aravind Srinivasan
    Finding large independent sets of hypergraphs in parallel. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:163-168 [Conf]
  20. Geeta Chaudhry, Thomas H. Cormen, Leonard F. Wisniewski
    Columnsort lives! an efficient out-of-core sorting program. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:169-178 [Conf]
  21. Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho
    Efficient parallel exponentiation in GF(2n) using normal basis representations. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:179-188 [Conf]
  22. Panagiota Fatourou
    Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:189-198 [Conf]
  23. Pierre-François Dutot, Denis Trystram
    Scheduling on hierarchical clusters using malleable tasks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:199-208 [Conf]
  24. Yanyong Zhang, Anand Sivasubramaniam
    Scheduling best-effort and real-time pipelined applications on time-shared clusters. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:209-219 [Conf]
  25. Mahesh Kallahalla, Peter J. Varman
    Optimal prefetching and caching for parallel I/O sytems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:219-228 [Conf]
  26. Myra B. Cohen, Charles J. Colbourn
    Ordering disks for double erasure codes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:229-236 [Conf]
  27. Christof Krick, Harald Räcke, Matthias Westermann
    Approximation algorithms for data management in networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:237-246 [Conf]
  28. Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri
    A data tracking scheme for general networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:247-254 [Conf]
  29. Robert Elsässer, Thomas Lücking, Burkhard Monien
    New spectral bounds on k-partitioning of graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:255-262 [Conf]
  30. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
    Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:263-270 [Conf]
  31. Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto
    Towards practical deteministic write-all algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:271-280 [Conf]
  32. Phillip B. Gibbons, Srikanta Tirthapura
    Estimating simple functions on the union of data streams. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:281-291 [Conf]
  33. Achour Mostéfaoui, Michel Raynal
    Randomized k-set agreement. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:291-297 [Conf]
  34. Marek Piotrów
    Periodic, random-fault-tolerant correction networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:298-305 [Conf]
  35. Yongbing Zhang, Xiaohua Jia, Sajal K. Das
    D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:308-309 [Conf]
  36. Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot
    A note on cycle covering. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:310-311 [Conf]
  37. Stefan D. Bruda, Selim G. Akl
    Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:312-313 [Conf]
  38. Evripidis Bampis, Rodolphe Giroudeau, Alexander Kononov
    Scheduling tasks with small communication delays for clusters of processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:314-315 [Conf]
  39. Thomas Rauber, Robert Reilein, Gudula Rünger
    Library support for orthogonal processor groups. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:316-317 [Conf]
  40. Frédéric Havet, Marc Wennink
    The push tree problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:318-319 [Conf]
  41. Ulf Lorenz
    Parallel controlled conspiracy number search. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:320-321 [Conf]
  42. Martin Griebl
    On tiling space-time mapped loop nests. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:322-323 [Conf]
  43. Jean-Guillaume Dumas, Jean-Louis Roch
    A parallel block algorithm for exact triangularization of rectangular matrices. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:324-325 [Conf]
  44. Mikel Larrea, Antonio Fernández, Sergio Arévalo
    Eventually consistent failure detectors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:326-327 [Conf]
  45. Will McLendon III, Bruce Hendrickson, Steve Plimpton, Lawrence Rauchwerger
    Finding strongly connected components in parallel in particle transport sweeps. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:328-329 [Conf]
  46. Thierry Garcia, Jean Frédéric Myoupo, David Semé
    A work-optimal CGM algorithm for the LIS problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:330-331 [Conf]
  47. Victor Luchangco
    Modeling weakly consistent memories with locks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:332-333 [Conf]
  48. David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
    The power of duality for prefetching and sorting with parallel disks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:334-335 [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