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=412
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The ``runs'' conjecture
Maxime Crochemore
,
Lucian Ilie
,
Liviu Tinta
Theoretical Computer Science
412
(27), 2011, pp. 2931-2941
An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
Manuel Domínguez
,
Thomas Noll
,
Marco Castrillón
Theoretical Computer Science
412
(27), 2011, pp. 2942-2954
Bounds for the generalized repetition threshold
Francesca Fiorenzi
,
Pascal Ochem
,
Elise Vaslet
Theoretical Computer Science
412
(27), 2011, pp. 2955-2963
A quick tour on suffix arrays and compressed suffix arrays
Roberto Grossi
Theoretical Computer Science
412
(27), 2011, pp. 2964-2973
On the axiomatizability of priority II
Luca Aceto
,
Taolue Chen
,
Anna Ingolfsdottir
,
Bas Luttik
,
Jaco van de Pol
Theoretical Computer Science
412
(28), 2011, pp. 3035-3044
SOS rule formats for zero and unit elements
Luca Aceto
,
Matteo Cimini
,
Anna Ingolfsdottir
,
MohammadReza Mousavi
,
Michel A. Reniers
Theoretical Computer Science
412
(28), 2011, pp. 3045-3071
Information hiding in probabilistic concurrent systems
Miguel E. Andrés
,
Catuscia Palamidessi
,
Peter van Rossum
,
Ana Sokolova
Theoretical Computer Science
412
(28), 2011, pp. 3072-3089
Unguardedness mostly means many solutions
Jos C.M. Baeten
,
Bas Luttik
Theoretical Computer Science
412
(28), 2011, pp. 3090-3100
Interface theories for concurrency and data
Sebastian S. Bauer
,
Rolf Hennicker
,
Martin Wirsing
Theoretical Computer Science
412
(28), 2011, pp. 3101-3121
A calculus for four-valued sequential logic
Jan A. Bergstra
,
Jaco van de Pol
Theoretical Computer Science
412
(28), 2011, pp. 3122-3128
A linear translation from CTL* to the first-order modal
\mu
-calculus
Sjoerd Cranen
,
Jan Friso Groote
,
Michel Reniers
Theoretical Computer Science
412
(28), 2011, pp. 3129-3139
On the algebra of structured specifications
Răzvan Diaconescu
,
Ionuţ Ţuţu
Theoretical Computer Science
412
(28), 2011, pp. 3145-3174
On equal
\mu
-terms
Jörg Endrullis
,
Clemens Grabmayer
,
Jan Willem Klop
,
Vincent van Oostrom
Theoretical Computer Science
412
(28), 2011, pp. 3175-3202
Lazy productivity via termination
Jörg Endrullis
,
Dimitri Hendriks
Theoretical Computer Science
412
(28), 2011, pp. 3203-3225
Derivation tree analysis for accelerated fixed-point computation
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Theoretical Computer Science
412
(28), 2011, pp. 3226-3241
The correctness of Newman's typability algorithm and some of its extensions
Herman Geuvers
,
Robbert Krebbers
Theoretical Computer Science
412
(28), 2011, pp. 3242-3261
Verification of mobile ad hoc networks: An algebraic approach
Fatemeh Ghassemi
,
Wan Fokkink
,
Ali Movaghar
Theoretical Computer Science
412
(28), 2011, pp. 3262-3282
Fixing Zeno gaps
Peter Höfner
,
Bernhard Möller
Theoretical Computer Science
412
(28), 2011, pp. 3303-3322
Dynamic FTSS in asynchronous systems: The case of unison
Swan Dubois
,
Maria Potop-Butucaru
,
Sébastien Tixeuil
Theoretical Computer Science
412
(29), 2011, pp. 3418-3439
An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
Jianxi Fan
,
Xiaohua Jia
,
Baolei Cheng
,
Jia Yu
Theoretical Computer Science
412
(29), 2011, pp. 3440-3450
Multiplication of polynomials modulo
\mbox x^n
Murat Cenk
,
Ferruh Özbudak
Theoretical Computer Science
412
(29), 2011, pp. 3451-3462
Recognisability for algebras of infinite trees
Achim Blumensath
Theoretical Computer Science
412
(29), 2011, pp. 3463-3486
An exact algorithm for minimum distortion embedding
Fedor V. Fomin
,
Daniel Lokshtanov
,
Saket Saurabh
Theoretical Computer Science
412
(29), 2011, pp. 3530-3536
Approximate string matching with stuck address bits
Amihood Amir
,
Estrella Eisenberg
,
Orgad Keller
,
Avivit Levy
,
Ely Porat
Theoretical Computer Science
412
(29), 2011, pp. 3537-3544
Testing permutation properties through subpermutations
Carlos Hoppen
,
Yoshiharu Kohayakawa
,
Carlos Gustavo Moreira
,
Rudini Menezes Sampaio
Theoretical Computer Science
412
(29), 2011, pp. 3555-3567
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>