On the public citation graph

The Art of Multiprocessor Programming

https://doi.org/10.1016/c2011-0-06993-4

0 signed · 938 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.1083041openalex-extracted

Jconqurr - A Multi-Core Programming Toolkit For Java

inferred← citeshttps://doi.org/10.1002/cpe.3304openalex-snapshot

Software‐based contention management for efficient compare‐and‐swap operations

inferred← citeshttps://doi.org/10.1002/cpe.3876openalex-snapshot

A skip list for multicore

inferred← citeshttps://doi.org/10.1002/cpe.3928openalex-snapshot

Testing for linearizability

inferred← citeshttps://doi.org/10.1002/rsa.20341openalex-snapshot

Smoothed analysis of balancing networks

inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_185openalex-snapshot

Non-Blocking Algorithms

inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_35openalex-snapshot

Speculative Parallelization of Loops

inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_6openalex-snapshot

Programs, Semantics and Effective Atomicity

inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_18openalex-snapshot

A Characterization of t-Resilient Colorless Task Anonymous Solvability

inferred← citeshttps://doi.org/10.1007/978-3-030-05051-1_19openalex-snapshot

MedusaVM: Decentralizing Virtual Memory System for Multithreaded Applications on Many-core

inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_11openalex-snapshot

Efficient Means of Achieving Composability Using Object Based Semantics in Transactional Memory Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_21openalex-snapshot

Practically-Self-stabilizing Vector Clocks in the Absence of Execution Fairness

inferred← citeshttps://doi.org/10.1007/978-3-030-05807-4_13openalex-snapshot

Technique for Teaching Parallel Programming via Solving a Computational Electrodynamics Problems

inferred← citeshttps://doi.org/10.1007/978-3-030-21759-4_11openalex-snapshot

Correct and Efficient Antichain Algorithms for Refinement Checking

inferred← citeshttps://doi.org/10.1007/978-3-030-22496-7_2openalex-snapshot

Check-Wait-Pounce: Increasing Transactional Data Structure Throughput by Delaying Transactions

inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_30openalex-snapshot

Violat: Generating Tests of Observational Refinement for Concurrent Objects

inferred← citeshttps://doi.org/10.1007/978-3-030-29400-7_23openalex-snapshot

Scalable FIFO Channels for Programming via Communicating Sequential Processes

inferred← citeshttps://doi.org/10.1007/978-3-030-29852-4_1openalex-snapshot

Kent Beck or Pablo Picasso? Speculations of the Relationships Between Artists in Software and Painting

inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_13openalex-snapshot

Towards Synthesis of Distributed Algorithms with SMT Solvers

inferred← citeshttps://doi.org/10.1007/978-3-030-43229-4_33openalex-snapshot

SIMD-node Transformations for Non-blocking Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_13openalex-snapshot

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_17openalex-snapshot

Root Causing Linearizability Violations

inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_22openalex-snapshot

Weakening Correctness and Linearizability for Concurrent Objects on Multicore Processors

inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_17openalex-snapshot

Verification of a Generative Separation Kernel

inferred← citeshttps://doi.org/10.1007/978-3-030-59854-9_18openalex-snapshot

Entropy Measurement of Concurrent Disorder

inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_8openalex-snapshot

Concurrent Correctness in Vector Space

inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_20openalex-snapshot

Fully Anonymous Consensus and Set Agreement Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-030-69244-5_27openalex-snapshot

A Relaxed Balanced Lock-Free Binary Search Tree

inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_9openalex-snapshot

The Epigenetic Consensus Problem

inferred← citeshttps://doi.org/10.1007/978-3-030-85665-6_24openalex-snapshot

TSLQueue: An Efficient Lock-Free Design for Priority Queues

inferred← citeshttps://doi.org/10.1007/978-3-030-86359-3_28openalex-snapshot

Design and Implementation of Highly Scalable Quantifiable Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-030-86359-3_29openalex-snapshot

Optimal Concurrency for List-Based Sets

inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_3openalex-snapshot

The Fence Complexity of Persistent Sets

inferred← citeshttps://doi.org/10.1007/978-3-032-00828-2_18openalex-snapshot

Checking Linearizability of Multi-core Task Management and Scheduling System

inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_15openalex-snapshot

A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention

inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_15openalex-snapshot

Quiescent Consistency: Defining and Verifying Relaxed Linearizability

inferred← citeshttps://doi.org/10.1007/978-3-319-06773-5_39openalex-snapshot

Multi-Touch Gesture Recognition Using Feature Extraction

inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_41openalex-snapshot

LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes

inferred← citeshttps://doi.org/10.1007/978-3-319-09581-3_4openalex-snapshot

