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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating fault-tolerant Group-Steiner problems
Rohit Khandekar
,
Guy Kortsarz
,
Zeev Nutov
Theoretical Computer Science
416
, 2012, pp. 55-64
The surviving rate of planar graphs
Jiangxu Kong
,
Weifan Wang
,
Xuding Zhu
Theoretical Computer Science
416
, 2012, pp. 65-70
Proof theory of Nelson's paraconsistent logic: A uniform perspective
Norihiro Kamide
,
Heinrich Wansing
Theoretical Computer Science
415
, 2012, pp. 1-38
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
Eric Angel
,
Evripidis Bampis
,
Nicolas Thibault
Theoretical Computer Science
414
(1), 2012, pp. 1-8
Updating the complexity status of coloring graphs without a fixed induced linear forest
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theoretical Computer Science
414
(1), 2012, pp. 9-19
Paperfolding morphisms, planefilling curves, and fractal tiles
Michel Dekking
Theoretical Computer Science
414
(1), 2012, pp. 20-37
The possible cardinalities of global secure sets in cographs
Katarzyna Jesse-Józefczyk
Theoretical Computer Science
414
(1), 2012, pp. 38-46
Simulation distances
Pavol C̑erný
,
Thomas A. Henzinger
,
Arjun Radhakrishna
Theoretical Computer Science
413
(1), 2012, pp. 21-35
A linear process-algebraic format with data for probabilistic automata
Joost-Pieter Katoen
,
Jaco van de Pol
,
Mariëlle Stoelinga
,
Mark Timmer
Theoretical Computer Science
413
(1), 2012, pp. 36-57
Branching bisimulation congruence for probabilistic systems
Suzana Andova
,
Sonja Georgievska
,
Nikola Trc̑ka
Theoretical Computer Science
413
(1), 2012, pp. 58-72
Approximating Markovian testing equivalence
Aldini Alessandro
Theoretical Computer Science
413
(1), 2012, pp. 73-86
Analysis of a clock synchronization protocol for wireless sensor networks
Faranak Heidarian
,
Julien Schmaltz
,
Frits Vaandrager
Theoretical Computer Science
413
(1), 2012, pp. 87-105
Fluid computation of passage-time distributions in large Markov models
Richard A. Hayden
,
Anton Stefanek
,
Jeremy T. Bradley
Theoretical Computer Science
413
(1), 2012, pp. 106-141
Cost analysis of object-oriented bytecode programs
Elvira Albert
,
Puri Arenas
,
Samir Genaim
,
German Puebla
,
Damiano Zanardini
Theoretical Computer Science
413
(1), 2012, pp. 142-159
Quantitatively fair scheduling
Alessandro Bianco
,
Marco Faella
,
Fabio Mogavero
,
Aniello Murano
Theoretical Computer Science
413
(1), 2012, pp. 160-175
New lower bounds for certain classes of bin packing algorithms
János Balogh
,
József Békési
,
Gábor Galambos
Theoretical Computer Science
440-441
, 2012, pp. 1-13
Some results on approximate 1-median selection in metric spaces
Ching-Lueh Chang
Theoretical Computer Science
426-427
, 2012, pp. 1-12
Tractability and approximability of maximal strip recovery
Laurent Bulteau
,
Guillaume Fertin
,
Minghui Jiang
,
Irena Rusu
Theoretical Computer Science
440-441
, 2012, pp. 14-28
New algorithms on wavelet trees and applications to information retrieval
Travis Gagie
,
Gonzalo Navarro
,
Simon J. Puglisi
Theoretical Computer Science
426-427
, 2012, pp. 25-41
A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
Khalil Challita
Theoretical Computer Science
440-441
, 2012, pp. 29-38
Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
Wai-Fong Chuan
,
Hui-Ling Ho
Theoretical Computer Science
440-441
, 2012, pp. 39-51
On algebra of languages representable by vertex-labeled graphs
Igor Grunsky
,
Igor Potapov
,
Elena Pryanichnikova
Theoretical Computer Science
426-427
, 2012, pp. 42-48
Inverse Hamiltonian Cycle
and inverse 3
Dimensional Matching
are coNP-complete
Harald Hempel
,
Michael Krüger
Theoretical Computer Science
426-427
, 2012, pp. 49-65
Choosing the best among peers
Jurek Czyzowicz
,
Leszek Ga̧sieniec
,
Andrzej Pelc
Theoretical Computer Science
440-441
, 2012, pp. 52-59
On demand string sorting over unbounded alphabets
Carmel Kent
,
Moshe Lewenstein
,
Dafna Sheinwald
Theoretical Computer Science
426-427
, 2012, pp. 66-74
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12