The following pages link to Benjamin Hollering (Q2076294):
Displayed 12 items.
- Discrete max-linear Bayesian networks (Q2076295) (← links)
- Identifiability in phylogenetics using algebraic matroids (Q2229705) (← links)
- Exchangeable and sampling-consistent distributions on rooted binary trees (Q5067211) (← links)
- Algebraic optimization degree (Q5102027) (← links)
- Toric fiber products in geometric modeling (Q6138153) (← links)
- Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model (Q6184907) (← links)
- Generalized cut polytopes for binary hierarchical models (Q6192401) (← links)
- Toric Ideals of Characteristic Imsets via Quasi-Independence Gluing (Q6409741) (← links)
- Identifiability of the Rooted Tree Parameter under the Cavender-Farris-Neyman Model with a Molecular Clock (Q6430385) (← links)
- Identifiability of Homoscedastic Linear Structural Equation Models using Algebraic Matroids (Q6446186) (← links)
- Computing Implicitizations of Multi-Graded Polynomial Maps (Q6459225) (← links)
- The Pfaffian Structure of CFN Phylogenetic Networks (Q6463257) (← links)