Optimal antimatroid sorting
From MaRDI portal
Cites work
- A circuit set characterization of antimatroids
- A Fast Merging Algorithm
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
- Antimatroids and balanced pairs
- Arboricity, \(h\)-index, and dynamic algorithms
- Balanced pairs in partial orders
- Balancing pairs and the cross product conjecture
- Deterministic sorting in O(nloglogn) time and linear space
- Finding and counting small induced subgraphs efficiently
- Finite partially ordered sets and their corresponding permutation sets
- Greedoids
- How good is the information theory bound in sorting?
- scientific article; zbMATH DE number 3871387 (Why is no real title available?)
- scientific article; zbMATH DE number 3742601 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Integer sorting in \(O(n \sqrt{\log \log n})\) expected time and linear space
- Introduction to Greedoids
- Lattices with unique irreducible decompositions
- Multiway powersort
- Sorting under partial information (without the ellipsoid algorithm)
- Surpassing the information theoretic bound with fusion trees
- The Information-Theoretic Bound is Good for Merging
- The Ultimate Planar Convex Hull Algorithm?
- Topological sorting of large networks
This page was built for publication: Optimal antimatroid sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322518)
