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=Theory of Computing Systems AND Volume=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
A hierarchy of monotone deterministic non-forgetting restarting automata
Hartmut Messerschmidt
,
Friedrich Otto
Theory of Computing Systems
48
(2), 2011, pp. 343-373
The strongest model of computation obeying 0-1 principles
Tamir Levi
,
Ami Litman
Theory of Computing Systems
48
(2), 2011, pp. 374-388
Spreading of messages in random graphs
Ching-Lueh Chang
,
Yuh-Dauh Lyuu
Theory of Computing Systems
48
(2), 2011, pp. 389-401
Vertex cover problem parameterized above and below tight bounds
Gregory Gutin
,
Eun Jung Kim
,
Michael Lampis
,
Valia Mitsou
Theory of Computing Systems
48
(2), 2011, pp. 402-410
Tilings and submonoids of Metabelian groups
Markus Lohrey
,
Benjamin Steinberg
Theory of Computing Systems
48
(2), 2011, pp. 411-427
Sublinear time algorithms for earth mover's distance
Khanh Do Ba
,
Huy L. Nguyen
,
Huy N. Nguyen
,
Ronitt Rubinfeld
Theory of Computing Systems
48
(2), 2011, pp. 428-442
Tractable structures for constraint satisfaction with truth tables
Dániel Marx
Theory of Computing Systems
48
(3), 2011, pp. 444-464
Randomness on computable probability spaces - A dynamical point of view
Peter Gács
,
Mathieu Hoyrup
,
Cristóbal Rojas
Theory of Computing Systems
48
(3), 2011, pp. 465-485
Fragments of first-order logic over infinite words
Volker Diekert
,
Manfred Kufleitner
Theory of Computing Systems
48
(3), 2011, pp. 486-516
Ambiguity and communication
Juraj Hromkovic̑
,
Georg Schnitger
Theory of Computing Systems
48
(3), 2011, pp. 517-534
Generating shorter bases for hard random lattices
Joël Alwen
,
Chris Peikert
Theory of Computing Systems
48
(3), 2011, pp. 535-553
Seiten 1
2
>