On the Complexity of Graph Self-assembly in Accretive Systems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai. On the Complexity of Graph Self-assembly in Accretive Systems. In Chengde Mao, Takashi Yokomori, editors, DNA Computing, 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers. Volume 4287 of Lecture Notes in Computer Science, pages 95-110, Springer, 2006. [doi]

This author has not been identified. Look up 'Stanislav Angelov' in GoogleThis author has not been identified. Look up 'Sanjeev Khanna' in GoogleThis author has not been identified. Look up 'Mirkó Visontai' in Google

runs on WebDSL