yusuke1997/dblp-id-title huggingface dataset:
String Matching with Wildcards in the Massively Parallel Computation Model
Expansion properties of (secure) wireless networks
Brief announcement: the problem based benchmark suite
Race Detection in Two Dimensions
The Append Memory Model: Why BlockDAGs Excel Blockchains
Computational Bounds for Fundamental Problems on General-Purpose Parallel Models
Matrix Multiplication I/O-Complexity by Path Routing
Automatable verification of sequential consistency
Sorting and Counting Networks of Small Depth and Arbitrary Width
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications
Randomized k-set agreement
Cache-conscious scheduling of streaming applications
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack
Non-preemptive Throughput Maximization under Time-varying Capacity
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs
SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006
Memory models: a case for rethinking parallel languages and hardware
Adaptive integration of hardware and software lock elision techniques
Writeback-Aware Caching (Brief Announcement)
Optimal Parallel Two Dimensional Pattern Matching
Space and Time Efficient Implementations of Parallel Nested Dissection
SIMD Instruction Cache
Cache-Adaptive Analysis
Packet-mode emulation of output-queued switches
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals
Efficient Access History for Race Detection
A Quantitative Comparison of Parallel Computation Models
The S3.mp Architecture: A Local Area Multiprocessor
On distributed smooth scheduling
Brief announcement: set it and forget it - approximating the set once strip cover problem
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
PC-oriented Prediction-based Runtime Power Management for GPGPU using Knowledge Transfer
Brief announcement: few buffers, many hot spots, and no tree saturation (with high probability)
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
Work-stealing for mixed-mode parallelism by deterministic team-building
The effect of faults on network expansion
Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract)
Brief announcement: between all and nothing - versatile aborts in hardware transactional memory
Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time
Efficient Multi-Processor Scheduling in Increasingly Realistic Models
Scalable reader-writer locks
Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
Elimination Trees and the Construction of Pools and Stacks (Preliminary Version)
A 3D Parallel Algorithm for QR Decomposition
Brief Announcement: Parallel Transitive Closure Within 3D Crosspoint Memory
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Delays induce an exponential memory gap for rendezvous in trees
Fast Dynamic Programming in Trees in the MPC Model
Connected Components on a PRAM in Log Diameter Time
Priority Scheduling for Interactive Applications
Coloring Fast with Broadcasts
Hardness and Tight Approximations of Demand Strip Packing
Communication vs Synchronisation in Parallel String Comparison
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem
µDatabase: Parallelism in a Memory-Mapped Environment
A scalable lock-free stack algorithm
On Multiprocessor System Scheduling
Capture of an intruder by mobile agents
Cache-efficient dynamic programming algorithms for multicores
Towards Efficiency and Portability: Programming with the BSP Model
Sharing the cost of multicast transmissions in wireless networks
Some Compact Layouts of the Butterfly
Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008
Applying Fast Fourier Transforms to Accelerate Spatially and Temporally Inhomogeneous Stencil Computations
Contention Resolution with Message Deadlines
Parallel depth first vs. work stealing schedulers on CMP architectures
Effectively sharing a cache among threads
Analyses of Load Stealing Models Based on Differential Equations
Finding heavy distinct hitters in data streams
Symmetric network computation
Cycle stealing under immediate dispatch task assignment
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff
Brief announcement: on speculative replication of transactional systems
A universal construction for wait-free transaction friendly data structures
The Power of Migration in Online Machine Minimization
Parallel Continuous Randomized Load Balancing (Extended Abstract)
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '97, Newport, RI, USA, June 23-25, 1997
Provable Advantages for Graph Algorithms in Spiking Neural Networks
Efficient Synchronization-Light Work Stealing
Impossibility Results for Asynchronous PRAM (Extended Abstract)
From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum
Efficiency and Stability in Euclidean Network Design
Embedding of d -Dimensional Grids into Optimal Hypercubes
System Area Network Mapping
Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers
Combinable memory-block transactions
Parallel Algorithms for the Circuit Value Update Problem
Partial snapshot objects
Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines
A Lower Bound on the Size of Shellsort Networks
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
Tight Bounds for Clairvoyant Dynamic Bin Packing
Keynote Talk: Algorithm Improvement: How Fast Has It Been and How Much Farther Can It Go?
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017
Collaborative scoring with dishonest participants
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Brief Announcement: Load Balancing with Duration Predictions
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation
Efficient Detection of Determinacy Races in Cilk Programs
Local strategies for maintaining a chain of relay stations between an explorer and a base station
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
The Efficiency of Greedy Routing in Hypercubes and Butterflies
An empirical study to compare two parallel programming models
Implementing the Multiprefix Operation on Parallel and Vector Computers
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation
Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
Parallel Sorting with Limited Bandwidth
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Brief Announcement: A Greedy 2 Approximation for the Active Time Problem
Parallelism versus memory allocation in pipelined router forwarding engines
Optimal Cooperative Search in Fractional Cascaded Data Structures
Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and Write
Better Deterministic Online Packet Routing on Grids
Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors
Anticipatory Instruction Scheduling
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures
Two processor scheduling with real release times and deadlines
General Profit Scheduling and the Power of Migration on Heterogeneous Machines
The impact of the power law exponent on the behavior of a dynamic epidemic type process
Parallel Algorithms for Arrangements
Brief Announcement: Spatial Locality and Granularity Change in Caching
Brief announcement: a lower bound for depth-restricted work stealing
A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs
Conflict-free coloring for rectangle ranges using O ( n .382 ) colors
Efficient Disk Allocation for Fast Similarity Searching
Scheduling reductions on realistic machines
Lower Bounds for Parallel Computation on Linked Structures
Primitives for Asynchronous List Compression
Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages
Diffracting Trees (Preliminary Version)
TCP is competitive against a limited adversary
Asymptotically Optimal Gathering on a Grid
(Near) optimal resource-competitive broadcast with jamming
Verification of FLASH Cache Coherence Protocol by Aggregation of Distributed Transactions
Quadratic Speedups in Parallel Sampling from Determinantal Distributions
Scheduling best-effort and real-time pipelined applications on time-shared clusters
The cache complexity of multithreaded cache oblivious algorithms
Using "Test Model-Checking" to Verify the Runway-PA8000 Memory Model
Vector Prefix Addition on Sub-Bus Mesh Computers
Eliminating Bank Conflicts in GPU Mergesort
Seer: Probabilistic Scheduling for Hardware Transactional Memory
Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows
A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers
Object location in realistic networks
Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization
A Closer Look at Quantum Distributed Consensus
Almost Universal Anonymous Rendezvous in the Plane
Brief Announcement: Lock-free Learned Search Data Structure
Packet-mode policies for input-queued switches
Low Contention Load Balancing on Large-Scale Multiprocessors
A forward planning situated protocol for data propagation in wireless sensor networks based on swarm intelligence techniques
BOS is Boss: A Case for Bulk-Synchronous Object Systems
A Parallel Algorithm for Subgraph Isomorphism (Brief Announcement)
Distributed Domination on Graph Classes of Bounded Expansion
Coloring unstructured radio networks
Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract)
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates
Laika: Efficient In-Place Scheduling for 3D Mesh Graph Computations
Preparing for Disaster: Leveraging Precomputation to Efficiently Repair Graph Structures Upon Failures
Weak graph colorings: distributed algorithms and applications
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
An Atomic Model for Message-Passing
PIM-trie: A Skew-resistant Trie for Processing-in-Memory
Non-Clairvoyant Scheduling with Predictions
Towards a Complexity Theory for the Congested Clique
Distributed Load Balancing in the Face of Reappearance Dependencies
Online algorithms for network design
On the bit communication complexity of randomized rumor spreading
Simple parallel and distributed algorithms for spectral graph sparsification
What can be approximated locally?: case study: dominating sets in planar graphs
Gradient clock synchronization in dynamic networks
The Performance of Simple Routing Algorithms That Drop Packets
Convergence to equilibrium of logit dynamics for strategic games
CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor Search
Selfish routing with incomplete information
Almost Optimal Streaming Algorithms for Coverage Problems
Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)
Scheduling on hierarchical clusters using malleable tasks
A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks
Efficient Optical Communication in Parallel Computers
Brief announcement: reclaiming the energy of a schedule, models and algorithms
Promoting cooperation in selfish grids
Optimal sparse matrix dense vector multiplication in the I/O-model
Communication-optimal parallel algorithm for strassen's matrix multiplication
Randomized Incremental Convex Hull is Highly Parallel
A Steady State Analysis of Diffracting Trees (Extended Abstract)
Brief announcement: amoebot - a new model for programmable matter
Parallel Longest Increasing Subsequence and van Emde Boas Trees
Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only)
Online multicast with egalitarian cost sharing
Improved approximation algorithms for the freeze-tag problem
Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling
Tradeoffs Between Parallelism and Fill in Nested Dissection
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees
Brief Announcement: Stochastic Parallel Scheduling with Bandit Feedback
Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract)
Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem
Cache-oblivious streaming B-trees
Brief Announcement: Coloring-based Task Mapping for Dragonfly Systems
Min-Max Gathering of Oblivious Robots
On the Hardness of Massively Parallel Computation
Histogram Sort with Sampling
DCAS-based concurrent deques
Brief Announcement: Competitive Routing in Hybrid Communication Networks
Interprocessor communication with memory constraints
The car sharing problem
Executing dynamic data-graph computations deterministically using chromatic scheduling
On a bounded budget network creation game
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous
Scheduling to minimize gaps and power consumption
Fine-Grain Multithreading with the EM-X Multiprocessor
Competitively scheduling tasks with intermediate parallelizability
Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications
Optimal Routing of Parentheses on the Hypercube
Cost-Driven Data Replication with Predictions
Autonomous SIMD Flexibility in the MP-1 and MP-2
A Comparison of Sorting Algorithms for the Connection Machine CM-2
Parallel scheduling problems in next generation wireless networks
Optimal sharing of bags of tasks in heterogeneous clusters
Δ-Snap: Snapshotting the Differential
Parallelism in dynamic well-spaced point sets
Universal Congestion Control for Meshes
Fast and Resource Competitive Broadcast in Multi-channel Radio Networks
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs
A no-busy-wait balanced tree parallel algorithmic paradigm
Scalability and resource usage of an OLAP benchmark on clusters of PCs
Cloud scheduling with setup cost
Simple, Efficient Routing Schemes for All-Optical Networks
The Cilkview scalability analyzer
Linear-work greedy parallel approximate set cover and variants
Brief Announcement: Tight Bounds for Repeated Balls-into-Bins
The Impact of Partial Computations on the Red-Blue Pebble Game
Brief Announcement: LCTree: A Fast Hardware BVH Constructor for Real-Time Ray Tracing
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest
PRAM-on-chip: first commitment to silicon
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015
At-most-once semantics in asynchronous shared memory
A parallel buffer tree
High-Probability Parallel Transitive Closure Algorithms
A first insight into object-aware hardware transactional memory
An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance
Fractal communication in software data dependency graphs
Admission control to minimize rejections and online set cover with repetitions
Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary
O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work
Subset Barrier Synchronization on a Private-Memory Parallel System
Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions
High throughput, parallelized 128-bit AES encryption in a resource-limited FPGA
An Implementation of the epsilon-Relaxation Algorithm on the CM-5
Fault-Tolerant Parallel Integer Multiplication
Designing overlay multicast networks for streaming
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem
Oblivious routing on geometric networks
Asynchronous Parallel Algorithm for Mining Association Rules on a Shared-Memory MultiPprocessors
SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003)
Adaptive Deadlock- and Livelock-Free Routing with all Minimal Paths in Torus Networks
Deterministic Sorting and Randomized Median Finding on the BSP Model
Distributed Graph Clustering by Load Balancing
Brief announcement: combine -- an improved directory-based consistency protocol
Reduced hardware transactions: a new approach to hybrid transactional memory
Brief Announcement: Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation
On space-stretch trade-offs: upper bounds
The Power of Processor Consistency
Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths
Multicore Paging Algorithms Cannot Be Competitive
Nonblocking transactions without indirection using alert-on-update
Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters
Columnsort lives! an efficient out-of-core sorting program
Asynchronous Shared Memory Search Structures
Efficient on-line communication in cellular networks
Brief announcement: on regenerator placement problems in optical networks
Ultra-Fast Asynchronous Randomized Rumor Spreading (Brief Announcement)
Paging and the Address-Translation Problem
Fast Parallel Matching in Expander Graphs
On the Parallel Implementation of Goldberg's Maximum Flow Algorithm
HybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing Architectures
A New Algorithm for Online Scheduling of Rigid Task Graphs with Near-Optimal Competitive Ratio
Brief Announcement: Scalable Distributed String Sorting
Cost-Oblivious Reallocation for Scheduling and Planning
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
Parallel Balanced Allocations
Generalized connection caching
Predicate Detection to Solve Combinatorial Optimization Problems
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries
Optimizing hybrid transactional memory: the importance of nonspeculative operations
A Lazy Cache Algorithm
Generalised Multiprocessor Scheduling Using Optimal Control
Bounds on the Greedy Routing Algorithm for Array Networks
Transactions in the jungle
Data replication in p2p environments
Adversarial contention resolution for simple channels
A tight bound on online buffer management for two-port shared-memory switches
Efficient Memory Management for Lock-Free Data Structures with Optimistic Access
Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers
Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining
Efficient search in unstructured peer-to-peer networks
Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
Energy estimation of nested loop programs
Making Sparse Matrix Computations Scalable (Invited Talk Abstract)
Reducing contention through priority updates
Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs
First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (Extended Abstract)
Cache-oblivious shortest paths in graphs using buffer heap
On the Complexity of Load Balancing in Dynamic Networks
On avoiding spare aborts in transactional memory
Block-Granularity-Aware Caching
Low depth cache-oblivious algorithms
Randomized Composable Coresets for Matching and Vertex Cover
Storage and search in dynamic peer-to-peer networks
Brief Announcement: Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation
Robust and Probabilistic Failure-Aware Placement
Compact name-independent routing with minimum stretch
A lightweight in-place implementation for software thread-level speculation
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Parallel RAMs with Bounded Memory Wordsize
Thread Scheduling for Multiprogrammed Multiprocessors
Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks
Toward Self-Adjusting Networks for the Matching Model
Distributed and Parallel Computing Issues in Data Warehousing (Abstract)
Robust Algorithms for Packet Routing in a Mesh
Towards soft optimization techniques for parallel cognitive applications
Implementations of Randomized Sorting on Large Parallel Machines
On the Number of Rounds Necessary to Disseminate Information
Brief announcement: transaction polymorphism
Pipelining with Futures
Tree based MPLS routing
An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph
Feasibility of Cross-Chain Payment with Success Guarantees
Parallel Network Mapping Algorithms
How Much Can We Speedup Gaussian Elimination with Pivoting?
On the Parallel Complexity of Integer Programming
Communication Lower Bounds of Convolutions in CNNs
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Deterministic Leader Election in Anonymous Radio Networks
Architectural Primitives for a Scalable Shared Memory Multiprocessor
Improved approximations for multiprocessor scheduling under uncertainty
Approximation algorithms for data management in networks
Balanced Allocations in Batches: The Tower of Two Choices
Selecting Tile Shape for Minimal Execution Time
BSP vs LogP
The push tree problem
Parallel Least-Squares Solution of General and Toeplitz Systems
PHPRX: An Efficient Hash Table for Persistent Memory
Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC
A Library of Basic PRAM Algorithms and its Implementation in FORK
Brief Announcement: Suffix Analysis
Balanced allocations with heterogenous bins
Abstraction failures in concurrent programming
Scheduling Out-Trees Online to Optimize Maximum Flow
Best-effort group service in dynamic networks
Brief announcement: byzantine agreement with homonyms
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, Island of Crete, Greece, July 2-6, 1990
Parallel Algorithms for Summing Floating-Point Numbers
Space-Efficient Scheduling of Parallelism with Synchronization Variables
An Executable Specification, Analyzer and Verifier for RMO (Relaxed Memory Order)
Towards Understanding Exclusive Read
The Chaos Router: A Practical Application of Randomization in Network Routing
Bounded Memory in Distributed Networks
Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures
Matching Partition a Linked List and Its Optimization
Parallel Balanced Allocations: The Heavily Loaded Case
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data
The Revolution in Graph Theoretic Optimization Problems
Algorithmic foundations for a parallel vector access memory system
A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems
ABD-HFL: Byzantine-resistant Decentralized Hierarchical Federated Learning
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms
Utilizing Virtual Shared Memory in a Topology Independent, Multicomputer Environment