HART: A Hybrid Addressing Scheme for Self-Balancing Binary Search Trees in Phase Change Memory (PCM)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Desai, Mahek, Rumale, Apoorva, Asadinia, Marjan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

WIRE: Write Energy Reduction via Encoding in Phase Change Main Memories (PCM)
by: Desai, Mahek, et al.
Published: (2025)

SHIELD: Securing Healthcare IoT with Efficient Machine Learning Techniques for Anomaly Detection
by: Desai, Mahek, et al.
Published: (2025)

ML-PCM : Machine Learning Technique for Write Optimization in Phase Change Memory (PCM)
by: Desai, Mahek, et al.
Published: (2025)

Hardness Amplification for Dynamic Binary Search Trees
by: Jiang, Shunhua, et al.
Published: (2024)

Noisy (Binary) Searching: Simple, Fast and Correct
by: Dereniowski, Dariusz, et al.
Published: (2021)

SMART-WRITE: Adaptive Learning-based Write Energy Optimization for Phase Change Memory
by: Desai, Mahek, et al.
Published: (2025)

Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
by: Joshi, Amit
Published: (2025)

Designing Approximate Binary Trees for Trees
by: Kellerhals, Leon, et al.
Published: (2026)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
by: Bruno, Roberto, et al.
Published: (2024)

Concurrent Balanced Augmented Trees
by: Wrench, Evan, et al.
Published: (2026)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Binary Search with Distributional Predictions
by: Dinitz, Michael, et al.
Published: (2024)

Tree Search With Predictions
by: Dinitz, Michael, et al.
Published: (2026)

Buffered Partially-Persistent External-Memory Search Trees
by: Brodal, Gerth Stølting, et al.
Published: (2025)

Search Trees on Trees via LP
by: Sadeh, Yaniv, et al.
Published: (2025)

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances
by: Dinitz, Michael, et al.
Published: (2025)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
by: Desikan, Hayagriv
Published: (2026)

Optimal Non-Oblivious Open Addressing
by: Bender, Michael A., et al.
Published: (2025)

Tight Bounds for Classical Open Addressing
by: Bender, Michael A., et al.
Published: (2024)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
by: Dempsey, Jordan, et al.
Published: (2024)

A Lock-free Binary Trie
by: Ko, Jeremy
Published: (2024)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
by: Gadekar, Ameet, et al.
Published: (2025)

An Algorithmic Approach to Address Course Enrollment Challenges
by: Biswas, Arpita, et al.
Published: (2023)

Matroid Secretary via Labeling Schemes
by: Bérczi, Kristóf, et al.
Published: (2024)

Succinct Encodings of Binary Trees with Application to AVL Trees
by: Chizewer, Jeremy, et al.
Published: (2023)

Interval Selection with Binary Predictions
by: Karavasilis, Christodoulos
Published: (2025)

Randomized Binary and Tree Search under Pressure
by: Caracci, Agustín, et al.
Published: (2024)

LZD-style Compression Scheme with Truncation and Repetitions
by: Götz, Linus, et al.
Published: (2025)

Additive Approximation Schemes for Low-Dimensional Embeddings
by: Anderson, Prashanti, et al.
Published: (2025)

Online Rounding Schemes for $ k $-Rental Problems
by: Nekouyan, Hossein, et al.
Published: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
by: Neuwohner, Meike, et al.
Published: (2025)

Building a Balanced k-d Tree in O(kn log n) Time
by: Brown, Russell A.
Published: (2014)

A Dynamic, Self-balancing k-d Tree
by: Brown, Russell A.
Published: (2025)

Efficient Parallel Ising Samplers via Localization Schemes
by: Chen, Xiaoyu, et al.
Published: (2025)

New Oracles and Labeling Schemes for Vertex Cut Queries
by: Jiang, Yonggang, et al.
Published: (2025)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
by: Bentert, Matthias, et al.
Published: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
by: Bhore, Sujoy, et al.
Published: (2025)

Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics
by: Ren, Kinter, et al.
Published: (2024)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
by: Joseph, et al.
Published: (2023)

A Linear Time Gap-ETH-Tight Approximation Scheme for Euclidean TSP
by: Mömke, Tobias, et al.
Published: (2024)