Search results for "SPAA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	David Chase, Yossi Lev	Dynamic circular work-stealing deque.	SPAA	2005	DBLP DOI BibTeX RDF	deque, load balancing, lock-free, work stealing
1	Eric Anderson 0003, Dirk Beyer 0002, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou	Value-maximizing deadline scheduling and its application to animation rendering.	SPAA	2005	DBLP DOI BibTeX RDF	animation rendering, multiprocessor job scheduling, simulation, deadline scheduling
1	Ioannis Chatzigiannakis, Athanasios Kinalis, Sotiris E. Nikoletseas	An adaptive power conservation scheme for heterogeneous wireless sensor networks with node redeployment.	SPAA	2005	DBLP DOI BibTeX RDF	redeployment, wireless sensor networks, distributed algorithms, heterogeneity, power conservation, data propagation
1	Noga Alon, Yossi Azar, Shai Gutner	Admission control to minimize rejections and online set cover with repetitions.	SPAA	2005	DBLP DOI BibTeX RDF	admission control, competitive, set cover, on-line
1	Christian Schindelhauer, Gunnar Schomaker	Weighted distributed hash tables.	SPAA	2005	DBLP DOI BibTeX RDF	adaptive hashing, consistent hashing, non-uniform disks, peer-to-peer networks, web caching, storage area networks
1	Thomas Moscibroda, Roger Wattenhofer	Coloring unstructured radio networks.	SPAA	2005	DBLP DOI BibTeX RDF	sensor networks, ad hoc networks, coloring, initialization, radio network, asynchronous wake-up
1	Ami Litman, Shiri Moran-Schein	On distributed smooth scheduling.	SPAA	2005	DBLP DOI BibTeX RDF	distributed resolution, p-fair scheduling, persistent scheduling, recurrent jobs, scheduling of multiple resources, smooth scheduling
1	Klaus Jansen, Hu Zhang 0004	Scheduling malleable tasks with precedence constraints.	SPAA	2005	DBLP DOI BibTeX RDF	malleable tasks, scheduling, approximation algorithms, precedence constraints
1	Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift	Windows scheduling of arbitrary length jobs on parallel machines.	SPAA	2005	DBLP DOI BibTeX RDF	window scheduling, approximation algorithms, parallel machines, periodic scheduling, experimental algorithms
1	Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin	Fast construction of overlay networks.	SPAA	2005	DBLP DOI BibTeX RDF	patricia trees, overlay networks, asynchronous, merging
1	Marcin Bienkowski	Dynamic page migration with stochastic requests.	SPAA	2005	DBLP DOI BibTeX RDF	online algorithms, data management, mobile networks, dynamic networks, page migration
1	Ittai Abraham, Dahlia Malkhi	Name independent routing for growth bounded networks.	SPAA	2005	DBLP DOI BibTeX RDF	compact routing
1	Lov K. Grover, Jaikumar Radhakrishnan	Is partial quantum search of a database any easier?	SPAA	2005	DBLP DOI BibTeX RDF	amplitude amplification, partial search, quantum search
1	Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio	Irrigating ad hoc networks in constant time.	SPAA	2005	DBLP DOI BibTeX RDF	ad hoc networks, wireless networks, distributed algorithms, overlay networks, randomized protocols
1	Ajay Gulati, Peter J. Varman	Lexicographic QoS scheduling for parallel I/O.	SPAA	2005	DBLP DOI BibTeX RDF	lexicographic minimization, QoS, resource allocation, parallel I/O, fair scheduling, storage virtualization
1	Chaiyasit Manovit, Sudheendra Hangal	Efficient algorithms for verifying memory consistency.	SPAA	2005	DBLP DOI BibTeX RDF	multiprocessor verification, total store order, sequential consistency, memory consistency models, vector clocks
1	Guido Proietti, Peter Widmayer	A truthful mechanism for the non-utilitarian minimum radius spanning tree problem.	SPAA	2005	DBLP DOI BibTeX RDF	pricing and equilibria in networks, algorithmic mechanism design, selfish agents, truthful mechanisms
1	Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi 0001, Shan Leung Maverick Woo	Finding effective support-tree preconditioners.	SPAA	2005	DBLP DOI BibTeX RDF	combinatorial preconditioner, linear systems, iterative solver
1	Ioannis Chatzigiannakis, Sotiris E. Nikoletseas	A forward planning situated protocol for data propagation in wireless sensor networks based on swarm intelligence techniques.	SPAA	2005	DBLP DOI BibTeX RDF
1	Kofi A. Laing, Rajmohan Rajaraman	A space lower bound for name-independent compact routing in trees.	SPAA	2005	DBLP DOI BibTeX RDF	trees, space complexity, compact routing
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul	Concurrent cache-oblivious b-trees.	SPAA	2005	DBLP DOI BibTeX RDF	cache-oblivious b-tree, concurrent b-tree, exponential tree, packed-memory array, lock free, non-blocking
1	Krishnaram Kenthapadi, Gurmeet Singh Manku	Decentralized algorithms using both local and random probes for P2P load balancing.	SPAA	2005	DBLP DOI BibTeX RDF	bins and balls, coupon collection, load balancing, distributed hash tables, peer to peer systems, binary trees, cliques, decentralized algorithms
1	Robert Elsässer, Leszek Gasieniec	Radio communication in random graphs: extended abstract.	SPAA	2005	DBLP DOI BibTeX RDF	broadcasting, random graphs, radio networks, communication algorithms
1	Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson	Adversarial contention resolution for simple channels.	SPAA	2005	DBLP DOI BibTeX RDF	exponential backoff, polynomial backoff, worst-case backoff performance, on-line, batch
1	Martin Gairing, Burkhard Monien, Karsten Tiemann	Selfish routing with incomplete information.	SPAA	2005	DBLP DOI BibTeX RDF	coordination ratio, incomplete information, nash equilibria, selfish routing, bayesian game
1	James Aspnes, Udi Wieder	The expansion and mixing time of skip graphs with applications.	SPAA	2005	DBLP DOI BibTeX RDF	P2P, expansion
1	Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle	Collaborate with strangers to find own preferences.	SPAA	2005	DBLP DOI BibTeX RDF	recommendation systems, collaborative filtering, electronic commerce, randomized algorithms, probes, billboard
1	Bradley C. Kuszmaul	A segmented parallel-prefix VLSI circuit with small delays for small segments.	SPAA	2005	DBLP DOI BibTeX RDF	VLSI layout parallel-prefix circuit
1	Peter Mahlmann, Christian Schindelhauer	Peer-to-peer networks based on random transformations of connected regular undirected graphs.	SPAA	2005	DBLP DOI BibTeX RDF	distributed algorithms, peer-to-peer networks, random graphs, expander graphs
1	Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan	Broadcasting on networks of workstations.	SPAA	2005	DBLP DOI BibTeX RDF	approximation algorithms, multicasting, broadcasting
1	Grzegorz Malewicz	Parallel scheduling of complex dags under uncertainty.	SPAA	2005	DBLP DOI BibTeX RDF	algorithms and theory, probabilistic failures, scheduling of dags, grid computing, combinatorial optimization, project management, resource constraints
1	Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.	DCAS is not a silver bullet for nonblocking algorithm design.	SPAA	2004	DBLP DOI BibTeX RDF	DCAS, double-compare-and-swap, multiprocessors, lock-free, concurrent data structures, linked lists, nonblocking synchronization
1	Phillip B. Gibbons, Micah Adler (eds.)	SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain	SPAA	2004	DBLP DOI BibTeX RDF
1	Vittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo	Sharing the cost of multicast transmissions in wireless networks.	SPAA	2004	DBLP DOI BibTeX RDF	approximate budget balanceness, multicast cost sharing, strategy-proof mechanisms, wireless networks, efficiency
1	Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler	The effect of faults on network expansion.	SPAA	2004	DBLP DOI BibTeX RDF	d-dimensional mesh, faulty networks, expansion, random faults
1	Daniel A. Spielman, Shang-Hua Teng, Alper Üngör	Time complexity of practical parallel steiner point insertion algorithms.	SPAA	2004	DBLP DOI BibTeX RDF	parallelization, delaunay triangulations, Steiner points
1	Fabian Kuhn, Roger Wattenhofer	Dynamic analysis of the arrow distributed protocol.	SPAA	2004	DBLP DOI BibTeX RDF	distributed ordering, distributed queuing, distributed algorithms, competitive analysis
1	Yi Cui 0001, Baochun Li, Klara Nahrstedt	On achieving optimized capacity utilization in application overlay networks with multiple competing sessions.	SPAA	2004	DBLP DOI BibTeX RDF	multicast, overlay, multicommodity flow
1	Guy E. Blelloch, Phillip B. Gibbons	Effectively sharing a cache among threads.	SPAA	2004	DBLP DOI BibTeX RDF	chip multiprocessors, scheduling algorithms, shared cache, multithreaded architectures
1	Xiaozhou Li 0001, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani	Online hierarchical cooperative caching.	SPAA	2004	DBLP DOI BibTeX RDF	hierarchical cooperative caching, online computation
1	Vicent Cholvi, Pascal Felber, Ernst W. Biersack	Efficient search in unstructured peer-to-peer networks.	SPAA	2004	DBLP DOI BibTeX RDF	peer-to-peer systems
1	Rezaul Alam Chowdhury, Vijaya Ramachandran	Cache-oblivious shortest paths in graphs using buffer heap.	SPAA	2004	DBLP DOI BibTeX RDF	buffer heap, cache-aware model, cache-oblivious model, decrease-key, tournament tree, shortest paths, priority queue
1	John Y. Oliver, Venkatesh Akella, Frederic T. Chong	Efficient orchestration of sub-word parallelism in media processors.	SPAA	2004	DBLP DOI BibTeX RDF	sub word, parallelism, media processors, decoupled control
1	Adi Rosén, Michael S. Tsirkin	On delivery times in packet networks under adversarial traffic.	SPAA	2004	DBLP DOI BibTeX RDF	adversarial queuing theory, delivery time, protocols, stability, packet networks
1	Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide	Scheduling against an adversarial network.	SPAA	2004	DBLP DOI BibTeX RDF	parallel computation, competitive algorithms, parallel machine scheduling
1	Kirsten Hildrum, Robert Krauthgamer, John Kubiatowicz	Object location in realistic networks.	SPAA	2004	DBLP DOI BibTeX RDF	DOLR, distributed object location, peer-o-peer, networking, locality, DHT, distributed hash table, overlay
1	Hagit Attiya, David Hay	The inherent queuing delay of parallel packet switches.	SPAA	2004	DBLP DOI BibTeX RDF	leaky-bucket traffic, load balancing, packet switching, clos networks, queuing delay, delay jitter, inverse multiplexing
1	Baruch Awerbuch, Christian Scheideler	Consistent and compact data management in distributed storage systems.	SPAA	2004	DBLP DOI BibTeX RDF	load balancing, peer-to-peer systems, range queries, distributed data management
1	Rahul Shah 0001, Peter J. Varman, Jeffrey Scott Vitter	Online algorithms for prefetching and caching on parallel disks.	SPAA	2004	DBLP DOI BibTeX RDF	parallel disk model, caching, prefetching, online algorithms, I/O scheduling
1	Dariusz R. Kowalski, Alexander A. Shvartsman	Writing-all deterministically and optimally using a non-trivial number of asynchronous processors.	SPAA	2004	DBLP DOI BibTeX RDF	write-all, distributed algorithms, shared memory, asynchrony, work
1	Alessandro Panconesi, Jaikumar Radhakrishnan	Expansion properties of (secure) wireless networks.	SPAA	2004	DBLP DOI BibTeX RDF	security, ad hoc networks, wireless networks, distributed algorithms, connectivity, expanders
1	Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano	How to route and tax selfish unsplittable traffic.	SPAA	2004	DBLP DOI BibTeX RDF	scheduling, nash equilibrium, selfish routing, algorithmic mechanism design
1	Pierre-François Dutot, Lionel Eyraud, Grégory Mounié, Denis Trystram	Bi-criteria algorithm for scheduling jobs on cluster platforms.	SPAA	2004	DBLP DOI BibTeX RDF	bi-criteria, moldable tasks, scheduling, algorithms, parallel computing, parallel tasks
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson	On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs.	SPAA	2004	DBLP DOI BibTeX RDF	SP-bags, SP-hybrid, SP-order, least common ancestor, order maintenance, series-parallel, algorithm, parallel computing, data structure, graph, tree, mutual exclusion, thread, trace, locking, multi-threading, data race, work stealing, race detection, Cilk, parse tree, amortized analysis, fork-join, on the fly, dynamic set
1	Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide	Fighting against two adversaries: page migration in dynamic networks.	SPAA	2004	DBLP DOI BibTeX RDF	online algorithms, data management, page migration
1	Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober	Pagoda: a dynamic overlay network for routing, data management, and multicasting.	SPAA	2004	DBLP DOI BibTeX RDF	routing, multicasting, peer-to-peer networks
1	Fan R. K. Chung, Ronald L. Graham, George Varghese	Parallelism versus memory allocation in pipelined router forwarding engines.	SPAA	2004	DBLP DOI BibTeX RDF	approximation algorithm, memory allocation
1	Yuu Tanaka, Toshinori Sato, Takenori Koushiro	The potential in energy efficiency of a speculative chip-multiprocessor.	SPAA	2004	DBLP DOI BibTeX RDF	dual pipeline, energy efficiency, speculative multithreading
1	Dan Guez, Alexander Kesselman, Adi Rosén	Packet-mode policies for input-queued switches.	SPAA	2004	DBLP DOI BibTeX RDF	packet-mode scheduling, competitive analysis, input-queued switches
1	Philippe Raipin Parvédy, Michel Raynal	Optimal early stopping uniform consensus in synchronous systems with process omission failures.	SPAA	2004	DBLP DOI BibTeX RDF	round-based computation, send omission, send/receive omission, uniform consensus, consensus, crash failure, omission failure, synchronous distributed system
1	Gary L. Miller, Peter C. Richter	Lower bounds for graph embeddings and combinatorial preconditioners.	SPAA	2004	DBLP DOI BibTeX RDF	congestion, preconditioning, dilation, graph embeddings
1	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup	Compact name-independent routing with minimum stretch.	SPAA	2004	DBLP DOI BibTeX RDF	compact routing
1	David P. Bunde, Yishay Mansour	Improved combination of online algorithms for acceptance and rejection.	SPAA	2004	DBLP DOI BibTeX RDF	QoS, admission control, competitive, on-line
1	Danny Hendler, Nir Shavit, Lena Yerushalmi	A scalable lock-free stack algorithm.	SPAA	2004	DBLP DOI BibTeX RDF
1	Subhash Suri, Csaba D. Tóth, Yunhong Zhou	Selfish load balancing and atomic congestion games.	SPAA	2004	DBLP DOI BibTeX RDF	load balancing, nash equilibrium, greedy algorithm, price of anarchy, congestion game
1	Adam Meyerson	Online algorithms for network design.	SPAA	2004	DBLP DOI BibTeX RDF
1	Konstantin Andreev, Harald Räcke	Balanced graph partitioning.	SPAA	2004	DBLP DOI BibTeX RDF	approximation algorithms, graph partitioning, bicriteria approximation
1	Susanne Albers	New results on web caching with request reordering.	SPAA	2004	DBLP DOI BibTeX RDF	cache, approximation, document, competitive, online, batch, offline
1	Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles	Adaptive channel queue routing on k-ary n-cubes.	SPAA	2004	DBLP DOI BibTeX RDF	adaptive channel queue routing, k-ary n-cubes
1	John W. Byers, Jeffrey Considine, Michael Mitzenmacher	Geometric generalizations of the power of two choices.	SPAA	2004	DBLP DOI BibTeX RDF	two choices, load balancing, distributed hash tables
1	Aaron Windsor	An NC algorithm for finding a maximal acyclic set in a graph.	SPAA	2004	DBLP DOI BibTeX RDF	hypergraph algorithms, maximal acyclic set, maximal forest, graph algorithms, NC algorithms
1	David R. Karger, Matthias Ruhl	Simple efficient load balancing algorithms for peer-to-peer systems.	SPAA	2004	DBLP DOI BibTeX RDF	load balancing, peer-to-peer systems
1	Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante	Cycle stealing under immediate dispatch task assignment.	SPAA	2003	DBLP DOI BibTeX RDF	distributed system, supercomputing, task assignment, load sharing, matrix analytic methods, starvation, cycle stealing, unfairness, server farm
1	Akira Matsubayashi	VLSI layout of trees into grids of minimum width.	SPAA	2003	DBLP DOI BibTeX RDF	cutwidth, grid, tree, graph embedding, VLSI layout, graph layout, aspect ratio
1	Evripidis Bampis, Alexander V. Kononov	Bicriteria approximation algorithms for scheduling problems with communications.	SPAA	2003	DBLP DOI BibTeX RDF
1	Susanne Albers, Markus Büttner	Integrated prefetching and caching in single and parallel disk systems.	SPAA	2003	DBLP DOI BibTeX RDF	magnetic disk systems, caching, prefetching
1	Tong Li 0003, Alvin R. Lebeck, Daniel J. Sorin	Quantifying instruction criticality for shared memory multiprocessors.	SPAA	2003	DBLP DOI BibTeX RDF	shared memory multiprocessors, slack, critical path analysis
1	Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro	Can we elect if we cannot compare?	SPAA	2003	DBLP DOI BibTeX RDF	distributed computing, mobile agents, cayley graphs, election, rendezvous, anonymous networks
1	Alexander Kesselman, Adi Rosén	Scheduling policies for CIOQ switches.	SPAA	2003	DBLP DOI BibTeX RDF	CIOQ switches, competitive analysis, buffer management, scheduling policies
1	Anupam Gupta 0001, Amit Kumar 0001, Mikkel Thorup	Tree based MPLS routing.	SPAA	2003	DBLP DOI BibTeX RDF	MPLS routing, networks, routing algorithms
1	Christopher Caltagirone, Kasi Anantha	High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA.	SPAA	2003	DBLP DOI BibTeX RDF	128-bit AES, optimization, FPGA, parallelization, hardware, high-throughput
1	Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Frederic T. Chong, Isaac L. Chuang, John Kubiatowicz	The effect of communication costs in solid-state quantum computing architectures.	SPAA	2003	DBLP DOI BibTeX RDF	quantum architecture, silicon-based quantum computing, quantum computing
1	Jason F. Cantin, Mikko H. Lipasti, James E. Smith 0001	The complexity of verifying memory coherence.	SPAA	2003	DBLP DOI BibTeX RDF	shared memory, coherence, consistency models
1	Kishore Kothapalli, Christian Scheideler	Information gathering in adversarial systems: lines and cycles.	SPAA	2003	DBLP DOI BibTeX RDF	sensor networks, routing, online algorithms
1	Nikhil Bansal 0001, Avrim Blum, Shuchi Chawla 0001, Adam Meyerson	Online oblivious routing.	SPAA	2003	DBLP DOI BibTeX RDF	networks, online algorithms, competitive analysis, congestion, gradient descent, oblivious routing
1	Roman Dementiev, Peter Sanders 0001	Asynchronous parallel disk sorting.	SPAA	2003	DBLP DOI BibTeX RDF	algorithm library, external memory sorting, overlapping I/O and computation, randomized algorithm, prefetching, large data sets, algorithm engineering, parallel disks, secondary memory
1	Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman	Short length menger's theorem and reliable optical routing.	SPAA	2003	DBLP DOI BibTeX RDF	flow number, menger's theorem, fault-tolerant routing, path coloring
1	Alexander Kesselman, Yishay Mansour, Zvi Lotker, Boaz Patt-Shamir	Buffer overflows of merging streams.	SPAA	2003	DBLP DOI BibTeX RDF
1	Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg	MST construction in O(log log n) communication rounds.	SPAA	2003	DBLP DOI BibTeX RDF	communication round complexity, sub-logarithmic protocols, minimum spanning tree
1	Amotz Bar-Noy, Justin Goshi, Richard E. Ladner	Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging.	SPAA	2003	DBLP DOI BibTeX RDF	off-line algorithms, on-line algorithms, stream merging, media-on-demand
1	Lujun Jia, Rajmohan Rajaraman, Christian Scheideler	On local algorithms for topology control and routing in ad hoc networks.	SPAA	2003	DBLP DOI BibTeX RDF	mobile computing and communication, routing, distributed algorithms, competitive analysis, ad hoc wireless networks, spanners, adversarial model
1	Moni Naor, Udi Wieder	Novel architectures for P2P applications: the continuous-discrete approach.	SPAA	2003	DBLP DOI BibTeX RDF	fault tolerance, distributed systems, peer-to-peer, hash tables
1	Jae-Ha Lee	Online deadline scheduling: multiple machines and randomization.	SPAA	2003	DBLP DOI BibTeX RDF
1	Raghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra	Efficient galois field arithmetic on SIMD architectures.	SPAA	2003	DBLP DOI BibTeX RDF	correcting codes, reed-solomon error, SIMD, rijndael, galois field arithmetic, bit slicing
1	Christine A. Shoemaker, Rommel G. Regis	MAPO: using a committee of algorithm-experts for parallel optimization of costly functions.	SPAA	2003	DBLP DOI BibTeX RDF	costly function, radial basis function, parallel optimization
1	Costas Busch, Srikanth Surapaneni, Srikanta Tirthapura	Analysis of link reversal routing algorithms for mobile ad hoc networks.	SPAA	2003	DBLP DOI BibTeX RDF	gafni-berstekas, link reversal routing, ad hoc networks
1	Robert Elsässer, Burkhard Monien	Load balancing of unit size tokens and expansion properties of graphs.	SPAA	2003	DBLP DOI BibTeX RDF
1	Toshinori Yamada, Shuichi Ueno	Optimal fault-tolerant linear arrays.	SPAA	2003	DBLP DOI BibTeX RDF	fault-tolerant graph, magnifier, expander, linear array
1	Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Cormen	Relaxing the problem-size bound for out-of-core columnsort.	SPAA	2003	DBLP DOI BibTeX RDF	columnsort, cluster, out-of-core, parallel sorting
1	Adnan Aziz, Amit Prakash, Vijaya Ramachandran	A near optimal scheduler for switch-memory-switch routers.	SPAA	2003	DBLP DOI BibTeX RDF	schedulers, parallelism, matching, randomization, routers

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