scientific article; zbMATH DE number 7650865

DOI10.4230/LIPICS.OPODIS.2019.15MaRDI QIDQ5874245

No author found.

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1911.06347

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

evaluationbenchmarksconcurrencyunion-findhardware transactional memory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (2)

Fast Evaluation of Union-Intersection Expressions ⋮ Logic Programming

Recommendations

• Unnamed Item 👍 👎
• A simple and efficient union-find-delete algorithm 👍 👎
• Work-efficient parallel union-find with applications to incremental graph connectivity 👍 👎
• Worst-case and amortised optimality in union-find (extended abstract) 👍 👎
• Union-Find with Constant Time Deletions 👍 👎
• Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR 👍 👎
• A Randomized Concurrent Algorithm for Disjoint Set Union 👍 👎
• Automata, Languages and Programming 👍 👎

This page was built for publication: