The following pages link to (Q3795602):
Displaying 17 items.
- Layouts for improved hierarchical parallel computations (Q405569) (← links)
- Efficient simulated annealing on fractal energy landscapes (Q805499) (← links)
- Frobenius-Artin algebras and infinite linear codes (Q888834) (← links)
- Data compression and histograms (Q1203347) (← links)
- Optimization by hierarchical mutant production (Q1310106) (← links)
- Phase transition in the confined growth of chains formed by self-avoiding hard spheres (Q1581778) (← links)
- Mathematics and flamenco: an unexpected partnership (Q1684350) (← links)
- On the depth of the storage access function (Q1759122) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- On the connection between Hamming codes, Heapsort and other methods (Q2444852) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- Some more n‐dimensional geometry† (Q4299940) (← links)
- (Deterministic) algorithms that compute the volume of polytopes (Q4360038) (← links)
- (Q5342264) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
- Variation approach to error threshold in generic fitness landscape (Q6123514) (← links)
- On the depth of a multiplexer function with a small number of select lines (Q6576760) (← links)
