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=409
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
CPO semantics of timed interactive actor networks
Xiaojun Liu
,
Edward A. Lee
Theoretical Computer Science
409
(1), 2008, pp. 110-125
The computable kernel of Abstract State Machines
W. Reisig
Theoretical Computer Science
409
(1), 2008, pp. 126-136
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
Stable normal forms for polynomial system solving
Bernard Mourrain
,
Philippe Trébuchet
Theoretical Computer Science
409
(2), 2008, pp. 229-240
Gravitational wave signal templates, pattern recognition, and reciprocal Eulerian gamma functions
Marc Eric Normandin
,
Adam Vajda
,
Sree Ram Valluri
Theoretical Computer Science
409
(2), 2008, pp. 241-254
Schur aggregation for linear systems and determinants
V.Y. Pan
,
D. Grady
,
B. Murphy
,
G. Qian
,
R.E. Rosholt
,
A.D. Ruslanov
Theoretical Computer Science
409
(2), 2008, pp. 255-268
Computing sum of squares decompositions with rational coefficients
Helfried Peyrl
,
Pablo A. Parrilo
Theoretical Computer Science
409
(2), 2008, pp. 269-281
The nearest polynomial with a zero in a given domain
Hiroshi Sekigawa
Theoretical Computer Science
409
(2), 2008, pp. 282-291
Complexity of real root isolation using continued fractions
Vikram Sharma
Theoretical Computer Science
409
(2), 2008, pp. 292-310
A new Gröbner basis conversion method based on stabilization techniques
Kiyoshi Shirayanagi
,
Hiroshi Sekigawa
Theoretical Computer Science
409
(2), 2008, pp. 311-317
A numerical elimination method for polynomial computations
Zhonggang Zeng
Theoretical Computer Science
409
(3), 2008, pp. 318-331
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
Seiten 1
2
>