Efficiency of Equivalence Algorithms

DOI10.1007/978-1-4684-2001-2_14MaRDI QIDQ4999430zbMATH OpenOpenAlexFDO

Authors Michael Fischer

Publication date 6 July 2021

Published in Complexity of Computer Computations (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/6201

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Cited in

(10)

• Testing flow graph reducibility
• A new data structure for the UNION-FIND problem
• Concurrent disjoint set union
• A tight lower bound for top-down skew heaps
• On the complexity of stream equality
• Similarity-Based Equality with Lazy Evaluation
• scientific article; zbMATH DE number 6169004 (Why is no real title available?)
• Efficiency of linked cell algorithms
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Complexity of algorithm and operations on trees

This page was built for publication: Efficiency of Equivalence Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999430)