Note to "An efficient Data Structure for Lattice Operation"

06/01/2020
by   Maurizio Talamo, et al.
0

This note is to publicly answer to a paper recently accepted to SWAT 2020 <cit.> that claims to have solved an error in our papers <cit.> by proposing a solution with worst performances. In the following section we describe in detail sections 4.2 (Cluster collection) and 5 (Data Structure and Space Complexity) in <cit.> to show the implementation of the data structure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2022

Lower Bounds on Retroactive Data Structures

We prove essentially optimal fine-grained lower bounds on the gap betwee...
research
01/17/2023

A Note on the Simplex-Tree Construction of the Vietoris-Rips Complex

We give an alternative presentation of the Simplex Tree construction of ...
research
03/12/2019

The k-d tree data structure and a proof for neighborhood computation in expected logarithmic time

For practical applications, any neighborhood concept imposed on a finite...
research
01/08/2020

The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes

This paper introduces a data structure, called simplex tree, to represen...
research
04/19/2020

Faster Dynamic Range Mode

In the dynamic range mode problem, we are given a sequence a of length b...
research
02/07/2020

Distribution free testing for linear regression. Extension to general parametric regression

Recently a distribution free approach for testing parametric hypotheses ...
research
06/04/2020

Non-lattice covering and quanitization of high dimensional sets

The main problem considered in this paper is construction and theoretica...

Please sign up or login with your details

Forgot password? Click here to reset