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=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On counter machines, reachability problems, and diophantine equations
Oscar H. Ibarra
,
Zhe Dang
,
Linmin Yang
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 919-934
Reachability problems in low-dimensional iterative maps
Oleksiy Kurganskyy
,
Igor Potapov
,
Fernando Sancho-Caparrini
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 935-951
Reachability analysis in verification via supercompilation
Alexei Lisitsa
,
Andrei P. Nemytykh
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 953-969
The finite tiling problem is undecidable in the hyperbolic plane
Maurice Margenstern
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 971-982
An alternative construction in symbolic reachability analysis of second order pushdown systems
Anil Seth
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 983-998
Decidability and complexity analysis of forbidden state problems for discrete event systems
Hsu-Chun Yen
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 999-1013
A minimum-process coordinated checkpointing protocol for mobile computing systems
Sunil Kumar Gupta
,
R.K. Chauhan
,
Parveen Kumar
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 1015-1038
On inequalities between subword histories
Szilárd Zsolt Fazekas
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 1039-1047
Intruder capturing in mesh and torus networks
N. Imani
,
H. Sarbazi-Azad
,
A. Zomaya
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 1049-1071
Properties and construction of unique maximal factorization families for strings
David E. Daykin
,
Jacqueline W. Daykin
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 1073-1084
Computation by annotation: Modelling epigenetic regulation
Franziska Biegler
,
Mark Daley
,
M. Elizabeth O. Locke
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1087-1098
State complexity of the subword closure operation with applications to DNA coding
Cezar Câmpeanu
,
Stavros Konstantinidis
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1099-1112
On the descriptional complexity of accepting networks of evolutionary processors with filtered connections
Cezara Drăgoi
,
Florin Manea
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1113-1132
Gene assembly models and Boolean circuits
Tseren-Onolt Ishdorj
,
Ion Petre
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1133-1145
Discrete nondeterministic modeling of the Fas pathway
John Jack
,
Alfonso Rodríguez-Patón
,
Oscar H. Ibarra
,
Andrei Păun
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1147-1162
Watson-Crick bordered words and their syntactic monoid
Lila Kari
,
Kalpana Mahalingam
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1163-1179
How to synchronize the activity of all components of a
P
system?
Francesco Bernardini
,
Marian Gheorghe
,
Maurice Margenstern
,
Sergey Verlan
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1183-1198
A logical characterization of robustness, mutants and species in colonies of agents
Radu Mardare
,
Matteo Cavaliere
,
Sean Sedwards
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1199-1221
Extended spiking neural
P
systems with decaying spikes and/or total spiking
Rudolf Freund
,
Mihai Ionescu
,
Marion Oswald
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1223-1234
On a characterization of cellular automata in tilings of the hyperbolic plane
Maurice Margenstern
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1235-1257
On stateless automata and
P
systems
Linmin Yang
,
Zhe Dang
,
Oscar H. Ibarra
International Journal of Foundations of Computer Science
19
(5), 2008, pp. 1259-1276
On achieving the shortest-path routing in 2-D meshes
Zhen Jiang
,
Jie Wu
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1279-1297
Implementing Hirschberg's PRAM-Algorithm for connected components on a global cellular automaton
Johannes Jendrsczok
,
Rolf Hoffmann
,
Jörg Keller
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1299-1316
Revisiting matrix product on master-worker platforms
Jack Dongarra
,
Jean-François Pineau
,
Yves Robert
,
Zhiao Shi
,
Frédéric Vivien
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1317-1336
Simulating an
R
-mesh on an
LR
-mesh in constant time
José Alberto Fernández-Zepeda
,
Carlos Alberto Córdova-Flores
,
Anu G. Bourgeois
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1337-1354
Seiten
<
1
2
3
4
>