The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
    Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:1-7 [Conf]
  2. Robert Krauthgamer
    On triangulation of simple networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:8-15 [Conf]
  3. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
    Strong-diameter decompositions of minor free graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:16-24 [Conf]
  4. Guolong Lin, Rajmohan Rajaraman
    Approximation algorithms for multiprocessor scheduling under uncertainty. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:25-34 [Conf]
  5. Michael A. Bender, Cynthia A. Phillips
    Scheduling DAGs on asynchronous processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:35-45 [Conf]
  6. Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
    Scheduling to minimize gaps and power consumption. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:46-54 [Conf]
  7. Arun Kumar, Naresh Jayam, Ashok Srinivasan, Ganapathy Senthilkumar, Pallav K. Baruah, Shakti Kapoor, Murali Krishna, Raghunath Sharma
    Feasibility study of MPI implementation on the heterogeneous multi-core cell BETM architecture. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:55-56 [Conf]
  8. Srinivas Sridharan, Arun Rodrigues, Peter M. Kogge
    Evaluating synchronization techniques for light-weight multithreaded/multicore architectures. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:57-58 [Conf]
  9. Woongki Baek, JaeWoong Chung, Chi Cao Minh, Christos Kozyrakis, Kunle Olukotun
    Towards soft optimization techniques for parallel cognitive applications. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:59-60 [Conf]
  10. Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
    Optimal sparse matrix dense vector multiplication in the I/O-model. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:61-70 [Conf]
  11. Rezaul Alam Chowdhury, Vijaya Ramachandran
    The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:71-80 [Conf]
  12. Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson
    Cache-oblivious streaming B-trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:81-92 [Conf]
  13. Kamen Yotov, Thomas Roeder, Keshav Pingali, John A. Gunnels, Fred G. Gustavson
    An experimental comparison of cache-oblivious and cache-conscious programs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:93-104 [Conf]
  14. Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, Chris Wilkerson
    Scheduling threads for constructive cache sharing on CMPs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:105-115 [Conf]
  15. Ernie Chan, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí, Robert A. van de Geijn
    Supermatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:116-125 [Conf]
  16. Jeffery A. Brown, Rakesh Kumar, Dean M. Tullsen
    Proximity-aware directory-based coherence for multi-core processor architectures. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:126-134 [Conf]
  17. Guangming Tan, Ninghui Sun, Guang R. Gao
    A parallel dynamic programming algorithm on a multi-core architecture. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:135-144 [Conf]
  18. Fabian Kuhn, Thomas Locher, Roger Wattenhofer
    Tight bounds for distributed selection. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:145-153 [Conf]
  19. Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
    Local MST computation with short advice. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:154-160 [Conf]
  20. Fabian Kuhn, Thomas Moscibroda
    Distributed approximation of capacitated dominating sets. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:161-170 [Conf]
  21. Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar
    Packing to angles and sectors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:171-180 [Conf]
  22. Deepak Ajwani, Khaled Elbassioni, Sathish Govindarajan, Saurabh Ray
    Conflict-free coloring for rectangle ranges using O(n.382) colors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:181-187 [Conf]
  23. Udi Wieder
    Balanced allocations with heterogenous bins. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:188-193 [Conf]
  24. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
    Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:194-195 [Conf]
  25. Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia
    On the truthfulness and the approximation for scheduling selfish tasks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:196-197 [Conf]
  26. Anton Lokhmotov, Alan Mycroft
    Optimal bit-reversal using vector permutations. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:198-199 [Conf]
  27. Michel Raynal, Gadi Taubenfeld
    The notion of a timed register and its application to indulgent synchronization. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:200-209 [Conf]
  28. Michael F. Spear, Arrvindh Shriraman, Luke Dalessandro, Sandhya Dwarkadas, Michael L. Scott
    Nonblocking transactions without indirection using alert-on-update. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:210-220 [Conf]
  29. Torvald Riegel, Christof Fetzer, Pascal Felber
    Time-based transactional memory with scalable time bases. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:221-228 [Conf]
  30. Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick
    Deadlock-free scheduling of X10 computations with bounded resources. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:229-240 [Conf]
  31. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang
    Online frequency allocation in cellular networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:241-249 [Conf]
  32. Petra Berenbrink, Colin Cooper, Zengjian Hu
    Energy efficient randomised communication in unknown AdHoc networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:250-259 [Conf]
  33. Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Jonas Schrieb
    Local strategies for maintaining a chain of relay stations between an explorer and a base station. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:260-269 [Conf]
  34. John R. Douceur, Jay R. Lorch, Thomas Moscibroda
    Maximizing total upload in latency-sensitive P2P applications. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:270-279 [Conf]
  35. Jack Dongarra, Emmanuel Jeannot, Erik Saule, Zhiao Shi
    Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:280-288 [Conf]
  36. Susanne Albers, Fabian Müller, Swen Schmelzer
    Speed scaling on parallel processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:289-298 [Conf]
  37. Bradley C. Kuszmaul
    Cilk provides the "best overall productivity" for high performance computing: (and won the HPC challenge award to prove it). [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:299-300 [Conf]
  38. Xingzhi Wen, Uzi Vishkin
    PRAM-on-chip: first commitment to silicon. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:301-302 [Conf]
  39. Craig B. Zilles, Ravi Rajwar
    Transactional memory and the birthday paradox. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:303-304 [Conf]
  40. Adi Rosén, Gabriel Scalosub
    Rate vs. buffer size: greedy information gathering on the line. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:305-314 [Conf]
  41. Baruch Awerbuch, Thomas P. Hayes
    Online collaborative filtering with nearly optimal dynamic regret. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:315-319 [Conf]
  42. Yossi Azar, Iftah Gamzu, Shai Gutner
    Truthful unsplittable flow for large capacity networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:320-329 [Conf]
  43. Angelo Fanelli, Michele Flammini, Luca Moscardelli
    On the convergence of multicast games in directed networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:330-338 [Conf]
  44. Benoît Hudson, Gary L. Miller, Todd Phillips
    Sparse parallel Delaunay mesh refinement. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:339-347 [Conf]
  45. Timothy Furtak, José Nelson Amaral, Robert Niewiadomski
    Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:348-357 [Conf]
  46. Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe
    A tight bound on online buffer management for two-port shared-memory switches. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:358-364 [Conf]
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002