The following pages link to Axioms and hulls (Q1202183):
Displaying 50 items.
- LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies (Q377487) (← links)
- Enumerating topological \((n_k)\)-configurations (Q390112) (← links)
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Formal specification and proofs for the topology and classification of combinatorial surfaces (Q396466) (← links)
- Condorcet domains of tiling type (Q423890) (← links)
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- Designing and proving correct a convex hull algorithm with hypermaps in Coq (Q448980) (← links)
- Geodesic order types (Q486983) (← links)
- On maximal weakly separated set-systems (Q604830) (← links)
- Qualitative reasoning with directional relations (Q622129) (← links)
- On the number of simple arrangements of five double pseudolines (Q629847) (← links)
- Coding and counting arrangements of pseudolines (Q644821) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- Optimal heapsort algorithm (Q671366) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← 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)
- Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
- A combinatorial version of Sylvester's four-point problem (Q990768) (← 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 verified ODE solver and the Lorenz attractor (Q1663218) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
