Search results for "SPAA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe	A tight bound on online buffer management for two-port shared-memory switches.	SPAA	2007	DBLP DOI BibTeX RDF	shared memory switches, competitive analysis, buffer management
1	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder	Strong-diameter decompositions of minor free graphs.	SPAA	2007	DBLP DOI BibTeX RDF	minor free graphs, compact routing
1	Torvald Riegel, Christof Fetzer, Pascal Felber	Time-based transactional memory with scalable time bases.	SPAA	2007	DBLP DOI BibTeX RDF	transactional memory
1	Phillip B. Gibbons, Christian Scheideler (eds.)	SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007	SPAA	2007	DBLP DOI BibTeX RDF
1	Benoît Hudson, Gary L. Miller, Todd Phillips	Sparse parallel Delaunay mesh refinement.	SPAA	2007	DBLP DOI BibTeX RDF	computational geometry, mesh generation, shared-memory parallelism
1	Woongki Baek, JaeWoong Chung, Chi Cao Minh, Christos Kozyrakis, Kunle Olukotun	Towards soft optimization techniques for parallel cognitive applications.	SPAA	2007	DBLP DOI BibTeX RDF	cognitive applications, optimization, parallel algorithms, parallel programming
1	Guangming Tan, Ninghui Sun, Guang R. Gao	A parallel dynamic programming algorithm on a multi-core architecture.	SPAA	2007	DBLP DOI BibTeX RDF	scalabilitiy, dynamic programming, multi-core, memory hierarchy, data dependence
1	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.	SPAA	2007	DBLP DOI BibTeX RDF	data affinity, data-flow parallelism, dense linear algebra libraries, dynamic scheduling, out-of-order execution
1	Fabian Kuhn, Thomas Locher, Roger Wattenhofer	Tight bounds for distributed selection.	SPAA	2007	DBLP DOI BibTeX RDF	sensor networks, distributed algorithms, time complexity, data aggregation, median, in-network aggregation
1	Michel Raynal, Gadi Taubenfeld	The notion of a timed register and its application to indulgent synchronization.	SPAA	2007	DBLP DOI BibTeX RDF	test&set, timing assumption, universal object, wait-free implementation, consensus, mutual exclusion, timing constraint, contention manager, process crash, simplicity, atomic register, renaming, concurrent object, asynchronous shared memory system
1	Rezaul Alam Chowdhury, Vijaya Ramachandran	The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation.	SPAA	2007	DBLP DOI BibTeX RDF	matrix multiplication, tiling, Gaussian elimination, cache-oblivious algorithm, all-pairs shortest path
1	Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia	On the truthfulness and the approximation for scheduling selfish tasks.	SPAA	2007	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, game theory, truthfulness
1	Kamen Yotov, Thomas Roeder, Keshav Pingali, John A. Gunnels, Fred G. Gustavson	An experimental comparison of cache-oblivious and cache-conscious programs.	SPAA	2007	DBLP DOI BibTeX RDF	cache-conscious algorithms, memory hierarchy, memory bandwidth, memory latency, numerical software, cache-oblivious algorithms
1	Angelo Fanelli 0001, Michele Flammini, Luca Moscardelli	On the convergence of multicast games in directed networks.	SPAA	2007	DBLP DOI BibTeX RDF	limited number of best-response moves, multicast games, price of anarchy
1	Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam	Scheduling to minimize gaps and power consumption.	SPAA	2007	DBLP DOI BibTeX RDF	sleep state, multiprocessor scheduling, power minimization
1	Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar	Packing to angles and sectors.	SPAA	2007	DBLP DOI BibTeX RDF	geometric covering, approximation algorithms, directional antenna, bin packing
1	Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker	Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.	SPAA	2007	DBLP DOI BibTeX RDF	small world phenomenon
1	Udi Wieder	Balanced allocations with heterogenous bins.	SPAA	2007	DBLP DOI BibTeX RDF	balls and bins, the multiple choice paradigm
1	Guolong Lin, Rajmohan Rajaraman	Approximation algorithms for multiprocessor scheduling under uncertainty.	SPAA	2007	DBLP DOI BibTeX RDF	approximation algorithms, multiprocessor scheduling
1	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.	SPAA	2007	DBLP DOI BibTeX RDF	constructive cache sharing, parallel depth first, thread granularity, working set profiling, chip multiprocessors, scheduling algorithms, work stealing
1	Robert Krauthgamer	On triangulation of simple networks.	SPAA	2007	DBLP DOI BibTeX RDF	network triangulation, distance estimation, tree metrics, doubling metrics
1	Bradley C. Kuszmaul	Cilk provides the "best overall productivity" for high performance computing: (and won the HPC challenge award to prove it).	SPAA	2007	DBLP DOI BibTeX RDF	Cilk
1	Petra Berenbrink, Colin Cooper, Zengjian Hu	Energy efficient randomised communication in unknown AdHoc networks.	SPAA	2007	DBLP DOI BibTeX RDF	ad hoc networks, energy efficiency, broadcasting, randomized algorithms, gossiping
1	Susanne Albers, Fabian Müller, Swen Schmelzer	Speed scaling on parallel processors.	SPAA	2007	DBLP DOI BibTeX RDF	approximation algorithms, energy efficiency, NP-completeness, online algorithms, multiprocessor scheduling
1	Arun Kumar 0004, 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.	SPAA	2007	DBLP DOI BibTeX RDF	cell BE™ processor, heterogeneous multi-core processors, MPI
1	Fabian Kuhn, Thomas Moscibroda	Distributed approximation of capacitated dominating sets.	SPAA	2007	DBLP DOI BibTeX RDF	distributed approximation, capacities, dominating sets, LP relaxation
1	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari	Optimal sparse matrix dense vector multiplication in the I/O-model.	SPAA	2007	DBLP DOI BibTeX RDF	I/O-model, sparse matrix dense vector multiplication, lower bound, external memory algorithms
1	Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson	Cache-oblivious streaming B-trees.	SPAA	2007	DBLP DOI BibTeX RDF	buffered repository tree, cache-oblivious B-tree, cascading array, deamortized, lookahead array, shuttle tree
1	Timothy Furtak, José Nelson Amaral, Robert Niewiadomski	Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms.	SPAA	2007	DBLP DOI BibTeX RDF	sorting, instruction-level parallelism, SIMD, vectorization, sorting networks, quicksort
1	John R. Douceur, Jay R. Lorch, Thomas Moscibroda	Maximizing total upload in latency-sensitive P2P applications.	SPAA	2007	DBLP DOI BibTeX RDF	peer-to-peer gaming, upload maximization, multicast
1	Anton Lokhmotov, Alan Mycroft	Optimal bit-reversal using vector permutations.	SPAA	2007	DBLP DOI BibTeX RDF	FFT, SIMD, vector, permutation, bit-reversal
1	Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray	Conflict-free coloring for rectangle ranges using O(n.382) colors.	SPAA	2007	DBLP DOI BibTeX RDF	axis-parallel rectangles, conflict-free coloring, frequency assignment in wireless networks, monotone sequences, dominating sets
1	Xingzhi Wen, Uzi Vishkin	PRAM-on-chip: first commitment to silicon.	SPAA	2007	DBLP DOI BibTeX RDF	ease-of-programming, explicit multi-threading, on-chip parallel processor, parallel algorithms, PRAM, XMT
1	Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky	Weakening the online adversary just enough to get optimal conflict-free colorings for intervals.	SPAA	2007	DBLP DOI BibTeX RDF	online algorithms, coloring, cellular networks, frequency assignment, conflict free
1	Craig B. Zilles, Ravi Rajwar	Transactional memory and the birthday paradox.	SPAA	2007	DBLP DOI BibTeX RDF	birthdays, concurrency, transactional memory
1	Jeffery A. Brown, Rakesh Kumar 0002, Dean M. Tullsen	Proximity-aware directory-based coherence for multi-core processor architectures.	SPAA	2007	DBLP DOI BibTeX RDF	chip multiprocessors, coherence
1	Michael F. Spear, Arrvindh Shriraman, Luke Dalessandro, Sandhya Dwarkadas, Michael L. Scott	Nonblocking transactions without indirection using alert-on-update.	SPAA	2007	DBLP DOI BibTeX RDF	software transactional memory, event-based systems, obstruction freedom
1	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.	SPAA	2007	DBLP DOI BibTeX RDF	ad-hoc networks, distributed algorithms, self-organization, swarm robotics
1	Jack J. Dongarra, Emmanuel Jeannot, Erik Saule, Zhiao Shi	Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems.	SPAA	2007	DBLP DOI BibTeX RDF	pareto-curve, scheduling, reliability, DAG
1	Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar	Local MST computation with short advice.	SPAA	2007	DBLP DOI BibTeX RDF	distributed algorithm, minimum spanning tree, local computation
1	Quentin F. Stout	Minimizing peak energy on mesh-connected systems.	SPAA	2006	DBLP DOI BibTeX RDF	image processing, cellular automata, graph algorithms
1	Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky	Conflict-free coloring for intervals: from offline to online.	SPAA	2006	DBLP DOI BibTeX RDF	online algorithms, coloring, cellular networks, frequency assignment, conflict free
1	Niv Buchbinder, Joseph Naor	Fair online load balancing.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, load balancing, online algorithms, competitive analysis, greedy algorithm
1	Michael T. Goodrich, Daniel S. Hirschberg	Efficient parallel algorithms for dead sensor diagnosis and multiple access channels.	SPAA	2006	DBLP DOI BibTeX RDF	dead sensor diagnosis, group testing, multiple access channels
1	Robert Elsässer	On the communication complexity of randomized broadcasting in random-like graphs.	SPAA	2006	DBLP DOI BibTeX RDF	broadcasting, random graphs
1	Julia Lipman, Quentin F. Stout	A performance analysis of local synchronization.	SPAA	2006	DBLP DOI BibTeX RDF	geometric distribution, stochastic task times, performance analysis, synchronization, heavy-tailed distribution
1	Arun Kejariwal, Alexandru Nicolau, Hideki Saito 0001, Xinmin Tian, Milind Girkar, Utpal Banerjee, Constantine D. Polychronopoulos	A general approach for partitioning N-dimensional parallel nested loops with conditionals.	SPAA	2006	DBLP DOI BibTeX RDF	partitioning, conditionals, parallel loops, affine, Fourier-Motzkin elimination
1	Matteo Frigo, Volker Strumpen	The cache complexity of multithreaded cache oblivious algorithms.	SPAA	2006	DBLP DOI BibTeX RDF
1	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi	On space-stretch trade-offs: lower bounds.	SPAA	2006	DBLP DOI BibTeX RDF	compact routing
1	Baruch Awerbuch, Christian Scheideler	Towards a scalable and robust DHT.	SPAA	2006	DBLP DOI BibTeX RDF	robustness, overlay networks, peer-to-peer systems
1	David P. Bunde	Power-aware scheduling for makespan and flow.	SPAA	2006	DBLP DOI BibTeX RDF	low power, dynamic voltage scaling, power-aware scheduling, speed scaling
1	Lorin Hochstein, Victor R. Basili	An empirical study to compare two parallel programming models.	SPAA	2006	DBLP DOI BibTeX RDF	parallel programming, empirical study, MPI, message-passing, productivity, HPC, PRAM, effort, XMT
1	Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel	Towards small world emergence.	SPAA	2006	DBLP DOI BibTeX RDF	bounded growth, distributed algorithms, routing algorithms, small world
1	Elena Riccio Davidson	The FG programming environment: good and good for you.	SPAA	2006	DBLP DOI BibTeX RDF	usability, parallel programming, human factors
1	Arthur Brady, Lenore Cowen	Compact routing with additive stretch using distance labelings.	SPAA	2006	DBLP DOI BibTeX RDF	compact routing
1	Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle	Publish and perish: definition and analysis of an n-person publication impact game.	SPAA	2006	DBLP DOI BibTeX RDF	timing games, nash equilibrium, numerical algorithms
1	Geoff Lowney	Why Intel is designing multi-core processors.	SPAA	2006	DBLP DOI BibTeX RDF	multi-core processors
1	David Pritchard, Santosh S. Vempala	Symmetric network computation.	SPAA	2006	DBLP DOI BibTeX RDF	fault-tolerance, agents, symmetry, election
1	Martha Mercaldi, Steven Swanson, Andrew Petersen 0001, Andrew Putnam, Andrew Schwerin, Mark Oskin, Susan J. Eggers	Modeling instruction placement on a spatial architecture.	SPAA	2006	DBLP DOI BibTeX RDF	instruction placement, dataflow, spatial computing
1	Franklin E. Powers Jr., Gita Alaghband	Introducing the hydra parallel programming system.	SPAA	2006	DBLP DOI BibTeX RDF
1	R. C. Chakinala, Abishek Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman	Playing push vs pull: models and algorithms for disseminating dynamic data in networks.	SPAA	2006	DBLP DOI BibTeX RDF	push & pull, approximation algorithms, NP-Completeness, network design, data dissemination, multicast tree
1	David Steurer	Tight bounds for the Min-Max boundary decomposition cost of weighted graphs.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, load balancing, parallel computing, graph partitioning, graph separators
1	Joachim Gehweiler, Christiane Lammersen, Christian Sohler	A distributed O(1)-approximation algorithm for the uniform facility location problem.	SPAA	2006	DBLP DOI BibTeX RDF	distributed approximation, randomized algorithm, facility location
1	Ami Litman, Shiri Moran-Schein	Smooth scheduling under variable rates or the analog-digital confinement game.	SPAA	2006	DBLP DOI BibTeX RDF	EDF schemes, EDF strategies, concurrent confinement games, confinement games, non-concurrent confinement games, smooth scheduling, variable rates, online scheduling, two players games
1	Ho-Lin Chen, Tim Roughgarden	Network design with weighted players.	SPAA	2006	DBLP DOI BibTeX RDF	network design, network games, nash equilibria, price of stability
1	Krzysztof Rzadca, Denis Trystram	Promoting cooperation in selfish grids.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, grid, game theory
1	Peter Mahlmann, Christian Schindelhauer	Distributed random digraph transformations for peer-to-peer networks.	SPAA	2006	DBLP DOI BibTeX RDF	distributed algorithms, peer-to-peer networks, random graphs, expander graphs
1	Tali Moreshet, R. Iris Bahar, Maurice Herlihy	Energy implications of multiprocessor synchronization.	SPAA	2006	DBLP DOI BibTeX RDF	multiprocessor, transactional memory, energy aware
1	Vasileios Liaskovitis, Shimin Chen, Phillip B. Gibbons, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Michael Kozuch, Todd C. Mowry, Chris Wilkerson	Parallel depth first vs. work stealing schedulers on CMP architectures.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, caches, chip multiprocessors
1	Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann	Deterministic load balancing and dictionaries in the parallel disk model.	SPAA	2006	DBLP DOI BibTeX RDF	parallel disk model, hashing, dictionary, expander graph, deterministic
1	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi	On space-stretch trade-offs: upper bounds.	SPAA	2006	DBLP DOI BibTeX RDF	compact routing
1	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton	Semi-oblivious routing.	SPAA	2006	DBLP DOI BibTeX RDF
1	Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman	Fault-tolerant semifast implementations of atomic read/write registers.	SPAA	2006	DBLP DOI BibTeX RDF	communication rounds, read/write registers, fault-tolerance, distributed algorithms, atomicity
1	Jonathan Leighton Brown, Sue Goudy, Mike Heroux, Shan Shan Huang, Zhaofang Wen	An envolutionary path towards virtual shared memory with random access.	SPAA	2006	DBLP DOI BibTeX RDF	parallel programming, programming models
1	Rezaul Alam Chowdhury, Vijaya Ramachandran	The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation.	SPAA	2006	DBLP DOI BibTeX RDF
1	Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi	Towards automatic parallelization of tree reductions in dynamic programming.	SPAA	2006	DBLP DOI BibTeX RDF	commutative semiring, parallel tree contraction, parallel programming, dynamic programming, code generator, tree
1	Jaime H. Moreno	Chip-level integration: the new frontier for microprocessor architecture.	SPAA	2006	DBLP DOI BibTeX RDF	chip-level integration, microprocessor architecture
1	Brighten Godfrey, Richard M. Karp	On the price of heterogeneity in parallel systems.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, heterogeneity, majorization
1	Lisa Higham, LillAnne Jackson	Translating between itanium and sparc memory consistency models.	SPAA	2006	DBLP DOI BibTeX RDF	multiprocessors, program transformations, memory consistency models, sparc, itanium
1	John W. Romein, P. Chris Broekema, Ellen van Meijeren, Kjeld van der Schaaf, Walther H. Zwart	Astronomical real-time streaming signal processing on a Blue Gene/L supercomputer.	SPAA	2006	DBLP DOI BibTeX RDF	LOFAR, filtering, correlator, Blue Gene/L
1	Alexis C. Kaporis, Paul G. Spirakis	The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.	SPAA	2006	DBLP DOI BibTeX RDF	coordination ratio, price of optimum, stackelberg
1	Phillip B. Gibbons, Uzi Vishkin (eds.)	SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006	SPAA	2006	DBLP DOI BibTeX RDF
1	John Augustine, Sudarshan Banerjee, Sandy Irani	Strip packing with precedence constraints and strip packing with release times.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, reconfigurable architectures, precedence constraints, release times, strip packing
1	Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir	Tell me who I am: an interactive recommendation system.	SPAA	2006	DBLP DOI BibTeX RDF	recommendation systems, collaborative filtering, electronic commerce, randomized algorithms, probes, billboard
1	François Le Gall	Exponential separation of quantum and classical online space complexity.	SPAA	2006	DBLP DOI BibTeX RDF	quantum computation, communication complexity, online, space complexity, streaming algorithms
1	C. Greg Plaxton, Yu Sun 0012, Mitul Tiwari, Harrick M. Vin	Reconfigurable resource scheduling.	SPAA	2006	DBLP DOI BibTeX RDF	reconfigurable resource scheduling, online computation
1	Arnaud Legrand, Alan Su 0001, Frédéric Vivien	Minimizing the stretch when scheduling flows of biological requests.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, linear programming, online algorithm, competitive analysis, divisible load, stretch, flow time
1	Marc Moreno Maza, Yuzhen Xie	An implementation report for parallel triangular decompositions.	SPAA	2006	DBLP DOI BibTeX RDF	polynomial system solver, parallel execution
1	Hagit Attiya, David Hay, Isaac Keslassy	Packet-mode emulation of output-queued switches.	SPAA	2006	DBLP DOI BibTeX RDF	CIOQ switch, output-queued, packet-mode scheduling, switch emulation, packet switching, queuing delay
1	Hagit Attiya, David Hay	Randomization does not reduce the average delay in parallel packet switches.	SPAA	2005	DBLP DOI BibTeX RDF	oblivious adversary, load balancing, packet switching, randomization, clos networks, queuing delay, inverse multiplexing, adaptive adversary
1	Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit	Using elimination to implement scalable and lock-free FIFO queues.	SPAA	2005	DBLP DOI BibTeX RDF	scalability, multiprocessors, lock-free, linearizability, nonblocking synchronization, FIFO queues, elimination
1	Ryan Williams 0001	Parallelizing time with polynomial circuits.	SPAA	2005	DBLP DOI BibTeX RDF	parallel speedup, circuit complexity, alternation
1	Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch	Autonomous virtual mobile nodes.	SPAA	2005	DBLP DOI BibTeX RDF
1	Kishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa	Constant density spanners for wireless ad-hoc networks.	SPAA	2005	DBLP DOI BibTeX RDF	ad hoc networks, self-stabilization, dominating set, spanner
1	Costas Busch, Malik Magdon-Ismail, Jing Xi	Oblivious routing on geometric networks.	SPAA	2005	DBLP DOI BibTeX RDF	disc graphs, congestion, oblivious routing, stretch, geometric networks
1	Phillip B. Gibbons, Paul G. Spirakis (eds.)	SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA	SPAA	2005	DBLP DOI BibTeX RDF
1	Nir Andelman	Randomized queue management for DiffServ.	SPAA	2005	DBLP DOI BibTeX RDF	randomized algorithms, online algorithms, competitive analysis, active queue management
1	Rahul Shah 0001, Peter J. Varman, Jeffrey Scott Vitter	On competitive online read-many parallel disks scheduling.	SPAA	2005	DBLP DOI BibTeX RDF	parallel disk model, online algorithms
1	Piotr Sankowski	Processor efficient parallel matching.	SPAA	2005	DBLP DOI BibTeX RDF	polynomial matrix determinant, processor efficient, parallel algorithms, randomized algorithms, perfect matching, RNC
1	Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber	Traffic engineering of management flows by link augmentations on confluent trees.	SPAA	2005	DBLP DOI BibTeX RDF	approximation algorithms, network management, traffic engineering

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