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=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The continuum as a final coalgebra
D. Pavlović
,
V. Pratt
Theoretical Computer Science
280
(1-2), 2002, pp. 105-122
Coalgebra morphisms subsume open maps
Sƚawomir Lasota
Theoretical Computer Science
280
(1-2), 2002, pp. 123-135
Combining a monad and a comonad
John Power
,
Hiroshi Watanabe
Theoretical Computer Science
280
(1-2), 2002, pp. 137-162
Compositional SOS and beyond: A coalgebraic view of open systems
Andrea Corradini
,
Reiko Heckel
,
Ugo Montanari
Theoretical Computer Science
280
(1-2), 2002, pp. 163-192
Computer arithmetic and hardware: ``off the shelf'' microprocessors versus ``custom hardware''
Daniel Etiemble
Theoretical Computer Science
279
(1-2), 2002, pp. 3-27
A constructive algorithm for finding the exact roots of polynomials with computable real coefficients
David Lester
,
Scott Chambers
,
Heoi Lee Lu
Theoretical Computer Science
279
(1-2), 2002, pp. 51-64
Contracitvity of linear fractional transformations
Reinhold Heckmann
Theoretical Computer Science
279
(1-2), 2002, pp. 65-82
A lower bound for range enclosure in interval arithmetic
Peter Hertling
Theoretical Computer Science
279
(1-2), 2002, pp. 83-95
Cartesian logic
Peter Freyd
Theoretical Computer Science
278
(1-2), 2002, pp. 3-21
Fixpoint semantics for logic programming a survey
Melvin Fitting
Theoretical Computer Science
278
(1-2), 2002, pp. 25-51
A fully abstract denotational semantics for the
\pi
-calculus
Matthew Hennessy
Theoretical Computer Science
278
(1-2), 2002, pp. 53-89
Relative definability of Boolean functions via hypergraphs
Antonio Bucciarelli
,
Pasquale Malacaria
Theoretical Computer Science
278
(1-2), 2002, pp. 91-110
Polymorphic lambda calculus and subtyping
Adrian Fiech
,
David A. Schmidt
Theoretical Computer Science
278
(1-2), 2002, pp. 111-140
The essence of ideal completion in quantitative form
Robert C. Flagg
,
Philipp Sünderhauf
Theoretical Computer Science
278
(1-2), 2002, pp. 141-158
On the Yoneda completion of a quasi-metric space
H.P. Künzi
,
M.P. Schellekens
Theoretical Computer Science
278
(1-2), 2002, pp. 159-194
Resource traces: A domain for processes sharing exclusive resources
Paul Gastin
,
Dan Teodosiu
Theoretical Computer Science
278
(1-2), 2002, pp. 195-221
Truly concurrent constraint programming
V. Gupta
,
R. Jagadeesan
,
V.A. Saraswat
Theoretical Computer Science
278
(1-2), 2002, pp. 223-255
Lifting results for categories of algebras
P.S. Mulry
Theoretical Computer Science
278
(1-2), 2002, pp. 257-269
Soundness of data refinement for a higher-order imperative language
David A. Naumann
Theoretical Computer Science
278
(1-2), 2002, pp. 271-301
Fixpoint operators for domain equations
John Power
,
Giuseppe Rosolini
Theoretical Computer Science
278
(1-2), 2002, pp. 323-333
Set-sharing is redundant for pair-sharing
Roberto Bagnara
,
Patricia M. Hill
,
Enea Zaffanella
Theoretical Computer Science
277
(1-2), 2002, pp. 3-46
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Patrick Cousot
Theoretical Computer Science
277
(1-2), 2002, pp. 47-103
Satisfying subtype inequalities in polynomial space
Alexandre Frey
Theoretical Computer Science
277
(1-2), 2002, pp. 105-117
Polynomial ideals for sandpiles and their Gröbner bases
Robert Cori
,
Dominique Rossin
,
Bruno Salvy
Theoretical Computer Science
276
(1-2), 2002, pp. 1-15
Listing all potential maximal cliques of a graph
Vincent Bouchitté
,
Ioan Todinca
Theoretical Computer Science
276
(1-2), 2002, pp. 17-32
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>