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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cell/symbol complexity of tissue
P
systems with symport/antiport rules
Artiom Alhazov
,
Rudolf Freund
,
Marion Oswald
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 3-25
P
systems with reaction maps
Luca Bianco
,
Federico Fontana
,
Vincenzo Manca
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 27-48
An universality result for a (mem)brane calculus based on mate/drip operations
Luca Cardelli
,
Gheorghe Păun
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 49-68
Further results on time-free
P
systems
Matteo Cavaliere
,
Vincenzo Deufemia
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 69-89
On simulating a class of parallel architectures
Rodica Ceterchi
,
Mario J. Pérez-Jiménez
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 91-110
Mealy multiset automata
Gabriel Ciobanu
,
Mihai Gontineac
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 111-126
P
systems with input in binary form
Alberto Leporati
,
Claudio Zandron
,
Miguel A. Gutiérrez-Naranjo
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 127-146
Complexity of bio-computation: Symbolic dynamics in membrane systems
Michael Muskulus
,
Robert Brijder
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 147-165
Gandy's principles for mechanisms and membrane computing
Adam Obtuƚowicz
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 167-181
Dynamical probabilistic
P
systems
Dario Pescini
,
Daniela Besozzi
,
Giancarlo Mauri
,
Claudio Zandron
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 183-204
Further results on
P
systems with promoters/inhibitors
Dragoş Sburlan
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 205-221
Completeness and realizability: Conditions for automatic generation of workflows
Shiyong Lu
,
Arthur J. Bernstein
,
Philip M. Lewis
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 223-245
Erratum to ''Conditional inequalities and the shortest common superstring problem''
U. Laube
,
M. Weinard
International Journal of Foundations of Computer Science
17
(1), 2006, pp. 247-247
A data re-distribution library for multi-processor task programming
Thomas Rauber
,
Gudula Rünger
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 251-270
Routing multiple width communications on the circuit switched tree
Krishnendu Roy
,
Ramachandran Vaidyanathan
,
Jerry L. Trahan
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 271-285
Critical path scheduling parallel programs on an unbounded number of processors
Mourad Hakem
,
Franck Butelle
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 287-301
Scalable and efficient implementations of the LDPC decoder using reconfigurable models
Sharareh Babvey
,
Anu G. Bourgeois
,
José Alberto Fernández-Zepeda
,
Steven W. Mclaughlin
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 303-322
Self-stabilizing anonymous leader election in a tree
Zhenyu Xu
,
Pradip K. Srimani
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 323-335
Approximate block sorting
Meena Mahajan
,
Raghavan Rama
,
Venkatesh Raman
,
S. Vijaykumar
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 337-355
PAMA: A fast string matching algorithm
Shiyong Lu
,
Feng Cao
,
Yi Lu
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 357-378
Infix-free regular expressions and languages
Yo-Sub Han
,
Yajun Wang
,
Derick Wood
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 379-393
Decidability of the shape preserving property of bottom-up tree transducers
Zsolt Gazdag
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 395-413
The spanning connectivity of the
(n,k)
-star graphs
Hong-Chun Hsu
,
Cheng-Kuan Lin
,
Hua-Min Hung
,
Lih-Hsing Hsu
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 415-434
Transitivity in two-dimensional local languages defined by dot systems
Natas̑a Jonoska
,
Joni Burnette Pirnot
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 435-463
The base problem for D0L Parikh sets
Juha Honkala
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 465-473
Seiten 1
2
3
4
>