Yao Qi, Raja Das, et al.
ISSTA 2009
The state splitting algorithm of Adler, Coppersmith, and Hassner for graphs with edges of fixed length is extended to graphs with edges of variable lengths. This has the potential to improve modulation code construction techniques. Although the ideas of state splitting come from dynamical systems, completely graph-theoretic terms are used. © 1986 IEEE
Yao Qi, Raja Das, et al.
ISSTA 2009
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev