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=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructing optimal highways
Hee-Kap Ahn
,
Helmut Alt
,
Tetsuo Asano
,
Sang Won Bae
,
Peter Brass
,
Otfried Cheong
,
Christian Knauer
,
Hyeon-Suk Na
,
Chan-Su Shin
,
Alexander Wolff
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 3-23
Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation in graph classes
Heidi Gebauer
,
Yoshio Okamoto
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 25-44
A near-optimal broadcasting protocol for mobile video-on-demand
Regant Y.S. Hung
,
H.F. Ting
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 45-55
Termination of abstract reduction systems
Jeremy E. Dawson
,
Rajeev Goré
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 57-82
A universe of strictly positive families
Peter Morris
,
Thorsten Altenkirch
,
Neil Ghani
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 83-107
New extensions of pairing-based signatures into universal (multi) designated verifier signatures
Damien Vergnaud
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 109-133
On spanners of geometric graphs
Joachim Gudmundsson
,
Michiel Smid
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 135-149
On Parikh Matrices, ambiguity, and prints
Virgil Nicolae Şerbănuţă
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 151-165
Knowledge states for the caching problem in shared memory multiprocessor systems
Wolfgang Bein
,
Lawrence L. Larmore
,
Rüdiger Reischuk
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 167-183
On deterministic CD-systems of restarting automata
Hartmut Messerschmidt
,
Friedrich Otto
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 185-209
On Parikh Matrices
K.G. Subramanian
,
Ang Miin Huey
,
Atulya K. Nagar
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 211-219
Decomposition of weighted multioperator tree automata
Torsten Stüber
,
Heiko Vogler
,
Zoltán Fülöp
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 221-245
Single machine scheduling with controllable processing times by submodular optimization
Natalia V. Shakhlevich
,
Akiyoshi Shioura
,
Vitaly A. Strusevich
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 247-269
Reduction graphs from overlap graphs for gene assembly in ciliates
Robert Brijder
,
Hendrik Jan Hoogeboom
,
Grzegorz Rozenberg
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 271-291
Dynamically formed clusters of agents in ECO-grammar systems
Katalin Anna Lázár
,
Erzsébet Csuhaj-Varjú
,
András Lörincz
,
György Vaszil
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 293-311
Testing embeddability between metric spaces
Ching-Lueh Chang
,
Yuh-Dauh Lyuu
,
Yen-Wu Ti
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 313-329
On the terminating derivation mode in cooperating distributed grammar systems with forbidding components
Tomás̑ Masopust
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 331-340
A note on scheduling parallel unit jobs on hypercubes
Ondȓej Zajíc̑ek
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 341-349
A new convertible authenticated encryption scheme based on the ElGamal Cryptosystem
Cheng-Chi Lee
,
Min-Shiang Hwang
,
Shiang-Feng Tzeng
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 351-359
Geometric algorithms for the constrained 1-D
k
-means clustering problems and IMRT applications
Danny Z. Chen
,
Mark A. Healy
,
Chao Wang
,
Bin Xu
International Journal of Foundations of Computer Science
20
(2), 2009, pp. 361-377
Encodings of multisets
Gabriel Ciobanu
,
Mihai Gontineac
International Journal of Foundations of Computer Science
20
(3), 2009, pp. 381-393
Rewriting logic-based semantics of
P
systems and the maximal concurrency
Dorel Lucanu
International Journal of Foundations of Computer Science
20
(3), 2009, pp. 395-410
Register machine computations on binary numbers by oscillating and catalytic chemical reactions modelled using mass-action kinetics
Thomas Hinze
,
Raffael Fassler
,
Thorsten Lenser
,
Peter Dittrich
International Journal of Foundations of Computer Science
20
(3), 2009, pp. 411-426
Modular assembly of cell systems biology models using
P
systems
Francisco J. Romero-Campero
,
Jamie Twycross
,
Miguel Cámara
,
Malcolm Bennett
,
Marian Gheorghe
,
Natalio Krasnogor
International Journal of Foundations of Computer Science
20
(3), 2009, pp. 427-442
Analysis of complements in multi-exponentiation algorithms using signed digit representations
Clemens Heuberger
,
Helmut Prodinger
International Journal of Foundations of Computer Science
20
(3), 2009, pp. 443-453
Seiten 1
2
3
>