The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Brian Towles, William J. Dally
    Worst-case traffic for oblivious routing functions. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:1-8 [Conf]
  2. Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta
    Locality-preserving randomized oblivious routing on torus networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:9-13 [Conf]
  3. Costas Busch
    Õ(congestion + dilation) hot-potato routing on leveled networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:20-29 [Conf]
  4. Matthias Westermann
    Distributed caching independent of the network size. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:31-40 [Conf]
  5. Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao
    Distributed object location in a dynamic network. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:41-52 [Conf]
  6. André Brinkmann, Kay Salzwedel, Christian Scheideler
    Compact, adaptive placement schemes for non-uniform requirements. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:53-62 [Conf]
  7. Phillip B. Gibbons, Srikanta Tirthapura
    Distributed streams algorithms for sliding windows. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:63-72 [Conf]
  8. Maged M. Michael
    High performance dynamic lock-free hash tables and list-based sets. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:73-82 [Conf]
  9. Michela Taufer, Thomas Stricker, Roger Weber
    Scalability and resource usage of an OLAP benchmark on clusters of PCs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:83-94 [Conf]
  10. Uzi Vishkin
    Two techniques for reconciling algorithm parallelism with memory constraints. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:95-98 [Conf]
  11. Anasua Bhowmik, Manoj Franklin
    A general compiler framework for speculative multithreading. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:99-108 [Conf]
  12. Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
    Optimal organizations for pipelined hierarchical memories. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:109-116 [Conf]
  13. Gautam Gupta, Sanjay V. Rajopadhye, Patrice Quinton
    Scheduling reductions on realistic machines. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:117-126 [Conf]
  14. Hui Wu, Joxan Jaffar
    Two processor scheduling with real release times and deadlines. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:127-132 [Conf]
  15. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Extra processors versus future information in optimal deadline scheduling. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:133-142 [Conf]
  16. Enoch Peserico
    The lazy adversary conjecture fails. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:143-144 [Conf]
  17. Chi-Hsiang Yeh
    AT2L2 appr. equal N2/2 for fast fourier transform in multilayer VLSI. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:145-146 [Conf]
  18. Jean-François Nezan, Olivier Déforges, Michael Raulet
    Rapid prototyping methodology for multi-DSP TI C6X platforms applied to an Mpeg-2 coding application. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:147-148 [Conf]
  19. Frank Hannig, Jürgen Teich
    Energy estimation of nested loop programs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:149-150 [Conf]
  20. Michel Raynal
    Sequential consistency as lazy linearizability. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:151-152 [Conf]
  21. Harold W. Cain, Mikko H. Lipasti
    Verifying sequential consistency using vector clocks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:153-154 [Conf]
  22. Ali Pinar, Bruce Hendrickson
    Exploiting flexibly assignable work to improve load balance. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:155-163 [Conf]
  23. Danny Hendler, Nir Shavit
    Work dealing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:164-172 [Conf]
  24. Francisco Almeida, Rumen Andonov, Daniel González, Luz Marina Moreno, Vincent Poirriez, Casiano Rodríguez
    Optimal tiling for the RNA base pairing problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:173-182 [Conf]
  25. Carme Àlvarez, Maria J. Blesa, Maria J. Serna
    Universal stability of undirected graphs in the adversarial queueing model. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:183-197 [Conf]
  26. Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
    New stability results for adversarial queuing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:192-199 [Conf]
  27. Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
    Capture of an intruder by mobile agents. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:200-209 [Conf]
  28. Emmanuelle Anceaume, Jean-Michel Hélary, Michel Raynal
    Tracking immediate predecessors in distributed computations. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:210-219 [Conf]
  29. Bogdan S. Chlebus, Dariusz R. Kowalski
    Gossiping to reach consensus. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:220-229 [Conf]
  30. Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald
    Energy, congestion and dilation in radio networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:230-237 [Conf]
  31. Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti
    Parallel scheduling problems in next generation wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:238-247 [Conf]
  32. Jeremy Brown, J. P. Grossman, Tom Knight
    A lightweight idempotent messaging protocol for faulty networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:248-257 [Conf]
  33. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
    Nearest common ancestors: a survey and a new distributed algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:258-264 [Conf]
  34. Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman
    Algorithms for fault-tolerant routing in circuit switched networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:265-274 [Conf]
  35. Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne
    Parallel dynamic programming for solving the string editing problem on a CGM/BSP. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:275-281 [Conf]
  36. Jop F. Sibeyn, James Abello, Ulrich Meyer
    Heuristics for semi-external depth first search on directed graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:282-292 [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