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=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generic causal model for place latency
Reiner Durchholz
Theoretical Computer Science
289
(1), 2002, pp. 1-49
Sorting algorithms for broadcast communications: Mathematical analysis
Peter J. Grabner
,
Helmut Prodinger
Theoretical Computer Science
289
(1), 2002, pp. 51-67
A deterministic
(2-2/(k+1))^n
algorithm for
k
-SAT based on local search
Evgeny Dantsin
,
Andreas Goerdt
,
Edward A. Hirsch
,
Ravi Kannan
,
Jon Kleinberg
,
Christos Papadimitriou
,
Prabhakar Raghavan
,
Uwe Schöning
Theoretical Computer Science
289
(1), 2002, pp. 69-83
The complexity of the characterization of networks supporting shortest-path interval routing
T. Eilam
,
S. Moran
,
S. Zaks
Theoretical Computer Science
289
(1), 2002, pp. 85-104
Symmetries of decimation invariant sequences and digit sets
A. Barbé
,
F. von Haeseler
Theoretical Computer Science
289
(1), 2002, pp. 105-136
Canonical derivatives, partial derivatives and finite automaton constructions
J.-M. Champarnaud
,
D. Ziadi
Theoretical Computer Science
289
(1), 2002, pp. 137-163
Counter machines and verification problems
Oscar H. Ibarra
,
Jianwen Su
,
Zhe Dang
,
Tevfik Bultan
,
Richard A. Kemmerer
Theoretical Computer Science
289
(1), 2002, pp. 165-189
Augmenting the discrete timed automaton with other data structures
Oscar H. Ibarra
,
Jianwen Su
Theoretical Computer Science
289
(1), 2002, pp. 191-204
Sorting with two ordered stacks in series
M.D. Atkinson
,
M.M. Murphy
,
N. Rus̑kuc
Theoretical Computer Science
289
(1), 2002, pp. 205-223
Determinization of transducers over finite and infinite words
Marie-Pierre Béal
,
Olivier Carton
Theoretical Computer Science
289
(1), 2002, pp. 225-251
Deterministic Turing machines in the range between real-time and linear-time
Andreas Klein
,
Martin Kutrib
Theoretical Computer Science
289
(1), 2002, pp. 253-275
Robust algorithms for constructing strongly convex hulls in parallel
Wei Chen
,
Koichi Wada
,
Kimio Kawaguchi
Theoretical Computer Science
289
(1), 2002, pp. 277-295
Conjugacy on partial words
F. Blanchet-Sadri
,
D.K. Luhmann
Theoretical Computer Science
289
(1), 2002, pp. 297-312
Load-balanced parallel banded-system solvers
Kuo-Liang Chung
,
Wen-Ming Yan
,
Jung-Gen Wu
Theoretical Computer Science
289
(1), 2002, pp. 313-334
The 3-server problem in the plane
Wolfgang W. Bein
,
Marek Chrobak
,
Lawrence L. Larmore
Theoretical Computer Science
289
(1), 2002, pp. 335-354
Randomized path coloring on binary trees
Vincenzo Auletta
,
Ioannis Caragiannis
,
Christos Kaklamanis
,
Pino Persiano
Theoretical Computer Science
289
(1), 2002, pp. 355-399
Public data structures: Counters as a special case
Hagit Brit
,
Shlomo Moran
,
Gadi Taubenfeld
Theoretical Computer Science
289
(1), 2002, pp. 401-423
Even linear simple matrix languages: Formal language properties and grammatical inference
Henning Fernau
Theoretical Computer Science
289
(1), 2002, pp. 425-456
On the drift of short schedules
Uriel Feige
,
Giora Rayzman
Theoretical Computer Science
289
(1), 2002, pp. 473-484
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Herbert Fleischner
,
Oliver Kullmann
,
Stefan Szeider
Theoretical Computer Science
289
(1), 2002, pp. 503-516
(1+\varepsilon)
-approximation of sorting by reversals and transpositions
Niklas Eriksen
Theoretical Computer Science
289
(1), 2002, pp. 517-529
On axioms for commutative regular equations without addition
Sinis̑a Crvenković
,
Igor Dolinka
Theoretical Computer Science
289
(1), 2002, pp. 531-551
The inapproximability of non-
NP
-hard optimization problems
Liming Cai
,
David Juedes
,
Iyad Kanj
Theoretical Computer Science
289
(1), 2002, pp. 553-571
On the presence of periodic configurations in Turing machines and in counter machines
Vincent D. Blondel
,
Julien Cassaigne
,
Codrin Nichitiu
Theoretical Computer Science
289
(1), 2002, pp. 573-590
Propositional default logics made easier: Computational complexity of model checking
Robert Baumgartner
,
Georg Gottlob
Theoretical Computer Science
289
(1), 2002, pp. 591-627
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>