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.
Restricted adaptive oblivious transfer
Javier Herranz
Theoretical Computer Science
412
(46), 2011, pp. 6498-6506
First-order satisfiability in Gödel logics: An NP-complete fragment
Matthias Baaz
,
Agata Ciabattoni
,
Norbert Preining
Theoretical Computer Science
412
(47), 2011, pp. 6612-6623
Fewest repetitions versus maximal-exponent powers in infinite binary words
Golnaz Badkobeh
Theoretical Computer Science
412
(48), 2011, pp. 6625-6633
Comparing and aggregating partially resolved trees
Mukul S. Bansal
,
Jianrong Dong
,
David Fernández-Baca
Theoretical Computer Science
412
(48), 2011, pp. 6634-6652
Number representation using generalized
(-\beta)
-transformation
D. Dombek
,
Z. Masáková
,
E. Pelantová
Theoretical Computer Science
412
(48), 2011, pp. 6653-6665
Online scheduling with rejection and withdrawal
Leah Epstein
,
Hanan Zebedat-Haider
Theoretical Computer Science
412
(48), 2011, pp. 6666-6674
The complexity of game isomorphism
Joaquim Gabarró
,
Alina García
,
Maria Serna
Theoretical Computer Science
412
(48), 2011, pp. 6675-6695
Effective dimensions and relative frequencies
Xiaoyang Gu
,
Jack H. Lutz
Theoretical Computer Science
412
(48), 2011, pp. 6696-6711
Hardness of preorder checking for basic formalisms
Laura Bozzelli
,
Axel Legay
,
Sophie Pinchinat
Theoretical Computer Science
412
(49), 2011, pp. 6795-6808
A unifying theory of control dependence and its application to arbitrary program structures
Sebastian Danicic
,
Richard W. Barraclough
,
Mark Harman
,
John D. Howroyd
,
Ákos Kiss
,
Michael R. Laurence
Theoretical Computer Science
412
(49), 2011, pp. 6809-6842
The robustness of stability under link and node failures
Carme Àlvarez
,
Maria Blesa
,
Maria Serna
Theoretical Computer Science
412
(50), 2011, pp. 6855-6878
On the complexity of searching in trees and partially ordered structures
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Marco Molinaro
Theoretical Computer Science
412
(50), 2011, pp. 6879-6896
Asynchronous deterministic rendezvous in bounded terrains
Jurek Czyzowicz
,
David Ilcinkas
,
Arnaud Labourel
,
Andrzej Pelc
Theoretical Computer Science
412
(50), 2011, pp. 6926-6937
Edge-bipancyclicity of star graphs with faulty elements
Chao-Wen Huang
,
Hui-Ling Huang
,
Sun-Yuan Hsieh
Theoretical Computer Science
412
(50), 2011, pp. 6938-6947
Verifying and enumerating parameterized border arrays
Tomohiro I
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
Theoretical Computer Science
412
(50), 2011, pp. 6959-6981
Dominating set is fixed parameter tractable in claw-free graphs
Marek Cygan
,
Geevarghese Philip
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Theoretical Computer Science
412
(50), 2011, pp. 6982-7000
Bandwidth
on AT-free graphs
Petr Golovach
,
Pinar Heggernes
,
Dieter Kratsch
,
Daniel Lokshtanov
,
Daniel Meister
,
Saket Saurabh
Theoretical Computer Science
412
(50), 2011, pp. 7001-7008
Faster parameterized algorithms for minor containment
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Theoretical Computer Science
412
(50), 2011, pp. 7018-7028
Selfish bin covering
Zhigang Cao
,
Xiaoguang Yang
Theoretical Computer Science
412
(50), 2011, pp. 7049-7058
An algorithm for a super-stable roommates problem
Tamás Fleiner
,
Robert W. Irving
,
David F. Manlove
Theoretical Computer Science
412
(50), 2011, pp. 7059-7065
The equational theory of Kleene lattices
Hajnal Andréka
,
Szabolcs Mikulás
,
István Németi
Theoretical Computer Science
412
(52), 2011, pp. 7099-7108
Optimizing regenerator cost in traffic grooming
Michele Flammini
,
Gianpiero Monaco
,
Luca Moscardelli
,
Mordechai Shalom
,
Shmuel Zaks
Theoretical Computer Science
412
(52), 2011, pp. 7109-7121
On the number of infinite sequences with trivial initial segment complexity
George Barmpalias
,
T.F. Sterkenburg
Theoretical Computer Science
412
(52), 2011, pp. 7133-7146
Bounded budget betweenness centrality game for strategic network formations
Xiaohui Bei
,
Wei Chen
,
Shang-Hua Teng
,
Jialin Zhang
,
Jiajie Zhu
Theoretical Computer Science
412
(52), 2011, pp. 7147-7168
Erratum to ``Communication complexity and intrinsic universality in cellular automata''
E. Goles
,
P.-E. Meunier
,
I. Rapaport
,
G. Theyssier
Theoretical Computer Science
412
(52), 2011, pp. 7169-7170
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12