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=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complementary cooperation, minimal winning coalitions, and power indices
Zhigang Cao
,
Xiaoguang Yang
Theoretical Computer Science
470
, 2013, pp. 53-92
Scheduling for weighted flow time and energy with rejection penalty
Sze-Hang Chan
,
Tak-Wah Lam
,
Lap-Kei Lee
Theoretical Computer Science
470
, 2013, pp. 93-104
Parameterized top-
K
algorithms
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Theoretical Computer Science
470
, 2013, pp. 105-119
Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction
Man Ho Au
,
Joseph K. Liu
,
Willy Susilo
,
Tsz Hon Yuen
Theoretical Computer Science
469
, 2013, pp. 1-14
Cycle transversals in perfect graphs and cographs
Andreas Brandstädt
,
Synara Brito
,
Sulamita Klein
,
Loana Tito Nogueira
,
Fábio Protti
Theoretical Computer Science
469
, 2013, pp. 15-23
On the
\mathcal {PLS}
-complexity of maximum constraint assignment
Dominic Dumrauf
,
Burkhard Monien
Theoretical Computer Science
469
, 2013, pp. 24-52
On the exploration of time-varying networks
Paola Flocchini
,
Bernard Mans
,
Nicola Santoro
Theoretical Computer Science
469
, 2013, pp. 53-68
Morphic characterizations with insertion systems controlled by a context of length one
Kaoru Fujioka
Theoretical Computer Science
469
, 2013, pp. 69-76
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Raimundo Briceño
,
Ivan Rapaport
Theoretical Computer Science
468
, 2013, pp. 1-11
Enumeration and structure of trapezoidal words
Michelangelo Bucci
,
Alessandro De Luca
,
Gabriele Fici
Theoretical Computer Science
468
, 2013, pp. 12-22
Exploring pairwise compatibility graphs
T. Calamoneri
,
E. Montefusco
,
R. Petreschi
,
B. Sinaimeri
Theoretical Computer Science
468
, 2013, pp. 23-36
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Ching-Lueh Chang
,
Yuh-Dauh Lyuu
Theoretical Computer Science
468
, 2013, pp. 37-49
Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
Yebin Chen
,
Ying Li
,
Tao Chen
Theoretical Computer Science
468
, 2013, pp. 50-58
A parameterizable enumeration algorithm for sequence mining
J. David
,
L. Nourine
Theoretical Computer Science
468
, 2013, pp. 59-68
Ancestors graph and an upper bound for the subword complexity function
Delalleau Guillaume
Theoretical Computer Science
468
, 2013, pp. 69-82
On the sensitivity complexity of bipartite graph properties
Yihan Gao
,
Jieming Mao
,
Xiaoming Sun
,
Song Zuo
Theoretical Computer Science
468
, 2013, pp. 83-91
Finding consensus and optimal alignment of circular strings
Taehyung Lee
,
Joong Chae Na
,
Heejin Park
,
Kunsoo Park
,
Jeong Seop Sim
Theoretical Computer Science
468
, 2013, pp. 92-101
Polynomial space hardness without disjunction property
Simone Bova
,
Franco Montagna
Theoretical Computer Science
467
, 2013, pp. 1-11
On the coverability and reachability languages of monotonic extensions of Petri nets
Giorgio Delzanno
,
Fernando Rosa-Velardo
Theoretical Computer Science
467
, 2013, pp. 12-29
Shuffled languages - Representation and recognition
Martin Berglund
,
Henrik Björklund
,
Johanna Björklund
Theoretical Computer Science
489-490
, 2013, pp. 1-20
On optimal cryptographic key derivation
Aldar C.-F. Chan
Theoretical Computer Science
489-490
, 2013, pp. 21-36
Mind change speed-up for learning languages from positive data
Sanjay Jain
,
Efim Kinber
Theoretical Computer Science
489-490
, 2013, pp. 37-47
A
(1+\ln 2)
-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
Nachshon Cohen
,
Zeev Nutov
Theoretical Computer Science
489-490
, 2013, pp. 67-74
Competitive buffer management with packet dependencies
Alex Kesselman
,
Boaz Patt-Shamir
,
Gabriel Scalosub
Theoretical Computer Science
489-490
, 2013, pp. 75-87
A truthful constant approximation for maximizing the minimum load on related machines
George Christodoulou
,
Annamária Kovács
,
Rob van Stee
Theoretical Computer Science
489-490
, 2013, pp. 88-98
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12