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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On alternating phrase-structure grammars
Etsuro Moriya
,
Friedrich Otto
International Journal of Foundations of Computer Science
21
(1), 2010, pp. 1-25
Approximation schemes for scheduling jobs with chain precedence constraints
Klaus Jansen
,
Roberto Solis-Oba
International Journal of Foundations of Computer Science
21
(1), 2010, pp. 27-49
An algorithm and applications to sequence alignment with weighted constraints
Yung-Hsing Peng
,
Chang-Biau Yang
,
Kuo-Tsung Tseng
,
Kuo-Si Huang
International Journal of Foundations of Computer Science
21
(1), 2010, pp. 51-59
Efficient testing of forecasts
Ching-Lueh Chang
,
Yuh-Dauh Lyuu
International Journal of Foundations of Computer Science
21
(1), 2010, pp. 61-72
Constructing multiple independent spanning trees on recursive circulant graphs
\mbox{G}(2^{\mbox{m}}, 2)
Jinn-Shyong Yang
,
Jou-Ming Chang
,
Shyue-Ming Tang
,
Yue-Li Wang
International Journal of Foundations of Computer Science
21
(1), 2010, pp. 73-90
Subword occurrences, Parikh matrices and Lyndon images
Arto Salomaa
,
Sheng Yu
International Journal of Foundations of Computer Science
21
(1), 2010, pp. 91-111
Complete SAT-based model checking for context-free processes
Geng-Dian Huang
,
Bow-Yaw Wang
International Journal of Foundations of Computer Science
21
(2), 2010, pp. 115-134
On the efficient computation of the minimal coverability set of Petri nets
Gilles Geeraerts
,
Jean-François Raskin
,
Laurent van Begin
International Journal of Foundations of Computer Science
21
(2), 2010, pp. 135-165
Latticed simulation relations and games
Orna Kupferman
,
Yoad Lustig
International Journal of Foundations of Computer Science
21
(2), 2010, pp. 167-189
Analog/mixed-signal circuit verification using models generated from simulation traces
Scott Little
,
David Walter
,
Kevin Jones
,
Chris Myers
,
Alper Sen
International Journal of Foundations of Computer Science
21
(2), 2010, pp. 191-210
Quantifying the discord: Order discrepancies in message sequence charts
Edith Elkind
,
Blaise Genest
,
Doron Peled
,
Paola Spoletini
International Journal of Foundations of Computer Science
21
(2), 2010, pp. 211-233
Continuous Petri nets: Expressive power and decidability issues
Laura Recalde
,
Serge Haddad
,
Manuel Silva
International Journal of Foundations of Computer Science
21
(2), 2010, pp. 235-256
Properties of quasi-relabeling tree bimorphisms
Andreas Maletti
,
Cătălin Ionuţ Tîrnăucă
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 257-276
The Stevens-Stirling-Algorithm for solving parity games locally requires exponential time
Oliver Friedmann
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 277-287
The complexity of model checking for Boolean formulas
Henning Schnoor
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 289-309
Computing the rupture degree in composite graphs
Aysun Aytac
,
Zeynep Nihan Odabas
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 311-319
Sets of
k
-independent strings
Yen-Wu Ti
,
Ching-Lueh Chang
,
Yuh-Dauh Lyuu
,
Alexander Shen
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 321-327
Incremental checkpoint schemes for Weibull failure distribution
Mihaela Paun
,
Nichamon Naksinehaboon
,
Raja Nassar
,
Chokchai Leangsuksun
,
Stephen L. Scott
,
Narate Taerat
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 329-344
Combinatorics of life and death for reaction systems
Andrzej Ehrenfeucht
,
Michael Main
,
Grzegorz Rozenberg
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 345-356
Minimizing total weighted earliness-tardiness on a single machine around a small common due date: An FPTAS using quadratic knapsack
Hans Kellerer
,
Vitaly A. Strusevich
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 357-383
On the performance and cost of some PRAM models on CMP hardware
Martti Forsell
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 387-404
Low-latency connected component labeling using an FPGA
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 405-425
The space complexity of leader election in anonymous networks
Ei Ando
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 427-440
Collapsing the hierarchy of parallel computational models
Stefan D. Bruda
,
Yuanqiao Zhang
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 441-457
A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
Sayaka Kamei
,
Hirotsugu Kakugawa
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 459-476
Seiten 1
2
3
>