yusuke1997/dblp-id-title huggingface dataset:
Parallelizing time with polynomial circuits
AT 2 Bounds for a Class of VLSI Problems and String Matching
Algorithms for fault-tolerant routing in circuit switched networks
Balls-into-bins with nearly optimal load distribution
The Processing-in-Memory Model
Optimal Virtual Network Embeddings for Tree Topologies
A DoS-resilient information system for dynamic data management
Consistent and compact data management in distributed storage systems
Approximation algorithms for time-constrained scheduling on line networks
A Deterministic Work-Depth Tradeoff for Strongly Connected Components
A Contraction Procedure for Planar Directed Graphs
How "Hard" is Thread Partitioning and How "Bad" is a List Scheduling Based Partitioning Algorithm?
Brief announcement: RedRem: a parallel redundancy remover
Finding strongly connected components in parallel in particle transport sweeps
Efficient galois field arithmetic on SIMD architectures
A general compiler framework for speculative multithreading
On the truthfulness and the approximation for scheduling selfish tasks
Parallel Graph Contraction
Brief announcement: large-scale multimaps
Impact of Knowledge on Election Time in Anonymous Networks
VLSI layout of trees into grids of minimum width
Thread Partitioning and Scheduling Based on Cost Model
Reconstructing Binary Trees in Parallel
Large-Scale Sorting in Parallel Memories (Extended Abstract)
Blocking in Parallel Multisearch Problems (Extended Abstract)
More Time-Work Tradeoffs for Parallel Graph Algorithms
Parallel Memory-Independent Communication Bounds for SYRK
Name independent routing for growth bounded networks
Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract)
Broadcast scheduling optimization for heterogeneous cluster systems
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing
Online Load and Graph Balancing for Random Order Inputs
Competitive non-migratory scheduling for flow time and energy
Balanced Routing: Towards the Distance Bound on Grids
An Adversarial Model for Distributed Dynamic Load Balancing
Asynchronous Shared Memory Parallel Computation
Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, June 17-21, 2024
Modeling Communication in Parallel Algorithms: A Fruitful Interaction Between Theory and Systems?
Rapid prototyping methodology for multi-DSP TI C6X platforms applied to an Mpeg-2 coding application
Ordering heuristics for parallel graph coloring
Locality-preserving randomized oblivious routing on torus networks
Parallel Minimum Cuts in Near-linear Work and Low Depth
A study of transactional memory vs. locks in practice
An Optimal Parallel Dictionary
Irrigating ad hoc networks in constant time
Run-Time Parallelization and Scheduling of Loops
SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022
On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros
Connected Components in Linear Work and Near-Optimal Time
Optimal tiling for the RNA base pairing problem
Balanced Partitioning of Several Cache-Oblivious Algorithms
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Library support for orthogonal processor groups
Brief Announcement: Nested Active-Time Scheduling
Cost-Bandwidth Tradeoffs for Communication Networks
Optimizing transactions for captured memory
Parallel Construction of Trees with Optimal Weighted Path Length
Brief Announcement: Extending Transactional Memory with Atomic Deferral
SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021
Separator Based Parallel Divide and Conquer in Computational Geometry
Balancing Flow Time and Energy Consumption
Deadlock avoidance for streaming computations with filtering
Applying Hazard Pointers to More Concurrent Data Structures
Parallel and (Nearly) Work-Efficient Dynamic Programming
Expediting Hazard Pointers with Bounded RCU Critical Sections
Contention Resolution for Coded Radio Networks
Provably-Efficient and Internally-Deterministic Parallel Union-Find
Massively Parallel Algorithms for Approximate Shortest Paths
Finding effective support-tree preconditioners
Finding similar users in social networks: extended abstract
Sequential consistency as lazy linearizability
Leveraging non-blocking collective communication in high-performance applications
Fast and Robust Memory Reclamation for Concurrent Data Structures
On the Benefit of Supporting Virtual Channels in Wormhole Routers
A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut
Better Trade-Offs for Parallel List Ranking
The Communication Complexity of Several Problems in Matrix Computation
Maximising lifetime for fault-tolerant target coverage in sensor networks
Massive-scale Streaming Analytics: Models, Parallelism, & Real-world Applications
Simple Path Selection for Optimal Routing on Processor Arrays
The Cilkprof Scalability Profiler
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem
The load rebalancing problem
Optimal prefetching and caching for parallel I/O systems
Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks
Delegation and nesting in best-effort hardware transactional memory
Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout
Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations
Parallel scheduling of complex dags under uncertainty
Romulus: Efficient Algorithms for Persistent Transactional Memory
DCAS is not a silver bullet for nonblocking algorithm design
Lock-free Contention Adapting Search Trees
An Analysis of Gang Scheduling for Multiprogrammed Parallel Computing Environments
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times
A Localized Algorithm for Parallel Association Mining
Brief announcement: universally truthful secondary spectrum auctions
On local algorithms for topology control and routing in ad hoc networks
Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library
Persistent Atomics for Implementing Durable Lock-Free Data Structures for Non-Volatile Memory (Brief Announcement)
Optimal semi-oblique tiling
Speed scaling on parallel processors
Brief Announcement: Optimality Conditions for Parallel Communication-Avoiding Matrix Multiplication with Overlapped Communication
Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory
Semi-oblivious routing
RUBIC: Online Parallelism Tuning for Co-located Transactional Memory Applications
Online hierarchical cooperative caching
Chip-level integration: the new frontier for microprocessor architecture
Average Case Analysis of Greedy Routing algorithms on Arrays
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs
Understanding bloom filter intersection for lazy address-set disambiguation
Brief Announcement: Accelerating Distributed Search System with In-network Computation
A local O(n 2 ) gathering algorithm
A Dynamic Load Balancing Framework for Unstructured Adaptive Computations on Distributed-Memory Multiprocessors
Brief announcement: a game-theoretic model motivated by the darpa network challenge
Inherent limitations on disjoint-access parallel implementations of transactional memory
Approximate Algorithms Scheduling Parallelizable Tasks
Wireless Expanders
Irrevocable transactions and their applications
Constructing Arrangements Optimally in Parallel (Preliminary Version)
Information gathering in adversarial systems: lines and cycles
The Recoverable Consensus Hierarchy
Peer-to-peer networks based on random transformations of connected regular undirected graphs
Scheduling Flows on a Switch to Optimize Response Times
Components of Congestion Control
The life and times of a zookeeper
Brief announcement: paging for multicore processors
Experience in Massively Parallel Discrete Event Simulation
Emerging challenges and opportunities in parallel computing: the cretaceous redux?
Multidimensional, Multiprocessor, Out-of-Core FFTs
Network Partitioning and Avoidable Contention
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract
Balls into bins with related random choices
Optimal Broadcast and Summation in the LogP Model
Comparing the effectiveness of fine-grain memory caching against page migration/replication in reducing traffic in DSM clusters
Spectral Lower Bounds on the I/O Complexity of Computation Graphs
An Approach to Emulating Separable Graphs (preliminary Version)
Dynamic Parallel Tree Contraction (Extended Abstract)
Hierarchical graph partitioning
FLIP-FLOP: A Stack-Oriented Multiprocessing System
Dataflow-Specific Algorithms for Resource-Constrained Scheduling and Memory Design
A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems
A work-optimal CGM algorithm for the LIS problem
On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors
A 2 n -2 Step Algorithm for Routing in an nxn Array with Constant Size Queues
Heuristics for semi-external depth first search on directed graphs
Matching the Bisection Bound for Routing and Sorting on the Mesh
Randomization does not reduce the average delay in parallel packet switches
Hemlock: Compact and Scalable Mutual Exclusion
Approximation algorithms for multiprocessor scheduling under uncertainty
Maintaining Dynamic Ordered Sets on Processor Networks
Location-based memory fences
In search of parallel dimensions
Automatic complexity analysis of explicitly parallel programs
Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems
Minimizing total flow time and total completion time with immediate dispatching
Local Memory Requirement of Universal Routing Schemes
A Scalable Concurrent Algorithm for Dynamic Connectivity
Worst-case traffic for oblivious routing functions
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems
The Online Multi-Commodity Facility Location Problem
Communication in wireless networks with directional antennas
Field-split parallel architecture for high performance multi-match packet classification using FPGAs
A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster
Parallel approximation algorithms for facility-location problems
Universality of Iterated Networks
Basic network creation games
Architectural Support for the Efficient Data-Driven Evaluation Scheme
Better Bounds for Coalescing-Branching Random Walks
VLSI layout and packaging of butterfly networks
Modeling instruction placement on a spatial architecture
The Mobile Server Problem
MAPO: using a committee of algorithm-experts for parallel optimization of costly functions
Scheduling Cilk multithreaded parallel programs on processors of different speeds
Branch-Avoiding Graph Algorithms
Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Preliminary Version)
The Price of Bounded Preemption
Parallel Dynamic Maximal Matching
A practical algorithm for constructing oblivious routing schemes
Time complexity of practical parallel steiner point insertion algorithms
The expansion and mixing time of skip graphs with applications
Sequential Consistency Versus Linearizability (Extended Abstract)
Work dealing
Brief announcement: communication bounds for heterogeneous architectures
Improved combination of online algorithms for acceptance and rejection
Two techniques for reconciling algorithm parallelism with memory constraints
Fast Stencil Computations using Fast Fourier Transforms
Constant density spanners for wireless ad-hoc networks
Exploiting flexibly assignable work to improve load balance
Brief announcement: persistent unfairness arising from cache residency imbalance
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible
Myths and Misconceptions about Threads
Stabilizing consensus with the power of two choices
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier
Communication-Processor Tradeoffs in Limited Resources PRAM
Some Sequential Algorithms are Almost Always Parallel
Faster Matrix Multiplication via Sparse Decomposition
Brief Announcement: Work Stealing through Partial Asynchronous Delegation
Scalable Operating Systems, or What Do a Million Processors Mean?
Allocating Weighted Jobs in Parallel
On the communication complexity of randomized broadcasting in random-like graphs
Energy-optimal distributed algorithms for minimum spanning trees
Graph expansion and communication costs of fast matrix multiplication: regular submission
Implementing and evaluating nested parallel transactions in software transactional memory
Brief announcement: application-sensitive QoS scheduling in storage servers
On the Capabilities of Systolic Systems (Extended Abstract)
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]
On space-stretch trade-offs: lower bounds
Towards practical deteministic write-all algorithms
A (3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks
Performance Analysis and Modelling of Concurrent Multi-access Data Structures
Safe open-nested transactions through ownership
Compact routing schemes
Time-based transactional memory with scalable time bases
Õ(congestion + dilation) hot-potato routing on leveled networks
An Optical Simulation of Shared Memory
Optimal Dynamic Scheduling of Task Tree on Constant-Dimensional Architectures
Automatic data partitioning in software transactional memories
In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version)
Multidimensional Approximate Agreement with Asynchronous Fallback
Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership
Efficient Parallel Reinforcement Learning Framework Using the Reactor Model
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting
Brief Announcement: Communication in Systems of Home Based Mobile Agents
Green Paging and Parallel Paging
Proximity-aware directory-based coherence for multi-core processor architectures
Robust Bounded-Degree Networks with Small Diameters
Scheduling Jobs with Work-Inefficient Parallel Solutions
Brief announcement: cache-oblivious scheduling of streaming pipelines
Scalable Hardware and Scalable Software : The nCUBE System
Optimal On-Line Load Balancing
Non-Linear Ski Rental
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds
Non-clairvoyant weighted flow time scheduling with rejection penalty
Asynchronous parallel disk sorting
A Massively Parallel Algorithm for Minimum Weight Vertex Cover
Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory
The Power of Parallel Pointer Manipulation
Compact, adaptive placement schemes for non-uniform requirements
I/O-efficient topological sorting of planar DAGs
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs
Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints
Sparse Spanners with Small Distance and Congestion Stretches
Brief announcement: full reversal routing as a linear dynamical system
wCQ: A Fast Wait-Free Queue with Bounded Memory Usage
Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)
Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract)
Efficient algorithms for verifying memory consistency
Locally scalable randomized consensus for synchronous crash failures
Fast greedy algorithms in mapreduce and streaming
Fault-Tolerant Meshes with Small Degree
An efficient self-simulation algorithm for reconfigurable meshes
Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2
Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition
Polylogarithmic network navigability using compact metrics with small stretch
Flexible Usage of Parity Storage Space in Disk Arrays
Balanced Allocations in Batches: Simplified and Generalized
Improved Parallel Algorithms for Spanners and Hopsets
Optimal Replacements in Caches with Two Miss Costs
Scheduling Parallelizable Tasks to Minimize Average Response Time
Understanding Retiming Through Maximum Average-Weight Cycles
A simple and practical linear-work parallel algorithm for connectivity
On the Analysis of Randomized Load Balancing Schemes
Lower bounds for restricted-use objects: extended abstract
Near Optimal Coflow Scheduling in Networks
High-performance RMA-based broadcast on the intel SCC
Formal Machine-Verification of MemSnap: An Efficient, Far-Future Linearizable Snapshot Algorithm
Data Oblivious Algorithms for Multicores
On Computational Thinking, Inferential Thinking and Data Science
Novel architectures for P2P applications: the continuous-discrete approach
The Parallel Persistent Memory Model
Coalescing-branching random walks on graphs
On the Slowdown of Efficient Simulations of Multibutterflies on Butterflies and Butterfly-Derived Networks
Approximation Hardness of Resource Scheduling
Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations
Scheduling irregular parallel computations on hierarchical caches
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms
Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation
ALock: Asymmetric Lock Primitive for RDMA Systems
Brief announcement: queue delegation locking
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays
Analysis of link reversal routing algorithms for mobile ad hoc networks
A framework for boosting matching approximation: parallel, distributed, and dynamic
Traffic engineering of management flows by link augmentations on confluent trees
Lower Bounds for Graph Embeddings via Algebraic Topology
Bicriteria Distributed Submodular Maximization in a Few Rounds
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '94, Cape May, New Jersey, USA, June 27-29, 1994
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Communication optimal parallel multiplication of sparse random matrices
An implementation report for parallel triangular decompositions
Efficient Concurrent Range Queries in B+-trees using RCU-HTM
Distributed Detection of Cycles
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
Four Shades of Deterministic Leader Election in Anonymous Networks
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
Design and Performance of Multipath MIN Architectures
New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies
Simple on-line algorithms for the maximum disjoint paths problem
Supermatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures
Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies
2d-Bubblesorting in Average time O(N lg N)
Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks
Remote storage with byzantine servers
Tight bounds for anonymous adopt-commit objects
Greedy and Local Ratio Algorithms in the MapReduce Model
Minimizing Processor Count for Fault Tolerant Toom-Cook Algorithms
Dynamic analysis of the arrow distributed protocol
Integrated Model, Batch, and Domain Parallelism in Training Neural Networks
A Practical Solution to the Cactus Stack Problem
Ephemeral networks with random availability of links: diameter and connectivity
A Randomized Parallel Algorithm for Planar Graph Isomorphism
Asynchronous scheduling of redundant disk arrays
Parallel peeling algorithms
A performance analysis of local synchronization
A Practical Constructive Scheme for Deterministic Shared-Memory Access
Are Parallel Algorithms Ready for Prime Time?
Optimal fault-tolerant linear arrays
25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013
Three-Dimensional Pattern Matching
Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
A Study of Synchronization Methods for Concurrent Size
Improving software concurrency with hardware-assisted memory snapshot
Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
Efficient Compilation of High-Level Data Parallel Algorithms
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, SPAA '89, Santa Fe, New Mexico, USA, June 18-21, 1989
Lower Bounds in the Asymmetric External Memory Model
Giving Future(s) to Transactional Memory
On dynamic bin packing for resource allocation in the cloud
Non-monetary fair scheduling: a cooperative game theory approach
Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
A Simple and Efficient Parallel Laplacian Solver
Investigating the Performance of Hardware Transactions on a Multi-Socket Machine
On characterizing the data movement complexity of computational DAGs for parallel execution
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels
Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud
On the Hardness of Red-Blue Pebble Games
Connected Components and the Interval Graph
Operational analysis of processor speed scaling
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths
Optimal Sorting on Mesh-Connected Processor Arrays
Efficient orchestration of sub-word parallelism in media processors
Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks
Re-Chord: a self-stabilizing chord overlay network
Universal Shape Formation for Programmable Matter
Against lock-based semantics for transactional memory
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs
Brief announcement: faster 3-periodic merging networks
Dispersion is (Almost) Optimal under (A)synchrony
Finding approximate partitions and splitters in external memory
Nonblocking k-compare-single-swap
Deterministic load balancing and dictionaries in the parallel disk model
Four Vector-Matrix Primitives
Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version)
Simple Competitive Request Scheduling Strategies
Utilizing shared data in chip multiprocessors with the nahalal architecture
Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
Simple dynamics for plurality consensus
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
ThreadScan: Automatic and Scalable Memory Reclamation
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design
Truthful unsplittable flow for large capacity networks
On dynamics in selfish network creation
Fully Dynamic Search Trees for an Extension of the BSP Model
Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications
Online Facility Location with Mobile Facilities
An optimal local approximation algorithm for max-min linear programs
Computational power of pipelined memory hierarchies
Smooth scheduling under variable rates or the analog-digital confinement game
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
Specifying Non-Blocking Shared Memories (Extended Abstract)
Simple efficient load balancing algorithms for peer-to-peer systems
Brief Announcement: Accelerate CNN Inference with Zoning Graph at Dynamic Granularity
Worst case mobility in ad hoc networks
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
Parallel Algorithms for Asymmetric Read-Write Costs