On the public citation graph

Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time

https://doi.org/10.1007/11944836_7

0 signed · 55 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1961.tb03975.xopenalex-snapshot

Proving Theorems by Pattern Recognition - II

inferredcites →https://doi.org/10.1016/0304-3975(92)90150-eopenalex-snapshot

A linear speed-up theorem for cellular automata

inferredcites →https://doi.org/10.1109/mmb.2006.251471openalex-snapshot

Algorithmic Self-Assembly of DNA

inferredcites →https://doi.org/10.1145/335305.335358openalex-snapshot

The program-size complexity of self-assembled squares (extended abstract)

inferredcites →https://doi.org/10.1145/380752.380881openalex-snapshot

Running time and program size for self-assembled squares

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11944836openalex-snapshot

FSTTCS 2006 : foundations of software technology and theoretical computer science : 26th International Conference, Kolkata, India, December 13-15, 2006 : proceedings

inferred← citeshttps://doi.org/10.1007/978-3-030-87993-8_1openalex-snapshot

The Complexity of Multiple Handed Self-assembly

inferred← citeshttps://doi.org/10.1007/978-3-319-01928-4_2openalex-snapshot

Parallel Computation Using Active Self-assembly

inferred← citeshttps://doi.org/10.1007/978-3-319-01928-4_7openalex-snapshot

Signal Transmission across Tile Assemblies: 3D Static Tiles Simulate Active Self-assembly by 2D Signal-Passing Tiles

inferred← citeshttps://doi.org/10.1007/978-3-319-08123-6_20openalex-snapshot

Fast Arithmetic in Algorithmic Self-assembly

inferred← citeshttps://doi.org/10.1007/978-3-319-21999-8_6openalex-snapshot

Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly

inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_31openalex-snapshot

Randomized Self-assembly for Approximate Shapes

inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_21openalex-snapshot

The Tile Complexity of Linear Assemblies

inferred← citeshttps://doi.org/10.1007/978-3-642-03076-5_12openalex-snapshot

Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes

inferred← citeshttps://doi.org/10.1007/978-3-642-03745-0_19openalex-snapshot

Random Number Selection in Self-assembly

inferred← citeshttps://doi.org/10.1007/978-3-642-18305-8_10openalex-snapshot

Randomized Self Assembly of Rectangular Nano Structures

inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_46openalex-snapshot

Program Size and Temperature in Self-Assembly

inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_669-1openalex-snapshot

Randomized Self-Assembly

inferred← citeshttps://doi.org/10.1007/978-3-642-32894-7_6openalex-snapshot

An Introduction to Tile-Based Self-assembly

inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_26openalex-snapshot

Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability

inferred← citeshttps://doi.org/10.1007/s00453-011-9522-5openalex-snapshot

Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming

inferred← citeshttps://doi.org/10.1007/s00453-012-9620-zopenalex-snapshot

Tile Complexity of Approximate Squares

inferred← citeshttps://doi.org/10.1007/s00453-014-9879-3openalex-snapshot

Program Size and Temperature in Self-Assembly

inferred← citeshttps://doi.org/10.1007/s11047-010-9218-9openalex-snapshot

Self-assembly of decidable sets

inferred← citeshttps://doi.org/10.1007/s11047-012-9313-1openalex-snapshot

Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models

inferred← citeshttps://doi.org/10.1007/s11047-013-9379-4openalex-snapshot

An introduction to tile-based self-assembly and a survey of recent results

inferred← citeshttps://doi.org/10.1007/s11047-014-9430-0openalex-snapshot

Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles

inferred← citeshttps://doi.org/10.1007/s11047-014-9432-yopenalex-snapshot

Parallel computation using active self-assembly

inferred← citeshttps://doi.org/10.1007/s11047-015-9512-7openalex-snapshot

Fast arithmetic in algorithmic self-assembly

inferred← citeshttps://doi.org/10.1007/s11047-023-09971-0openalex-snapshot

Self-replication via tile self-assembly

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.011openalex-snapshot

Pictures worth a thousand tiles, a geometrical programming language for self-assembly

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.015openalex-snapshot

Self-assembly of infinite structures: A survey

inferred← citeshttps://doi.org/10.1021/nl203450hopenalex-snapshot

Nanoscale Transport Enables Active Self-Assembly of Millimeter-Scale Wires

inferred← citeshttps://doi.org/10.1109/focs.2009.13openalex-snapshot

Randomized Self-Assembly for Exact Shapes

inferred← citeshttps://doi.org/10.1109/focs.2010.47openalex-snapshot

Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature

inferred← citeshttps://doi.org/10.1137/1.9781611973082.46openalex-snapshot

The Power of Nondeterminism in Self-Assembly

inferred← citeshttps://doi.org/10.1137/1.9781611973099.92openalex-snapshot

Parallelism and Time in Hierarchical Self-Assembly

inferred← citeshttps://doi.org/10.1137/1.9781611973105.109openalex-snapshot

Fuel Efficient Computation in Passive Self-Assembly

inferred← citeshttps://doi.org/10.1137/1.9781611973105.110openalex-snapshot

Active Self-Assembly of Simple Units Using an Insertion Primitive

inferred← citeshttps://doi.org/10.1145/2380656.2380675openalex-snapshot

Theory of algorithmic self-assembly

inferred← citeshttps://doi.org/10.31274/etd-180810-2863openalex-snapshot

Universality in algorithmic self-assembly

inferred← citeshttps://doi.org/10.31274/etd-180810-930openalex-snapshot

Applications of the theory of computation to nanoscale self-assembly

inferred← citeshttps://doi.org/10.4086/toc.2013.v009a001openalex-snapshot

inferred← citeshttps://doi.org/10.4230/lipics.dna.27.3openalex-snapshot

Self-Replication via Tile Self-Assembly (Extended Abstract)

inferred← citeshttps://doi.org/10.48550/arxiv.0901.1849openalex-snapshot

Randomized Self-Assembly for Exact Shapes

inferred← citeshttps://doi.org/10.48550/arxiv.0904.1630openalex-snapshot

Self-Assembly of a Statistically Self-Similar Fractal

inferred← citeshttps://doi.org/10.48550/arxiv.0906.3306openalex-snapshot

Self-Assembly of Infinite Structures

inferred← citeshttps://doi.org/10.48550/arxiv.1004.0995openalex-snapshot

Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature

inferred← citeshttps://doi.org/10.48550/arxiv.1011.3493openalex-snapshot

Program Size and Temperature in Self-Assembly

inferred← citeshttps://doi.org/10.48550/arxiv.1111.3097openalex-snapshot

The tile assembly model is intrinsically universal

inferred← citeshttps://doi.org/10.48550/arxiv.1303.2416openalex-snapshot

Fast Arithmetic in Algorithmic Self-Assembly

inferred← citeshttps://doi.org/10.48550/arxiv.2005.13581openalex-snapshot

Limitations on counting in Boolean circuits and self-assembly

inferred← citeshttps://doi.org/10.5555/2627817.2627926openalex-snapshot

Fuel efficient computation in passive self-assembly

inferred← citeshttps://doi.org/10.70675/501753aazc972z4693z856cz4959181e256copenalex-snapshot

Self-Assembly on Various Surfaces

inferred← citeshttps://doi.org/10.7916/d8dz06fqopenalex-snapshot

Modeling Nanoscale Transport Systems

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.