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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the construction of stable models of untyped
\lambda
-calculus
Rainer Kerth
Theoretical Computer Science
269
(1-2), 2001, pp. 23-46
On the semantics of durational actions
Flavio Corradini
,
GianLuigi Ferrari
,
Marco Pistore
Theoretical Computer Science
269
(1-2), 2001, pp. 47-82
Explicit substitutions for pi-congruences
Paola Quaglia
Theoretical Computer Science
269
(1-2), 2001, pp. 83-134
Towards a practical snapshot algorithm
Yaron Riany
,
Nir Shavit
,
Dan Touitou
Theoretical Computer Science
269
(1-2), 2001, pp. 163-201
Non-regular iterators in process algebra
Jan A. Bergstra
,
Alban Ponse
Theoretical Computer Science
269
(1-2), 2001, pp. 203-229
Wadge hierarchy of omega context-free languages
Olivier Finkel
Theoretical Computer Science
269
(1-2), 2001, pp. 283-315
Weak normalization implies strong normalization in a class of non-dependent pure type systems
Gilles Barthe
,
John Hatcliff
,
Morten Heine Srensen
Theoretical Computer Science
269
(1-2), 2001, pp. 317-361
A declarative framework for object-oriented programming with genetic inheritance
Joaquín Mateos Lago
,
Mario Rodrígues Artalejo
Theoretical Computer Science
269
(1-2), 2001, pp. 363-417
Operators on classes of coalgebras
Dragan Mas̑ulović
,
Boz̑a Tasić
Theoretical Computer Science
269
(1-2), 2001, pp. 419-431
Derivation lengths and order types of Knuth-Bendix orders
Ingo Lepper
Theoretical Computer Science
269
(1-2), 2001, pp. 433-450
Cylindric structures and dependencies in relational databases
Ivo Düntsch
,
Szabolcs Mikulás
Theoretical Computer Science
269
(1-2), 2001, pp. 451-468
Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
Michel Rigo
Theoretical Computer Science
269
(1-2), 2001, pp. 469-498
A new lower bound for the list update problem in the partial cost model
Christoph Ambühl
,
Bernd Gärtner
,
Bernhard von Stengel
Theoretical Computer Science
268
(1), 2001, pp. 3-16
On-line bin-stretching
Yossi Azar
,
Oded Regev
Theoretical Computer Science
268
(1), 2001, pp. 17-41
On page migration and other relaxed task systems
Yair Bartal
,
Moses Charikar
,
Piotr Indyk
Theoretical Computer Science
268
(1), 2001, pp. 43-66
On-line scheduling of parallel jobs with runtime restrictions
Stefan Bischof
,
Ernst W. Mayr
Theoretical Computer Science
268
(1), 2001, pp. 67-90
On-line single-server dial-a-ride problems
Esteban Feuerstein
,
Leen Stougie
Theoretical Computer Science
268
(1), 2001, pp. 91-105
Online algorithms for page replication in rings
Wƚodzimierz Gƚazek
Theoretical Computer Science
268
(1), 2001, pp. 107-117
Online paging and file caching with expiration times
Tracy Kimbrel
Theoretical Computer Science
268
(1), 2001, pp. 119-131
An optimal online algorithm for scheduling two machines with release times
John Noga
,
Steven S. Seiden
Theoretical Computer Science
268
(1), 2001, pp. 133-143
Online request server matching
Marco Riedel
Theoretical Computer Science
268
(1), 2001, pp. 145-160
On the Bahncard Problem
Rudolf Fleischer
Theoretical Computer Science
268
(1), 2001, pp. 161-174
Polynomial-time learnability of logic programs with local variables from entailment
M.R.K. Krishna Rao
,
A. Sattar
Theoretical Computer Science
268
(2), 2001, pp. 179-198
Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions
Marc Fischlin
Theoretical Computer Science
268
(2), 2001, pp. 199-219
Aspects of complexity of probabilistic learning under monotonocity constraints
Léa Meyer
Theoretical Computer Science
268
(2), 2001, pp. 275-322
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>