메뉴 건너뛰기




Volumn , Issue , 2007, Pages

An architectural style for solving computationally intensive problems on large networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; INTERNET; PROBLEM SOLVING; SCALABILITY;

EID: 36249008978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEAMS.2007.4     Document Type: Conference Paper
Times cited : (33)

References (21)
  • 1
    • 0028114541 scopus 로고
    • Molecular computation of solutions to combinatorial problems
    • L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, 1994.
    • (1994) Science , vol.266 , pp. 1021-1024
    • Adleman, L.1
  • 5
    • 30644470156 scopus 로고    scopus 로고
    • Two computational primitives for algorithmic self-assembly: Copying and counting
    • R. Barish, P. W. K. Rothemund, and E. Winfree. Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters, 5(12):2586-2592, 2005.
    • (2005) Nano Letters , vol.5 , Issue.12 , pp. 2586-2592
    • Barish, R.1    Rothemund, P.W.K.2    Winfree, E.3
  • 7
    • 34247880278 scopus 로고    scopus 로고
    • Arithmetic computation in the tile assembly model: Addition and multiplication
    • 10.1016/j.tcs.2006.10.025
    • Y. Brun. Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science, 10.1016/j.tcs.2006.10.025, 2006.
    • (2006) Theoretical Computer Science
    • Brun, Y.1
  • 8
    • 36248942901 scopus 로고    scopus 로고
    • Solving NP-complete problems in the tile assembly model
    • Technical Report USC-CSSE-2007-703, Center for Software Engineering, University of Southern California
    • Y. Brun. Solving NP-complete problems in the tile assembly model. Technical Report USC-CSSE-2007-703, Center for Software Engineering, University of Southern California, 2007.
    • (2007)
    • Brun, Y.1
  • 12
    • 0027255843 scopus 로고
    • DNA double-crossover molecules
    • T. J. Fu and N. C. Seeman. DNA double-crossover molecules. Biochemistry, 32(13):3211-3220, 1993.
    • (1993) Biochemistry , vol.32 , Issue.13 , pp. 3211-3220
    • Fu, T.J.1    Seeman, N.C.2
  • 14
  • 15
    • 14044251445 scopus 로고    scopus 로고
    • Algorithmic self-assembly of DNA Sierpinski triangles
    • P. W. K. Rothemund, N. Papadakis, and E. Winfree. Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology, 2(12):e424, 2004.
    • (2004) PLoS Biology , vol.2 , Issue.12
    • Rothemund, P.W.K.1    Papadakis, N.2    Winfree, E.3
  • 16
    • 0033701726 scopus 로고    scopus 로고
    • The program-size complexity of self-assembled squares
    • Montreal, Quebec, Canada
    • P. W. K. Rothemund and E. Winfree. The program-size complexity of self-assembled squares. In ACM Symposium on Theory of Computing (STOC02), pages 459-468, Montreal, Quebec, Canada, 2001.
    • (2001) ACM Symposium on Theory of Computing (STOC02) , pp. 459-468
    • Rothemund, P.W.K.1    Winfree, E.2
  • 19
    • 0003546918 scopus 로고    scopus 로고
    • PhD thesis, California Insitute of Technology, Pasadena, CA, June
    • E. Winfree. Algorithmic Self-Assembly of DNA. PhD thesis, California Insitute of Technology, Pasadena, CA, June 1998.
    • (1998) Algorithmic Self-Assembly of DNA
    • Winfree, E.1
  • 20
    • 36249023048 scopus 로고    scopus 로고
    • Simulations of computing by self-assembly of DNA
    • Technical Report CS-TR:1998:22, California Insitute of Technology, Pasadena, CA
    • E. Winfree. Simulations of computing by self-assembly of DNA. Technical Report CS-TR:1998:22, California Insitute of Technology, Pasadena, CA, 1998.
    • (1998)
    • Winfree, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.