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=J. ACM AND YEAR=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight bounds for asynchronous renaming
Dan Alistarh
,
James Aspnes
,
Keren Censor-Hillel
,
Seth Gilbert
,
Rachid Guerraoui
Journal of the ACM
61
(3), 2014, pp. 18: 1-51
XML schema mappings: Data exchange and metadata management
Shun'ichi Amano
,
Claire David
,
Leonid Libkin
,
Filip Murlak
Journal of the ACM
61
(2), 2014, pp. 12: 1-48
A logic for true concurrency
Paolo Baldan
,
Silvia Crafa
Journal of the ACM
61
(4), 2014, pp. 24: 1-36
Querying regular graph patterns
Pablo Barceló
,
Leonid Libkin
,
Juan L. Reutter
Journal of the ACM
61
(1), 2014, pp. 8: 1-54
Constraint satisfaction problems solvable by local consistency methods
Libor Barto
,
Marcin Kozik
Journal of the ACM
61
(1), 2014, pp. 3: 1-19
Ranking functions for linear-constraint loops
Amir M. Ben-Amram
,
Samir Genaim
Journal of the ACM
61
(4), 2014, pp. 26: 1-55
An additive combinatorics approach relating rank to communication complexity
Eli Ben-Sasson
,
Shachar Lovett
,
Noga Ron-Zewi
Journal of the ACM
61
(4), 2014, pp. 22: 1-18
Beyond Lamport's happened-before: On time bounds and the ordering of events in distributed systems
Ido Ben-Zvi
,
Yoram Moses
Journal of the ACM
61
(2), 2014, pp. 13: 1-26
Fast interactive coding against adversarial noise
Zvika Brakerski
,
Yael Tauman Kalai
,
Moni Naor
Journal of the ACM
61
(6), 2014, pp. 35: 1-30
Efficient analysis of probabilistic programs with an unbounded counter
Tomás Brázdil
,
Stefan Kiefer
,
Antonín Kuc̑era
Journal of the ACM
61
(6), 2014, pp. 41: 1-35
Undecidability of propositional separation logic and its neighbours
James Brotherston
,
Max Kanovich
Journal of the ACM
61
(2), 2014, pp. 14: 1-43
Computing all maps into a sphere
Martin C̑adek
,
Marek Krc̑ál
,
Jiȓí Matous̑ek
,
Francis Sergeraert
,
Lukás̑ Vokȓínek
,
Uli Wagner
Journal of the ACM
61
(3), 2014, pp. 17: 1-44
Avoiding three consecutive blocks of the same size and same sum
Julien Cassaigne
,
James D. Currie
,
Luke Schaeffer
,
Jeffrey Shallit
Journal of the ACM
61
(2), 2014, pp. 10: 1-17
Privacy amplification with asymptotically optimal entropy loss
Nishanth Chandran
,
Bhavana Kanukurthi
,
Rafail Ostrovsky
,
Leonid Reyzin
Journal of the ACM
61
(5), 2014, pp. 29: 1-28
Approximating Markov processes by averaging
Philippe Chaput
,
Vincent Danos
,
Prakash Panangaden
,
Gordon Plotkin
Journal of the ACM
61
(1), 2014, pp. 5: 1-45
Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
Krishnendu Chatterjee
,
Monika Henzinger
Journal of the ACM
61
(3), 2014, pp. 15: 1-40
The convergence of bird flocking
Bernard Chazelle
Journal of the ACM
61
(4), 2014, pp. 21: 1-35
The cost of fault tolerance in multi-party communication complexity
Binbin Chen
,
Haifeng Yu
,
Yuda Zhao
,
Phillip B. Gibbons
Journal of the ACM
61
(3), 2014, pp. 19: 1-64
Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces
Anindya De
,
Ilias Diakonikolas
,
Vitaly Feldman
,
Rocco A. Servedio
Journal of the ACM
61
(2), 2014, pp. 11: 1-36
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Holger Dell
,
Dieter van Melkebeek
Journal of the ACM
61
(4), 2014, pp. 23: 1-27
Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation
Danny Dolev
,
Matthias Függer
,
Ulrich Schmid
,
Christoph Lenzen
Journal of the ACM
61
(5), 2014, pp. 30: 1-74
Linear-time approximation for maximum weight matching
Ran Duan
,
Seth Pettie
Journal of the ACM
61
(1), 2014, pp. 1: 1-23
Privacy aware learning
John C. Duchi
,
Michael I. Jordan
,
Martin J. Wainwright
Journal of the ACM
61
(6), 2014, pp. 38: 1-57
Solving the weighted stable set problem in claw-free graphs via decomposition
Yuri Faenza
,
Gianpaolo Oriolo
,
Gautier Stauffer
Journal of the ACM
61
(4), 2014, pp. 20: 1-41
Approaching the chasm at depth four
Ankit Gupta
,
Pritish Kamath
,
Neeraj Kayal
,
Ramprasad Saptharishi
Journal of the ACM
61
(6), 2014, pp. 33: 1-16
Seiten 1
2
>