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.
Towards more efficient infection and fire fighting
Peter Floderus
,
Andrzej Lingas
,
Mia Persson
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 3-14
Energy-efficient threshold circuits computing MOD functions
Akira Suzuki
,
Kei Uchizawa
,
Xiao Zhou
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 15-29
Tight analysis of shortest path convergecast in wireless sensor networks
John Augustine
,
Qi Han
,
Philip Loden
,
Sachin Lodha
,
Sasanka Roy
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 31-50
Minimum mosaic inference of a set of recombinants
Guillaume Blin
,
Romeo Rizzi
,
Florian Sikora
,
Stephane Vialette
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 51-66
A unified framework for bi(tri)connectivity and chordal augmentation
N.S. Narayanaswamy
,
N. Sadagopan
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 67-93
(1,2)-Hamiltonian completion on a matching
Marcin Bienkowski
,
Paweƚ Zalewski
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 95-108
A technique for exact computation of precoloring extension on interval graphs
Martin R. Ehmsen
,
Kim S. Larsen
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 109-122
Decidability of uniform recurrence of morphic sequences
Fabien Durand
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 123-146
Functional constructions between reaction systems and propositional logic
Arto Salomaa
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 147-159
The complexity of coverage
Krishnendu Chatterjee
,
Luca de Alfaro
,
Rupak Majumdar
International Journal of Foundations of Computer Science
24
(2), 2013, pp. 165-185
Monotonic abstraction for programs with multiply-linked structures
Parosh Aziz Abdulla
,
Jonathan Cederberg
,
Tomás̑ Vojnar
International Journal of Foundations of Computer Science
24
(2), 2013, pp. 187-210
Automated termination in model-checking modulo theories
Alessandro Carioni
,
Silvio Ghilardi
,
Silvio Ranise
International Journal of Foundations of Computer Science
24
(2), 2013, pp. 211-232
Parametric verification and test coverage for hybrid automata using the inverse method
Laurent Fribourg
,
Ulrich Kühne
International Journal of Foundations of Computer Science
24
(2), 2013, pp. 233-249
Lower bounds for the length of reset words in Eulerian automata
Vladimir V. Gusev
International Journal of Foundations of Computer Science
24
(2), 2013, pp. 251-262
An efficient fully symbolic bisimulation algorithm for non-deterministic systems
Malcolm Mumme
,
Gianfranco Ciardo
International Journal of Foundations of Computer Science
24
(2), 2013, pp. 263-282
Reachability for finite-state process algebras using Horn clauses
Nataliya Skrypnyuk
,
Flemming Nielson
International Journal of Foundations of Computer Science
24
(2), 2013, pp. 283-302
Neighbor integrity of transformation graphs
Goksen Bacak-Turan
,
Alpay Kirlangic
International Journal of Foundations of Computer Science
24
(3), 2013, pp. 303-317
A note on limited pushdown alphabets in stateless deterministic pushdown automata
Tomás̑ Masopust
International Journal of Foundations of Computer Science
24
(3), 2013, pp. 319-328
A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem
Javad Akbari Torkestani
International Journal of Foundations of Computer Science
24
(3), 2013, pp. 329-348
From computing to interaction: On the expressiveness of asynchronous pi-calculus
Houguang Yue
International Journal of Foundations of Computer Science
24
(3), 2013, pp. 349-373
On coverings of products of rough transformation semigroups
S.P. Tiwari
,
Shambhu Sharan
,
Anupam K. Singh
International Journal of Foundations of Computer Science
24
(3), 2013, pp. 375-391
Two-dimensional digitized picture arrays and Parikh matrices
K.G. Subramanian
,
Kalpana Mahalingam
,
Rosni Abdullah
,
Atulya K. Nagar
International Journal of Foundations of Computer Science
24
(3), 2013, pp. 393-408
Constructing odd variable Boolean functions with optimal algebraic immunity
Ziran Tu
,
Yupeng Jiang
,
Xiangyong Zeng
International Journal of Foundations of Computer Science
24
(3), 2013, pp. 409-417
Assume-guarantee reasoning with local specifications
Alessio Lomuscio
,
Ben Strulo
,
Nigel Walker
,
Peng Wu
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 419-444
A note on the decidability of subword inequalities
Szilárd Zsolt Fazekas
,
Robert Mercaş
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 445-452
Seiten 1
2
3
>