Journal of the ACM, Volume 55, 2008
Volume 55, Number 1, February 2008
Sergey Yekhanin: Towards 3-query locally decodable codes of subexponential length.- Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Bit complexity of breaking and achieving symmetry in chains and rings.
Volume 55, Number 2, May 2008
- Martín Abadi, Bogdan Warinschi: Security analysis of cryptographically controlled access to XML documents.
- Gábor Tardos: Optimal probabilistic fingerprint codes.
Volume 55, Number 3, July 2008
- Ninghui Li, Qihua Wang: Beyond separation of duty: An algebra for specifying high-level security policies.
- Benjamin Rossman: Homomorphism preservation theorems.
Volume 55, Number 4, September 2008
- Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin: The approximability of MAX CSP with fixed-value constraints.
- Omer Reingold: Undirected connectivity in log-space.
- Alain Frisch, Giuseppe Castagna, Véronique Benzaken: Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types.
Volume 55, Number 5, October 2008
- Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon: A fixed-parameter algorithm for the directed feedback vertex set problem.
- Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani: Market equilibrium via a primal--dual algorithm for a convex program.
- Nir Ailon, Moses Charikar, Alantha Newman: Aggregating inconsistent information: Ranking and clustering.
Volume 55, Number 6, December 2008
- Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the impact of combinatorial structure on congestion games.
- Richard E. Korf: Linear-time disk-based implicit graph search.
- Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak &epsis;-nets and interval chains.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team