English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We consider the problem of sorting elements on a series of stacks, introducedby Tarjan and Knuth. We improve the asymptotic lower bound for the number ofstacks necessary to sort $n$ elements to $0.561 \log_2 n + O(1)$. This is thefirst significant improvement since the previous lower bound, $1/2 \log_2 n +O(1)$, was established by Knuth in 1972.

An Improved Lower Bound for Stack Sorting