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=International Journal of Foundations of Computer Science AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal results for the computational completeness of gemmating (tissue)
P
systems
Rudolf Freund
,
Marion Oswald
,
Andrei Păun
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 929-942
Non-recursive trade-offs for two-way machines
Christos Kapoutsis
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 943-956
The phenomenon of non-recursive trade-offs
Martin Kutrib
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 957-973
Descriptional complexity of NFA of different ambiguity
Hing Leung
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 975-984
A characterization of the arithmetical hierarchy by language equations
Alexander Okhotin
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 985-998
Minimalizations of NFA using the universal automaton
Libor Polák
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 999-1010
On the descriptional complexity of metalinear
CD
grammar systems
Bettina Sunckel
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 1011-1025
Magic numbers for symmetric difference NFAs
Lynette van Zijl
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 1027-1038
Bond-free languages: Formalizations, maximality and construction methods
Lila Kari
,
Stavros Konstantinidis
,
Petr Sosík
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 1039-1070
Theoretical issues of searching aerial photographs: A bird's eye view
Amihood Amir
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1075-1097
Algorithms for the constrained longest common subsequence problems
Abdullah N. Arslan
,
Ömer Eğecioğlu
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1099-1109
A simple lossless compression heuristic for grey scale images
Luigi Cinque
,
Sergio de Agostino
,
Franco Liberati
,
Bart Westgeest
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1111-1119
BDD-based analysis of gapped
q
-gram filters
Marc Fontaine
,
Stefan Burkhardt
,
Juha Kärkkäinen
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1121-1134
Sorting suffixes of two-pattern strings
Frantisek Franek
,
W.F. Smyth
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1135-1144
A first approach to finding common motifs with gaps
Costas S. Iliopoulos
,
James Mchugh
,
Pierre Peterlongo
,
Nadia Pisanti
,
Wojciech Rytter
,
Marie-France Sagot
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1145-1154
A fully compressed pattern matching algorithm for simple collage systems
Shunsuke Inenaga
,
Ayumi Shinohara
,
Masayuki Takeda
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1155-1166
Semi-lossless text compression
Yair Kaufman
,
Shmuel T. Klein
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1167-1178
Combinatorial characterization of the language recognized by factor and suffix oracles
Alban Mancheron
,
Christophe Moan
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1179-1191
A framework for the dynamic implementation of finite automata for performance enhancement
Ernest Ketcha Ngassam
,
Bruce W. Watson
,
Derrick G. Kourie
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1193-1206
Arithmetic coding in parallel
Jan S̑upol
,
Boȓivoj Melichar
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1207-1217
Conditional inequalities and the shortest common superstring problem
Uli Laube
,
Maik Weinard
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1219-1230
Algorithms for approximate
k
k-covering of strings
Lili Zhang
,
F. Blanchet-Sadri
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1231-1251
Enumerating nondeterministic automata for a given language without constructing the canonical automaton
J.-M. Champarnaud
,
F. Coulon
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1253-1266
Completeness in differential approximation classes
Giorgio Ausiello
,
Cristina Bazgan
,
Marc Demange
,
Vangelis Th. Paschos
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1267-1295
Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games
N.V. Vinodchandran
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1297-1308
Seiten
<
1
2
3