A simplified derivation of timing complexity lower bounds for sorting by comparisons | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

A simplified derivation of timing complexity lower bounds for sorting by comparisons

Identifier:nobleid.org/w1/20260515/AC8677CD

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/AC8677CD.svg?ark=w1%2F20260515%2FAC8677CD)](https://nobleid.org/work/w1/20260515/AC8677CD)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

SchellekensMichel

PopoviciEmanuel

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy