The following pages link to Axioms and hulls (Q1202183):
Displayed 50 items.
- Optimal heapsort algorithm (Q671366) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- Creating order in sequence spaces with simple machines (Q751622) (← links)
- Principal \(\Gamma\)-cone for a tree (Q884434) (← links)
- q-hook length formulas for forests (Q911620) (← links)
- A characterization of heaps and its applications (Q918196) (← links)
- Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof (Q944364) (← links)
- Plücker environments, wiring and tiling diagrams, and weakly separated set-systems (Q962148) (← links)
- Multitriangulations as complexes of star polygons (Q1017914) (← links)
- The sorting order on a Coxeter group. (Q1040844) (← links)
- Split sequence hash search (Q1062771) (← links)
- Resurrecting the asymptotics of linear recurrences (Q1066904) (← links)
- The node visit cost of brother trees (Q1098304) (← links)
- Towards optimal parallel bucket sorting (Q1098305) (← links)
- Permutation statistics and \((k,\ell)\)-hook Schur functions (Q1116946) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- On the relationship between son-trees and symmetric binary B-trees (Q1133900) (← links)
- A note on some algorithms for matroids (Q1145155) (← links)
- A note on some tree similarity measures (Q1166933) (← links)
- Improved deterministic parallel integer sorting (Q1175944) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
- The method of creative telescoping (Q1176785) (← links)
- Mahonian statistics on labeled forests (Q1191953) (← links)
- The ring of \(k\)-regular sequences (Q1193879) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Parallel hashing algorithms (Q1240062) (← links)
- The expected linearity of a simple equivalence algorithm (Q1246269) (← links)
- Parking functions, valet functions and priority queues (Q1292844) (← links)
- Exact computation of the sign of a finite sum (Q1294292) (← links)
- Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
- Cell complexes, oriented matroids and digital geometry. (Q1427793) (← links)
- A scheme for constructing ordered minimal perfect hashing functions (Q1820600) (← links)
- On the computation of units and class numbers by a generalization of Lagrange's algorithm (Q1820814) (← links)
- A new measure of presortedness (Q1822995) (← links)
- The properties of random trees (Q1825678) (← links)
- Formalizing generalized maps in Coq (Q1882905) (← links)
- Space saving generalization of \(B\)-trees with \(2/3\) utilization (Q1900545) (← links)
- On Delaunay oriented matroids for convex distance functions (Q1923774) (← links)
- Factorizations in Schubert cells (Q1971630) (← links)
- Three-dimensional convex hull as a fruitful source of diagrams (Q1978717) (← links)
- Fringe analysis for extquick: An in situ distributive external sorting algorithm (Q2639632) (← links)
- Design and formal proof of a new optimal image segmentation program with hypermaps (Q2643883) (← links)
- Computer solution to the 17-point Erdős-Szekeres problem (Q3541568) (← links)
- On Some SAT-Variants over Linear Formulas (Q3599093) (← links)
- Robustness and Randomness (Q5302770) (← links)
- Combining Isabelle and QEPCAD-B in the Prover’s Palette (Q5505513) (← links)
- Enumeration of simple complete topological graphs (Q5902255) (← links)
- Cycle action on treelike structures. (Q5919969) (← links)
- Static competitive facility location: an overview of optimisation approaches. (Q5928373) (← links)
- Sweeps, arrangements and signotopes (Q5929322) (← links)