Disjoint-Access Parallelism Does Not Entail Scalability

inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_45openalex-snapshot

High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication

inferred← citeshttps://doi.org/10.1007/978-3-319-09967-5_4openalex-snapshot

Near Optimal Work-Stealing Tree Scheduler for Highly Irregular Data-Parallel Workloads

inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_15openalex-snapshot

Synthesis of Memory Fences via Refinement Propagation

inferred← citeshttps://doi.org/10.1007/978-3-319-11227-5_5openalex-snapshot

P-Skip Graph: An Efficient Data Structure for Peer-to-Peer Network

inferred← citeshttps://doi.org/10.1007/978-3-319-11454-5_10openalex-snapshot

Towards Transactional Memory for OpenMP

inferred← citeshttps://doi.org/10.1007/978-3-319-13186-3_44openalex-snapshot

A General Framework for Parallel Unary Operations on ZDDs

inferred← citeshttps://doi.org/10.1007/978-3-319-14325-5_17openalex-snapshot

Concurrent Data Structures in Architectures with Limited Shared Memory Support

inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_24openalex-snapshot

LCD: Local Combining on Demand

inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_25openalex-snapshot

ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List

inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_26openalex-snapshot

Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization

inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_29openalex-snapshot

On Developing Optimistic Transactional Lazy Set

inferred← citeshttps://doi.org/10.1007/978-3-319-14720-8_11openalex-snapshot

Proactive Contention Avoidance

inferred← citeshttps://doi.org/10.1007/978-3-319-14720-8_4openalex-snapshot

Disjoint-Access Parallelism in Software Transactional Memory

inferred← citeshttps://doi.org/10.1007/978-3-319-14720-8_7openalex-snapshot

Multi-versioning in Transactional Memory

inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_22openalex-snapshot

Admit Your Weakness: Verifying Correctness on TSO Architectures

inferred← citeshttps://doi.org/10.1007/978-3-319-17404-4_9openalex-snapshot

Combining Separation Logic and Projection Temporal Logic to Reason About Non-blocking Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_12openalex-snapshot

A Framework for Correctness Criteria on Weak Memory Models

inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_26openalex-snapshot

Automated and Modular Refinement Reasoning for Concurrent Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-21909-7_11openalex-snapshot

The Mathematical Model and the Problem of Optimal Partitioning of Shared Memory for Work-Stealing Deques

inferred← citeshttps://doi.org/10.1007/978-3-319-24012-1_10openalex-snapshot

Composable Memory Transactions for Java Using a Monadic Intermediate Language

inferred← citeshttps://doi.org/10.1007/978-3-319-24012-1_8openalex-snapshot

Deadlocks as Runtime Exceptions

inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_15openalex-snapshot

Data-Streaming and Concurrent Data-Object Co-design: Overview and Algorithmic Challenges

inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_20openalex-snapshot

Of Concurrent Data Structures and Iterations

inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_1openalex-snapshot

Communication Patterns and Input Patterns in Distributed Computing

inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_29openalex-snapshot

The Computability of Relaxed Data Structures: Queues and Stacks as Examples

inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_20openalex-snapshot

Quasi-Linearizability is Undecidable

inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_1openalex-snapshot

Scal: A Benchmarking Suite for Concurrent Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_17openalex-snapshot

Fisheye Consistency: Keeping Data in Synch in a Georeplicated World

inferred← citeshttps://doi.org/10.1007/978-3-319-27308-2_4openalex-snapshot

Parallel Computing vs. Distributed Computing: A Great Confusion? (Position Paper)

inferred← citeshttps://doi.org/10.1007/978-3-319-28034-9_6openalex-snapshot

A Wait-Free Stack

inferred← citeshttps://doi.org/10.1007/978-3-319-39570-8_2openalex-snapshot

Fencing Programs with Self-Invalidation and Self-Downgrade

inferred← citeshttps://doi.org/10.1007/978-3-319-41591-8_13openalex-snapshot

Model Checking Simulation Rules for Linearizability

inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_34openalex-snapshot

CBPQ: High Performance Lock-Free Priority Queue

inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_40openalex-snapshot

Multicore vs Manycore: The Energy Cost of Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-319-45279-1_8openalex-snapshot

Concurrent Hash Tables for Haskell

inferred← citeshttps://doi.org/10.1007/978-3-319-46140-3_12openalex-snapshot

Asynchronous Consensus with Bounded Memory

inferred← citeshttps://doi.org/10.1007/978-3-319-46140-3_8openalex-snapshot

Transactional Pointers: Experiences with HTM-Based Reference Counting in C++

