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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Main-memory triangle computations for very large (sparse (power-law)) graphs
Matthieu Latapy
Theoretical Computer Science
407
(1-3), 2008, pp. 458-473
On the bandwidth of 3-dimensional Hamming graphs
J. Balogh
,
S.L. Bezrukov
,
L.H. Harper
,
A. Seress
Theoretical Computer Science
407
(1-3), 2008, pp. 488-495
Lower bounds and new constructions on secure group communication schemes
Scott C.-H. Huang
,
Frances Yao
,
Minming Li
,
Weili Wu
Theoretical Computer Science
407
(1-3), 2008, pp. 511-523
Efficient on-line repetition detection
Jin-Ju Hong
,
Gen-Huey Chen
Theoretical Computer Science
407
(1-3), 2008, pp. 554-563
A note on the problem of reporting maximal cliques
F. Cazals
,
C. Karande
Theoretical Computer Science
407
(1-3), 2008, pp. 564-568
Matching cutsets in graphs of diameter 2
Mieczysƚaw Borowiecki
,
Katarzyna Jesse-Józefczyk
Theoretical Computer Science
407
(1-3), 2008, pp. 574-582
On the complexity of deciding bimatrix games similarity
Ye Du
Theoretical Computer Science
407
(1-3), 2008, pp. 583-586
An assertion concerning functionally complete algebras and
NP
-completeness
Gábor Horváth
,
Chrystopher L. Nehaniv
,
Csaba Szabó
Theoretical Computer Science
407
(1-3), 2008, pp. 591-595
Two undecidable variants of Collatz's problems
Eero Lehtonen
Theoretical Computer Science
407
(1-3), 2008, pp. 596-600
The supercover of an
m
-flat is a discrete analytical object
Eric Andres
Theoretical Computer Science
406
(1-2), 2008, pp. 8-14
A framework for generating some discrete sets with disjoint components by using uniform distributions
Péter Balázs
Theoretical Computer Science
406
(1-2), 2008, pp. 15-23
On the polyhedral complexity of the integer points in a hyperball
Valentin E. Brimkov
,
Reneta P. Barneva
Theoretical Computer Science
406
(1-2), 2008, pp. 24-30
Discrete sets with minimal moment of inertia
S. Brlek
,
G. Labelle
,
A. Lacasse
Theoretical Computer Science
406
(1-2), 2008, pp. 31-42
Reconstruction of binary matrices under fixed size neighborhood constraints
S. Brocchi
,
A. Frosini
,
C. Picouleau
Theoretical Computer Science
406
(1-2), 2008, pp. 43-54
Reconstruction of convex lattice sets from tomographic projections in quartic time
Sara Brunetti
,
Alain Daurat
Theoretical Computer Science
406
(1-2), 2008, pp. 55-62
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
S. Brunetti
,
A. Del Lungo
,
P. Gritzmann
,
S. de Vries
Theoretical Computer Science
406
(1-2), 2008, pp. 63-71
Finding a minimum medial axis of a discrete shape is
NP
-hard
David Coeurjolly
,
Jérôme Hulin
,
Isabelle Sivignon
Theoretical Computer Science
406
(1-2), 2008, pp. 72-79
Convex decomposition of
U
-polygons
Paolo Dulio
Theoretical Computer Science
406
(1-2), 2008, pp. 80-89
Scanning integer matrices by means of two rectangular windows
Andrea Frosini
,
Maurice Nivat
,
Simone Rinaldi
Theoretical Computer Science
406
(1-2), 2008, pp. 90-96
Minimal non-deletable sets and minimal non-codeletable sets in binary images
T. Yung Kong
Theoretical Computer Science
406
(1-2), 2008, pp. 97-118
Deterministic monotone algorithms for scheduling on related machines
Pasquale Ambrosio
,
Vincenzo Auletta
Theoretical Computer Science
406
(3), 2008, pp. 173-186
The Steiner tree problem on graphs: Inapproximability results
Miroslav Chlebík
,
Janka Chlebíková
Theoretical Computer Science
406
(3), 2008, pp. 207-214
On the complexity of bandwidth allocation in radio networks
Ralf Klasing
,
Nelson Morales
,
Stéphane Pérennes
Theoretical Computer Science
406
(3), 2008, pp. 225-239
High level communication functionalities for wireless sensor networks
Carme Àlvarez
,
Josep Díaz
,
Jordi Petit
,
José Rolim
,
Maria Serna
Theoretical Computer Science
406
(3), 2008, pp. 240-247
A randomized algorithm for the joining protocol in dynamic distributed networks
Colin Cooper
,
Ralf Klasing
,
Tomasz Radzik
Theoretical Computer Science
406
(3), 2008, pp. 248-262
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>