Fast and simple sorting using partial information
From MaRDI portal
Cites work
- A Fast Merging Algorithm
- A history of distribution-sensitive data structures
- A Mathematical Theory of Communication
- A new data structure for representing sorted lists
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- A random polynomial-time algorithm for approximating the volume of convex bodies
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
- Adaptive Heapsort
- Amortized Computational Complexity
- An efficient algorithm for partial order production
- Balanced pairs in partial orders
- Balancing extensions via Brunn-Minkowski
- Balancing pairs and the cross product conjecture
- Balancing poset extensions
- Efficiency of self-adjusting heaps
- Fast perfect sampling from linear extensions
- Faster random generation of linear extensions
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finite partially ordered sets and their corresponding permutation sets
- Generating a random linear extension of a partial order
- How good is the information theory bound in sorting?
- scientific article; zbMATH DE number 1617246 (Why is no real title available?)
- scientific article; zbMATH DE number 3780571 (Why is no real title available?)
- scientific article; zbMATH DE number 3596259 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 1947389 (Why is no real title available?)
- New bounds for matrix multiplication: from alpha to omega
- On generalized comparison-based sorting problems
- On the Complexity of Partial Order Productions
- On the conductance of order Markov chains
- On the hierarchy of distribution-sensitive properties for data structures
- Self-adjusting binary search trees
- Smooth heaps and a dual view of self-adjusting data structures
- Sorting under partial information (without the ellipsoid algorithm)
- The Information-Theoretic Bound is Good for Merging
- The pairing heap: A new form of self-adjusting heap
- Time bounds for selection
- Topological sorting of large networks
- Using TPA to count linear extensions
This page was built for publication: Fast and simple sorting using partial information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255551)
