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=412
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved lower bound for deterministic broadcasting in radio networks
Carlos Fisch Brito
,
Shailesh Vaya
Theoretical Computer Science
412
(29), 2011, pp. 3568-3578
Cache-oblivious index for approximate string matching
Wing-Kai Hon
,
Tak-Wah Lam
,
Rahul Shah
,
Siu-Lung Tam
,
Jeffrey Scott Vitter
Theoretical Computer Science
412
(29), 2011, pp. 3579-3588
Special factors and the combinatorics of suffix and factor automata
Gabriele Fici
Theoretical Computer Science
412
(29), 2011, pp. 3604-3615
Communication complexity in number-conserving and monotone cellular automata
E. Goles
,
A. Moreira
,
I. Rapaport
Theoretical Computer Science
412
(29), 2011, pp. 3616-3628
On the complexity of interval scheduling with a resource constraint
Enrico Angelelli
,
Carlo Filippi
Theoretical Computer Science
412
(29), 2011, pp. 3650-3657
\omega
-wide diameters of enhanced pyramid networks
Hsien-Jone Hsieh
,
Dyi-Rong Duh
Theoretical Computer Science
412
(29), 2011, pp. 3658-3675
Equational tree transformations
Symeon Bozapalidis
,
Zoltán Fülöp
,
George Rahonis
Theoretical Computer Science
412
(29), 2011, pp. 3676-3692
Irreversible conversion of graphs
Carmen C. Centeno
,
Mitre C. Dourado
,
Lucia Draque Penso
,
Dieter Rautenbach
,
Jayme L. Szwarcfiter
Theoretical Computer Science
412
(29), 2011, pp. 3693-3700
Compositional synthesis of asynchronous automata
Nicolas Baudru
Theoretical Computer Science
412
(29), 2011, pp. 3701-3716
Semi-online scheduling with known partial information about job sizes on two identical machines
Qian Cao
,
Zhaohui Liu
,
T.C.E. Cheng
Theoretical Computer Science
412
(29), 2011, pp. 3731-3737
Approximation algorithms for grooming in optical network design
Spyridon Antonakopoulos
,
Lisa Zhang
Theoretical Computer Science
412
(29), 2011, pp. 3738-3751
Avoiding large squares in partial words
F. Blanchet-Sadri
,
Ilkyoo Choi
,
Robert Mercaş
Theoretical Computer Science
412
(29), 2011, pp. 3752-3758
Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators''
Pascal Caron
,
Jean-Marc Champarnaud
,
Ludovic Mignot
Theoretical Computer Science
412
(29), 2011, pp. 3795-3796
Directional dynamics along arbitrary curves in cellular automata
M. Delacourt
,
V. Poupet
,
M. Sablik
,
G. Theyssier
Theoretical Computer Science
412
(30), 2011, pp. 3800-3821
Generalized Besicovitch and Weyl spaces: Topology, patterns, and sliding block codes
Silvio Capobianco
Theoretical Computer Science
412
(30), 2011, pp. 3822-3837
Bulking I: An abstract theory of bulking
M. Delorme
,
J. Mazoyer
,
N. Ollinger
,
G. Theyssier
Theoretical Computer Science
412
(30), 2011, pp. 3866-3880
Bulking II: Classifications of cellular automata
M. Delorme
,
J. Mazoyer
,
N. Ollinger
,
G. Theyssier
Theoretical Computer Science
412
(30), 2011, pp. 3881-3905
Traced communication complexity of cellular automata
Eric Goles
,
Pierre Guillon
,
Ivan Rapaport
Theoretical Computer Science
412
(30), 2011, pp. 3906-3916
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Chris Barrett
,
Harry B. Hunt III
,
Madhav V. Marathe
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Richard E. Stearns
Theoretical Computer Science
412
(30), 2011, pp. 3932-3946
Disjunction property and complexity of substructural logics
Rostislav Horc̑ík
,
Kazushige Terui
Theoretical Computer Science
412
(31), 2011, pp. 3992-4006
Distributed temporal logic for the analysis of security protocol models
David Basin
,
Carlos Caleiro
,
Jaime Ramos
,
Luca Viganò
Theoretical Computer Science
412
(31), 2011, pp. 4007-4043
A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
Joachim Biskup
,
Lena Wiese
Theoretical Computer Science
412
(31), 2011, pp. 4044-4072
Complexity and approximation of the Constrained Forest problem
Cristina Bazgan
,
Basile Couëtoux
,
Zsolt Tuza
Theoretical Computer Science
412
(32), 2011, pp. 4081-4091
Computing large matchings in planar graphs with fixed minimum degree
Robert Franke
,
Ignaz Rutter
,
Dorothea Wagner
Theoretical Computer Science
412
(32), 2011, pp. 4092-4099
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in
O(n^{1+\epsilon})
time
Qian-Ping Gu
,
Hisao Tamaki
Theoretical Computer Science
412
(32), 2011, pp. 4100-4109
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>