Use a sorted array if deletions and insertions are not going to happen often (or never). Otherwise a balanced binary search tree is usually more appropriate.

We next examined whether multipoint calculations using the Lander-Green algorithm 11 could be carried out efficiently when sparse binary trees replace the traditional array organization of ...

Reliable multilevel resistive switching in nanoscale cells is desirable for the wide adoption of resistive random access memory as the next-generation nonvolatile memory. We designed NiO-based cells ...