Author image not provided
 Robert Tinsley Schweller

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article12.70
Citation Count381
Publication count30
Publication years2004-2017
Available for download9
Average downloads per article243.78
Downloads (cumulative)2,194
Downloads (12 Months)143
Downloads (6 Weeks)17
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


30 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 30
Result page: 1 2

Sort by:

1
March 2017 Theoretical Computer Science: Volume 667 Issue C, March 2017
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

In this paper we introduce the robust random number generation problem where the goal is to design an abstract tile assembly system (aTAM system) whose terminal assemblies can be split into n partitions such that a resulting assembly of the system lies within each partition with probability 1/n, regardless of ...
Keywords: DNA computing, Tile self-assembly, Randomization, aTAM, Biocomputing

2
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Downloads (Overall): 24

Full text available: PDFPDF
We show how to design a universal shape replicator in a self-assembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown hole-free polyomino shape, produces an unbounded number of copies of that shape ...

3
September 2016 Algorithmica: Volume 76 Issue 1, September 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In this paper we consider the problem of the strict self-assembly of infinite fractals within tile self-assembly. In particular, we provide tile assembly algorithms for the assembly of a Sierpinski triangle and the discrete Sierpinski carpet within a class of models we term the h-handed assembly model (h-HAM), which generalizes ...
Keywords: DNA tiles, Self-assembly, Fractals

4
March 2016 Natural Computing: an international journal: Volume 15 Issue 1, March 2016
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

In this paper we consider the time complexity of adding two n-bit numbers together within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system components are square tiles with different glue types assigned to tile edges. Assembly is driven by the ...
Keywords: Adder, Computational geometry, Tile assembly model, Algorithmic self-assembly

5
February 2016 Algorithmica: Volume 74 Issue 2, February 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The Two-Handed Tile Assembly Model (2HAM) is a model of algorithmic self-assembly in which large structures, or assemblies of tiles, are grown by the binding of smaller assemblies. In order to bind, two assemblies must have matching glues that can simultaneously touch each other, and stick together with strength that ...
Keywords: Intrinsic universality, Tile assembly model, Tile-assembly, 2HAM

6
August 2015 DNA 21: Proceedings of the 21st International Conference on DNA Computing and Molecular Programming - Volume 9211
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In this paper we introduce the robust coin flip problem in which one must design an abstract tile assembly system aTAM system whose terminal assemblies can be partitioned such that the final assembly lies within either partition with exactly probability 1/2, regardless of what relative concentration assignment is given to ...

7
June 2015 Natural Computing: an international journal: Volume 14 Issue 2, June 2015
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 1

Chemical self-replicators are of considerable interest in the field of nanomanufacturing and as a model for evolution. We introduce the problem of self-replication of rectangular two-dimensional patterns in the practically motivated signal tile assembly model (STAM) (Padilla et al. Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient ...
Keywords: Computational geometry, Self-replication, Wang tiles, Self-assembly, Tile self-assembly

8
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Downloads (Overall): 45

Full text available: PDFPDF
In this paper we explore the power of geometry to overcome the limitations of non-cooperative self-assembly. We define a generalization of the abstract Tile Assembly Model (aTAM), such that a tile system consists of a collection of polyomino tiles, the Polyomino Tile Assembly Model (polyTAM), and investigate the computational powers ...

9
September 2013 DNA 19: Proceedings of the 19th International Conference on DNA Computing and Molecular Programming - Volume 8141
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

Chemical self-replicators are of considerable interest in the field of nanomanufacturing and as a model for evolution. We introduce the problem of self-replication of rectangular two-dimensional patterns in the practically motivated Signal Tile Assembly Model STAM [9]. The STAM is based on the Tile Assembly Model TAM which is a ...

10
July 2013 ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

In this paper, we study the intrinsic universality of the well-studied Two-Handed Tile Assembly Model (2HAM), in which two "supertile" assemblies, each consisting of one or more unit-square tiles, can fuse together (self-assemble) whenever their total attachment strength is at least the global temperature τ . Our main result is ...

11
July 2013 Theoretical Computer Science: Volume 497, July, 2013
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

This paper presents a summary of our initial work on developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its sum-product expansion. The complexity aspects of this problem and its ...
Keywords: Monomial testing, Monomials, Multivariate polynomials, Derandomization, Algebra, Complexity, Randomization

12
January 2013 SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 22

Full text available: PDFPDF
In this paper we show that passive self-assembly in the context of the tile self-assembly model is capable of performing fuel efficient, universal computation. The tile self-assembly model is a premiere model of self-assembly in which particles are modeled by four-sided squares with glue types assigned to each tile edge. ...

13
October 2012 FOCS '12: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 22

We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T. The simulation is ``intrinsic" in the sense that the self-assembly process carried out by ...
Keywords: tile self-assembly, intrinsic universality, simulation

14
July 2012 ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 16

In this work we propose a generalization of Winfree's abstract Tile Assembly Model (aTAM) in which tile types are assigned rigid shapes, or geometries, along each tile face. We examine the number of distinct tile types needed to assemble shapes within this model, the temperature required for efficient assembly, and ...

15
September 2011 DNA'11: Proceedings of the 17th international conference on DNA computing and molecular programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 12

Is Winfree's abstract Tile Assembly Model (aTAM) "powerful?" Well, if certain tiles are required to "cooperate" in order to be able to bind to a growing tile assembly (a.k.a., temperature 2 self-assembly), then Turing universal computation and the efficient self-assembly of N × N squares is achievable in the aTAM ...

16
August 2011 COCOA'11: Proceedings of the 5th international conference on Combinatorial optimization and applications
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its sum-product expansion. The complexity aspects of this problem and its variants have been ...
Keywords: algebra, derandomization, monomial testing, randomization, complexity, multivariate polynomials

17
January 2011 SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 26
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Downloads (Overall): 93

Full text available: PDFPDF
We investigate the power of the Wang tile self-assembly model at temperature 1, a threshold value that permits attachment between any two tiles that share even a single bond. When restricted to deterministic assembly in the plane, no temperature 1 assembly system has been shown to build a shape with ...

18
October 2010 FOCS '10: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 15

We consider the problem of fault-tolerance in nanoscale algorithmic self-assembly. We employ a standard variant of Winfree’s abstract Tile Assembly Model (aTAM), the two-handed aTAM, in which square “tiles” – a model of molecules constructed from DNA for the purpose of engineering self-assembled nanostructures – aggregate according to specific binding ...
Keywords: Self-Assembly, Fault-Tolerance

19 published by ACM
November 2009 ACM Transactions on Algorithms (TALG): Volume 5 Issue 4, October 2009
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 302

Full text available: PDFPDF
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivations including DNA self-assembly and DNA computing. Previous work has extended results from coding theory to obtain bounds on code size for new biologically motivated constraints and ...
Keywords: DNA code design, randomized algorithms

20
September 2008 Natural Computing: an international journal: Volume 7 Issue 3, September 2008
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 36

We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measures are motivated by a practical nanofabrication scenario through protein-based bioengineering. Staging allows us to break through ...
Keywords: Self-assembly, Tiling, Nanotechnology, DNA computing, DNA self-assembly



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us