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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
Klaus Ambos-Spies
,
Decheng Ding
,
Yun Fan
,
Wolfgang Merkle
Theory of Computing Systems
52
(1), 2013, pp. 2-27
On the gap between trivial and nontrivial initial segment prefix-free complexity
Martijn Baartse
,
George Barmpalias
Theory of Computing Systems
52
(1), 2013, pp. 28-47
Effective randomness of unions and intersections
Douglas Cenzer
,
Rebecca Weber
Theory of Computing Systems
52
(1), 2013, pp. 48-64
Martin-Löf randomness, invariant measures and countable homogeneous structures
Willem L. Fouché
Theory of Computing Systems
52
(1), 2013, pp. 65-79
Time-bounded Kolmogorov complexity and Solovay functions
Rupert Hölzl
,
Thorsten Kräling
,
Wolfgang Merkle
Theory of Computing Systems
52
(1), 2013, pp. 80-94
Dimension is compression
María López-Valdés
,
Elvira Mayordomo
Theory of Computing Systems
52
(1), 2013, pp. 95-112
Characterization of Kurtz randomness by a differentiation theorem
Kenshi Miyabe
Theory of Computing Systems
52
(1), 2013, pp. 113-132
Using ideas of Kolmogorov complexity for studying biological texts
Boris Ryabko
,
Zhanna Reznikova
,
Alexey Druzyaka
Theory of Computing Systems
52
(1), 2013, pp. 133-147
Axiomatizing Kolmogorov complexity
Antoine Taveneaux
Theory of Computing Systems
52
(1), 2013, pp. 148-161
One-way functions using algorithmic and classical information theories
Luís Antunes
,
Armando Matos
,
Alexandre Pinto
,
André Souto
Theory of Computing Systems
52
(1), 2013, pp. 162-178
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Jurek Czyzowicz
,
Adrian Kosowski
,
Andrzej Pelc
Theory of Computing Systems
52
(2), 2013, pp. 179-199
Strategic multiway cut and multicut games
Elliot Anshelevich
,
Bugra Caskurlu
,
Ameya Hate
Theory of Computing Systems
52
(2), 2013, pp. 200-220
Parameterized random complexity
Juan Andrés Montoya
,
Moritz Müller
Theory of Computing Systems
52
(2), 2013, pp. 221-270
A combinatorial analysis for the critical clause tree
Masaki Yamamoto
Theory of Computing Systems
52
(2), 2013, pp. 271-284
Energy-efficient communication in multi-interface wireless networks
Stavros Athanassopoulos
,
Ioannis Caragiannis
Theory of Computing Systems
52
(2), 2013, pp. 285-296
An additivity theorem for plain Kolmogorov complexity
Bruno Bauwens
,
Alexander Shen
Theory of Computing Systems
52
(2), 2013, pp. 297-302
On reversible cascades in scale-free and Erdŏs-Rényi random graphs
Ching-Lueh Chang
,
Chao-Hong Wang
Theory of Computing Systems
52
(2), 2013, pp. 303-318
On the expansion and diameter of Bluetooth-like topologies
Alberto Pettarin
,
Andrea Pietracaprina
,
Geppino Pucci
Theory of Computing Systems
52
(2), 2013, pp. 319-339
(Approximate) uncertain skylines
Peyman Afshani
,
Pankaj K. Agarwal
,
Lars Arge
Theory of Computing Systems
52
(3), 2013, pp. 342-366
Querying probabilistic business processes for sub-flows
Daniel Deutch
Theory of Computing Systems
52
(3), 2013, pp. 367-402
Knowledge compilation meets database theory: Compiling queries to decision diagrams
Abhay Jha
,
Dan Suciu
Theory of Computing Systems
52
(3), 2013, pp. 403-440
Data cleaning and query answering with matching dependencies and matching functions
Leopoldo Bertossi
,
Solmaz Kolahi
,
Laks V.S. Lakshmanan
Theory of Computing Systems
52
(3), 2013, pp. 441-482
Relaxed notions of schema mapping equivalence revisited
Reinhard Pichler
,
Emanuel Sallinger
,
Vadim Savenkov
Theory of Computing Systems
52
(3), 2013, pp. 483-541
Generating, sampling and counting subclasses of regular tree languages
Timos Antonopoulos
,
Floris Geerts
,
Wim Martens
,
Frank Neven
Theory of Computing Systems
52
(3), 2013, pp. 542-585
On rationality of verbal subsets in a group
A. Myasnikov
,
V. Roman'kov
Theory of Computing Systems
52
(4), 2013, pp. 587-598
Seiten 1
2
>