Search results for "SPAA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Raphael Eidenbenz, Roger Wattenhofer	Brief announcement: selfishness in transactional memory.	SPAA	2009	DBLP DOI BibTeX RDF	game theory, transactional memory, contention management, multicore architecture
1	Weirong Jiang, Viktor K. Prasanna	Field-split parallel architecture for high performance multi-match packet classification using FPGAs.	SPAA	2009	DBLP DOI BibTeX RDF	multi-match packet classification, fpga, sram, nids
1	Flavio Paiva Junqueira, Benjamin C. Reed	The life and times of a zookeeper.	SPAA	2009	DBLP DOI BibTeX RDF	fault-tolerance, distributed algorithms, coordination, replication, atomic broadcast
1	James E. Levy, Anand Ganti, Cynthia A. Phillips, Benjamin R. Hamlet, Andrew J. Landahl, Thomas M. Gurrieri, Robert D. Carr, Malcolm S. Carroll	Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory.	SPAA	2009	DBLP DOI BibTeX RDF	classical electronics, logical qubit, quantum architecture, quantum information processsing
1	Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri	Brief announcement: low depth cache-oblivious sorting.	SPAA	2009	DBLP DOI BibTeX RDF	schedulers, parallel algorithms, multiprocessors, sorting, merging, cache-oblivious algorithms
1	Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs	Speed scaling of processes with arbitrary speedup curves on a multiprocessor.	SPAA	2009	DBLP DOI BibTeX RDF	scheduling, speed scaling
1	Bruce Hendrickson	Emerging challenges and opportunities in parallel computing: the cretaceous redux?	SPAA	2009	DBLP DOI BibTeX RDF	parallel computing
1	Aviv Nisgav, Boaz Patt-Shamir	Finding similar users in social networks: extended abstract.	SPAA	2009	DBLP DOI BibTeX RDF	collaboartive filtering, recommendation systems, randomized algorithms, market segmentation, user classification
1	Yossi Lev, Victor Luchangco, Marek Olszewski	Scalable reader-writer locks.	SPAA	2009	DBLP DOI BibTeX RDF	reader-writer lock, snzi, scalable, synchronization
1	Sarita V. Adve	Memory models: a case for rethinking parallel languages and hardware.	SPAA	2009	DBLP DOI BibTeX RDF	safe programming, memory models, multicore architecture, memory consistency models
1	Aleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabatabai	Optimizing transactions for captured memory.	SPAA	2009	DBLP DOI BibTeX RDF	software transactional memory, runtime optimizations
1	Cosmin E. Oancea, Alan Mycroft, Tim Harris 0001	A lightweight in-place implementation for software thread-level speculation.	SPAA	2009	DBLP DOI BibTeX RDF	roll-back, thread-level speculation (tls)
1	Jim Sukha	Brief announcement: a lower bound for depth-restricted work stealing.	SPAA	2009	DBLP DOI BibTeX RDF	dynamic multithreading, intel threading building blocks, scheduling, work stealing, cilk
1	Avinash Lakshman, Prashant Malik	Cassandra: a structured storage system on a P2P network.	SPAA	2009	DBLP DOI BibTeX RDF	distributed databases, distributed storage system, eventual consistency
1	Pierre Fraigniaud, Amos Korman	On randomized representations of graphs using short labels.	SPAA	2009	DBLP DOI BibTeX RDF	adjacency labeling schemes, ancestry labeling schemes, probabilistic embeddings, universal graphs, distributed algorithms
1	Friedhelm Meyer auf der Heide, Michael A. Bender (eds.)	SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009	SPAA	2009	DBLP DOI BibTeX RDF
1	Marcos Kawazoe Aguilera, Ram Swaminathan	Remote storage with byzantine servers.	SPAA	2009	DBLP DOI BibTeX RDF	distributed system, algorithms, digital signatures, distributed storage, byzantine failures
1	Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman	At-most-once semantics in asynchronous shared memory.	SPAA	2009	DBLP DOI BibTeX RDF	at-most-once semantic, shared memory
1	Bradley C. Kuszmaul	Brief announcement: TeraByte TokuSampleSort sorts 1TB in 197s.	SPAA	2009	DBLP DOI BibTeX RDF	samplesort, terabyte, cluster, sort, mpi
1	Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson	Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks.	SPAA	2009	DBLP DOI BibTeX RDF	compressed sparse blocks, compressed sparse columns, compressed sparse rows, multithreaded algorithm, storage format, parallelism, sparse matrix, work, span, matrix transpose, matrix-vector multiplication
1	Bogdan S. Chlebus, Dariusz R. Kowalski	Locally scalable randomized consensus for synchronous crash failures.	SPAA	2009	DBLP DOI BibTeX RDF	bit communication complexity, graph expansion, fault tolerance, scalability, lower bound, message passing, randomization, consensus, synchrony
1	Gero Greiner, Tim Nonner, Alexander Souza	The bell is ringing in speed-scaled multiprocessor scheduling.	SPAA	2009	DBLP DOI BibTeX RDF	dynamic speed scaling, approximation algorithms, randomized algorithms, online algorithms, scheduling algorithms, competitive analysis, energy minimization
1	Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper 0001	Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures.	SPAA	2009	DBLP DOI BibTeX RDF	scheduling, work stealing, futures, performance bounds
1	Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski	Pregel: a system for large-scale graph processing.	SPAA	2009	DBLP DOI BibTeX RDF	distributed computing, graph algorithms
1	Fabian Kuhn, Thomas Locher, Rotem Oshman	Gradient clock synchronization in dynamic networks.	SPAA	2009	DBLP DOI BibTeX RDF	distributed algorithms, clock synchronization, dynamic networks
1	Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks	On the complexity of the regenerator placement problem in optical networks.	SPAA	2009	DBLP DOI BibTeX RDF	approximation algorithms, complexity, optical networks, wavelength division multiplexing (wdm), regenerators
1	Matthias Baumgart 0001, Christian Scheideler, Stefan Schmid 0001	A DoS-resilient information system for dynamic data management.	SPAA	2009	DBLP DOI BibTeX RDF	replication, peer-to-peer systems, DHTS, denial of service attacks
1	Jan Mehler, Friedhelm Meyer auf der Heide	Power-aware online file allocation in mobile ad hoc networks: [extended abstract].	SPAA	2009	DBLP DOI BibTeX RDF	mobile ad hoc networks, online algorithms, file allocation, amortized analysis
1	Harald Räcke, Adi Rosén	Approximation algorithms for time-constrained scheduling on line networks.	SPAA	2009	DBLP DOI BibTeX RDF	line networks, time constraints, packet scheduling
1	Kunal Agrawal, Anne Benoit, Fanny Dufossé, Yves Robert	Mapping filtering streaming applications with communication costs.	SPAA	2009	DBLP DOI BibTeX RDF	web service, workflow, query optimization, latency, period, communication model, streaming application, complexity results
1	Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra	Buffer management for colored packets with deadlines.	SPAA	2009	DBLP DOI BibTeX RDF	dram scheduling, online algorithms, buffer management, packets scheduling, earliest deadline first
1	Zhewei Wei, Ke Yi 0001, Qin Zhang 0001	Dynamic external hashing: the limit of buffering.	SPAA	2009	DBLP DOI BibTeX RDF	dynamic hash table, successful query, lower bound
1	Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe	Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms.	SPAA	2009	DBLP DOI BibTeX RDF	multi-queue switches, competitive analysis, buffer management
1	Melih Onus, Andréa W. Richa	Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design.	SPAA	2009	DBLP DOI BibTeX RDF	optimization, peer-to-peer, multicast, overlay networks, pub/sub
1	Heiner Ackermann, Simon Fischer 0001, Martin Hoefer 0001, Marcel Schöngens	Distributed algorithms for QoS load balancing.	SPAA	2009	DBLP DOI BibTeX RDF	quality of service, load balancing, dynamics
1	Marios Mavronicolas, Thomas Sauerwald	A randomized, o(log w)-depth 2 smoothing network.	SPAA	2009	DBLP DOI BibTeX RDF	smoothing network, load balancing, probabilistic analysis
1	Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang	NZTM: nonblocking zero-indirection transactional memory.	SPAA	2009	DBLP DOI BibTeX RDF	transactional memory, hardware support, nonblocking synchronization
1	Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert Geva, Yang Ni, Adam Welc	Towards transactional memory semantics for C++.	SPAA	2009	DBLP DOI BibTeX RDF	synchronization, c++, transactional memory, atomicity, serializability
1	Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz	Communication-optimal parallel and sequential Cholesky decomposition: extended abstract.	SPAA	2009	DBLP DOI BibTeX RDF	Cholesky decomposition, communication avoiding, algorithm, lower bound, latency, bandwidth
1	Adam Welc, Bratin Saha, Ali-Reza Adl-Tabatabai	Irrevocable transactions and their applications.	SPAA	2008	DBLP DOI BibTeX RDF	performance, virtual machines, concurrent programming, software transactional memory
1	Fei Wei, Huazhong Yang	Directed transmission method, a fully asynchronous approach to solve sparse linear systems in parallel.	SPAA	2008	DBLP DOI BibTeX RDF	convergence theory, directed transmission method (dtm), virtual transmission method (vtm), distributed algorithm, sparse linear system, asynchronous algorithm
1	Vittorio Bilò, Angelo Fanelli 0001, Michele Flammini, Luca Moscardelli	Graphical congestion games with linear latencies.	SPAA	2008	DBLP DOI BibTeX RDF	nash equilibrium, price of anarchy, congestion games, algorithmic game theory, price of stability, social knowledge
1	Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri	Combinable memory-block transactions.	SPAA	2008	DBLP DOI BibTeX RDF	memory-block transactions, priority write, read-modify-write, shared memory, transactional memory, queue, contention, combining, stack, linearizability, semaphore
1	Zvika Guz, Idit Keidar, Avinoam Kolodny, Uri C. Weiser	Utilizing shared data in chip multiprocessors with the nahalal architecture.	SPAA	2008	DBLP DOI BibTeX RDF	chip multiprocessors, cache memories
1	Richard M. Yoo, Hsien-Hsin S. Lee	Adaptive transaction scheduling for transactional memory systems.	SPAA	2008	DBLP DOI BibTeX RDF	contention intensity, transaction effectiveness, transactional memory systems, performance, parallelism
1	Mark Moir, Kevin Moore, Daniel Nussbaum	The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster).	SPAA	2008	DBLP DOI BibTeX RDF	simulation, performance, scalability, synchronization, multiprocessors, transactional memory, multicore
1	Behram Khan, Matthew Horsnell, Ian Rogers, Mikel Luján, Andrew Dinn, Ian Watson	A first insight into object-aware hardware transactional memory.	SPAA	2008	DBLP DOI BibTeX RDF	object-oriented programming, transactional memory, concurrent programming
1	Yaacov Fernandess, Dahlia Malkhi	On spreading recommendations via social gossip.	SPAA	2008	DBLP DOI BibTeX RDF	epidemic algorithms, message dissemination, randomized algorithms, gossip algorithms
1	Victor Luchangco	Against lock-based semantics for transactional memory.	SPAA	2008	DBLP DOI BibTeX RDF	semantics, transactional memory, locks
1	Xiongfei Liao, Wu Jigang, Thambipillai Srikanthan	A temperature-aware virtual submesh allocation scheme for noc-based manycore chips.	SPAA	2008	DBLP DOI BibTeX RDF	manycore chips, submesh allocation, algorithm, noc, temperature
1	JaeWoong Chung, Jiwon Seo 0002, Woongki Baek, Chi Cao Minh, Austen McDonald, Christos Kozyrakis, Kunle Olukotun	Improving software concurrency with hardware-assisted memory snapshot.	SPAA	2008	DBLP DOI BibTeX RDF	memory snapshot, transactional memory
1	Yongwook Choi, Maleq Khan, V. S. Anil Kumar 0001, Gopal Pandurangan	Energy-optimal distributed algorithms for minimum spanning trees.	SPAA	2008	DBLP DOI BibTeX RDF	distributed algorithm, energy-efficient, minimum spanning tree, distributed approximation algorithm
1	Vijay Menon 0002, Steven Balensiefer, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Bratin Saha, Adam Welc	Practical weak-atomicity semantics for java stm.	SPAA	2008	DBLP DOI BibTeX RDF	weak atomicity, java, transactional memory, memory models, programming language semantics
1	Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha	Safe open-nested transactions through ownership.	SPAA	2008	DBLP DOI BibTeX RDF	abstract serializability, open-nested transactions, ownership-aware transactions, serializability by levels, serializability by modules, xmodules, transactional memory, ownership types
1	Kai Shen, Alex Zhang, Terence Kelly, Christopher Stewart	Operational analysis of processor speed scaling.	SPAA	2008	DBLP DOI BibTeX RDF	acpi, datacenter-on-chip, p-states, scheduling, performance modeling, power, multicore, capacity planning, queuing, dynamic resource allocation, multi-processor, operational analysis, internet servers
1	Torvald Riegel, Christof Fetzer, Pascal Felber	Automatic data partitioning in software transactional memories.	SPAA	2008	DBLP DOI BibTeX RDF	partitioning, transactional memory
1	Daniel Greenfield, Simon W. Moore	Fractal communication in software data dependency graphs.	SPAA	2008	DBLP DOI BibTeX RDF	CMP, communication complexity, fractal, NoC
1	Emanuele G. Fusco, Andrzej Pelc	Trade-offs between the size of advice and broadcasting time in trees.	SPAA	2008	DBLP DOI BibTeX RDF	broadcast, tree, advice
1	Torsten Hoefler, Peter Gottschling, Andrew Lumsdaine	Leveraging non-blocking collective communication in high-performance applications.	SPAA	2008	DBLP DOI BibTeX RDF	mpi optimization, non-blocking collective operations, parallel code transformation
1	Nedialko B. Dimitrov, Indrajit Roy 0001	A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster.	SPAA	2008	DBLP DOI BibTeX RDF	approximate core equilibrium, facility location, resource augmentation, primal-dual
1	Edya Ladan-Mozes, Charles E. Leiserson	A consistency architecture for hierarchical shared caches.	SPAA	2008	DBLP DOI BibTeX RDF	mapping collision, message race, progressive protocol, memory hierarchy, deadlock, sequential consistency, cache consistency, shared caches, fat-tree
1	Eric Koskinen, Maurice Herlihy	Checkpoints and continuations instead of nested transactions.	SPAA	2008	DBLP DOI BibTeX RDF	parallel programming, concurrency, checkpoints, transactional memory, boosting, continuations
1	Pierre Fraigniaud, Cyril Gavoille	Polylogarithmic network navigability using compact metrics with small stretch.	SPAA	2008	DBLP DOI BibTeX RDF	network navigability, social networks, small world phenomenon
1	Hagit Attiya, Rachid Guerraoui, Eric Ruppert	Partial snapshot objects.	SPAA	2008	DBLP DOI BibTeX RDF	active set, shared-memory, asynchronous, wait-free, snapshot
1	Michael F. Spear, Maged M. Michael, Christoph von Praun	RingSTM: scalable transactions with a single atomic instruction.	SPAA	2008	DBLP DOI BibTeX RDF	synchronization, atomicity, software transactional memory
1	Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak	Distributed packing in planar graphs.	SPAA	2008	DBLP DOI BibTeX RDF	graph packing, approximation algorithms, distributed algorithms
1	Shantanu Gupta, Florin Sultan, Srihari Cadambi, Franjo Ivancic, Martin Rötteler	RaceTM: detecting data races using transactional memory.	SPAA	2008	DBLP DOI BibTeX RDF	transactional memory, data race detection
1	Amitabha Roy 0002, Keir Fraser, Steven Hand 0001	A transactional approach to lock scalability.	SPAA	2008	DBLP DOI BibTeX RDF	concurrency, fairness, transactional memory, locks
1	André Brinkmann, Sascha Effert	Data replication in p2p environments.	SPAA	2008	DBLP DOI BibTeX RDF	capacity efficiency, distributed hash functions, p2p networks, data replication, heterogeneous environments
1	Friedhelm Meyer auf der Heide, Nir Shavit (eds.)	SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008	SPAA	2008	DBLP DOI BibTeX RDF
1	Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese	Communication in wireless networks with directional antennas.	SPAA	2008	DBLP DOI BibTeX RDF	wireless networks, connectivity, directional antennas
1	Noga Alon, Chen Avin, Michal Koucký 0001, Gady Kozma, Zvi Lotker, Mark R. Tuttle	Many random walks are faster than one.	SPAA	2008	DBLP DOI BibTeX RDF	distributed algorithms, random walks, graph search, speed-up, cover time
1	Richard M. Yoo, Yang Ni, Adam Welc, Bratin Saha, Ali-Reza Adl-Tabatabai, Hsien-Hsin S. Lee	Kicking the tires of software transactional memory: why the going gets tough.	SPAA	2008	DBLP DOI BibTeX RDF	performance, compiler, measurement, software transactional memory, runtime, c/c++
1	Eric Koskinen, Maurice Herlihy	Dreadlocks: efficient deadlock detection.	SPAA	2008	DBLP DOI BibTeX RDF	parallel programming, concurrency, transactional memory, deadlock, bloom filters, deadlock detection
1	Rezaul Alam Chowdhury, Vijaya Ramachandran	Cache-efficient dynamic programming algorithms for multicores.	SPAA	2008	DBLP DOI BibTeX RDF	parallelism, multicore, shared cache, distributed cache, cache-efficiency
1	Lars Arge, Michael T. Goodrich, Michael J. Nelson 0002, Nodari Sitchinava	Fundamental parallel algorithms for private-cache chip multiprocessors.	SPAA	2008	DBLP DOI BibTeX RDF	parallel external memory, pem, private-cache cmp
1	Waleed Alsalih, Kamrul Islam 0001, Yurai Núñez Rodríguez, Henry Xiao	Distributed voronoi diagram computation in wireless sensor networks.	SPAA	2008	DBLP DOI BibTeX RDF	sensor networks, distributed algorithms, voronoi diagrams
1	Zvi Lotker, Boaz Patt-Shamir, Seth Pettie	Improved distributed approximate matching.	SPAA	2008	DBLP DOI BibTeX RDF	matching
1	Rui Zhang, Zoran Budimlic, William N. Scherer III	Commit phase in timestamp-based stm.	SPAA	2008	DBLP DOI BibTeX RDF	commit sequence, transactional memory, timestamp
1	Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong	Competitive non-migratory scheduling for flow time and energy.	SPAA	2008	DBLP DOI BibTeX RDF	dynamic speed scaling, online scheduling algorithms, competitive analysis, energy minimization
1	Ioannis Koutis, Gary L. Miller	Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning.	SPAA	2008	DBLP DOI BibTeX RDF	combinatorial preconditioning, multi-way decompositions, planar graphs, spectral graph theory
1	Wing-Kai Hon, Rahul Shah 0001, Peter J. Varman, Jeffrey Scott Vitter	Tight competitive ratios for parallel disk prefetching and caching.	SPAA	2008	DBLP DOI BibTeX RDF	parallel disk model, online algorithms, competitive analysis
1	Olatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael P. Ryan	Parallelizing dynamic information flow tracking.	SPAA	2008	DBLP DOI BibTeX RDF	dynamic information flow tracking (dift), log-based monitoring, parallel algorithm, taint analysis, program monitoring
1	Rachid Guerraoui, Michal Kapalka	On obstruction-free transactions.	SPAA	2008	DBLP DOI BibTeX RDF	transactional memory, obstruction-freedom, impossibility, consensus number
1	Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks	Online multicast with egalitarian cost sharing.	SPAA	2008	DBLP DOI BibTeX RDF	best response, nash equilibrium, price of anarchy, shapley value
1	Milind Kulkarni 0001, Patrick Carribault, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew	Scheduling strategies for optimistic parallel execution of irregular programs.	SPAA	2008	DBLP DOI BibTeX RDF	scheduling, optimistic parallelism, irregular programs
1	Christoph Lenzen 0001, Yvonne Anne Oswald, Roger Wattenhofer	What can be approximated locally?: case study: dominating sets in planar graphs.	SPAA	2008	DBLP DOI BibTeX RDF	distributed algorithms, approximation, planar graphs, local algorithms, dominating sets
1	Reza Dorrigiv, Alejandro López-Ortiz, Alejandro Salinger	Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM).	SPAA	2008	DBLP DOI BibTeX RDF	pram, thread based parallelism, dynamic programming, multi-core, divide and conquer, models of computation
1	JaeWoong Chung, Woongki Baek, Nathan Grasso Bronson, Jiwon Seo 0002, Christos Kozyrakis, Kunle Olukotun	Ased: availability, security, and debugging support usingtransactional memory.	SPAA	2008	DBLP DOI BibTeX RDF	security, reliability, debugging, transactional memory
1	Baruch Awerbuch, Rohit Khandekar	Cost sharing mechanisms for near-optimal traffic aggregation and network design.	SPAA	2008	DBLP DOI BibTeX RDF	cost sharing mechanism, traffic aggregation, network design
1	Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott 0001	Improved approximations for multiprocessor scheduling under uncertainty.	SPAA	2008	DBLP DOI BibTeX RDF	scheduling under uncertainty, approximation algorithms, multiprocessor scheduling, stochastic scheduling
1	Warren Schudy	Finding strongly connected components in parallel using o(log2n) reachability queries.	SPAA	2008	DBLP DOI BibTeX RDF	transitive closure bottleneck, parallel algorithms, graph algorithms, strongly connected components, topological sort
1	Alessandro Panconesi, Mauro Sozio	Fast distributed scheduling via primal-dual.	SPAA	2008	DBLP DOI BibTeX RDF	scheduling, peer-to-peer, distributed algorithms, primal-dual
1	Adi Rosén, Gabriel Scalosub	Rate vs. buffer size: greedy information gathering on the line.	SPAA	2007	DBLP DOI BibTeX RDF	competitive network throughput, online algorithms, competitive analysis, buffer management, information gathering
1	Baruch Awerbuch, Thomas P. Hayes	Online collaborative filtering with nearly optimal dynamic regret.	SPAA	2007	DBLP DOI BibTeX RDF	online decision making, regret, learning, collaborative filtering, multiagent systems
1	Yossi Azar, Iftah Gamzu, Shai Gutner	Truthful unsplittable flow for large capacity networks.	SPAA	2007	DBLP DOI BibTeX RDF	combinatorial and multi-unit auctions, approximation algorithms, mechanism design, primal-dual method
1	Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang 0001	Online frequency allocation in cellular networks.	SPAA	2007	DBLP DOI BibTeX RDF	competitive analysis, cellular networks, on-line algorithms, frequency allocation
1	Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick	Deadlock-free scheduling of X10 computations with bounded resources.	SPAA	2007	DBLP DOI BibTeX RDF	deadlock-free scheduling, X10, active messages
1	Michael A. Bender, Cynthia A. Phillips	Scheduling DAGs on asynchronous processors.	SPAA	2007	DBLP DOI BibTeX RDF	asynchronous parallel computing, firing-squad scheduling, precedence-constrained scheduling, online scheduling
1	Srinivas Sridharan 0002, Arun Rodrigues, Peter M. Kogge	Evaluating synchronization techniques for light-weight multithreaded/multicore architectures.	SPAA	2007	DBLP DOI BibTeX RDF	full-empty bits, light-weight multithreading, scalable lock and barrier synchronization techniques, multicore processors, processing-in-memory

Publications at "SPAA"( http://dblp.L3S.de/Venues/SPAA )