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=429
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vector team automata
Maurice H. ter Beek
,
Jetty Kleijn
Theoretical Computer Science
429
, 2012, pp. 21-29
On switching classes, NLC-width, cliquewidth and treewidth
Hans L. Bodlaender
,
Jurriaan Hage
Theoretical Computer Science
429
, 2012, pp. 30-35
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters
Paola Bonizzoni
,
Gianluca Della Vedova
,
Riccardo Dondi
Theoretical Computer Science
429
, 2012, pp. 36-45
A comparison of graph-theoretic DNA hybridization models
Robert Brijder
,
Joris J.M. Gillis
,
Jan Van den Bussche
Theoretical Computer Science
429
, 2012, pp. 46-53
Relativized codes
Mark Daley
,
Helmut Jürgensen
,
Lila Kari
,
Kalpana Mahalingam
Theoretical Computer Science
429
, 2012, pp. 54-64
Language theoretical properties of hairpin formations
Volker Diekert
,
Steffen Kopecki
Theoretical Computer Science
429
, 2012, pp. 65-73
Asynchronous P systems with active membranes
Pierluigi Frisco
,
Gordon Govan
,
Alberto Leporati
Theoretical Computer Science
429
, 2012, pp. 74-86
Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes
Karsten Gabriel
,
Hartmut Ehrig
Theoretical Computer Science
429
, 2012, pp. 87-97
State complexity of union and intersection of star on
k
regular languages
Yuan Gao
,
Lila Kari
,
Sheng Yu
Theoretical Computer Science
429
, 2012, pp. 98-107
Forbidding and enforcing on graphs
Daniela Genova
,
Natas̑a Jonoska
Theoretical Computer Science
429
, 2012, pp. 108-117
Multi-modal scenarios revisited: A net-based representation
David Harel
,
Amir Kantor
Theoretical Computer Science
429
, 2012, pp. 118-127
Square-free words obtained from prefixes by permutations
Tero Harju
Theoretical Computer Science
429
, 2012, pp. 128-133
On probabilistic and quantum reaction systems
Mika Hirvensalo
Theoretical Computer Science
429
, 2012, pp. 134-143
On the approximability and hardness of minimum topic connected overlay and its special instances
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Theoretical Computer Science
429
, 2012, pp. 144-154
On the containment and equivalence problems for two-way transducers
Oscar H. Ibarra
,
Hsu-Chun Yen
Theoretical Computer Science
429
, 2012, pp. 155-163
Algebraic structures of automata
Masami Ito
Theoretical Computer Science
429
, 2012, pp. 164-168
The sweep-line state space exploration method
Kurt Jensen
,
Lars M. Kristensen
,
Thomas Mailund
Theoretical Computer Science
429
, 2012, pp. 169-179
Universal pattern generation by cellular automata
Jarkko Kari
Theoretical Computer Science
429
, 2012, pp. 180-184
Localities in systems with a/sync communication
Jetty Kleijn
,
Maciej Koutny
Theoretical Computer Science
429
, 2012, pp. 185-192
Polynomial graph transformability
Hans-Jörg Kreowski
,
Sabine Kuske
Theoretical Computer Science
429
, 2012, pp. 193-201
Computation as an unbounded process
Jan van Leeuwen
,
Jiȓí Wiedermann
Theoretical Computer Science
429
, 2012, pp. 202-212
A distance between populations for one-point crossover in genetic algorithms
Luca Manzoni
,
Leonardo Vanneschi
,
Giancarlo Mauri
Theoretical Computer Science
429
, 2012, pp. 213-221
A linear ordering of a multi-parameter universe is usually nonsense
H. Maurer
Theoretical Computer Science
429
, 2012, pp. 222-226
Petri net languages revisited
Antoni Mazurkiewicz
Theoretical Computer Science
429
, 2012, pp. 227-235
Transfer of trust in event-based reputation systems
Mogens Nielsen
,
Karl Krukow
Theoretical Computer Science
429
, 2012, pp. 236-246
Seiten 1
2
>