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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covers from templates
A. Ehrenfeucht
,
G. Rozenberg
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 475-488
Membership and finiteness problems for rational sets of regular languages
Sergey Afonin
,
Elena Khazova
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 493-506
Collapsing words: A progress report
D.S. Ananichev
,
I.V. Petrov
,
M.V. Volkov
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 507-518
A Kleene theorem for languages of words indexed by linear orderings
Alexis Bès
,
Olivier Carton
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 519-541
Properties of the contour path of discrete sets
S. Brlek
,
G. Labelle
,
A. Lacasse
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 543-556
Combinatorial properties of Sturmian palindromes
Aldo de Luca
,
Alessandro de Luca
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 557-573
Multidimensional Sturmian sequences and generalized substitutions
Fernique Thomas
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 575-599
Unambiguous morphic images of strings
Dominik D. Freydenberger
,
Daniel Reidenbach
,
Johannes C. Schneider
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 601-628
Generalized LR parsing algorithm for Boolean grammars
Alexander Okhotin
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 629-664
On some properties of the language of 2-collapsing words
Elena V. Pribavkina
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 665-676
An efficient distributed algorithm for 3-edge-connectivity
Yung H. Tsin
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 677-701
Fast algorithms for comparison of similar unordered trees
Daiji Fukagawa
,
Tatsuya Akutsu
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 703-729
Molecular model checking
E. Allen Emerson
,
Kristina D. Hager
,
Jay H. Konieczka
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 733-741
Enforcing concurrent temporal behaviors
Doron Peled
,
Hongyang Qu
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 743-761
Controllability and cooperativeness analysis for automatic abstraction refinement
Freddy Y.C. Mang
,
Pei-Hsin Ho
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 763-774
SAT-based model checking for region automata
Fang Yu
,
Bow-Yaw Wang
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 775-795
Conflicts and fair testing
Robi Malik
,
David Streader
,
Steve Reeves
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 797-813
Exploiting symmetries for testing equivalence verification in the spi calculus
Ivan Cibrario Bertolotti
,
Luca Durante
,
Riccardo Sisto
,
Adriano Valenzano
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 815-832
A timed failure equivalence preserving abstraction for parametric time-interval automata
Akio Nakata
,
Tadaaki Tanimoto
,
Suguru Sasaki
,
Teruo Higashino
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 833-849
Büchi complementation made tighter
Ehud Friedgut
,
Orna Kupferman
,
Moshe Y. Vardi
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 851-867
Typeness for
\omega
-regular automata
Orna Kupferman
,
Gila Morgenstern
,
Aniello Murano
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 869-883
Hybrid system verification is not a sinecure - The Electronic Throttle Control case study
Ansgar Fehnker
,
Bruce Krogh
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 885-901
Algorithms for point set matching with
k
-differences
Tatsuya Akutsu
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 903-917
Quantum octal games
Sylvain Gravier
,
Philippe Jorrand
,
Mehdi Mhalla
,
Charles Payan
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 919-931
Sorting signed permutations by fixed-length reversals
Xingqin Qi
,
Guojun Li
,
Jichang Wu
,
Bingqiang Liu
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 933-948
Seiten
<
1
2
3
4
>