inferred← citeshttps://doi.org/10.1007/978-3-319-46376-6_13openalex-snapshot

Mining for Functional Dependencies Using Shared Radix Trees in Many-Core Multi-Threaded Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-47677-3_3openalex-snapshot

Performance Evaluation of Concurrent Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-319-47846-3_17openalex-snapshot

Contextual Trace Refinement for Concurrent Objects: Safety and Progress

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_10openalex-snapshot

In the Search for Optimal Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_11openalex-snapshot

The F-Snapshot Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_9openalex-snapshot

Concurrent Use of Write-Once Memory

inferred← citeshttps://doi.org/10.1007/978-3-319-48869-1_9openalex-snapshot

Enabling Modular Verification with Abstract Interference Specifications for a Concurrent Queue

inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_26openalex-snapshot

A Generic Logic for Proving Linearizability

inferred← citeshttps://doi.org/10.1007/978-3-319-49583-5_4openalex-snapshot

A Portable Lock-Free Bounded Queue

inferred← citeshttps://doi.org/10.1007/978-3-319-51046-0_9openalex-snapshot

Analysing Lock-Free Linearizable Datatypes Using CSP

inferred← citeshttps://doi.org/10.1007/978-3-319-60588-3_8openalex-snapshot

Lock Elision for Protected Objects Using Intel Transactional Synchronization Extensions

inferred← citeshttps://doi.org/10.1007/978-3-319-61756-5_2openalex-snapshot

On the Design and Implementation of an Efficient Lock-Free Scheduler

inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_27openalex-snapshot

Starling: Lightweight Concurrency Verification with Views

inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_6openalex-snapshot

Compiling Parameterized X86-TSO Concurrent Programs to Cubicle- $$\mathcal {W}$$

inferred← citeshttps://doi.org/10.1007/978-3-319-70278-0_30openalex-snapshot

A Concurrent Perspective on Smart Contracts

inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_36openalex-snapshot

Modeling and Verifying Multi-core Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_14openalex-snapshot

Safety and Liveness of MCS Lock—Layer by Layer

inferred← citeshttps://doi.org/10.1007/978-3-319-71734-0_6openalex-snapshot

Dl-Check: Dynamic Potential Deadlock Detection Tool for Java Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-73305-0_2openalex-snapshot

Rewriting High-Level Spreadsheet Structures into Higher-Order Functional Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-73721-8_9openalex-snapshot

On abstraction and compositionality for weak-memory linearisability

inferred← citeshttps://doi.org/10.1007/978-3-319-77610-1_11openalex-snapshot

CaCAO: Complex and Compositional Atomic Operations for NoC-Based Manycore Platforms

inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_16openalex-snapshot

Fragment Abstraction for Concurrent Shape Analysis

inferred← citeshttps://doi.org/10.1007/978-3-319-90104-6_10openalex-snapshot

Implementing MapReduce with MSVL

inferred← citeshttps://doi.org/10.1007/978-3-319-92402-1_2openalex-snapshot

A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality

inferred← citeshttps://doi.org/10.1007/978-3-319-92432-8_4openalex-snapshot

Safe Non-blocking Synchronization in Ada2x

inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_11openalex-snapshot

Cubicle-$$\mathcal {W}$$: Parameterized Model Checking on Weak Memory

inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_33openalex-snapshot

Snapshot-Based Synchronization: A Fast Replacement for Hand-over-Hand Locking

inferred← citeshttps://doi.org/10.1007/978-3-319-98047-8_18openalex-snapshot

Reasoning About Weak Semantics via Strong Semantics

inferred← citeshttps://doi.org/10.1007/978-3-319-98938-9_7openalex-snapshot

Making Linearizability Compositional for Partially Ordered Executions

inferred← citeshttps://doi.org/10.1007/978-3-319-99933-3_7openalex-snapshot

Interleaving-Tree Based Fine-Grained Linearizability Fault Localization

inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_24openalex-snapshot

Hopscotch Hashing

inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_40openalex-snapshot

Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers

inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_19openalex-snapshot

Abstraction for Concurrent Objects

inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_27openalex-snapshot

A Basis for Verifying Multi-threaded Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_24openalex-snapshot

Integrity Protection for Revision Control

inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_39openalex-snapshot

Smoothed Analysis of Balancing Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_16openalex-snapshot

Help When Needed, But No More: Efficient Read/Write Partial Snapshot

inferred← citeshttps://doi.org/10.1007/978-3-642-10604-0_16openalex-snapshot

Distributed Agreement in Tile Self-assembly

inferred← citeshttps://doi.org/10.1007/978-3-642-10665-1_39openalex-snapshot

Task Parallel Scheduling over Multi-core System

inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_3openalex-snapshot

The Sketching Approach to Program Synthesis

inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_5openalex-snapshot

Abstract Transformers for Thread Correlation Analysis

inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_25openalex-snapshot

RGSep Action Inference

inferred← citeshttps://doi.org/10.1007/978-3-642-13550-7_15openalex-snapshot

AdaStreams: A Type-Based Programming Extension for Stream-Parallelism with Ada 2005

inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_40openalex-snapshot

Automatically Proving Linearizability

inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_41openalex-snapshot

Model Checking of Linearizability of Concurrent List Implementations

inferred← citeshttps://doi.org/10.1007/978-3-642-15291-7_16openalex-snapshot

Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_8openalex-snapshot

Scalable Flat-Combining Based Synchronous Queues

inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_7openalex-snapshot

Decision Procedures for the Temporal Verification of Concurrent Lists

inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_21openalex-snapshot

On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors

inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_29openalex-snapshot

Quasi-Linearizability: Relaxed Consistency for Improved Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_1openalex-snapshot

Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It

inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_10openalex-snapshot

Locality-Conscious Lock-Free Linked Lists

inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_13openalex-snapshot

Distributed Generalized Dynamic Barrier Synchronization

inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_25openalex-snapshot

A Theory of Skiplists with Applications to the Verification of Concurrent Datatypes

inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_36openalex-snapshot

Liveness-Preserving Atomicity Abstraction

inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_20openalex-snapshot

Quantitative Synthesis for Concurrent Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-23178-0_7openalex-snapshot

Looking for Efficient Implementations of Concurrent Objects

inferred← citeshttps://doi.org/10.1007/978-3-642-23397-5_14openalex-snapshot

A Generic Parallel Collection Framework

inferred← citeshttps://doi.org/10.1007/978-3-642-23397-5_15openalex-snapshot

Progress Guarantees When Composing Lock-Free Objects

inferred← citeshttps://doi.org/10.1007/978-3-642-23737-9_16openalex-snapshot

Processing (Multiple) Spatio-temporal Range Queries in Multicore Settings

inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_44openalex-snapshot

CAFÉ: Scalable Task Pools with Adjustable Fairness and Contention

inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_9openalex-snapshot

SMV: Selective Multi-Versioning STM

inferred← citeshttps://doi.org/10.1007/978-3-642-24541-1_33openalex-snapshot

On the Implementation of Concurrent Objects

inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_22openalex-snapshot

On the Nature of Progress

inferred← citeshttps://doi.org/10.1007/978-3-642-25929-6_18openalex-snapshot

A Parallel Compact Hash Table

inferred← citeshttps://doi.org/10.1007/978-3-642-30961-8_4openalex-snapshot

A Case for Including Transactions in OpenMP II: Hardware Transactional Memory

inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_19openalex-snapshot

Detecting Fair Non-termination in Multithreaded Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-31759-0_15openalex-snapshot

Parameterized Model Checking of Fine Grained Concurrency

inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_19openalex-snapshot

Linearizability with Ownership Transfer

inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_21openalex-snapshot

Intensional and Extensional Characterisation of Global Progress in the π-Calculus

inferred← citeshttps://doi.org/10.1007/978-3-642-33078-0_20openalex-snapshot

Performance, Scalability, and Semantics of Concurrent FIFO Queues

inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_19openalex-snapshot

RMR-Efficient Randomized Abortable Mutual Exclusion

inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_23openalex-snapshot

Wait-Free Linked-Lists

inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_25openalex-snapshot

Linear Space Bootstrap Communication Schemes

inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_29openalex-snapshot

Weak Read/Write Registers

inferred← citeshttps://doi.org/10.1007/978-3-642-36036-7_11openalex-snapshot

Lock-Free Resizeable Concurrent Tries

inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_11openalex-snapshot

Modular Reasoning about Separation of Concurrent Data Structures

inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_29openalex-snapshot

Checking and Enforcing Robustness against TSO

inferred← citeshttps://doi.org/10.1007/978-3-642-37658-0_11openalex-snapshot

FlowPools: A Lock-Free Deterministic Concurrent Dataflow Abstraction

inferred← citeshttps://doi.org/10.1007/978-3-642-38088-4_15openalex-snapshot

Formal Analysis of GPU Programs with Atomics via Conflict-Directed Delay-Bounding

inferred← citeshttps://doi.org/10.1007/978-3-642-38493-6_12openalex-snapshot

ByteSTM: Virtual Machine-Level Java Software Transactional Memory

inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_20openalex-snapshot

Model Checking Unbounded Concurrent Lists

inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_3openalex-snapshot

