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
[1]
Hilfe
Suche: Journal=International Journal of Foundations of Computer Science AND Volume=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of satisfiability for fragments of CTL and CTL*
Arne Meier
,
Michael Thomas
,
Heribert Vollmer
,
Martin Mundhenk
International Journal of Foundations of Computer Science
20
(5), 2009, pp. 901-918
On uniformly recurrent morphic sequences
Francois Nicolas
,
Yuri Pritykin
International Journal of Foundations of Computer Science
20
(5), 2009, pp. 919-940
Multiprocessor interconnection networks with small tightness
Dragos̑ Cvetković
,
Tatjana Davidović
International Journal of Foundations of Computer Science
20
(5), 2009, pp. 941-963
Efficient variants of the backward-oracle-matching algorithm
Simone Faro
,
Thierry Lecroq
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 967-984
An adaptive hybrid pattern-matching algorithm on indeterminate strings
W.F. Smyth
,
Shu Wang
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 985-1004
Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
Paweƚ Baturo
,
Marcin Piatkowski
,
Wojciech Rytter
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1005-1023
In-place update of suffix array while recoding words
Matthias Gallé
,
Pierre Peterlongo
,
François Coste
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1025-1045
Edit distance with combinations and splits and its applications in OCR name matching
Manolis Christodoulakis
,
Gerhard Brey
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1047-1068
On regular expression hashing to reduce FA size
Wikus Coetser
,
Derrick G. Kourie
,
Bruce W. Watson
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1069-1086
New efficient bit-parallel algorithms for the
(\delta, \alpha)
-matching problem with applications in music information retrieval
Domenico Cantone
,
Salvatore Cristofaro
,
Simone Faro
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1087-1108
The virtual suffix tree
Jie Lin
,
Yue Jiang
,
Don Adjeroh
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1109-1133
Average value of sum of exponents of runs in a string
Kazuhiko Kusano
,
Wataru Matsubara
,
Akira Ishino
,
Ayumi Shinohara
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1135-1146
Preemptive scheduling algorithms with nested processing set restriction
Yumei Huo
,
Joseph Y.-T. Leung
,
Xin Wang
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 1147-1160
Seiten
<
1
2
3