Conferences in DBLP

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

1. 
   Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures. [Citation Graph (, )][DBLP]
   
   
2. 
   Scheduling jobs with varying parallelizability to reduce variance. [Citation Graph (, )][DBLP]
   
   
3. 
   Scheduling to minimize power consumption using submodular functions. [Citation Graph (, )][DBLP]
   
   
4. 
   Assigning tasks for efficiency in Hadoop: extended abstract. [Citation Graph (, )][DBLP]
   
   
5. 
   Database systems in the multicore era. [Citation Graph (, )][DBLP]
   
   
6. 
   Collaborative scoring with dishonest participants. [Citation Graph (, )][DBLP]
   
   
7. 
   Securing every bit: authenticated broadcast in radio networks. [Citation Graph (, )][DBLP]
   
   
8. 
   Multi-sided shared coins and randomized set-agreement. [Citation Graph (, )][DBLP]
   
   
9. 
   Brief announcement: on speculative replication of transactional systems. [Citation Graph (, )][DBLP]
   
   
10. 
    Brief announcement: combine -- an improved directory-based consistency protocol. [Citation Graph (, )][DBLP]
    
    
11. 
    Brief announcement: byzantine agreement with homonyms. [Citation Graph (, )][DBLP]
    
    
12. 
    Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games. [Citation Graph (, )][DBLP]
    
    
13. 
    Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem. [Citation Graph (, )][DBLP]
    
    
14. 
    Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory. [Citation Graph (, )][DBLP]
    
    
15. 
    Online capacity maximization in wireless networks. [Citation Graph (, )][DBLP]
    
    
16. 
    Balls into bins with related random choices. [Citation Graph (, )][DBLP]
    
    
17. 
    Basic network creation games. [Citation Graph (, )][DBLP]
    
    
18. 
    Tree network coding for peer-to-peer networks. [Citation Graph (, )][DBLP]
    
    
19. 
    Optimal gossip-based aggregate computation. [Citation Graph (, )][DBLP]
    
    
20. 
    On the bit communication complexity of randomized rumor spreading. [Citation Graph (, )][DBLP]
    
    
21. 
    Algorithms and application for grids and clouds. [Citation Graph (, )][DBLP]
    
    
22. 
    The Cilkview scalability analyzer. [Citation Graph (, )][DBLP]
    
    
23. 
    Towards optimizing energy costs of algorithms for shared memory architectures. [Citation Graph (, )][DBLP]
    
    
24. 
    Computing the throughput of probabilistic and replicated streaming applications. [Citation Graph (, )][DBLP]
    
    
25. 
    Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints. [Citation Graph (, )][DBLP]
    
    
26. 
    Brief announcement: on regenerator placement problems in optical networks. [Citation Graph (, )][DBLP]
    
    
27. 
    Brief announcement: a reinforcement learning approach for dynamic load-balancing of parallel digital logic simulation. [Citation Graph (, )][DBLP]
    
    
28. 
    Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications. [Citation Graph (, )][DBLP]
    
    
29. 
    Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages. [Citation Graph (, )][DBLP]
    
    
30. 
    Low depth cache-oblivious algorithms. [Citation Graph (, )][DBLP]
    
    
31. 
    Managing the complexity of lookahead for LU factorization with pivoting. [Citation Graph (, )][DBLP]
    
    
32. 
    New algorithms for efficient parallel string comparison. [Citation Graph (, )][DBLP]
    
    
33. 
    A local O(n²) gathering algorithm. [Citation Graph (, )][DBLP]
    
    
34. 
    Delays induce an exponential memory gap for rendezvous in trees. [Citation Graph (, )][DBLP]
    
    
35. 
    Best-effort group service in dynamic networks. [Citation Graph (, )][DBLP]
    
    
36. 
    Deadlock avoidance for streaming computations with filtering. [Citation Graph (, )][DBLP]
    
    
37. 
    Implementing and evaluating nested parallel transactions in software transactional memory. [Citation Graph (, )][DBLP]
    
    
38. 
    Transactions in the jungle. [Citation Graph (, )][DBLP]
    
    
39. 
    Lightweight, robust adaptivity for software transactional memory. [Citation Graph (, )][DBLP]
    
    
40. 
    TLRW: return of the read-write lock. [Citation Graph (, )][DBLP]
    
    
41. 
    Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. [Citation Graph (, )][DBLP]
    
    
42. 
    A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). [Citation Graph (, )][DBLP]
    
    
43. 
    Parallel approximation algorithms for facility-location problems. [Citation Graph (, )][DBLP]
    
    
44. 
    Simplifying concurrent algorithms by exploiting hardware transactional memory. [Citation Graph (, )][DBLP]
    
    
45. 
    A universal construction for wait-free transaction friendly data structures. [Citation Graph (, )][DBLP]
    
    
46. 
    Low-contention data structures. [Citation Graph (, )][DBLP]
    
    
47. 
    Flat combining and the synchronization-parallelism tradeoff. [Citation Graph (, )][DBLP]
    
    
48. 
    Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. [Citation Graph (, )][DBLP]