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=Inf.~Comput. AND Volume=207
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The three-color and two-color Tantrix\texttrademark rotation puzzle problems are
NP
-complete via parsimonious reductions
Dorothea Baumeister
,
Jörg Rothe
Information and Computation
207
(11), 2009, pp. 1119-1139
On input-revolving deterministic and nondeterministic finite automata
Suna Bensch
,
Henning Bordihn
,
Markus Holzer
,
Martin Kutrib
Information and Computation
207
(11), 2009, pp. 1140-1155
Automatic presentations for semigroups
Alan J. Cain
,
Graham Oliver
,
Nik Rus̑kuc
,
Richard M. Thomas
Information and Computation
207
(11), 2009, pp. 1156-1168
On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
Silvio Capobianco
Information and Computation
207
(11), 2009, pp. 1169-1180
Efficient inclusion checking for deterministic tree automata and XML schemas
Jérôme Champavére
,
Rémi Gilleron
,
Aurélien Lemay
,
Joachim Niehren
Information and Computation
207
(11), 2009, pp. 1181-1208
Minimality in template-guided recombination
Michael Domaratzki
Information and Computation
207
(11), 2009, pp. 1209-1220
Asymptotic behavior of the numbers of runs and microruns
Mathieu Giraud
Information and Computation
207
(11), 2009, pp. 1221-1228
On linear logic planning and concurrency
Ozan Kahramanoğulları
Information and Computation
207
(11), 2009, pp. 1229-1258
Match-bounds revisited
Martin Korp
,
Aart Middeldorp
Information and Computation
207
(11), 2009, pp. 1259-1283
Minimizing deterministic weighted tree automata
Andreas Maletti
Information and Computation
207
(11), 2009, pp. 1284-1299
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Martin Plátek
,
Friedrich Otto
,
Frantis̑ek Mráz
Information and Computation
207
(11), 2009, pp. 1300-1314
On periodicity of generalized two-dimensional infinite words
S.A. Puzynina
Information and Computation
207
(11), 2009, pp. 1315-1328
Rational subsets of polycyclic monoids and valence automata
Elaine Render
,
Mark Kambites
Information and Computation
207
(11), 2009, pp. 1329-1339
Variants of codes and indecomposable languages
Arto Salomaa
,
Kai Salomaa
,
Sheng Yu
Information and Computation
207
(11), 2009, pp. 1340-1349
On the round complexity of Byzantine agreement without initial set-up
Michael Okun
Information and Computation
207
(12), 2009, pp. 1351-1368
The lambda-context calculus (extended version)
Murdoch J. Gabbay
,
Stéphane Lengrand
Information and Computation
207
(12), 2009, pp. 1369-1400
Seiten
<
1
2
3