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=289
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Performance analysis of evolution strategies with multi-recombination in high-dimensional
R^N
-search spaces disturbed by noise
Dirk V. Arnold
,
Hans-Georg Beyer
Theoretical Computer Science
289
(1), 2002, pp. 629-647
The height of a binary search tree: The limiting distribution perspective
Charles Knessl
,
Wojciech Szpankowski
Theoretical Computer Science
289
(1), 2002, pp. 649-703
Conway's problem for three-word sets
Juhani Karhumäki
,
Ion Petre
Theoretical Computer Science
289
(1), 2002, pp. 705-725
Extensions and submonoids of automatic monoids
Pedro V. Silva
,
Benjamin Steinberg
Theoretical Computer Science
289
(1), 2002, pp. 727-754
On the lattice of prefix codes
Antonio Restivo
,
Pedro V. Silva
Theoretical Computer Science
289
(1), 2002, pp. 755-782
Algorithms for computing lengths of chains in integral partition lattices
Honghui Wan
,
John C. Wootton
Theoretical Computer Science
289
(1), 2002, pp. 783-800
Molecular interaction
Gabriel Ciobanu
,
Mihai Rotaru
Theoretical Computer Science
289
(1), 2002, pp. 801-827
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
Wolfgang Slany
Theoretical Computer Science
289
(1), 2002, pp. 829-843
Two short notes on the on-line Travelling Salesman: Handling times and lookahead
Peter Damaschke
Theoretical Computer Science
289
(1), 2002, pp. 845-852
Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language
R
with
R_1 \subseteq R \subseteq R_2
for given regular languages
R_1,R_2
Kosaburo Hashiguchi
Theoretical Computer Science
289
(1), 2002, pp. 853-859
MAX3SAT is exponentially hard to approximate if
NP
has positive dimension
John M. Hitchcock
Theoretical Computer Science
289
(1), 2002, pp. 861-869
Martin's game: A lower bound for the number of sets
M. Ageev
Theoretical Computer Science
289
(1), 2002, pp. 871-876
Approximating uniform triangular meshes in polygons
Franz Aurenhammer
,
Naoki Katoh
,
Hiromichi Kojima
,
Makoto Ohsaki
,
Yinfeng Xu
Theoretical Computer Science
289
(2), 2002, pp. 879-895
Embedding problems for paths with direction constrained edges
Giuseppe di Battista
,
Giuseppe Liotta
,
Anna Lubiw
,
Sue Whitesides
Theoretical Computer Science
289
(2), 2002, pp. 897-917
On local transformation of polygons with visibility properties
Carmen Hernando
,
Michael E. Houle
,
Ferran Hurtado
Theoretical Computer Science
289
(2), 2002, pp. 919-937
Two-dimensional on-line bin packing problem with rotatable items
Satoshi Fujita
,
Takeshi Hada
Theoretical Computer Science
289
(2), 2002, pp. 939-952
Online independent sets
Magnús M. Halldórsson
,
Kazuo Iwama
,
Shuichi Miyazaki
,
Shiro Taketomi
Theoretical Computer Science
289
(2), 2002, pp. 953-962
One-way probabilistic reversible and quantum one-counter automata
Tomohiro Yamasaki
,
Hirotada Kobayashi
,
Yuki Tokunaga
,
Hiroshi Imai
Theoretical Computer Science
289
(2), 2002, pp. 963-976
Logical analysis of data with decomposable structures
Hirotaka Ono
,
Kazuhisa Makino
,
Toshihide Ibaraki
Theoretical Computer Science
289
(2), 2002, pp. 977-995
Parameterized complexity of finding subgraphs with hereditary properties
Subhash Khot
,
Venkatesh Raman
Theoretical Computer Science
289
(2), 2002, pp. 997-1008
Some results on tries with adaptive branching
Yuriy A. Reznik
Theoretical Computer Science
289
(2), 2002, pp. 1009-1026
Seiten
<
1
2