Skip to content

Author

Benjamin Aram Berendsohn

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Selection under partial information

The selection problem asks to find the $k$-th smallest element in a given set $X$. Its complexity is well-known to be $\Theta(|X|)$ for every fixed $k$. We consider the poset selection problem where a partial order $P$ on $X$ is given, and the underlying order of $X$ is guaranteed to be a linear extension of $P$. This...

Benjamin Aram Berendsohn · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.