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=249
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
Bounding the bandwidts for graphs
Sanming Zhou
Theoretical Computer Science
249
(2), 2000, pp. 357-368