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 YEAR=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Machine semantics
Peter Hines
Theoretical Computer Science
409
(1), 2008, pp. 1-23
Verification of qualitative
\mathbb{Z}
constraints
Stéphane Demri
,
Régis Gascon
Theoretical Computer Science
409
(1), 2008, pp. 24-40
Optimization techniques for propositional intuitionistic logic and their implementation
Alessandro Avellone
,
Guido Fiorino
,
Ugo Moscato
Theoretical Computer Science
409
(1), 2008, pp. 41-58
Responsiveness in process calculi
Lucia Acciai
,
Michele Boreale
Theoretical Computer Science
409
(1), 2008, pp. 59-93
The identity type weak factorisation system
Nicola Gambino
,
Richard Garner
Theoretical Computer Science
409
(1), 2008, pp. 94-109
The expressive power of valued constraints: Hierarchies and collapses
David A. Cohen
,
Peter G. Jeavons
,
Stanislav Z̑ivný
Theoretical Computer Science
409
(1), 2008, pp. 137-153
Computations with quasiseparable polynomials and matrices
T. Bella
,
Y. Eidelman
,
I. Gohberg
,
V. Olshevsky
Theoretical Computer Science
409
(2), 2008, pp. 158-179
A new algorithm for sparse interpolation of multivariate polynomials
Annie Cuyt
,
Wen-shin Lee
Theoretical Computer Science
409
(2), 2008, pp. 180-185
Real algebraic numbers and polynomial systems of small degree
Ioannis Z. Emiris
,
Elias P. Tsigaridas
Theoretical Computer Science
409
(2), 2008, pp. 186-199
Approximate GCDs of polynomials and sparse SOS relaxations
Bin Li
,
Jiawang Nie
,
Lihong Zhi
Theoretical Computer Science
409
(2), 2008, pp. 200-210
A fast Hermite transform
Gregory Leibon
,
Daniel N. Rockmore
,
Wooram Park
,
Robert Taintor
,
Gregory S. Chirikjian
Theoretical Computer Science
409
(2), 2008, pp. 211-228
Rectangular polyomino set weak (1, 2)-achievement games
Edgar Fisher
,
Nándor Sieben
Theoretical Computer Science
409
(3), 2008, pp. 333-340
Games to induce specified equilibria
Antoniy Ganchev
,
Lata Narayanan
,
Sunil Shende
Theoretical Computer Science
409
(3), 2008, pp. 341-350
Sequential vector packing
Mark Cieliebak
,
Alexander Hall
,
Riko Jacob
,
Marc Nunkesser
Theoretical Computer Science
409
(3), 2008, pp. 351-363
Complexity of question/answer games
Sarmad Abbasi
,
Numan Sheikh
Theoretical Computer Science
409
(3), 2008, pp. 364-381
The pruning-grafting lattice of binary trees
J.L. Baril
,
J.M. Pallo
Theoretical Computer Science
409
(3), 2008, pp. 382-393
Algorithms for subsequence combinatorics
Cees Elzinga
,
Sven Rahmann
,
Hui Wang
Theoretical Computer Science
409
(3), 2008, pp. 394-404
Simulating one-reversal multicounter machines by partially blind multihead finite automata
Alan Deckelbaum
Theoretical Computer Science
409
(3), 2008, pp. 411-416
Minimum-cost delegation in service composition
Cagdas E. Gerede
,
Oscar H. Ibarra
,
Bala Ravikumar
,
Jianwen Su
Theoretical Computer Science
409
(3), 2008, pp. 417-431
Long binary patterns are Abelian 2-avoidable
James D. Currie
,
Terry I. Visentin
Theoretical Computer Science
409
(3), 2008, pp. 432-437
Generalized LCS
Amihood Amir
,
Tzvika Hartman
,
Oren Kapah
,
B. Riva Shalom
,
Dekel Tsur
Theoretical Computer Science
409
(3), 2008, pp. 438-449
A palindromization map for the free group
Christian Kassel
,
Christophe Reutenauer
Theoretical Computer Science
409
(3), 2008, pp. 461-470
Expanders and time-restricted branching programs
Stasys Jukna
Theoretical Computer Science
409
(3), 2008, pp. 471-476
Fast and compact regular expression matching
Philip Bille
,
Martin Farach-Colton
Theoretical Computer Science
409
(3), 2008, pp. 486-496
Paths and trails in edge-colored graphs
A. Abouelaoualim
,
K.Ch. Das
,
L. Faria
,
Y. Manoussakis
,
C. Martinhon
,
R. Saad
Theoretical Computer Science
409
(3), 2008, pp. 497-510
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>