SPAA 2013 - 25th ACM Symposium on Parallelism in Algorithms and Architectures

SPAA defines the term ``parallel'' broadly, encompassing any computational system that can perform multiple operations or tasks simultaneously. Topics include, but are not limited to:

Parallel and Distributed Algorithms Parallel and Distributed Data Structures
Green Computing and Power-Efficient Architectures Management of Massive Data Sets
Parallel Complexity Theory Parallel and Distributed Architectures
Multi-Core Architectures Instruction Level Parallelism and VLSI
Compilers and Tools for Concurrent Programming Supercomputer Architecture and Computing
Transactional Memory Hardware and Software The Internet and the World Wide Web
Game Theory and Collaborative Learning Routing and Information Dissemination
Resource Management and Awareness Peer-to-Peer Systems
Mobile Ad-Hoc and Sensor Networks Robustness, Self-Stabilization and Security
Synergy of parallelism in algorithms, programming and architecture

Conference Presentation:
Regular presentations will be allotted a 25-minute talk and up to 10 pages in the proceedings. This format is intended for contributions reporting original research, submitted exclusively to this conference. Brief announcements will be allotted a 10-minute talk and a 2-page abstract (each marked as a brief announcement) in the proceedings. This format is a forum for brief communications, which may be published later in other conferences.

Awards:
Every regular paper is eligible for the best paper award. The program committee may decline to make this award or may split the award among multiple papers.