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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Query-point visibility constrained shortest paths in simple polygons
Ramtin Khosravi
,
Mohammad Ghodsi
Theoretical Computer Science
389
(1-2), 2007, pp. 1-11
On a class of infinite words with affine factor complexity
Julien Bernat
,
Zuzana Masáková
,
Edita Pelantová
Theoretical Computer Science
389
(1-2), 2007, pp. 12-25
Towards a theory of data entanglement
James Aspnes
,
Joan Feigenbaum
,
Aleksandr Yampolskiy
,
Sheng Zhong
Theoretical Computer Science
389
(1-2), 2007, pp. 26-43
On the hardness of inferring phylogenies from triplet-dissimilarities
Ilan Gronau
,
Shlomo Moran
Theoretical Computer Science
389
(1-2), 2007, pp. 44-55
On complexity of grammars related to the safety problem
Tomasz Jurdziński
Theoretical Computer Science
389
(1-2), 2007, pp. 56-72
Canonical scattered context generators of sentences with their parses
Alexander Meduna
,
Jiȓí Techet
Theoretical Computer Science
389
(1-2), 2007, pp. 73-81
Strict partitions and discrete dynamical systems
Minh Ha Le
,
Thi Ha Duong Phan
Theoretical Computer Science
389
(1-2), 2007, pp. 82-90
Edge-colouring of regular graphs of large degree
Caterina De Simone
,
Anna Galluccio
Theoretical Computer Science
389
(1-2), 2007, pp. 91-99
Identity-based ring signatures from RSA
Javier Herranz
Theoretical Computer Science
389
(1-2), 2007, pp. 100-117
Reducing rank-maximal to maximum weight matching
Dimitrios Michail
Theoretical Computer Science
389
(1-2), 2007, pp. 125-132
Algorithms for terminal Steiner trees
Fábio Viduani Martinez
,
José Coelho de Pina
,
José Soares
Theoretical Computer Science
389
(1-2), 2007, pp. 133-142
A solution to the Angel Problem
Oddvar Kloster
Theoretical Computer Science
389
(1-2), 2007, pp. 152-161
Upward separations and weaker hypotheses in resource-bounded measure
Ryan C. Harkins
,
John M. Hitchcock
Theoretical Computer Science
389
(1-2), 2007, pp. 162-171
The complexity of two problems on arithmetic circuits
Pascal Koiran
,
Sylvain Perifel
Theoretical Computer Science
389
(1-2), 2007, pp. 172-181
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
Hsiao-Fei Liu
,
Kun-Mao Chao
Theoretical Computer Science
389
(1-2), 2007, pp. 182-189
Learning languages from positive data and a limited number of short counterexamples
Sanjay Jain
,
Efim Kinber
Theoretical Computer Science
389
(1-2), 2007, pp. 190-218
NP
-hard graph problems and boundary classes of graphs
V.E. Alekseev
,
R. Boliac
,
D.V. Korobitsyn
,
V.V. Lozin
Theoretical Computer Science
389
(1-2), 2007, pp. 219-236
Relational codes of words
Vesa Halava
,
Tero Harju
,
Tomi Kärki
Theoretical Computer Science
389
(1-2), 2007, pp. 237-249
Freeness of partial words
Florin Manea
,
Robert Mercaş
Theoretical Computer Science
389
(1-2), 2007, pp. 265-277
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Andreas Brandstädt
,
Chính T. Hoàng
Theoretical Computer Science
389
(1-2), 2007, pp. 295-306
Prefix-free regular languages and pattern matching
Yo-Sub Han
,
Yajun Wang
,
Derick Wood
Theoretical Computer Science
389
(1-2), 2007, pp. 307-317
On the complexity of 4-coloring graphs without long induced paths
Van Bang Le
,
Bert Randerath
,
Ingo Schiermeyer
Theoretical Computer Science
389
(1-2), 2007, pp. 330-335
Formalising Java RMI with explicit code mobility
Alexander Ahern
,
Nobuko Yoshida
Theoretical Computer Science
389
(3), 2007, pp. 341-410
A program logic for resources
David Aspinall
,
Lennart Beringer
,
Martin Hofmann
,
Hans-Wolfgang Loidl
,
Alberto Momigliano
Theoretical Computer Science
389
(3), 2007, pp. 411-445
A semantic framework for open processes
P. Baldan
,
A. Bracciali
,
R. Bruni
Theoretical Computer Science
389
(3), 2007, pp. 446-483
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>