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=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flipping letters to minimize the support of a string
Giuseppe Lancia
,
Franca Rinaldi
,
Romeo Rizzi
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 5-17
A Markovian approach for the analysis of the gene structure
Christelle Melodelima
,
Laurent Gueguen
,
Christian Gautier
,
Didier Piau
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 19-35
Identifying rhythms in musical texts
Manolis Christodoulakis
,
Costas S. Iliopoulos
,
M. Sohel Rahman
,
William F. Smyth
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 37-51
On implementation and performance of table-driven DFA-based string processors
Ernest Ketcha Ngassam
,
Derrick G. Kourie
,
Bruce W. Watson
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 53-70
Indexing gapped-factors using a tree
Pierre Peterlongo
,
Julien Allali
,
Marie-France Sagot
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 71-87
Using alignment for multilingual text compression
Ehud S. Conley
,
Shmuel T. Klein
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 89-101
On some combinatorial problems concerning the harmonic structure of musical chord sequences
Domenico Cantone
,
Salvatore Cristofaro
,
Simone Faro
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 103-124
A concurrent specification of Brzozowski's DFA construction algorithm
Tinus Strauss
,
Derrick G. Kourie
,
Bruce W. Watson
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 125-135
Modeling delta encoding of compressed files
Shmuel T. Klein
,
Tamar C. Serebro
,
Dana Shapira
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 137-146
Reachability on suffix tree graphs
Yasuto Higa
,
Hideo Bannai
,
Shunsuke Inenaga
,
Masayuki Takeda
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 147-162
Efficient algorithms for
(\delta,\gamma,\alpha)
and
(\delta, k_{\Delta}, \alpha)
-matching
Kimmo Fredriksson
,
Szymon Grabowski
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 163-183
Efficient automata constructions and approximate automata
Bruce W. Watson
,
Derrick G. Kourie
,
Tinus Strauss
,
Ernest Ketcha
,
Loek Cleophas
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 185-193
An asymptotic lower bound for the maximal number of runs in a string
Frantisek Franek
,
Qian Yang
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 195-203
A normal form for first-order logic over doubly-linked data structures
Steven Lindell
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 205-217
On the computation of the relative entropy of probabilistic automata
Corinna Cortes
,
Mehryar Mohri
,
Ashish Rastogi
,
Michael Riley
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 219-242
On subword symmetry of words
Anton C̑erný
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 243-250
Fast factorization by similarity of fuzzy concept lattices with hedges
Radim Bȇlohlávek
,
Jan Outrata
,
Vilem Vychodil
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 255-269
Succinct minimal generators: Theoretical foundations and applications
Tarek Hamrouni
,
Sadok Ben Yahia
,
Engelbert Mephu Nguifo
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 271-296
Basic algorithm for attribute implications and functional dependencies in graded setting
Radim Bȇlohlávek
,
Vilem Vychodil
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 297-317
A parameterized algorithm to explore formal contexts with a taxonomy
Peggy Cellier
,
Sébastien Ferré
,
Olivier Ridoux
,
Mireille Ducassé
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 319-343
Adjusting annotated taxonomies
Tim B. Kaiser
,
Stefan E. Schmidt
,
Cliff A. Joslyn
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 345-358
An intelligent User Interface for browsing and searching MPEG-7 images using concept lattices
Jon Ducrou
,
Peter Eklund
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 359-381
On succinct representation of knowledge community taxonomies with formal concept analysis
Camille Roth
,
Sergei Obiedkov
,
Derrick G. Kourie
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 383-404
Variations of base-station placement problem on the boundary of a convex region
Gautam K. Das
,
Sasanka Roy
,
Sandip Das
,
Subhas C. Nandy
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 405-427
Automatic service composition via simulation
Daniela Berardi
,
Fahima Cheikh
,
Giuseppe De Giacomo
,
Fabio Patrizi
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 429-451
Seiten 1
2
3
4
>