Verifying a Quantitative Relaxation of Linearizability via Refinement

inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_25openalex-snapshot

A Contention-Friendly Binary Search Tree

inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_60openalex-snapshot

Lightweight Contention Management for Efficient Compare-and-Swap Operations

inferred← citeshttps://doi.org/10.1007/978-3-642-40148-0_3openalex-snapshot

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|

inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_16openalex-snapshot

An Epistemic Perspective on Consistency of Concurrent Computations

inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_17openalex-snapshot

Characterizing Progress Properties of Concurrent Objects via Contextual Refinements

inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_18openalex-snapshot

Aspect-Oriented Linearizability Proofs

inferred← citeshttps://doi.org/10.1007/978-3-642-40511-2_9openalex-snapshot

Extracting Correlated Patterns on Multicore Architectures

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_11openalex-snapshot

Practical Parallel Nesting for Software Transactional Memory

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_16openalex-snapshot

Lock-Free Data-Structure Iterators

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_17openalex-snapshot

Practical Non-blocking Unordered Lists

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_8openalex-snapshot

Proving Non-opacity

inferred← citeshttps://doi.org/10.1007/978-3-642-45340-3_5openalex-snapshot

Towards Efficient Abstractions for Concurrent Consensus

inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_16openalex-snapshot

Communicating State Transition Systems for Fine-Grained Concurrent Resources

inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_9openalex-snapshot

Impredicative Concurrent Abstract Predicates

inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_14openalex-snapshot

What Can be Computed in a Distributed System?

inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_19openalex-snapshot

Between Linearizability and Quiescent Consistency

inferred← citeshttps://doi.org/10.1007/978-3-662-44202-9_8openalex-snapshot

Reusable Concurrent Data Types

inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_14openalex-snapshot

Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity

inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_1openalex-snapshot

Concurrent Systems: Hybrid Object Implementations and Abortable Objects

inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_14openalex-snapshot

Why Non-blocking Operations Should be Selfish

inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_21openalex-snapshot

Amalgamated Lock-Elision

inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_22openalex-snapshot

Transactional Interference-Less Balanced Tree

inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_28openalex-snapshot

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks

inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_14openalex-snapshot

The Read/Write Protocol Complex Is Collapsible

inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_4openalex-snapshot

Automated Verification of Linearization Policies

inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_23openalex-snapshot

Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model

inferred← citeshttps://doi.org/10.1007/978-981-10-3005-5_28openalex-snapshot

Parallel Randomized Block Coordinate Descent for Neural Probabilistic Language Model with High-Dimensional Output Targets

inferred← citeshttps://doi.org/10.1007/978-981-16-1927-4_6openalex-snapshot

CCLearner: Clone Detection via Deep Learning

inferred← citeshttps://doi.org/10.1007/bf03342023openalex-snapshot

Parallelization Strategies to Speed-Up Computations for Terrain Analysis on Multi-Core Processors

inferred← citeshttps://doi.org/10.1007/s00165-009-0141-8openalex-snapshot

Inter-process buffers in separation logic with rely-guarantee

inferred← citeshttps://doi.org/10.1007/s00165-011-0219-yopenalex-snapshot

Starvation-free mutual exclusion with semaphores

inferred← citeshttps://doi.org/10.1007/s00165-017-0418-2openalex-snapshot

Relating trace refinement and linearizability

inferred← citeshttps://doi.org/10.1007/s00165-019-00483-2openalex-snapshot

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

inferred← citeshttps://doi.org/10.1007/s00165-019-00499-8openalex-snapshot

Linearizability on hardware weak memory models

inferred← citeshttps://doi.org/10.1007/s00180-022-01223-6openalex-snapshot

Adaptive smoothing spline estimator for the function-on-function linear regression model

inferred← citeshttps://doi.org/10.1007/s00224-010-9304-5openalex-snapshot

Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory

inferred← citeshttps://doi.org/10.1007/s00236-011-0132-0openalex-snapshot

Nonatomic dual bakery algorithm with bounded tokens

inferred← citeshttps://doi.org/10.1007/s00236-013-0178-2openalex-snapshot

Verifying a simplification of mutual exclusion by Lycklama–Hadzilacos

inferred← citeshttps://doi.org/10.1007/s00236-015-0222-5openalex-snapshot

Parametrized invariance for infinite state processes

inferred← citeshttps://doi.org/10.1007/s00354-019-00073-zopenalex-snapshot

Concurrent Treaps and Impact of Locking Objects

inferred← citeshttps://doi.org/10.1007/s00446-009-0087-3openalex-snapshot

The impact of randomization in smoothing networks

showing the first 200 of 938 · page through all 938

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.