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=407
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for finding the weight-constrained
k
longest paths in a tree and the length-constrained
k
maximum-sum segments of a sequence
Hsiao-Fei Liu
,
Kun-Mao Chao
Theoretical Computer Science
407
(1-3), 2008, pp. 349-358
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
Elitza Maneva
,
Alistair Sinclair
Theoretical Computer Science
407
(1-3), 2008, pp. 359-369
A new framework for the design and analysis of identity-based identification schemes
Guomin Yang
,
Jing Chen
,
Duncan S. Wong
,
Xiaotie Deng
,
Dongsheng Wang
Theoretical Computer Science
407
(1-3), 2008, pp. 370-388
Dense open-shop schedules with release times
Rongjun Chen
,
Wanzhen Huang
,
Guochun Tang
Theoretical Computer Science
407
(1-3), 2008, pp. 389-399
Tiling problems, automata, and tiling graphs
Katherine P. Benedetto
,
Nicholas A. Loehr
Theoretical Computer Science
407
(1-3), 2008, pp. 400-411
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Paola Flocchini
,
Giuseppe Prencipe
,
Nicola Santoro
,
Peter Widmayer
Theoretical Computer Science
407
(1-3), 2008, pp. 412-447
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
Hans Kleine Büning
,
Xishun Zhao
Theoretical Computer Science
407
(1-3), 2008, pp. 448-457
Main-memory triangle computations for very large (sparse (power-law)) graphs
Matthieu Latapy
Theoretical Computer Science
407
(1-3), 2008, pp. 458-473
Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
Kei Uchizawa
,
Eiji Takimoto
Theoretical Computer Science
407
(1-3), 2008, pp. 474-487
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
Time separations of cyclic event rule systems with min-max timing constraints
Qianchuan Zhao
,
Jianfeng Mao
,
Ye Tao
Theoretical Computer Science
407
(1-3), 2008, pp. 496-510
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
The 2-radius and 2-radiian problems on trees
Hung-Lung Wang
,
Kun-Mao Chao
Theoretical Computer Science
407
(1-3), 2008, pp. 524-531
Monotonicity in digraph search problems
Boting Yang
,
Yi Cao
Theoretical Computer Science
407
(1-3), 2008, pp. 532-544
Testing whether a digraph contains
H
-free
k
-induced subgraphs
Hong-Yiu Lin
,
Yuh-Dauh Lyuu
,
Tak-Man Ma
,
Yen-Wu Ti
Theoretical Computer Science
407
(1-3), 2008, pp. 545-553
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
Rich, Sturmian, and trapezoidal words
Aldo de Luca
,
Amy Glen
,
Luca Q. Zamboni
Theoretical Computer Science
407
(1-3), 2008, pp. 569-573
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
Pattern matching with pair correlation distance
Benny Porat
,
Ely Porat
,
Asaf Zur
Theoretical Computer Science
407
(1-3), 2008, pp. 587-590
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
Seiten
<
1
2