The following pages link to Mary Cryan (Q396812):
Displayed 17 items.
- The number of Euler tours of random directed graphs (Q396813) (← links)
- Exact counting of Euler tours for generalized series-parallel graphs (Q414430) (← links)
- (Q1125452) (redirect page) (← links)
- Approximation algorithms for the fixed-topology phylogenetic number problem (Q1125454) (← links)
- Modified log-Sobolev inequalities for strongly log-concave distributions (Q2227722) (← links)
- Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model (Q2784459) (← links)
- The number of Euler tours of a random directed graph (Q2959900) (← links)
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows (Q3427745) (← links)
- Approximately counting integral flows and cell-bounded contingency tables (Q3581402) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- (Q4471315) (← links)
- (Q4779150) (← links)
- Constructing a normal form for Property Theory (Q5234704) (← links)
- Approximately Counting Integral Flows and Cell-Bounded Contingency Tables (Q5390574) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5901055) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580) (← links)
- Exact counting of Euler Tours for Graphs of Bounded Treewidth (Q6245257) (← links)