Available stabilizing heaps

DOI10.1016/S0020-0190(00)00208-8zbMath1003.68031OpenAlexW2015134090WikidataQ126789887 ScholiaQ126789887MaRDI QIDQ1607089

Ted Herman, Toshimitsu Masuzawa

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00208-8

zbMATH Keywords

time complexity

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (6)

Numerical investigation of the 3D Hubbard model on a Linux cluster ⋮ Spectral clustering for detecting protein complexes in protein-protein interaction (PPI) networks ⋮ An efficient data structure for branch-and-bound algorithm ⋮ Optimal location and controller design of STATCOM for power system stability improvement using PSO ⋮ Self-Stabilizing Prefix Tree Based Overlay Networks ⋮ A contribution of sparse matrices tools to matrix population model analysis

Cites Work

• The processor identity problem
• Superstabilizing mutual exclusion
• The Wakeup Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Available stabilizing heaps