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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of the evaluation of transient extensions of Boolean functions
Janusz Brzozowski
,
Baiyu Li
,
Yuli Ye
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 21-35
State-size hierarchy for finite-state complexity
Cristian S. Calude
,
Kai Salomaa
,
Tania K. Roblot
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 37-50
State complexity of two combined operations: Catenation-star and catenation-reversal
Bo Cui
,
Yuan Gao
,
Lila Kari
,
Sheng Yu
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 51-66
Formal descriptions of code properties: Decidability, complexity, implementation
Krystian Dudzinski
,
Stavros Konstantinidis
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 67-85
Ordinal automata and Cantor Normal Form
Zoltán Ésik
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 87-98
A comparison of the descriptional complexity of classes of limited Lindenmayer systems: Part I
Ronny Harbich
,
Bianca Truthe
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 99-114
The magic number problem for subregular language families
Markus Holzer
,
Sebastian Jakobi
,
Martin Kutrib
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 115-131
L-systems in geometric modeling
Przemyslaw Prusinkiewicz
,
Mitra Shirmohammadi
,
Faramarz Samavati
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 133-146
Model partitions and compact test case suites
Adilson Luiz Bonifacio
,
Arnaldo Vieira Moura
,
Adenilso Simao
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 147-172
Phase transitions of expspace-complete problems: A further step
Junping Zhou
,
Minghao Yin
,
Xiangtao Li
,
Jinyan Wang
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 173-184
Two-dimensional languages and cellular automata
Egor Dolzhenko
,
Natas̑a Jonoska
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 185-206
Product of Parikh matrices and commutativity
Kalpana Mahalingam
,
K.G. Subramanian
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 207-223
A parameterization process: From a functorial point of view
César Domínguez
,
Dominique Duval
International Journal of Foundations of Computer Science
23
(1), 2012, pp. 225-242
Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome
Costas S. Iliopoulos
,
Mirka Miller
,
Solon P. Pissis
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 249-259
Finding characteristic substrings from compressed texts
Shunsuke Inenaga
,
Hideo Bannai
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 261-280
On-line construction of a small automaton for a finite set of words
Maxime Crochemore
,
Laura Giambruno
,
Alessio Langiu
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 281-301
Asymptotic behaviour of the maximal number of squares in standard Sturmian words
Marcin Piatkowski
,
Wojciech Rytter
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 303-321
Pattern matching with swaps in practice
Matteo Campanelli
,
Domenico Cantone
,
Simone Faro
,
Emanuele Giaquinta
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 323-342
Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
Domenico Cantone
,
Simone Faro
,
Emanuele Giaquinta
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 343-356
Algorithms for jumbled pattern matching in strings
Péter Burcsi
,
Ferdinand Cicalese
,
Gabriele Fici
,
Zsuzsanna Liptaḱ
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 357-374
Constant-memory iterative generation of special strings representing binary trees
Sebastian Smyczyński
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 375-387
Crochemore's repetitions algorithm revisited: Computing runs
Frantisek Franek
,
Mei Jiang
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 389-401
Exact parallel alignment of megabase genomic sequences with tunable work distribution
Azzedine Boukerche
,
Rodolfo Bezerra Batista
,
Alba Cristina Magalhaes Alves de Melo
,
Felipe Brandt Scarel
,
Lavir Antonio Bahia Carvalho de Souza
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 407-429
Hybridization of genetic and quantum algorithm for gene selection and classification of microarray data
Allani Abderrahim
,
El-Ghazali Talbi
,
Mellouli Khaled
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 431-444
A parallel metaheuristic framework based on harmony search for scheduling in distributed computing systems
Young Choon Lee
,
Javid Taheri
,
Albert Y. Zomaya
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 445-464
Seiten 1
2
3
4
>