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=352
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Weili Wu
,
Hongwei Du
,
Xiaohua Jia
,
Yingshu Li
,
Scott C.-H. Huang
Theoretical Computer Science
352
(1-3), 2006, pp. 1-7
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
Pawel Hitczenko
,
Jeremy R. Johnson
,
Hung-Jen Huang
Theoretical Computer Science
352
(1-3), 2006, pp. 8-30
Occurrences of palindromes in characteristic Sturmian words
Amy Glen
Theoretical Computer Science
352
(1-3), 2006, pp. 31-46
Satgraphs and independent domination. Part 1
Igor Edm. Zverovich
Theoretical Computer Science
352
(1-3), 2006, pp. 47-56
On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups
Genjiro Tanaka
Theoretical Computer Science
352
(1-3), 2006, pp. 57-70
Approximation schemes for knapsack problems with shelf divisions
E.C. Xavier
,
F.K. Miyazawa
Theoretical Computer Science
352
(1-3), 2006, pp. 71-84
The DNF exception problem
Dhruv Mubayi
,
György Turán
,
Yi Zhao
Theoretical Computer Science
352
(1-3), 2006, pp. 85-96
Closure properties of cellular automata
Véronique Terrier
Theoretical Computer Science
352
(1-3), 2006, pp. 97-107
Sequential and parallel algorithms for the NCA problem on pure pointer machines
A. Dal Palú
,
E. Pontelli
,
D. Ranjan
Theoretical Computer Science
352
(1-3), 2006, pp. 108-135
The binomial transform and the analysis of skip lists
Patricio V. Poblete
,
J. Ian Munro
,
Thomas Papadakis
Theoretical Computer Science
352
(1-3), 2006, pp. 136-158
Kolmogorov complexities
K_{max}
,
K_{min}
on computable partially ordered sets
Marie Ferbus-Zanda
,
Serge Grigorieff
Theoretical Computer Science
352
(1-3), 2006, pp. 159-180
Hierarchies for classes of priority algorithms for job scheduling
Periklis A. Papakonstantinou
Theoretical Computer Science
352
(1-3), 2006, pp. 181-189
On the positional determinacy of edge-labeled games
Thomas Colcombet
,
Damian Niwiński
Theoretical Computer Science
352
(1-3), 2006, pp. 190-196
Rearrangeability of bit permutation networks
Xuewen Bao
,
Frank K. Hwang
,
Qiao Li
Theoretical Computer Science
352
(1-3), 2006, pp. 197-214
Independent domination in hereditary classes
Igor É. Zverovich
,
Olga I. Zverovich
Theoretical Computer Science
352
(1-3), 2006, pp. 215-225
Set of periods of additive cellular automata
T.K. Subrahmonian Moothathu
Theoretical Computer Science
352
(1-3), 2006, pp. 226-231
Wide-sense nonblocking for multi-
\log_d N
networks under various routing strategies
F.H. Chang
,
J.Y. Guo
,
F.K. Hwang
Theoretical Computer Science
352
(1-3), 2006, pp. 232-239
Approximate string matching using compressed suffix arrays
Trinh N.D. Huynh
,
Wing-Kai Hon
,
Tak-Wah Lam
,
Wing-Kin Sung
Theoretical Computer Science
352
(1-3), 2006, pp. 240-249
Efficient algorithms for robustness in resource allocation and scheduling problems
Greg N. Frederickson
,
Roberto Solis-Oba
Theoretical Computer Science
352
(1-3), 2006, pp. 250-265
A metric index for approximate string matching
Gonzalo Navarro
,
Edgar Chávez
Theoretical Computer Science
352
(1-3), 2006, pp. 266-279
Security analysis of a password-based authentication protocol proposed to IEEE 1363
Zhu Zhao
,
Zhongqi Dong
,
Yongge Wang
Theoretical Computer Science
352
(1-3), 2006, pp. 280-287
On linear complexity of sequences over
GF(2^n)
A.M. Youssef
,
G. Gong
Theoretical Computer Science
352
(1-3), 2006, pp. 288-292
An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields
S. Ballet
Theoretical Computer Science
352
(1-3), 2006, pp. 293-305
Combinatorial properties of smooth infinite words
S. Brlek
,
S. Dulucq
,
A. Ladouceur
,
L. Vuillon
Theoretical Computer Science
352
(1-3), 2006, pp. 306-317
On the max-flow min-cut ratio for directed multicommodity flows
M.T Hajiaghayi
,
Tom Leighton
Theoretical Computer Science
352
(1-3), 2006, pp. 318-321
Seiten 1
2
>