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 Volume=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The inclusion problem of context-free languages: Some tractable cases
Alberto Bertoni
,
Christian Choffrut
,
Roberto Radicioni
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 289-299
Closures in formal languages and Kuratowski's theorem
Janusz Brzozowski
,
Elyot Grant
,
Jeffrey Shallit
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 301-321
Powers of regular languages
Szilárd Zsolt Fazekas
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 323-330
Magic numbers and ternary alphabet
Galina Jirásková
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 331-344
Word equations with one unknown
Markku Laine
,
Wojciech Plandowski
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 345-375
On equations over sets of numbers and their limitations
Tommi Lehtinen
,
Alexander Okhotin
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 377-393
Simulations by time-bounded counter machines
Holger Petersen
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 395-409
Toward understanding the generative capacity of erasing rules in matrix grammars
Georg Zetzsche
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 411-426
A Kleene theorem for bisemigroup and binoid languages
Zsolt Gazdag
,
Zoltán L. Németh
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 427-446
Properties of pseudo-primitive words and their applications
Lila Kari
,
Benoît Masson
,
Shinnosuke Seki
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 447-471
Reduction tree of the binary generalized post correspondence problem
Vesa Halava
,
S̑tȇpá Holub
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 473-490
Algebraic linear orderings
S.L. Bloom
,
Z. Ésik
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 491-515
On the performance of static and dynamic location management strategies in mobile computing
Javid Taheri
,
Albert Y. Zomaya
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 519-546
Logic and arithmetic operations with a constant number of steps in membrane computing
Akihiro Fujiwara
,
Takeshi Tateishi
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 547-564
Bounds on the convergence time of distributed selfish bin packing
Flávio K. Miyazawa
,
André L. Vignatti
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 565-582
Graph orientation to maximize the minimum weighted outdegree
Yuichi Asahiro
,
Jesper Jansson
,
Eiji Miyano
,
Hirotaka Ono
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 583-601
Population size modeling for GA in time-critical task scheduling
Wei Sun
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 603-620
Resource allocation strategies for constructive in-network stream processing
Anne Benoit
,
Veronika Rehn-Sonigo
,
Yves Robert
,
Henri Casanova
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 621-638
Approximating the discrete resource sharing scheduling problem
Marin Bougeret
,
Pierre-François Dutot
,
Alfredo Goldman
,
Yanik Ngoko
,
Denis Trystram
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 639-656
Self-stabilizing
k
-out-of-
\ell
exclusion in tree networks
Ajoy K. Datta
,
Stéphane Devismes
,
Florian Horn
,
Lawrence L. Larmore
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 657-677
Uniform scattering of autonomous mobile robots in a grid
Lali Barrière
,
Paola Flocchini
,
Eduardo Mesa-Barrameda
,
Nicola Santoro
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 679-697
Binary morphisms with stable suffix complexity
S̑tȇpán Holub
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 699-712
Adaptive distributed mutual exclusion by dynamic topology switching
Sushanta Karmakar
,
Arobinda Gupta
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 713-737
A novel identity-based key-insulated convertible authenticated encryption scheme
Han-Yu Lin
,
Chien-Lung Hsu
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 739-756
Automatic verification of directory-based consistency protocols with graph constraints
Parosh Aziz Abdulla
,
Giorgio Delzanno
,
Ahmed Rezine
International Journal of Foundations of Computer Science
22
(4), 2011, pp. 761-782
Seiten
<
1
2
3
4
5
>