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=268
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Learning algebraic structures from text
Frank Stephan
,
Yuri Ventsov
Theoretical Computer Science
268
(2), 2001, pp. 221-273
Aspects of complexity of probabilistic learning under monotonocity constraints
Léa Meyer
Theoretical Computer Science
268
(2), 2001, pp. 275-322
Predictive learning models for concept drift
John Case
,
Sanjay Jain
,
Susanne Kaufmann
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
268
(2), 2001, pp. 323-349
A comparison of identification criteria for inductive inference of recursive real-valued functions
Eiju Hirowatari
,
Setsuo Arikawa
Theoretical Computer Science
268
(2), 2001, pp. 351-366
Closedness properties in ex-identification
Kalvis Aps̄itis
,
Rūsiņs̑ Freivalds
,
Raimonds Simanovskis
,
Juris Smotrovs
Theoretical Computer Science
268
(2), 2001, pp. 367-393