Kinetic data structure: Difference between revisions

Content deleted Content added
Got rid of stray whitespace between footnote links.
m Compactness: \operatorname
Line 53:
 
===Compactness===
The maximum number of certificates used to augment the data structure at any time. A kinetic data structure is compact if the number of certificates it uses is <math>O(n \textrmoperatorname{polylog} n)</math> or <math>O(n^{1+\epsilon})</math> for arbitrarily small <math>\epsilon</math>. (a small factor more than linear space)
 
===Efficiency===