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.
Assembling molecules in ATOMIX is hard
Markus Holzer
,
Stefan Schwoon
Theoretical Computer Science
313
(3), 2004, pp. 447-462
Periodicity and arithmetic-periodicity in hexadecimal games
S. Howse
,
R.J. Nowakowski
Theoretical Computer Science
313
(3), 2004, pp. 463-472
It is tough to be a plumber
Daniel Král'
,
Vladan Majerech
,
Jiȓí Sgall
,
Tomás̑ Tichý
,
Gerhard Woeginger
Theoretical Computer Science
313
(3), 2004, pp. 473-484
Error analysis in minimax trees
U. Lorenz
,
B. Monien
Theoretical Computer Science
313
(3), 2004, pp. 485-498
Appendix A: Report on the First International Clobber Tournament
J.P. Grossman
Theoretical Computer Science
313
(3), 2004, pp. 533-537
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory
Erik D. Demaine
,
Rudolf Fleischer
,
Aviezri S. Fraenkel
,
Richard J. Nowakowski
Theoretical Computer Science
313
(3), 2004, pp. 539-543
Finding frequent items in data streams
Moses Charikar
,
Kevin Chen
,
Martin Farach-Colton
Theoretical Computer Science
312
(1), 2004, pp. 3-15
Inapproximability results for equations over finite groups
Lars Engebretsen
,
Jonas Holmerin
,
Alexander Russell
Theoretical Computer Science
312
(1), 2004, pp. 17-45
From regulated rewriting to computing with membranes: Collapsing hierarchies
Rudolf Freund
,
Carlos Martín-Vide
,
Gheorghe Pȃun
Theoretical Computer Science
312
(2-3), 2004, pp. 143-188
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
Kosaburo Hashiguchi
,
Naoto Sakakibara
,
Shuji Jimbo
Theoretical Computer Science
312
(2-3), 2004, pp. 251-266
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
Yoshiyuki Karuno
,
Hiroshi Nagamochi
Theoretical Computer Science
312
(2-3), 2004, pp. 267-280
The conformon-P system: A molecular and cell biology-inspired computability model
Pierluigi Frisco
Theoretical Computer Science
312
(2-3), 2004, pp. 295-319
Computing the similarity of two sequences with nested arc annotations
Jochen Alber
,
Jens Gramm
,
Jiong Guo
,
Rolf Niedermeier
Theoretical Computer Science
312
(2-3), 2004, pp. 337-358
On two-way FA with monotonic counters and quadratic Diophantine equations
Oscar H. Ibarra
,
Zhe Dang
Theoretical Computer Science
312
(2-3), 2004, pp. 359-378
Catalytic
P
systems, semilinear sets, and vector addition systems
Oscar H. Ibarra
,
Zhe Dang
,
Omer Egecioglu
Theoretical Computer Science
312
(2-3), 2004, pp. 379-399
Computational aspects of the 2-dimension of partially ordered sets
M. Habib
,
L. Nourine
,
O. Raynaud
,
E. Thierry
Theoretical Computer Science
312
(2-3), 2004, pp. 401-431
Shuffle on positive varieties of languages
Antonio Cano Gómez
,
Jean-Éric Pin
Theoretical Computer Science
312
(2-3), 2004, pp. 433-461
Typical rounding problems
Benjamin Doerr
Theoretical Computer Science
312
(2-3), 2004, pp. 463-477
Principality and type inference for intersection types using expansion variables
A.J. Kfoury
,
J.B. Wells
Theoretical Computer Science
311
(1-3), 2004, pp. 1-70
Paracategories II: Adjunctions, fibrations and examples from probabilistic automata theory
Claudio Hermida
,
P. Mateus
Theoretical Computer Science
311
(1-3), 2004, pp. 71-103
Confluence of the coinductive
\lambda
-calculus
Felix Joachimski
Theoretical Computer Science
311
(1-3), 2004, pp. 105-119
A generic type system for the
\pi
-calculus
Atsushi Igarashi
,
Naoki Kobayashi
Theoretical Computer Science
311
(1-3), 2004, pp. 121-163
On liveness and boundedness of asymmetric choice nets
Li Jiao
,
To-Yat Cheung
,
Weiming Lu
Theoretical Computer Science
311
(1-3), 2004, pp. 165-197
Limiting partial combinatory algebras
Yohji Akama
Theoretical Computer Science
311
(1-3), 2004, pp. 199-220
An efficient algorithm for computing bisimulation equivalence
Agostino Dovier
,
Carla Piazza
,
Alberto Policriti
Theoretical Computer Science
311
(1-3), 2004, pp. 221-256
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>