Erdös-Szekeres Partitioning Problem

11/21/2020
by   Michael Mitzenmacher, et al.
0

In this note, we present a substantial improvement on the computational complexity of the Erdös-Szekeres partitioning problem and review recent works on dynamic LIS.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/03/2019

Value-centric Dynamic Partial Order Reduction

The verification of concurrent programs remains an open challenge, as th...
12/29/2020

Quality-Driven Dynamic VVC Frame Partitioning for Efficient Parallel Processing

VVC is the next generation video coding standard, offering coding capabi...
02/21/2016

Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques

In a series of recent works, we have generalised the consistency results...
08/19/2019

Cumulants of multiinformation density in the case of a multivariate normal distribution

We consider a generalization of information density to a partitioning in...
09/01/2020

Rank-one partitioning: formalization, illustrative examples, and a new cluster enhancing strategy

In this paper, we introduce and formalize a rank-one partitioning learni...
07/19/2017

On recent advances in 2D Constrained Delaunay triangulation algorithms

In this article, recent works on 2D Constrained Delaunay triangulation(C...
08/09/2020

Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning

Extracting a Construction Tree from potentially noisy point clouds is an...