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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On higher Arthur-Merlin classes
Jin-Yi Cai
,
Denis Charles
,
A. Pavan
,
Samik Sengupta
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 3-19
Coloring algorithms on subcubic graphs
San Skulrattanakulchai
,
Harold N. Gabow
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 21-40
Word complexity and repetitions in words
Lucian Ilie
,
Sheng Yu
,
Kaizhong Zhang
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 41-55
Dictionary look-up within small edit distance
Abdullah N. Arslan
,
Ömer Eg̑eciog̑lu
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 57-71
Time and energy optimal list ranking algorithms on the
k
-channel broadcast communication model with no collision detection
Koji Nakano
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 73-88
On the minimal polynomial of a matrix
Thanh Minh Hoang
,
Thomas Thierauf
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 89-105
Analyzing vulnerabilities of critical infrastructures using flows and critical vertices in and/or graphs
Yvo Desmedt
,
Yongge Wang
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 107-125
On the
k
-truck scheduling problem
Weimin Ma
,
Yinfeng Xu
,
J. You
,
Jinhui Xu
,
Zhi-Dong Wang
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 127-141
Improved bounds on the number of automata accepting finite languages
Michael Domaratzki
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 143-161
Gem- and co-gem-free graphs have bounded clique-width
Andreas Brandstädt
,
Hoàng-Oanh Le
,
Raffaele Mosca
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 163-185
Multicasting and broadcasting in undirected WDM networks and QoS extentions of multicasting
Yinlong Xu
,
Li Lin
,
Guoliang Chen
,
Yingyu Wan
,
Weijun Guo
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 187-203
Single-pushout transformation of total algebras
Ricardo Alberich
,
Mercè Llabrés
,
Francesc Rosselló
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 205-222
A survey on algorithmic aspects of tandem repeats evolution
Eric Rivals
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 225-257
Words guaranteeing minimum image
S.W. Margolis
,
J.-E. Pin
,
M.V. Volkov
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 259-276
Matrix indicators for subword occurrences and ambiguity
Alexandru Mateescu
,
Arto Salomaa
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 277-292
On the palindromic complexity of infinite words
S. Brlek
,
S. Hamel
,
M. Nivat
,
C. Reutenauer
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 293-306
Conjectures and results on morphisms generating
k
-power-free words
Gwénaël Richomme
,
Patrice Séébold
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 307-316
Simultaneous avoidance of large squares and fractional powers in infinite binary words
Jeffrey Shallit
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 317-327
Episturmian words: Shifts, morphisms and numeration systems
Jacques Justin
,
Giuseppe Pirillo
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 329-348
Minimal Duval extensions
Tero Harju
,
Dirk Nowotka
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 349-354
Repetitions, fullness, and uniformity in two-dimensional words
Arturo Carpi
,
Aldo de Luca
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 355-383
Scheduling to minimize max flow time: Off-line and on-line algorithms
Monaldo Mastrolilli
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 385-401
Instance-specific solutions for accelerating the CKY parsing of large context-free grammars
Jacir L. Bordim
,
Oscar H. Ibarra
,
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 403-415
A proof procedure for temporal logic programming
Manolis Gergatsoulis
,
Christos Nomikos
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 417-443
Several generalizations of Shamir's secret sharing scheme
Chun-Pong Lai
,
Cunsheng Ding
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 445-458
Seiten 1
2
>