Tom Head - RankMe

50 papers A 1B 5C 1Journal 32Unranked 8

Year	Rank	Type	Title / Venue / Authors
2011	J	`jnl`	Computing transparently: the independent sets in a graph. Nat. Comput. Tom Head
2011	J	`jnl`	Computing with Light: toward Parallel Boolean Algebra. Int. J. Found. Comput. Sci. Tom Head
2011	—	`ch.`	How the Structure of DNA Molecules Provides Tools for Computation. Biology, Computation and Linguistics Tom Head
2010	C	`conf`	Using Light to Implement Parallel Boolean Algebra. Developments in Language Theory Tom Head
2009	—	`conf`	Parallel Computing by Xeroxing on Transparencies. Algorithmic Bioprocesses Tom Head
2007	—	`conf`	A Cosmic Muse. Formal Models, Languages and Applications Tom Head
2007	J	`jnl`	Photocomputing: Explorations with Transparency and Opacity. Parallel Process. Lett. Tom Head
2006	—	`conf`	Aqueous Computing: Writing on Molecules Dissolved in Water. Nanotechnology: Science and Computation Tom Head, Susannah Gal
2006	—	`ch.`	Splicing and Regularity. Recent Advances in Formal Languages and Applications Tom Head, Dennis Pixton
2005	J	`jnl`	Does Light Direct Life Toward Cosmic Awareness? Fundam. Informaticae Tom Head
2005	J	`jnl`	Protein output for DNA computing. Nat. Comput. Christiaan V. Henkel, Reno S. Bladergroen, Crina I. A. Balog, André M. Deelder, Tom Head, Grzegorz Rozenberg, Herman P. Spaink
2002	—	`conf`	An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation. Formal and Natural Computing Tom Head
2002	J	`jnl`	Aqueous Computing: A Survey with an Invitation to Participate. J. Comput. Sci. Technol. Tom Head, Xia Chen, Masayuki Yamamura, Susannah Gal
2002	J	`jnl`	Biomolecular Computing - Preface. New Gener. Comput. Masayuki Yamamura, Tom Head, Masami Hagiya
2002	B	`conf`	Splicing Systems: Regularity and Below. DNA Tom Head, Dennis Pixton, Elizabeth Goode
2001	J	`jnl`	Aqueous Computing: Writing into Fluid Memory. Bull. EATCS Tom Head, Susannah Gal
2001	B	`conf`	Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3. DNA Tom Head, Xia Chen, Matthew J. Nichols, Masayuki Yamamura, Susannah Gal
2001	J	`jnl`	Biomolecular Realizations of a Parallel Architecture for Solving Combinatorial Problems. New Gener. Comput. Tom Head
2001	—	`conf`	Visualizing Languages Using Primitive Powers. Words, Semigroups, and Transductions Tom Head
2001	—	`conf`	Writing by methylation proposed for aqueous computing. Where Mathematics, Computer Science, Linguistics and Biology Meet Tom Head
2000	—	`ch.`	Relativized Code Concepts and Multi-Tube DNA Dictionaries. Finite Versus Infinite Tom Head
2000	—	`conf`	Splicing Systems, Aqueous Computing, and Beyond. UMC Tom Head
1999	B	`conf`	Aqueous computing: writing on molecules. CEC Tom Head, Masayuki Yamamura, Susannah Gal
1999	J	`jnl`	Foreword. J. Comb. Optim. Ying Xu, Satoru Miyano, Tom Head
1998	B	`conf`	Locality, Reversibility, and Beyond: Learning Languages from Positive Data. ALT Tom Head, Satoshi Kobayashi, Takashi Yokomori
1998	J	`jnl`	Splicing Representations of Strictly Locally Testable Languages. Discret. Appl. Math. Tom Head
1996	J	`jnl`	The finest homophonic partition and related code concepts. IEEE Trans. Inf. Theory Andreas Weber, Tom Head
1995	J	`jnl`	Deciding multiset decipherability. IEEE Trans. Inf. Theory Tom Head, Andreas Weber
1994	B	`conf`	The Finest Homophonic Partition and Related Code Concepts. MFCS Andreas Weber, Tom Head
1992	J	`jnl`	The lattice of semiretracts of a free monoid. Int. J. Comput. Math. James Anderson, Tom Head
1991	J	`jnl`	The topologies of sofic subshifts have computable Pierce invariants. RAIRO Theor. Informatics Appl. Tom Head
1990	J	`jnl`	The Set of Strings Mapped Into a Submonoid by Iterates of a Morphism. Theor. Comput. Sci. Tom Head
1990	J	`jnl`	The poset of retracts of a free monoid. Int. J. Comput. Math. Wit Forys, Tom Head
1989	J	`jnl`	Deciding the Immutability of Regular Codes and Languages Under Finite Transductions. Inf. Process. Lett. Tom Head
1989	J	`jnl`	One-Dimensional Cellular Automata: Injectivity From Unambiguity. Complex Syst. Tom Head
1987	J	`jnl`	Bounded D0L Languages. Theor. Comput. Sci. Tom Head, Barbara Lando
1986	J	`jnl`	Periodic D0L Languages. Theor. Comput. Sci. Tom Head, Barbara Lando
1986	J	`jnl`	Regularity of Sets of Initial Strings of Periodic D0L-Systems. Theor. Comput. Sci. Tom Head, Barbara Lando
1986	J	`jnl`	The Topological Structure of Adherences of Regular Languages. RAIRO Theor. Informatics Appl. Tom Head
1985	J	`jnl`	Code Properties and Homomorphisms of D0L Systems. Theor. Comput. Sci. Tom Head, John Wilkinson
1984	A	`conf`	Adherence Equivalence Is Decidable for DOL Languages. STACS Tom Head
1984	J	`jnl`	Adherences of D0L Languages. Theor. Comput. Sci. Tom Head
1984	—	`conf`	The adherences of languages as topological spaces. Automata on Infinite Words Tom Head
1983	J	`jnl`	DOL Schemes and the Periodicity of String Embeddings. Theor. Comput. Sci. Tom Head, Gabriel Thierrin, John Wilkinson
1982	J	`jnl`	Finite DOL Languages and Codes. Theor. Comput. Sci. Tom Head, John Wilkinson
1980	J	`jnl`	A-Transducers and the Monotonicity of IL Schemes. J. Comput. Syst. Sci. Tom Head
1980	J	`jnl`	Hypercodes in Deterministic and Slender 0L Languages Inf. Control. Tom Head, Gabriel Thierrin
1979	J	`jnl`	Codeterministic Lindenmayer Schemes and Systems. J. Comput. Syst. Sci. Tom Head
1979	J	`jnl`	The Decidability of Equivalence for Deterministic Finite Transducers. J. Comput. Syst. Sci. Meera Blattner, Tom Head
1977	J	`jnl`	Automata That Recognize Intersections of Free Submonoids Inf. Control. Meera Blattner, Tom Head