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=255
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decidability of DPDA equivalence
Colin Stirling
Theoretical Computer Science
255
(1-2), 2001, pp. 1-31
The complexity of path coloring and call scheduling
Thomas Erlebach
,
Klaus Jansen
Theoretical Computer Science
255
(1-2), 2001, pp. 33-50
Approximation algorithms for maximum two-dimensional pattern matching
Srinivasa R. Arikati
,
Anders Dessmark
,
Andrzej Lingas
,
Madhav V. Marathe
Theoretical Computer Science
255
(1-2), 2001, pp. 51-62
A relation-algebraic approach to the region connection calculus
Ivo Düntsch
,
Hui Wang
,
Steve McCloskey
Theoretical Computer Science
255
(1-2), 2001, pp. 63-83
Post-plus languages
S.S. Yu
Theoretical Computer Science
255
(1-2), 2001, pp. 85-105
Branch and bound on the network model
Sanjay Jain
Theoretical Computer Science
255
(1-2), 2001, pp. 107-123
Recursively enumberable reals and Chaitin
\Omega
numbers
Cristian S. Calude
,
Peter H. Hertling
,
Bakhadyr Khoussainov
,
Yongge Wang
Theoretical Computer Science
255
(1-2), 2001, pp. 125-149
On codes with a finite deciphering delay: Constructing uncompletable words
Jean Néraud
,
Carla Selmi
Theoretical Computer Science
255
(1-2), 2001, pp. 151-162
Parallel communicating limited and uniformly limited 0L systems
Dietmar Wätjen
Theoretical Computer Science
255
(1-2), 2001, pp. 163-191
Marked PCP is decidable
Vesa Halava
,
Mika Hirvensalo
,
Ronald de Wolf
Theoretical Computer Science
255
(1-2), 2001, pp. 193-204
On pseudorandomness and resource-bounded measure
V. Arvind
,
Johannes Köbler
Theoretical Computer Science
255
(1-2), 2001, pp. 205-221
Locally finite languages
Olivier Finkel
Theoretical Computer Science
255
(1-2), 2001, pp. 223-261
Optimal three-dimensional layout of interconnection networks
Tiziana Calamoneri
,
Annalisa Massini
Theoretical Computer Science
255
(1-2), 2001, pp. 263-279
Fanout limitations on constraint systems
Tomás Feder
Theoretical Computer Science
255
(1-2), 2001, pp. 281-293
Gaining degrees of freedom in subsymbolic learning
B. Apolloni
,
D. Malchiodi
Theoretical Computer Science
255
(1-2), 2001, pp. 295-321
Substitutions and interval exchange transformation of rotation class
Luis-Miguel Lopez
,
Philippe Narbel
Theoretical Computer Science
255
(1-2), 2001, pp. 323-344
Chemins de Schröder et hiérarchies aléatoires
Jean-Guy Penaud
,
Elisa Pergola
,
Renzo Pinzani
,
Olivier Roques
Theoretical Computer Science
255
(1-2), 2001, pp. 345-361
Fractional powers in Sturmian words
Jacques Justin
,
Giuseppe Pirillo
Theoretical Computer Science
255
(1-2), 2001, pp. 363-376
Alphabetic and synchronized tree transducers
George Rahonis
Theoretical Computer Science
255
(1-2), 2001, pp. 377-399
Non-injective knapsack public-key cryptosystems
Jukka A. Koskinen
Theoretical Computer Science
255
(1-2), 2001, pp. 401-422
Generalized scans and tridiagonal systems
Paul F. Fischer
,
Franco P. Preparata
,
John E. Savage
Theoretical Computer Science
255
(1-2), 2001, pp. 423-436
Reconstruction of domino tiling from its two orthogonal projections
C. Picouleau
Theoretical Computer Science
255
(1-2), 2001, pp. 437-447
A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing
Guohua Jin
,
Zhiyuan Li
,
Fujie Chen
Theoretical Computer Science
255
(1-2), 2001, pp. 449-481
Codes and equations on trees
Sabrina Mantaci
,
Antonio Restivo
Theoretical Computer Science
255
(1-2), 2001, pp. 483-509
On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms
Erzsébet Csuhaj-Varjú
,
György Vaszil
Theoretical Computer Science
255
(1-2), 2001, pp. 511-538
Seiten 1
2
>