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=351
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Three concepts of decidability for general subsets of uncountable spaces
Matthew W. Parker
Theoretical Computer Science
351
(1), 2006, pp. 2-13
Stability versus speed in a computable algebraic model
Martin Ziegler
Theoretical Computer Science
351
(1), 2006, pp. 14-26
Divergence bounded computable real numbers
Xizhong Zheng
,
Dianchen Lu
,
Kejin Bao
Theoretical Computer Science
351
(1), 2006, pp. 27-38
A certified, corecursive implementation of exact real numbers
Alberto Ciaffaglione
,
Pietro Di Gianantonio
Theoretical Computer Science
351
(1), 2006, pp. 39-51
Computations with effective real numbers
Joris van der Hoeven
Theoretical Computer Science
351
(1), 2006, pp. 52-60
Admissible digit sets
Jesse Hughes
,
Milad Niqui
Theoretical Computer Science
351
(1), 2006, pp. 61-73
Implementing exact real arithmetic in python, C++ and C
Keith Briggs
Theoretical Computer Science
351
(1), 2006, pp. 74-81
Quadrature using 64-bit IEEE arithmetic for integrands over [0,1] with a singularity at 1
M. Hill
,
I. Robinson
Theoretical Computer Science
351
(1), 2006, pp. 82-100
Choosing starting values for certain Newton-Raphson iterations
Peter Kornerup
,
Jean-Michel Muller
Theoretical Computer Science
351
(1), 2006, pp. 101-110
The design of the Boost interval arithmetic library
Hervé Brönnimann
,
Guillaume Melquiond
,
Sylvain Pion
Theoretical Computer Science
351
(1), 2006, pp. 111-118
Using interval arithmetic to prove that a set is path-connected
Nicolas Delanoue
,
Luc Jaulin
,
Bertrand Cottenceau
Theoretical Computer Science
351
(1), 2006, pp. 119-128
State space reduction for process algebra specifications
Hubert Garavel
,
Wendelin Serwe
Theoretical Computer Science
351
(2), 2006, pp. 131-145
A language for configuring multi-level specifications
Gillian Hill
,
Steven Vickers
Theoretical Computer Science
351
(2), 2006, pp. 146-166
Formal design and verification of operational transformation algorithms for copies convergence
Abdessamad Imine
,
Michaël Rusinowitch
,
Gérald Oster
,
Pascal Molli
Theoretical Computer Science
351
(2), 2006, pp. 167-183
Specification and refinement of mobile systems in MTLA and mobile UML
Alexander Knapp
,
Stephan Merz
,
Martin Wirsing
,
Júlia Zappe
Theoretical Computer Science
351
(2), 2006, pp. 184-202
Modelling concurrent interactions
Juliana Küster-Filipe
Theoretical Computer Science
351
(2), 2006, pp. 203-220
Algebras of modal operators and partial correctness
Bernhard Möller
,
Georg Struth
Theoretical Computer Science
351
(2), 2006, pp. 221-239
Semantics of plan revision in intelligent agents
M. Birna van Riemsdijk
,
John-Jules Ch. Meyer
,
Frank S. de Boer
Theoretical Computer Science
351
(2), 2006, pp. 240-257
Extending separation logic with fixpoints and postponed substitution
Élodie-Jane Sims
Theoretical Computer Science
351
(2), 2006, pp. 258-275
Components as coalgebras: The refinement dimension
Sun Meng
,
Luis S. Barbosa
Theoretical Computer Science
351
(2), 2006, pp. 276-294
Compatibility of unrooted phylogenetic trees is FPT
David Bryant
,
Jens Lagergren
Theoretical Computer Science
351
(3), 2006, pp. 296-302
Simplifying the weft hierarchy
Jonathan F. Buss
,
Tarique Islam
Theoretical Computer Science
351
(3), 2006, pp. 303-313
On miniaturized problems in parameterized complexity theory
Yijia Chen
,
Jörg Flum
Theoretical Computer Science
351
(3), 2006, pp. 314-336
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Peter Damaschke
Theoretical Computer Science
351
(3), 2006, pp. 337-350
On finding short resolution refutations and small unsatisfiable subsets
Michael R. Fellows
,
Stefan Szeider
,
Graham Wrightson
Theoretical Computer Science
351
(3), 2006, pp. 351-359
Seiten 1
2
>