Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

We present a new multi-dimensional data structure, which we call the skip quadtree (for
point data in R2) or the skip octree (for point data in Rd, with constant d> 2). Our data …

Quadtrees are hierarchical spatial tree data structures that are based on the principle of
recursive decomposition of space. The term quadtree originated from representation of two …

We present a new multi-dimensional data structure, which we call the skip quadtree (for
point data in R 2) or the skip octree (for point data in R d, with constant d> 2). Our data …

Temporal graphs represent vertices and binary relations that change along time. The work in
this paper proposes to represent temporal graphs as cells in a 4D binary matrix: two …

We provide efficient constant-factor approximation algorithms for the problems of finding a
hierarchical clustering of a point set in any metric space, minimizing the sum of minimimum …

In this paper, we develop a parallel Fast Multipole Method (FMM) based solution for
computing the scattered electromagnetic fields from a Perfect Electrically Conducting (PEC) …

Phenomics is an emerging branch of modern biology that uses high throughput phenotyping
tools to capture multiple environmental and phenotypic traits, often at massive spatial and …

We present an efficient method for maintaining a compressed quadtree for a set of moving
points in ℝ d. Our method works in the black-box KDS model, where we receive the …

We describe the design and implementation of efficient parallel algorithms, and a software
library for the parallel implementation of compressed octree data structures. Octrees are …