yusuke1997/dblp-id-title huggingface dataset:
Brief Announcement: A Compiler-Runtime Application Binary Interface for Pipe-While Loops
Infinite parallel job allocation (extended abstract)
A Comparison of Parallel Algorithms for Connected Components
Approximating Biconnectivity in Parallel
Optimal Speedup for Backtrack Search on a butterfly Network
Profitable scheduling on multiple speed-scalable processors
POPQC: Parallel Optimization for Quantum Circuits
An experimental comparison of cache-oblivious and cache-conscious programs
Optimal Parallel Sorting with Comparison Errors
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
On the cost of composing shared-memory algorithms
Brief Announcement: A Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
On the Scheduling of Variable Latency Functional Units
Parallelism and data movement characterization of contemporary application classes
Low-contention data structures
Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach
Modeling Parallel Bandwidth: Local vs. Global Restrictions
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion
Algorithmic Problems in Internet Research (Abstract)
Online Parallel Paging with Optimal Makespan
Energy implications of multiprocessor synchronization
On obstruction-free transactions
Modeling weakly consistent memories with locks
Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm
Directed transmission method, a fully asynchronous approach to solve sparse linear systems in parallel
Routing without ordering
Database systems in the multicore era
SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)
Brief announcement: TeraByte TokuSampleSort sorts 1TB in 197s
On tiling space-time mapped loop nests
Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection
Combining online algorithms for rejection and acceptance
The data locality of work stealing
Latency effects on reachability in large-scale peer-to-peer networks
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
A Foundation for Sequentializing Parallel Code
On the complexity of the regenerator placement problem in optical networks
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC
SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA
Brief Announcement: Distributed Butterfly Analysis using Mobile Agents
Supervised Average Consensus in Anonymous Dynamic Networks
Tightening I/O Lower Bounds through the Hourglass Dependency Pattern
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput
D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks
Automatic Parallel I/O Performance Optimization in Panda
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer
A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible
An Overview of Supertoroidal Networks
Brief announcement: deadline-aware scheduling of big-data processing jobs
Brief Announcement: SCOT: Fix non-blocking data structures, not memory reclamation
Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors
A note on cycle covering
Practical Massively Parallel Sorting
Diffusive load balancing schemes on heterogeneous networks
Ased: availability, security, and debugging support usingtransactional memory
Trace-Driven Studies of VLIW Video Signal Processors
The Meiko CS-2 System Architecture
Competitive Fault-Tolerance in Area-Universal Networks
Efficient Computations on Fault-Prone BSP Machines
Efficient Online Weighted Multi-Level Paging
Computing the throughput of probabilistic and replicated streaming applications
Attack propagation in networks
Bi-criteria algorithm for scheduling jobs on cluster platforms
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables
Randomized Local Network Computing
Fair online load balancing
The Arvy Distributed Directory Protocol
Processor Networks and Interconnection Networks Without Long Wires
On the Parallel Complexity of Matrix Factorization Algorithms
Fast Broadcast in Highly Connected Networks
PolarStar: Expanding the Horizon of Diameter-3 Networks
Dreadlocks: efficient deadlock detection
Scalable Parallel Computing: The IBM 9076 Scalable POWERparallel 1
Sharing-aware algorithms for virtual machine colocation
Brief Announcement: A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors
On a local protocol for concurrent file transfers
Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues
Tracking immediate predecessors in distributed computations
Listening Efficient Contention Resolution for Semi-batch Arrivals without Collision Detection
Towards optimizing energy costs of algorithms for shared memory architectures
Scope Consistency: A Bridge Between Release Consistency and Entry Consistency
Parallel Algorithms for Generating Random Permutations on a Shared memory Machine
Distributed object location in a dynamic network
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations
Fast Algorithms for Bit-Serial Routing on a Hypercube
Parallel Batch-Dynamic Graph Connectivity
Tradeoffs between knowledge and time of communication in geometric radio networks
Stable Blockchain Sharding under Adversarial Transaction Generation
A Memory Optimized Architecture for Multi-Field Packet Classification (Brief Announcement)
Linear Programming Models for Scheduling Systems of Affine Recurrence Equations - A Comparative Study
Parallel controlled conspiracy number search
Towards a first vertical prototyping of an extremely fine-grained parallel programming approach
A Method for Implementing Lock-Free Shared-Data Structures
A cost effective architecture for vectorizable numerical and multimedia applications
A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance
Balanced graph partitioning
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
The Energy Complexity of Las Vegas Leader Election
Scheduling threads for constructive cache sharing on CMPs
Scheduling strategies for optimistic parallel execution of irregular programs
Parallelism in Randomized Incremental Algorithms
The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019
Scheduling against an adversarial network
Cassandra: a structured storage system on a P2P network
Broadcasting in logarithmic time for ad hoc network nodes on a line using mimo
Dynamic Algorithms for the Massively Parallel Computation Model
On Testing Consecutive-Ones Property in Parallel
Gossiping to reach consensus
Discovery through gossip
26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014
Translating between itanium and sparc memory consistency models
Provable Neuromorphic Advantages for Computing Shortest Paths
Minimal Adaptive Routing on the Mesh with Bounded Queue Size
High performance dynamic lock-free hash tables and list-based sets
Distributed Backup Placement in Networks
Distributionally Linearizable Data Structures
A Unified Approach to Off-Line Permutation Routing on Parallel Networks
Don't Melt Your Cache: Low-Associativity with Heat-Sink
Parallel and I/O efficient set covering algorithms
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
Mapping filtering streaming applications with communication costs
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling
On scheduling in map-reduce and flow-shops
Brief announcement: locality-enhancing loop transformations for tree traversal algorithms
New results on web caching with request reordering
Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
A note on multiprocessor speed scaling with precedence constraints
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications
Online oblivious routing
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic
A Comparison of Scalable Superscalar Processors
The effect of communication costs in solid-state quantum computing architectures
On Energy Conservation in Data Centers
Analysis of Busy-Time Scheduling on Heterogeneous Machines
TLRW: return of the read-write lock
Possibilities and Impossibilities for Distributed Subgraph Detection
Scheduling to minimize staleness and stretch in real-time data warehouses
Conflict-free coloring for intervals: from offline to online
Tight Bounds for the Chaining Problem
Classifying peer-to-peer network coding schemes
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs
RACE: Operator Choreography for Inference Acceleration in Personalized Recommender System
SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007
Graphical congestion games with linear latencies
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001
Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract
In-network Allreduce with Multiple Spanning Trees on PolarFly
Online capacity maximization in wireless networks
Dynamic Scheduling With Incomplete Information
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
Universal stability of undirected graphs in the adversarial queueing model
Online collaborative filtering with nearly optimal dynamic regret
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)
Massively Parallel Algorithms for b-Matching
Practical weak-atomicity semantics for java stm
Distributed caching independent of the network size
Tight Bounds for Oblivious Routing in the Hypercube
A consistency architecture for hierarchical shared caches
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Speed Scaling in the Non-clairvoyant Model
A Framework for Adaptive Routing in Multicomputer Networks
Extending TM Primitives using Low Level Semantics
Increment - and - Freeze: Every Cache, Everywhere, All of the Time
On computing maximal independent sets of hypergraphs in parallel
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed
Drop the anchor: lightweight memory management for non-blocking data structures
On triangulation of simple networks
Extra processors versus future information in optimal deadline scheduling
Many random walks are faster than one
Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols
An NC algorithm for finding a maximal acyclic set in a graph
Brief announcement: multilane - a concurrent blocking multiset
Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
On the online fault-tolerant server consolidation problem
Construction of the Mesh and the Torus Tolerating a Large Number of Faults
Efficient Parallel Solutions of Linear Algebraic Circuits
Efficient Techniques for Fast Nested Barrier Synchronization
Improved MPC Algorithms for Edit Distance and Ulam Distance
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract
Reallocation problems in scheduling
Is partial quantum search of a database any easier?
Temporal Notions of Synchronization and Consistency in Beehive
The Transactional Conflict Problem
Detecting Data Rase in Cilk Programs That use Locks
An Efficient Scheduler for Task-Parallel Interactive Applications
Towards Lockfree Persistent Homology
Randomized permutations in a coarse grained parallel environment
Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions
Strong-diameter decompositions of minor free graphs
Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Simple Randomized Mergesort on Parallel Disks
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '98, Puerto Vallarta, Mexico, June 28 - July 2, 1998
One-to-Many routing on the mesh
Brief announcement: distributed shared memory based on computation migration
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes
Energy Efficient Adversarial Routing in Shared Channels
Geometric generalizations of the power of two choices
Trade-offs between the size of advice and broadcasting time in trees
Lock-Free garbage Collection for Multiprocessors
Brief Announcement: On Solving Recoverable Mutual Exclusion Under System-Wide Failures
Buffer overflows of merging streams
Remote Queues: Exposing Message Queues for Optimization and Atomicity
BALM: QoS-Aware Memory Bandwidth Partitioning for Multi-Socket Cloud Nodes
Matrix Multiplication, a Little Faster
Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm
Brief announcement: better speedups for parallel max-flow
ReFINE: A Reactive and Fine-Grained Scheduling Framework For Concurrency on General Purpose GPUs
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
Multi-Packet-Routing on Mesh Connected Arrays
Job Scheduling in Rings
Efficient scheduling to minimize calibrations
Reconciling Hardware Transactional Memory and Persistent Programming with Buffered Durability
Distributed streams algorithms for sliding windows
Competitive Algorithms for Block-Aware Caching
Constant Time per Edge is Optimal on Rooted Tree Networks
Semantic Conflict Detection for Transactional Data Structure Libraries
Distributed Partial Clustering
Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked List
Brief Announcement: Transactional Data Structure Libraries
Integrated prefetching and caching in single and parallel disk systems
Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation
An Analysis of Diffusive Load-Balancing
Parallel dynamic programming for solving the string editing problem on a CGM/BSP
An W(log log n) Lower Bound for Routing in Optical Networks
Simple Local Computation Algorithms for the General Lovász Local Lemma
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
Brief announcement: low depth cache-oblivious sorting
Eccentricities via Parallel Set Cover (Brief Announcement)
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Multithreaded algorithms for the fast Fourier transform
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Distributed random digraph transformations for peer-to-peer networks
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale
Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games
Flat combining and the synchronization-parallelism tradeoff
Lexicographic QoS scheduling for parallel I/O
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling
A System-Level Specification Framework for I/O Architectures
Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications
Segment Router: A Novel Router Design for Parallel Computers
Efficient Parallel Self-Adjusting Computation
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract)
Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond
NZTM: nonblocking zero-indirection transactional memory
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Sparse Matrix Multiplication in the Low-Bandwidth Model
Universal Continuous Routing Strategies
The pochoir stencil compiler
How Fast Can You Update Your MST?
Fast Scheduling in Distributed Transactional Memory
On the price of heterogeneity in parallel systems
Faster Deterministic All Pairs Shortest Paths in Congest Model
A distributed perspective on graph connectivity and cuts
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
KRS1: High Performance and Ease of Programming, No Longer an Oxymoron
Massively Parallel Computation via Remote Memory Access
Communication-Optimal Tilings for Projective Nested Loops with Arbitrary Bounds
On the convergence of multicast games in directed networks
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
Towards a scalable and robust DHT
Memory-mapping support for reducer hyperobjects
Brief Announcement: Fair Adaptive Parallelism for Concurrent Transactional Memory Applications
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Experiences with Parallel N-Body Simulation
Brief Announcement: Improved Understanding of Landlord Under Suffix Analysis
Components for Computing and Communications
New algorithms for efficient parallel string comparison
Energy, congestion and dilation in radio networks
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
Finding large independent sets of hypergraphs in parallel
The Verification of Cache Coherence Protocols
Communication Efficient Matrix Multiplication on Hypercubes
Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
Quantifying instruction criticality for shared memory multiprocessors
Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications
Design, verification and applications of a new read-write lock algorithm
Windows scheduling of arbitrary length jobs on parallel machines
A Simple and Efficient Parallel Disk Mergesort
Fast Byzantine Agreement for Permissioned Distributed Ledgers
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Fast construction of overlay networks
A near optimal scheduler for switch-memory-switch routers
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
Parallel Approaches to the String Matching Problem on the GPU
Filtering: a method for solving graph problems in MapReduce
Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM
Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation
Supereffective Slow-Down of Parallel Computations
On the Communication Throughput of Buffered Multistage Interconnection Networks
A temperature-aware virtual submesh allocation scheme for noc-based manycore chips
Bicriteria approximation algorithms for scheduling problems with communications
Provably good scheduling for parallel programs that use data structures through implicit batching
Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures
A polynomial-time tree decomposition to minimize congestion
Brief Announcement: Regular and Dyck Languages in MPC
Scheduling jobs with varying parallelizability to reduce variance
The Virtual Time Machine
Average Awake Complexity of MIS and Matching
Robust and Optimal Contention Resolution without Collision Detection
Scheduling in wireless networks with rayleigh-fading interference
SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
Relaxing the problem-size bound for out-of-core columnsort
Nearest common ancestors: a survey and a new distributed algorithm
Finding Subgraphs in Highly Dynamic Networks
How to route and tax selfish unsplittable traffic
Scheduling in Bandwidth Constrained Tree Networks
On the Computational Equivalence of Hypercube-Derived Networks
Study of Parallelism in Regular Iterative Algorithms
Brief Announcement: A Novel Integrated Parallel Accelerator for an Irregular Killer App
New stability results for adversarial queuing
Online algorithms for prefetching and caching on parallel disks
Resource Scheduling for Parallel Database and Scientific Applications
Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication
Square Meshes Are Not Always Optimal
Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds
AT 2 L 2 appr. equal N 2 /2 for fast fourier transform in multilayer VLSI
Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation
A randomized, o(log w)-depth 2 smoothing network
Brief announcement: parallelization of asynchronous variational integrators forshared memory architectures
The Connection Machine Systems CM-5
SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer pools
Scheduling DAGs on asynchronous processors
Deadlock-free scheduling of X10 computations with bounded resources
Estimating simple functions on the union of data streams
Assigning tasks for efficiency in Hadoop: extended abstract
Brief Announcement: Hardware Transactional Persistent Memory
Exponential separation of quantum and classical online space complexity
Parallel Computation of Persistent Homology using the Blowup Complex
Fast and Reliable Parallel Hashing
Detecting Violations of Sequential Consistency
Cost sharing mechanisms for near-optimal traffic aggregation and network design
A distributed O (1)-approximation algorithm for the uniform facility location problem
Brief Announcement: Towards a More Robust Algorithm for Flow Time Scheduling with Predictions
Adaptive channel queue routing on k-ary n-cubes
Brief Announcement: Energy Optimization of Memory Intensive Parallel Workloads
Minimizing Total Weighted Flow Time with Calibrations
Data management in hierarchical bus networks
The Expected Advantage of Asynchrony
Simple, Efficient Shared Memory Simulations
Using Speculative Retirement and Larger Instruction Windows to Narrow the Performance Gap Between Memory Consistency Models
Massively Parallel Algorithms for Distance Approximation and Spanners
A constant factor approximation algorithm for the storage allocation problem: extended abstract
Brief Announcement: Fine-Grained Computation in 3-Space: Matrix Multiplication, Paths, and Mazes
Parallel Working-Set Search Structures
Autonomous virtual mobile nodes
Minimizing peak energy on mesh-connected systems
Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Brief Announcement: Composable Dynamic Secure Emulation
Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms
Brief Announcement: A Parallel (Δ, Γ)-Stepping Algorithm for the Constrained Shortest Path Problem
Analysis of Free Schedule in Periodic Graphs
Optimal VLSI Architectures for Multidimensional DFT
Hand-Over-Hand Transactions with Precise Memory Reclamation
Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments
Rate vs. buffer size: greedy information gathering on the line
Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane
Finding strongly connected components in parallel using o (log 2 n ) reachability queries
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues
Generalized Sweep Methods for Parallel Computational Geometry
Scheduling Threads for Low Space Requirement and Good Locality
Compact routing with name independence