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
[3]
Hilfe
Suche: Journal=Theory of Computing Systems AND YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating the metric TSP in linear time
Davide Bilò
,
Luca Forlizzi
,
Guido Proietti
Theory of Computing Systems
49
(3), 2011, pp. 615-631
Generalized semimagic squares for digital halftoning
Akitoshi Kawamura
Theory of Computing Systems
49
(3), 2011, pp. 632-638
Regular languages of nested words: Fixed points, automata, and synchronization
Marcelo Arenas
,
Pablo Barceló
,
Leonid Libkin
Theory of Computing Systems
49
(3), 2011, pp. 639-670
Local approximability of max-min and min-max linear programs
Patrik Floréen
,
Marja Hassinen
,
Joel Kaasinen
,
Petteri Kaski
,
Topi Musto
,
Jukka Suomela
Theory of Computing Systems
49
(4), 2011, pp. 672-697
Inherent limitations on disjoint-access parallel implementations of transactional memory
Hagit Attiya
,
Eshcar Hillel
,
Alessia Milani
Theory of Computing Systems
49
(4), 2011, pp. 698-719
Finding similar users in social networks
Aviv Nisgav
,
Boaz Patt-Shamir
Theory of Computing Systems
49
(4), 2011, pp. 720-737
Buffer management for colored packets with deadlines
Yossi Azar
,
Uriel Feige
,
Iftah Gamzu
,
Thomas Moscibroda
,
Prasad Raghavendra
Theory of Computing Systems
49
(4), 2011, pp. 738-756
Scheduling to minimize staleness and stretch in real-time data warehouses
MohammadHossein Bateni
,
Lukasz Golab
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Theory of Computing Systems
49
(4), 2011, pp. 757-780
Gradient clock synchronization in dynamic networks
Fabian Kuhn
,
Thomas Locher
,
Rotem Oshman
Theory of Computing Systems
49
(4), 2011, pp. 781-816
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Ho-Leung Chan
,
Jeff Edmonds
,
Kirk Pruhs
Theory of Computing Systems
49
(4), 2011, pp. 817-833
Approximation algorithms for time-constrained scheduling on line networks
Harald Räcke
,
Adi Rosén
Theory of Computing Systems
49
(4), 2011, pp. 834-856
Performance of scheduling policies in adversarial networks with non-synchronized clocks
Antonio Fernández Anta
,
José Luis López-Presa
,
M. Araceli Lorenzo
,
Pilar Manzano
,
Juan Martinez-Romo
,
Alberto Mozo
,
Anna Puig-Centelles
,
Agustín Santos
,
Christopher Thraves
Theory of Computing Systems
48
(1), 2011, pp. 1-22
Weighted logics for unranked tree automata
Manfred Droste
,
Heiko Vogler
Theory of Computing Systems
48
(1), 2011, pp. 23-47
Weighted picture automata and weighted logics
Ina Fichtner
Theory of Computing Systems
48
(1), 2011, pp. 48-78
Improved results for a memory allocation problem
Leah Epstein
,
Rob van Stee
Theory of Computing Systems
48
(1), 2011, pp. 79-92
Fixpoint logics over hierarchical structures
Stefan Göller
,
Markus Lohrey
Theory of Computing Systems
48
(1), 2011, pp. 93-131
RFID authentication efficient proactive information security with computational security
Shlomi Dolev
,
Marina Kopeetsky
,
Adi Shamir
Theory of Computing Systems
48
(1), 2011, pp. 132-149
Parallelizing time with polynomial circuits
Ryan Williams
Theory of Computing Systems
48
(1), 2011, pp. 150-169
New results on the most significant bit of integer multiplication
Beate Bollig
,
Jochen Klump
Theory of Computing Systems
48
(1), 2011, pp. 170-188
An almost quadratic time algorithm for sparse spliced alignment
Yoshifumi Sakai
Theory of Computing Systems
48
(1), 2011, pp. 189-210
Privacy in non-private environments
Markus Bläser
,
Andreas Jakoby
,
Maciej Liśkiewicz
,
Bodo Manthey
Theory of Computing Systems
48
(1), 2011, pp. 211-245
Notes on sum-tests and independence tests
Bruno Bauwens
,
Sebastiaan A. Terwijn
Theory of Computing Systems
48
(2), 2011, pp. 247-268
Optimal cache-oblivious mesh layouts
Michael A. Bender
,
Bradley C. Kuszmaul
,
Shang-Hua Teng
,
Kebin Wang
Theory of Computing Systems
48
(2), 2011, pp. 269-296
Beta-shifts, their languages, and computability
Jakob Grue Simonsen
Theory of Computing Systems
48
(2), 2011, pp. 297-318
Complexity of equations over sets of natural numbers
Artur Jeż
,
Alexander Okhotin
Theory of Computing Systems
48
(2), 2011, pp. 319-342
Seiten
<
1
2
3
>