Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=454
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rewriting rule chains modeling DNA rearrangement pathways
Angela Angeleska
,
Natas̑a Jonoska
,
Masahico Saito
Theoretical Computer Science
454
, 2012, pp. 5-22
Parameterized searching with mismatches for run-length encoded strings
Alberto Apostolico
,
Péter L. Erdŏs
,
Alpár Jüttner
Theoretical Computer Science
454
, 2012, pp. 23-29
Simple gene assembly as a rewriting of directed overlap-inclusion graphs
Sepinoud Azimi
,
Tero Harju
,
Miika Langille
,
Ion Petre
Theoretical Computer Science
454
, 2012, pp. 30-37
Algorithmic decomposition of shuffle on words
Franziska Biegler
,
Mark Daley
,
Ian McQuillan
Theoretical Computer Science
454
, 2012, pp. 38-50
The binary perfect phylogeny with persistent characters
Paola Bonizzoni
,
Chiara Braghin
,
Riccardo Dondi
,
Gabriella Trucco
Theoretical Computer Science
454
, 2012, pp. 51-63
Pivots, determinants, and perfect matchings of graphs
Robert Brijder
,
Tero Harju
,
Hendrik Jan Hoogeboom
Theoretical Computer Science
454
, 2012, pp. 64-71
The complexity of Euler's integer partition theorem
Cristian S. Calude
,
Elena Calude
,
Melissa S. Queen
Theoretical Computer Science
454
, 2012, pp. 72-80
One-reversal counter machines and multihead automata: Revisited
Ehsan Chiniforooshan
,
Mark Daley
,
Oscar H. Ibarra
,
Lila Kari
,
Shinnosuke Seki
Theoretical Computer Science
454
, 2012, pp. 81-87
Rational relations having a rational trace on each finite intersection of rational relations
Christian Choffrut
,
Serge Grigorieff
Theoretical Computer Science
454
, 2012, pp. 88-94
An excursion in reaction systems: From computer science to biology
Luca Corolli
,
Carlo Maj
,
Fabrizio Marini
,
Daniela Besozzi
,
Giancarlo Mauri
Theoretical Computer Science
454
, 2012, pp. 95-108
A generalized palindromization map in free monoids
Aldo de Luca
,
Alessandro De Luca
Theoretical Computer Science
454
, 2012, pp. 109-128
Star-free languages are Church-Rosser congruential
Volker Diekert
,
Manfred Kufleitner
,
Pascal Weil
Theoretical Computer Science
454
, 2012, pp. 129-135
A combinatoric interpretation of dual variables for weighted matching and
f
-factors
Harold N. Gabow
Theoretical Computer Science
454
, 2012, pp. 136-163
State complexity of union and intersection of square and reversal on regular languages
Yuan Gao
,
Lila Kari
,
Sheng Yu
Theoretical Computer Science
454
, 2012, pp. 164-171
Problems in between words and Abelian words:
k
-Abelian avoidability
Mari Huova
,
Juhani Karhumäki
,
Aleksi Saarela
Theoretical Computer Science
454
, 2012, pp. 172-177
Consistency of multidimensional combinatorial substitutions
Timo Jolivet
,
Jarkko Kari
Theoretical Computer Science
454
, 2012, pp. 178-188
Regions of Petri nets with a/sync connections
Jetty Kleijn
,
Maciej Koutny
,
Marta Pietkiewicz-Koutny
Theoretical Computer Science
454
, 2012, pp. 189-198
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
Filippo Mignosi
,
Antonio Restivo
Theoretical Computer Science
454
, 2012, pp. 199-205
On the properties of language classes defined by bounded reaction automata
Fumiya Okubo
,
Satoshi Kobayashi
,
Takashi Yokomori
Theoretical Computer Science
454
, 2012, pp. 206-221
P automata revisited
Gheorghe Pȃun
,
Mario J. Pérez-Jiménez
Theoretical Computer Science
454
, 2012, pp. 222-230
Lower bounds for the size of deterministic unranked tree automata
Xiaoxue Piao
,
Kai Salomaa
Theoretical Computer Science
454
, 2012, pp. 231-239
Interactive information systems: Toward perception based computing
Andrzej Skowron
,
Piotr Wasilewski
Theoretical Computer Science
454
, 2012, pp. 240-260