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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On centralized parallel communicating grammar systems with context-sensitive components
Friedrich Otto
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 453-471
EMS1: An elegant algorithm for edit distance based motif search
Sudipta Pathak
,
Sanguthevar Rjasekaran
,
Marius Nicolae
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 473-486
Inductive complexity measures for mathematical problems
Mark Burgin
,
Cristian S. Calude
,
Elena Calude
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 487-500
A bridge between self-organizing networks and grammar systems theory
Katalin Anna Lázár
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 501-517
Minimization of planar directed acyclic graph algebras
Antonios Kalampakas
,
Olympia Louscou-Bozapalidou
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 519-531
New optimal frequency hopping sequence sets from balanced nested difference packings of partition-type
Han Cai
,
Xiangyong Zeng
,
Xiaohu Tang
,
Lei Hu
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 533-545
Research frontiers of membrane computing: Open problems and research topics
Marian Gheorghe
,
Gheorghe Pȃun
,
Mario J. Pérez-Jiménez
,
Grzegorz Rozenberg
International Journal of Foundations of Computer Science
24
(5), 2013, pp. 547-623
A novel efficient access control scheme for large-scale distributed wireless sensor networks
Ashok Kumar Das
,
Santanu Chatterjee
,
Jamuna Kanta Sing
International Journal of Foundations of Computer Science
24
(5), 2013, pp. 625-653
Popular spanning trees
Andreas Darmann
International Journal of Foundations of Computer Science
24
(5), 2013, pp. 655-677
An improved prefix-free regular-expression matching
Yo-Sub Han
International Journal of Foundations of Computer Science
24
(5), 2013, pp. 679-687
In search of most complex regular languages
Janusz Brzozowski
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 691-708
Weighted automata as coalgebras in categories of matrices
José N. Oliveira
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 709-728
Synchronizing quasi-Eulerian and quasi-one-cluster automata
Mikhail V. Berlinkov
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 729-745
Strict local testability with consensus equals regularity, and other properties
Stefano Crespi Reghizzi
,
Pierluigi San Pietro
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 747-763
P(l)aying for synchronization
F.M. Fominykh
,
P.V. Martyugin
,
M.V. Volkov
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 765-780
Automatic theorem-proving in combinatorics on words
Daniel Goc̑
,
Dane Henshall
,
Jeffrey Shallitt
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 781-798
How to synchronize the heads of a multitape automaton
Oscar H. Ibarra
,
Nicholas Q. Tran
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 799-813
Hyper-minimization for deterministic tree automata
Artur Jeż
,
Andreas Maletti
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 815-830
On the descriptional complexity of the window size for deleting restarting automata
Martin Kutrib
,
Friedrich Otto
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 831-846
On the disambiguation of finite automata and functional transducers
Mehryar Mohri
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 847-862
Restarting tiling automata
Daniel Pr ůs̑a
,
Frantis̑ek Mráz
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 863-878
Rational multi-secret sharing scheme in standard point-to-point communication networks
En Zhang
,
Yongquan Cai
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 879-897
A new upper bound for random
(2+p)
-SAT by flipping two variables
Guangyan Zhou
,
Zongsheng Gao
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 899-912
Self stabilization in distributed knot detection
Prabhu M. Santhosh
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 913-919
The super spanning connectivity and super spanning laceability of tori with faulty elements
Jing Li
,
Di Liu
,
Jun Yuan
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 921-939
Seiten
<
1
2
3
>