yusuke1997/dblp-id-title huggingface dataset:
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation
Efficient Parallel Algorithms for Path Problems in Directed Graphs
Brief announcement: towards a fully-articulated pessimistic distributed transactional memory
Optimal quantum sampling on distributed databases
Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM
Brief Announcement: Open Cilk
Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2025, Portland, OR, USA, 28 July 2025 - 1 August 2025
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
Maximizing total upload in latency-sensitive P2P applications
Nearly Work-Efficient Parallel DFS in Undirected Graphs
Brief Announcement: Optimized GPU-accelerated Feature Extraction for ORB-SLAM Systems
Periodic, random-fault-tolerant correction networks
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures
A Scalable Recoverable Skip List for Persistent Memory
Concurrent cache-oblivious b-trees
Blockchain Abstract Data Type
Feasibility study of MPI implementation on the heterogeneous multi-core cell BE TM architecture
Scaling Parallel Algorithms to Massive Datasets using Multi-SSD Machines
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002
On Shortest Path Routing in Single Stage Shuffle-Exchange Networks
The Cost of Unknown Diameter in Dynamic Networks
Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996
O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices
Efficient Low-Contention Parallel Algorithms
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation
Parallel Point-to-Point Shortest Paths and Batch Queries
Scheduling shared continuous resources on many-cores
Message-Passing Algorithms for a SIMD Torus with Coteries
Brief announcement: fairness-efficiency tradeoffs in tiered storage allocation
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults
Elimination Forest Guided 2D Sparse LU Factorization
Scheduling to minimize power consumption using submodular functions
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
SybilCast: broadcast on the open airwaves (extended abstract)
IRIS: a robust information system against insider dos-attacks
Brief Announcement: STAR (Space-Time Adaptive and Reductive) Algorithms for Dynamic Programming Recurrences with more than O(1) Dependency
Optimal Parallel Algorithms in the Binary-Forking Model
Optimal patrolling of fragmented boundaries
A Computational Model for Tensor Core Units
An Architecture for Optimal All-to-All Personalized Communication
Why Intel is designing multi-core processors
On competitive online read-many parallel disks scheduling
Brief Announcement: Benchmarking Concurrent Priority Queues
Transactional memory and the birthday paradox
Can we elect if we cannot compare?
Strip packing with precedence constraints and strip packing with release times
Brief announcement: selfishness in transactional memory
Permutation Predictions for Non-Clairvoyant Scheduling
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023
Transactional Composition of Nonblocking Data Structures
Optimal Reissue Policies for Reducing Tail Latency
Brief Announcement: Graph Matching in Massive Datasets
Theoretically-Efficient and Practical Parallel In-Place Radix Sorting
Tell me who I am: an interactive recommendation system
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Toward a decidable notion of sequential consistency
Technology Advances in the Intel Paragon System
Scalable statistics counters
Space-Efficient Representations of Shared Data for Parallel Computers
Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
Efficient Parallel Determinacy Race Detection for Structured Futures
Parallel Construction of Optimal Alphabetic Trees
Parallel Best Arm Identification in Heterogeneous Environments
Online Generalized Caching with Varying Weights and Costs
Brief Announcement: On Scheduling Best-Effort HTM Transactions
Brief announcement: concurrent data structures for efficient streaming aggregation
Compact, multilayer layout for butterfly fat-tree
Tight competitive ratios for parallel disk prefetching and caching
Designing Synchronous Algorithms for Asynchronous Processors
Fault-Tolerant Circuit-Switching Networks
Fundamental parallel algorithms for private-cache chip multiprocessors
Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract)
Sparse parallel Delaunay mesh refinement
Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions
Towards Zero Spawn Overhead: Work Stealing Without Deques
Architectural Mechanisms to Support Three-Dimensional Lattice Gas Simulations
Brief Announcement: Managing Resource Limitation of Best-Effort HTM
Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
Algorithms for Right-Sizing Heterogeneous Data Centers
A Simple Load Balancing Scheme for Task Allocation in Parallel Machines
Brief announcement: a GPU accelerated iterated local search TSP solver
The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster)
Verifying sequential consistency using vector clocks
Parallel rotor walks on finite graphs and applications in discrete load balancing
Fast Set Operations Using Treaps
Lock-free Transactions without Rollbacks for Linked Data Structures
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms
Multi Bucket Queues: Efficient Concurrent Priority Scheduling
Room synchronizations
Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory
Optimal Algorithms for Right-Sizing Data Centers
An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence
Approximate Agreement Algorithms for Byzantine Collaborative Learning
A parallel dynamic programming algorithm on a multi-core architecture
Dense Edge-Disjoint Embedding of Binary Trees in the Mesh
Processor Networks and Alternating Machines
Competitve buffer management for shared-memory switches
On Communication Latency in PRAM Computations
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000
Tight bounds for distributed selection
Scheduling tasks with small communication delays for clusters of processors
An Overview of Cray Research Computers Including the Y-MP/C90 and the new MPP T3D
The k-Server with Preferences Problem
Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules
Accurate Traffic Splitting on Commodity Switches
"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments
Sparse spanners vs. compact routing
Brief Announcement: A QPTAS for Non-preemptive Speed-scaling
HARP: A Fast Spectral Partitioner
Optimal bit-reversal using vector permutations
Efficient parallel exponentiation in GF(2 n ) using normal basis representations
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '93, Velen, Germany, June 30 - July 2, 1993
An Associativity Threshold Phenomenon in Set-Associative Caches
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design
Reactive Diffracting Trees
Advances in Homotopic Layout Compaction
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999
Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract)
Checkpoints and continuations instead of nested transactions
Recursive design of hardware priority queues
In-Memory Directories: Eliminating the Cost of Directories in CC-NUMAs
Quancurrent: A Concurrent Quantiles Sketch
Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics
Time vs. space trade-offs for rendezvous in trees
Parallel graph decompositions using random shifts
List Ranking and List Scan on the Cray C-90
On Parallel k-Center Clustering
Tree network coding for peer-to-peer networks
Brief Announcement: Streaming Balanced Clustering
Parallel Cover Trees and their Applications
Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms
Towards automatic parallelization of tree reductions in dynamic programming
Collaborate with strangers to find own preferences
The FG programming environment: good and good for you
Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees
Parallel Neighborhood Modeling
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
Online Non-preemptive Scheduling on Unrelated Machines with Rejections
Routing without flow control
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond
Self-Stabilizing Repeated Balls-into-Bins
The notion of a timed register and its application to indulgent synchronization
How to Find It: Research Issues in Distributed Search (Abstract)
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
Brief Announcement: Dynamic Determinacy Race Detection for Task Parallelism with Futures
Running Algorithms Efficiently on Faulty Hypercubes
An experimental study of a simple, distributed edge coloring algorithm
Efficient online scheduling for deadline-sensitive jobs: extended abstract
Work-efficient matrix inversion in polylogarithmic time
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '92, San Diego, CA, USA, June 29 - July 1, 1992
Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures
Durable Queues: The Second Amendment
A Tight Layout of the Butterfly Network
Optimizing Dynamic Data Center Provisioning through Speed Scaling: A Primal-Dual Perspective
Swarm-based Incast Congestion Control in Datacenters Serving Web Applications
Distributed voronoi diagram computation in wireless sensor networks
Distributed Graph Coloring Made Easy
Local MST computation with short advice
Parallel Rectilinear Shortest Paths with Rectangular Obstacles
The potential in energy efficiency of a speculative chip-multiprocessor
Computation-Centric Memory Models
Online Tree Caching
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection
Efficient Local Medium Access
Parallel Planar Subgraph Isomorphism and Vertex Connectivity
Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast
Log Diameter Rounds MST Verification and Sensitivity in MPC
An Efficient Wait-free Resizable Hash Table
On Probabilistic Networks for Selection, Merging, and Sorting
On Sparsity Awareness in Distributed Computations
Brief Announcement: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables
Parallelizing dynamic information flow tracking
Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers
LogGP: Incorporating Long Messages into the LogP Model - One Step Closer Towards a Realistic Model for Parallel Computation
The inherent queuing delay of parallel packet switches
Brief Announcement: Faster Stencil Computations using Gaussian Approximations
Scheduling Optimization for Resource-Intensive Web Requests on Server Clusters
Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer
Towards small world emergence
Parallel Shortest Paths with Negative Edge Weights
Broadcasting on networks of workstations
A NUMA-Aware Recoverable Mutex Lock
Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version)
Parallel Searching in Generalized Monge Arrays with Applications
Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling
JOVS: Joint Optimization of Vectorization and Scheduling for DNN on AI DSPs
Bounds to the Throughput of an Interconnection Network
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors
Value-maximizing deadline scheduling and its application to animation rendering
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication
Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks
Adaptive Massively Parallel Algorithms for Cut Problems
A lock-free B+tree
Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method
Commit phase in timestamp-based stm
Distributed algorithms for QoS load balancing
Lightweight, robust adaptivity for software transactional memory
Finding Connected Components on a Scan Line Array Processor
Brief announcement: towards a communication optimal fast multipole method and its implications at exascale
Layered Cross Product - A Technique to Construct Interconnection Networks
A non-blocking internal binary search tree
Towards transactional memory semantics for C++
Balanced allocations and double hashing
An envolutionary path towards virtual shared memory with random access
The Dispersion Time of Random Walks on Finite Graphs
Fighting against two adversaries: page migration in dynamic networks
Simplifying concurrent algorithms by exploiting hardware transactional memory
Randomized queue management for DiffServ
Evaluating synchronization techniques for light-weight multithreaded/multicore architectures
Triplex: A Multi-Class Routing Algorithm
Fault tolerant networks with small degree
Constructing Trees in Parallel
New spectral bounds on k-partitioning of graphs
Speed Scaling with Explorable Uncertainty
On-the-fly pipeline parallelism
Brief Announcement: ROMe: Wait-free Objects for RDMA
Polynomial time algorithms for network information flow
Parallel Sorting by Over Partitioning
Online multi-robot exploration of grid graphs with rectangular obstacles
Systolic Implementations of a Move-to-Front Text Compressor
Automatic HBM Management: Models and Algorithms
Dynamic page migration with stochastic requests
Experimental analysis of space-bounded schedulers
Reducers and other Cilk++ hyperobjects
Brief Announcement: Preserving Happens-before in Persistent Memory
Optimal Latency-Throughput Tradeoffs for Data Parallel Pipelines
Fault-tolerant semifast implementations of atomic read/write registers
Concurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation
PREP-UC: A Practical Replicated Persistent Universal Construction
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol
Layout of the Batcher Bitonic Sorter (Extended Abstract)
Fast Parallel Algorithms for the Unit Cost Editing Distance Between Trees
Transactional Acceleration of Concurrent Data Structures
Hardware Speedups in Long Integer Multiplication
High Performance Clusters (Abstract): State of the Art and Challenges Ahead
Highly Efficient Dictionary Matching in Parallel
Online deadline scheduling: multiple machines and randomization
An EPTAS for Machine Scheduling with Bag-Constraints
An Efficient Expected Time Parallel Algorithm for Voronoi Construction
A scalable framework for heterogeneous GPU-based clusters
Deterministic P-RAM Simulation with Constant Redundancy
Fast Distributed Algorithms for Connectivity and MST in Large Graphs
Randomized routing with shorter paths
Enforcing efficient equilibria in network design games via subsidies
Weighted distributed hash tables
Lower Bounds for Randomized Exclusive Write PRAMs
A segmented parallel-prefix VLSI circuit with small delays for small segments
Fast Parallel Discrete Approximation Algorithms for the Radon Transform
A transactional approach to lock scalability
Location-Sensitive String Problems in MPC
A Closer Look at Coscheduling Approaches for a Network of Workstations
Scheduling malleable tasks with precedence constraints
From AAPC Algorithms to High Performance Permutation Routing and Sorting
On randomized representations of graphs using short labels
Fast Connected Components Algorithms for the EREW PRAM
Brief announcement: a reinforcement learning approach for dynamic load-balancing of parallel digital logic simulation
Improved Parity-Declustered Layouts for Disk Arrays
A universal approach to data center network design
Parallel Minimum Cuts in O ( m log 2 n ) Work and Low Depth
Introducing the hydra parallel programming system
Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors
Load balancing of unit size tokens and expansion properties of graphs
Buffer management for colored packets with deadlines
Sublinear Algorithms in T-interval Dynamic Networks
Flat-combining NUMA locks
Approximate Dynamic Balanced Graph Partitioning
I/O-Optimal Algorithms for Symmetric Linear Algebra Kernels
Modeling the Benefits of Mixed Data and Task Parallelism
Dynamic external hashing: the limit of buffering
Online frequency allocation in cellular networks
Parallel Molecular Computation
Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs
Coding Theory, Hypercube Embeddings, and Fault Tolerance
Hardware Combining and Scalability
Applying Randomized Edge Coloring Algorithms to Distributed Communication: An Experimental Study
Optimal gossip-based aggregate computation
Stability and non-stability of the FIFO protocol
Astronomical real-time streaming signal processing on a Blue Gene/L supercomputer
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels
Optimal Resource Allocation for Elastic and Inelastic Jobs
Transaction-friendly condition variables
Fast distributed scheduling via primal-dual
Fault Tolerance in Hypercube-Derivative Networks
Self-Stabilizing Task Allocation In Spite of Noise
Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints
Commitment and Slack for Online Load Maximization
A highly-efficient wait-free universal construction
The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines
Wait-Free Data Structures in the Asynchronous PRAM Model
An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract)
Dynamic circular work-stealing deque
Publish and perish: definition and analysis of an n -person publication impact game
Routing Multiple Paths in Hypercubes
BQ: A Lock-Free Queue with Batching
Compact routing with additive stretch using distance labelings
On multi-processor speed scaling with migration: extended abstract
Delay-Free Concurrency on Faulty Persistent Memory
Supporting the Hypercube Programming Model on Mesh Architectures: A Fast Sorter for iWarp Tori
Processor Efficient Parallel Solution of Linear Systems over an Abstract Field
Brief announcement: subgraph isomorphism on a multithreaded shared memory architecture
Brief Announcement: Is the Problem-Based Benchmark Suite Fearless with Rust?
Brief Announcement: Relaxed Byzantine Vector Consensus
Radio communication in random graphs: extended abstract
On delivery times in packet networks under adversarial traffic
Load Balancing, Selection Sorting on the Hypercube
Reconfigurable resource scheduling
HEX: scaling honeycombs is easier than scaling clock trees
Optimal-Time Multipliers and C-Testability
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020
Greedy sequential maximal independent set and matching are parallel on average
Selfish load balancing and atomic congestion games
A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables
Approximation Algorithms for Structured Communication Problems
Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
Brief Announcement: Racos: A Leaderless Erasure Coding State Machine Replication
Cache Coherence for Large Scale Shared Memory Multiprocessors
A general approach for partitioning N-dimensional parallel nested loops with conditionals
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity
A Queueing Network-Based Distributed Laplacian Solver
Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems
Scheduling selfish jobs on multidimensional parallel machines
Efficient Approximation Algorithms for Scheduling Malleable Tasks
Kicking the tires of software transactional memory: why the going gets tough
P-Complete Geometric Problems
Analysis of Multithreaded Architectures for Parallel Computing
Brief announcement: online batch scheduling for flow objectives
Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms
All-to-All Routing and Coloring in Weighted Trees of Rings
The APRAM: Incorporating Asynchrony into the PRAM Model
Distributed packing in planar graphs
Efficient computation of distance sketches in distributed networks
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
Multi-sided shared coins and randomized set-agreement
Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018
Geometric Network Creation Games
A One-Way Array Algorithm for Matroid Scheduling
Packing to angles and sectors
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
Energy efficient randomised communication in unknown AdHoc networks
Experience with an Adaptive Globally-Synchronizing Clock Algorithm
Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths
Brief announcement: processor allocation for optimistic parallelization of irregular programs
Adaptive Massively Parallel Connectivity in Optimal Space
Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices
Eventually consistent failure detectors
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems
On the Distributed Complexity of Large-Scale Graph Computations
Bounding Laconic Proof Systems by Solving CSPs in Parallel
Phase-concurrent hash tables for determinism
Power-aware scheduling for makespan and flow
On Parallel Evaluation of Game Trees
Dynamic Tree Embeddings in Butterflies and Hypercubes
Simulating Binary Trees on X-Trees (Extended Abstract)
Fundamental Control Algorithms in Mobile Networks
Brief announcement: fast dual ring queues
The power of duality for prefetching and sorting with parallel disks
TLF: Transactional Lock Fusion
Unconditional Lower Bounds for Adaptive Massively Parallel Computation
ROMM Routing on Mesh and Torus Networks
Benchmarking Recoverable Mutex Locks
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
A Lower Bound for Sorting Networks Based on the Shuffle Permutation
Constant-Length Labeling Schemes for Deterministic Radio Broadcast