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=147
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
E. Bampis
,
J.-C. König
,
D. Trystram
Theoretical Computer Science
147
(1-2), 1995, pp. 1-18
The zooming method: A recursive approach to time-space efficient string-matching
Leszek Gasieniec
,
Wojciech Plandowski
,
Wojciech Rytter
Theoretical Computer Science
147
(1-2), 1995, pp. 19-30
The parameterized complexity of sequence alignment and consensus
Hans L. Bodlaender
,
Rodney G. Downey
,
Michael R. Fellows
,
Harold T. Wareham
Theoretical Computer Science
147
(1-2), 1995, pp. 31-54
\NP\neq co-\NP
and models of arithmetic
Claude Sureson
Theoretical Computer Science
147
(1-2), 1995, pp. 55-67
The minimum broadcast time problem for several processor networks
Klaus Jansen
,
Haiko Müller
Theoretical Computer Science
147
(1-2), 1995, pp. 69-85
Quasi-deterministic 0L systems and their representation
Taishin Y. Nishida
Theoretical Computer Science
147
(1-2), 1995, pp. 87-116
Complexity results for 1-safe nets
Allan Cheng
,
Javier Esparza
,
Jens Palsberg
Theoretical Computer Science
147
(1-2), 1995, pp. 117-136
On the topological size of
p
-
m
-complete degrees
Marius Zimand
Theoretical Computer Science
147
(1-2), 1995, pp. 137-147
Most general first order theorems are not recursively enumerable
Gerhard Schurz
Theoretical Computer Science
147
(1-2), 1995, pp. 149-163
Polyomino tilings, cellular automata and codicity
Philippe Aigrain
,
Danièle Beauquier
Theoretical Computer Science
147
(1-2), 1995, pp. 165-180
The complexity and approximability of finding maximum feasible subsystems of linear relations
Edoardo Amaldi
,
Viggo Kann
Theoretical Computer Science
147
(1-2), 1995, pp. 181-210
A fast scan-line algorithm for topological filling of well-nested objects in 2.5D digital pictures
Didier Arquès
,
Olivier Grange
Theoretical Computer Science
147
(1-2), 1995, pp. 211-248
Efficient parallel algorithms for doubly convex-bipartite graphs
Chang-Wu Yu
,
Gen-Huey Chen
Theoretical Computer Science
147
(1-2), 1995, pp. 249-265
Average case analysis of greedy algorithms for optimisation problems on set systems
Joël Blot
,
Wenceslas Fernandez de la Vega
,
Vangelis Th. Paschos
,
Rachid Saad
Theoretical Computer Science
147
(1-2), 1995, pp. 267-298