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=Theor.~Comput.~Sci. AND Volume=347
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Positive varieties of tree languages
Tatjana Petković
,
Saeed Salehi
Theoretical Computer Science
347
(1-2), 2005, pp. 1-35
Reconciling a gene tree to a species tree under the duplication cost model
Paola Bonizzoni
,
Gianluca Della Vedova
,
Riccardo Dondi
Theoretical Computer Science
347
(1-2), 2005, pp. 36-53
Additive sparse spanners for graphs with bounded length of largest induced cycle
Victor D. Chepoi
,
Feodor F. Dragan
,
Chenyu Yan
Theoretical Computer Science
347
(1-2), 2005, pp. 54-75
On the relationship between NLC-width and linear NLC-width
Frank Gurski
,
Egon Wanke
Theoretical Computer Science
347
(1-2), 2005, pp. 76-89
Resource bounded immunity and simplicity
Tomoyuki Yamakami
,
Toshio Suzuki
Theoretical Computer Science
347
(1-2), 2005, pp. 90-129
Efficient gossip and robust distributed computation
Chryssis Georgiou
,
Dariusz R. Kowalski
,
Alexander A. Shvartsman
Theoretical Computer Science
347
(1-2), 2005, pp. 130-166
Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars
Peter R.J. Asveld
Theoretical Computer Science
347
(1-2), 2005, pp. 167-190
Fuzzy context-free languages - Part 2: Recognition and parsing algorithms
Peter R.J. Asveld
Theoretical Computer Science
347
(1-2), 2005, pp. 191-213
On Floyd and Rivest's SELECT algorithm
Krzysztof C. Kiwiel
Theoretical Computer Science
347
(1-2), 2005, pp. 214-238
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Kimmo Fredriksson
,
Gonzalo Navarro
,
Esko Ukkonen
Theoretical Computer Science
347
(1-2), 2005, pp. 239-275
Linear deterministic multi bottom-up tree transducers
Zoltán Fülöp
,
Armin Kühnemann
,
Heiko Vogler
Theoretical Computer Science
347
(1-2), 2005, pp. 276-287
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
Zhaohui Liu
,
T.C. Edwin Cheng
Theoretical Computer Science
347
(1-2), 2005, pp. 288-298
There is no efficient reverse derivation mode for discrete derivatives
Éric Schost
Theoretical Computer Science
347
(1-2), 2005, pp. 299-305
Dependences related to strict binary relations
H.K. Hsiao
,
Y.T. Yeh
,
S.S. Yu
Theoretical Computer Science
347
(1-2), 2005, pp. 306-324
On converting CNF to DNF
Peter Bro Miltersen
,
Jaikumar Radhakrishnan
,
Ingo Wegener
Theoretical Computer Science
347
(1-2), 2005, pp. 325-335
Enumeration of
L
-convex polyominoes by rows and columns
G. Castiglione
,
A. Frosini
,
A. Restivo
,
S. Rinaldi
Theoretical Computer Science
347
(1-2), 2005, pp. 336-352
Cayley continuants
Emanuele Munarini
,
Damiano Torri
Theoretical Computer Science
347
(1-2), 2005, pp. 353-369
An introduction to periodical discrete sets from a tomographical perspective
Andrea Frosini
,
Maurice Nivat
,
Laurent Vuillon
Theoretical Computer Science
347
(1-2), 2005, pp. 370-392
Random generation of
Q
-convex sets
Sara Brunetti
,
Alain Daurat
Theoretical Computer Science
347
(1-2), 2005, pp. 393-414
A note on the circuit complexity of
PP
N.V. Vinodchandran
Theoretical Computer Science
347
(1-2), 2005, pp. 415-418
A characterization of periodicity of bi-infinite words
Tero Harju
,
Arto Lepistö
,
Dirk Nowotka
Theoretical Computer Science
347
(1-2), 2005, pp. 419-422
*-
\mu
-semirings and *-
\lambda
-semirings
Feng Feng
,
Xianzhong Zhao
,
Young Bae Jun
Theoretical Computer Science
347
(1-2), 2005, pp. 423-431
Some necessary clarifications about the chords' problem and the partial digest problem
A. Daurat
,
Y. Gérard
,
M. Nivat
Theoretical Computer Science
347
(1-2), 2005, pp. 432-436
Erratum to ''NFA reduction algorithms by means of regular inequalities''
J.-M. Champarnaud
,
F. Coulon
Theoretical Computer Science
347
(1-2), 2005, pp. 437-440
A structural approach to reversible computation
Samson Abramsky
Theoretical Computer Science
347
(3), 2005, pp. 441-464
Seiten 1
2
>