◍wovepaper
SearchResearchersInstitutions
Sign in
cs.DSNov 21, 2020
2
citations (OpenAlex)
authors
  • Michael Mitzenmacher
  • Saeed Seddighin
arXiv abstractPDF
paper

Erdös-Szekeres Partitioning Problem

arXiv:2011.10870

Abstract

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 \textsf{LIS}.

Cited by in corpus (1)

  • Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.