The following pages link to Sarah E. Anderson (Q398986):
Displayed 22 items.
- Exponents of polar codes using algebraic geometric code kernels (Q398987) (← links)
- Representations of the multicast network problem (Q1742156) (← links)
- Product throttling (Q2073191) (← links)
- Correction to: ``On well-edge-dominated graphs'' (Q2084786) (← links)
- Orientable domination in product-like graphs (Q2109114) (← links)
- An efficient, conservative, time-implicit solver for the fully kinetic arbitrary-species 1D-2V Vlasov-Ampère system (Q2125455) (← links)
- Power domination in cubic graphs and Cartesian products (Q2166320) (← links)
- Independent transversal domination in trees, products and under local changes to a graph (Q2172837) (← links)
- Prime factorization and domination in the hierarchical product of graphs (Q2409781) (← links)
- Domination in the hierarchical product and Vizing's conjecture (Q2411590) (← links)
- On well-dominated graphs (Q2657074) (← links)
- On well-edge-dominated graphs (Q2673496) (← links)
- Stopping Sets of Hermitian Codes (Q2976509) (← links)
- (Q4793436) (← links)
- (Q5883635) (← links)
- A conservative phase-space moving-grid strategy for a 1D-2V Vlasov-Fokker-Planck solver (Q6040997) (← links)
- An Eulerian Vlasov-Fokker-Planck algorithm for spherical implosion simulations of inertial confinement fusion capsules (Q6104166) (← links)
- Product throttling for power domination (Q6352657) (← links)
- Graphs which satisfy a Vizing-like bound for power domination of Cartesian products (Q6410139) (← links)
- Orientable domination in product-like graphs (Q6416154) (← links)
- Relative hulls and quantum codes (Q6422041) (← links)
- Orientable total domination in graphs (Q6461021) (← links)