Algorithmic Folding Complexity
暂无分享,去创建一个
Jean Cardinal | Erik D. Demaine | Ryuhei Uehara | Stefan Langerman | Shinji Imahori | Martin L. Demaine
[1] Michel Dekking,et al. Folds: III. More Morphisms , 1982 .
[2] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[3] Joseph B. M. Mitchell,et al. When can you fold a map? , 2000, Comput. Geom..
[4] Jean-Paul Allouche,et al. Sur la complexite des suites in nies , 1994 .
[5] Erik D. Demaine,et al. Open problems from cccg 2001 , 2001, CCCG.
[6] Erik D. Demaine,et al. Open Problems: Open Problems from CCCG 2005 , 2006, CCCG.
[7] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[8] A. V. D. Poorten. Arithmetic and analytic properties of paper folding sequences , 1981, Bulletin of the Australian Mathematical Society.
[9] Erik D. Demaine,et al. Geometric folding algorithms - linkages, origami, polyhedra , 2007 .