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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Universal coalgebra: A theory of systems
J.J.M.M. Rutten
Theoretical Computer Science
249
(1), 2000, pp. 3-80
From computation to foundations via functions and application: The
\lambda
-calculus and its webbed models
Chantal Berline
Theoretical Computer Science
249
(1), 2000, pp. 81-161
An application of lattice theory to knowledge representation
Frank J. Oles
Theoretical Computer Science
249
(1), 2000, pp. 163-196
On the algebraic models of lambda calculus
Antonino Salibra
Theoretical Computer Science
249
(1), 2000, pp. 197-240
Complexity-theoretic models of phase transitions in search problems
Paul E. Dunne
,
Alan Gibbons
,
Michele Zito
Theoretical Computer Science
249
(2), 2000, pp. 243-263
Recent results and questions in combinatorial game complexity
Aviezri S. Fraenkel
Theoretical Computer Science
249
(2), 2000, pp. 265-288
Repetitions in Sturmian strings
Frantis̑ek Franȇk
,
Ayşe Karaman
,
W.F. Smyth
Theoretical Computer Science
249
(2), 2000, pp. 289-303
Approximate string matching using factor automata
Jan Holub
,
Boȓivoj Milichar
Theoretical Computer Science
249
(2), 2000, pp. 305-311
Normal forms of quasiperiodic strings
Laurent Mouchard
Theoretical Computer Science
249
(2), 2000, pp. 313-324
Dense edge-disjoint embedding of complete binary trees in interconnection networks
S. Ravindran
,
A.M. Gibbons
,
M.S. Paterson
Theoretical Computer Science
249
(2), 2000, pp. 325-342
Repetitive perhaps, but certainly not boring
W.F. Smyth
Theoretical Computer Science
249
(2), 2000, pp. 343-355
Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
Luke Hornof
,
Jacques Noyé
Theoretical Computer Science
248
(1-2), 2000, pp. 3-27
Interconvertibility of a class of set constraints and context-free-language reachability
David Melski
,
Thomas Reps
Theoretical Computer Science
248
(1-2), 2000, pp. 29-98
Extending a partial evaluator which supports separate compilation
Rogardt Heldal
,
John Hughes
Theoretical Computer Science
248
(1-2), 2000, pp. 99-145
DyC: An expressive annotation-directed dynamic compiler for
C
Brian Grant
,
Markus Mock
,
Matthai Philipose
,
Craig Chambers
,
Susan J. Eggers
Theoretical Computer Science
248
(1-2), 2000, pp. 147-199
Accurate program analyses for successful specialization of legacy system software
Gilles Muller
,
Renaud Marlet
,
Eugen-Nicolae Volanschi
Theoretical Computer Science
248
(1-2), 2000, pp. 201-210
MetaML and multi-stage programming with explicit annotations
Walid Taha
,
Tim Sheard
Theoretical Computer Science
248
(1-2), 2000, pp. 211-242
Lambda-dropping: Transforming recursive equations into programs with block structure
Olivier Danvy
,
Ulrik P. Schultz
Theoretical Computer Science
248
(1-2), 2000, pp. 243-287
Asynchronous cellular automata for pomsets
Manfred Droste
,
Paul Gastin
,
Dietrich Kuske
Theoretical Computer Science
247
(1-2), 2000, pp. 1-38
Parallel and serial hypercoherences
Thomas Ehrhard
Theoretical Computer Science
247
(1-2), 2000, pp. 39-81
Interaction nets for linear logic
Ian Mackie
Theoretical Computer Science
247
(1-2), 2000, pp. 83-140
Detecting equivalence of modular specifications with categorical diagrams
Catherine Oriat
Theoretical Computer Science
247
(1-2), 2000, pp. 141-190
Some first-order probability logics
Zoran Ognjanovic
,
Miodrag Ras̑kovic
Theoretical Computer Science
247
(1-2), 2000, pp. 191-212
On the total
_k
-diameter of connection networks
Yefim Dinitz
,
Tamar Eilam
,
Shlomo Moran
,
Shmuel Zaks
Theoretical Computer Science
247
(1-2), 2000, pp. 213-228
Domain representations of topological spaces
Jens Blanck
Theoretical Computer Science
247
(1-2), 2000, pp. 229-255
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>