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=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modular ranking abstraction
Ittai Balaban
,
Amir Pnueli
,
Lenore D. Zuck
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 5-44
Verifying very large industrial circuits using 100 processes and beyond
Limor Fix
,
Orna Grumberg
,
Amnon Heyman
,
Tamir Heyman
,
Assaf Schuster
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 45-61
Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems
Werner Damm
,
Guilherme Pinto
,
Stefan Ratschan
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 63-86
Reasoning about transfinite sequences
Stéphane Demri
,
David Nowak
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 87-112
Semi-automatic distributed synthesis
Sven Schewe
,
Bernd Finkbeiner
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 113-138
Update-efficient data structures for dynamic IP router tables
Tobias Lauer
,
Thomas Ottmann
,
Amitava Datta
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 139-161
Minimal cooperation in symport/antiport tissue P systems
Artiom Alhazov
,
Yurii Rogozhin
,
Sergey Verlan
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 163-179
The D0L
\omega
-equivalence problem
Juha Honkala
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 181-194
Graph orientation algorithms to minimize the maximum outdegree
Yuichi Asahiro
,
Eiji Miyano
,
Hirotaka Ono
,
Kouhei Zenmyo
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 197-215
On the approximability of maximum and minimum edge clique partition problems
Anders Dessmark
,
Jesper Jansson
,
Andrzej Lingas
,
Eva-Marta Lundell
,
Mia Persson
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 217-226
Un-Kleene Boolean equation solving
Brian Herlihy
,
Peter Schachte
,
Harald Sndergaard
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 227-250
On-demand bounded broadcast scheduling with tight deadlines
Chung Keung Poon
,
Feifeng Zheng
,
Yinfeng Xu
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 251-262
Fusing loopless algorithms for combinatorial generation
Tadao Takaoka
,
Stephen Violich
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 263-293
Update-efficient data structures for dynamic IP router tables
Tobias Lauer
,
Thomas Ottmann
,
Amitava Datta
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 295-317
Algorithms for
K
-disjoint maximum subarrays
Sung Eun Bae
,
Tadao Takaoka
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 319-339
Scheduling two-machine flow shops with exact delays
Joseph Y.-T. Leung
,
Haibing Li
,
Hairong Zhao
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 341-359
Shrinking restarting automata
Tomasz Jurdziński
,
Friedrich Otto
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 361-385
Binary amiable words
Adrian Atanasiu
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 387-400
Online and dynamic recognition of squarefree strings
Jesper Jansson
,
Zeshan Peng
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 401-414
On the power of deterministic and sequential communicating P systems
Ludȇk Cienciala
,
Lucie Ciencialová
,
Pierluigi Frisco
,
Petr Sosík
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 415-431
Spiking neural P systems: An early survey
Gheorghe Păun
,
Mario J. Pérez-Jiménez
,
Arto Salomaa
International Journal of Foundations of Computer Science
18
(3), 2007, pp. 435-455
Network decontamination in presence of local immunity
Fabrizio Luccio
,
Linda Pagli
,
Nicola Santoro
International Journal of Foundations of Computer Science
18
(3), 2007, pp. 457-474
Procedures for computing the maximum with DNA
Akihiro Fujiwara
,
Satoshi Kamio
,
Akiko Takehara
International Journal of Foundations of Computer Science
18
(3), 2007, pp. 475-493
Software diversity-based active replication as an approach for enhancing the performance of advanced simulation systems
Francesco Quaglia
International Journal of Foundations of Computer Science
18
(3), 2007, pp. 495-515
Efficient hardware algorithms for
n
choose
k
counters using the bitonic merger
Yasuaki Ito
,
Koji Nakano
,
Youhei Yamagishi
International Journal of Foundations of Computer Science
18
(3), 2007, pp. 517-528
Seiten 1
2
3
4
>