Finger-tree implementation of the Preisach extremum stack achieves O(log k) worst-case update time for search and deletion while preserving exact R-minimality.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Worst-Case Update Complexity of the Preisach Extremum Stack
Finger-tree implementation of the Preisach extremum stack achieves O(log k) worst-case update time for search and deletion while preserving exact R-minimality.