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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Competitive caching of query results in search engines
Ronny Lempel
,
Shlomo Moran
Theoretical Computer Science
324
(2-3), 2004, pp. 253-271
Competitive online routing in geometric graphs
Prosenjit Bose
,
Pat Morin
Theoretical Computer Science
324
(2-3), 2004, pp. 273-288
The weighted 2-server problem
Marek Chrobak
,
Jiȓí Sgall
Theoretical Computer Science
324
(2-3), 2004, pp. 289-312
On-line generalized Steiner problem
Baruch Awerbuch
,
Yossi Azar
,
Yair Bartal
Theoretical Computer Science
324
(2-3), 2004, pp. 313-324
Semi-clairvoyant scheduling
Luca Becchetti
,
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
,
Kirk Pruhs
Theoretical Computer Science
324
(2-3), 2004, pp. 325-335
On the competitive ratio of the work function algorithm for the
k
-server problem
Yair Bartal
,
Elias Koutsoupias
Theoretical Computer Science
324
(2-3), 2004, pp. 337-345
The CNN problem and other
k
-server variants
Elias Koutsoupias
,
David Scot Taylor
Theoretical Computer Science
324
(2-3), 2004, pp. 347-359
The best expert versus the smartest algorithm
Peter Chen
,
Guoli Ding
Theoretical Computer Science
324
(2-3), 2004, pp. 361-380
A theory of bisimulation for a fragment of concurrent ML with local names
Alan Jeffrey
,
Julian Rathke
Theoretical Computer Science
323
(1-3), 2004, pp. 1-48
Pattern matching as cut elimination
Serenella Cerrito
,
Delia Kesner
Theoretical Computer Science
323
(1-3), 2004, pp. 71-127
Domain and event structure semantics for Petri nets with read and inhibitor arcs
P. Baldan
,
N. Busi
,
A. Corradini
,
G.M. Pinna
Theoretical Computer Science
323
(1-3), 2004, pp. 129-189
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
R.M. Hierons
,
M. Harman
Theoretical Computer Science
323
(1-3), 2004, pp. 191-233
Formalizing generalized maps in Coq
Christophe Dehlinger
,
Jean-François Dufourd
Theoretical Computer Science
323
(1-3), 2004, pp. 351-397
Formalizing the trading theorem in Coq
Christophe Dehlinger
,
Jean-François Dufourd
Theoretical Computer Science
323
(1-3), 2004, pp. 399-442
Well-behaved principles alternative to bounded induction
Zofia Adamowicz
,
Leszek Aleksander Koƚodziejczyk
Theoretical Computer Science
322
(1), 2004, pp. 5-16
A strong induction scheme that leads to polynomially computable realizations
Anatoly Petrivich Beltiukov
Theoretical Computer Science
322
(1), 2004, pp. 17-39
On the complexity of decision using destinies in
H
-bounded structures
A. Chateau
Theoretical Computer Science
322
(1), 2004, pp. 41-67
Closure properties of locally finite
\omega
-languages
Olivier Finkel
Theoretical Computer Science
322
(1), 2004, pp. 69-84
Recursion and topology on
2^{\le \omega}
for possibly infinite computations
Verónica Becher
,
Serge Grigorieff
Theoretical Computer Science
322
(1), 2004, pp. 85-136
Arithmetical definability and computational complexity
Yassine Hachaïchi
Theoretical Computer Science
322
(1), 2004, pp. 137-146
Three-variable statements of set-pairing
Andrea Formisano
,
Eugenio G. Omodeo
,
Alberto Policriti
Theoretical Computer Science
322
(1), 2004, pp. 147-173
On limit cycles of monotone functions with symmetric connection graph
Julio Aracena
,
Jacques Demongeot
,
Eric Goles
Theoretical Computer Science
322
(2), 2004, pp. 237-244
Student admissions and faculty recruitment
Mourad Baïou
,
Michel Balinski
Theoretical Computer Science
322
(2), 2004, pp. 245-265
Dynamics of a class of ants on a one-dimensional lattice
A. Gajardo
,
E. Goles
Theoretical Computer Science
322
(2), 2004, pp. 267-283
Folding and tiling
Eric Goles
Theoretical Computer Science
322
(2), 2004, pp. 285-296
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>