default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 55, 2008
Volume 55, Number 1, February 2008
- Sergey Yekhanin:
Towards 3-query locally decodable codes of subexponential length. 1:1-1:16 - Sergio Flesca
, Filippo Furfaro, Elio Masciari:
On the minimization of XPath queries. 2:1-2:46 - Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Bit complexity of breaking and achieving symmetry in chains and rings. 3:1-3:28 - Joseph Y. Halpern, Vicky Weissman:
A formal foundation for XrML. 4:1-4:42 - Petr Jancar, Jirí Srba:
Undecidability of bisimilarity by defender's forcing. 5:1-5:26
Volume 55, Number 2, May 2008
- Martín Abadi, Bogdan Warinschi:
Security analysis of cryptographically controlled access to XML documents. 6:1-6:29 - Marcelo Arenas, Leonid Libkin:
XML data exchange: Consistency and query answering. 7:1-7:72 - Michael Benedikt, Wenfei Fan, Floris Geerts:
XPath satisfiability in the presence of DTDs. 8:1-8:79 - Georg Gottlob, Alan Nash:
Efficient core computation in data exchange. 9:1-9:49 - Gábor Tardos:
Optimal probabilistic fingerprint codes. 10:1-10:24 - Wolfgang Mulzer, Günter Rote:
Minimum-weight triangulation is NP-hard. 11:1-11:29
Volume 55, Number 3, July 2008
- Ninghui Li, Qihua Wang:
Beyond separation of duty: An algebra for specifying high-level security policies. 12:1-12:46 - Xi Chen, Xiaotie Deng:
Matching algorithmic bounds for finding a Brouwer fixed point. 13:1-13:26 - Christos H. Papadimitriou, Tim Roughgarden:
Computing correlated equilibria in multi-player games. 14:1-14:29 - Benjamin Rossman:
Homomorphism preservation theorems. 15:1-15:53
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. 16:1-16:37 - Omer Reingold:
Undirected connectivity in log-space. 17:1-17:24 - Baruch Awerbuch, Israel Cidon, Shay Kutten:
Optimal maintenance of a spanning tree. 18:1-18:45 - Alain Frisch, Giuseppe Castagna, Véronique Benzaken:
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types. 19:1-19:64
Volume 55, Number 5, October 2008
- Hagit Attiya, Keren Censor:
Tight bounds for asynchronous randomized consensus. 20:1-20:26 - Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem. 21:1-21:19 - Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market equilibrium via a primal-dual algorithm for a convex program. 22:1-22:18 - Nir Ailon, Moses Charikar, Alantha Newman:
Aggregating inconsistent information: Ranking and clustering. 23:1-23:27 - Ziv Bar-Yossef, Maxim Gurevich:
Random sampling from a search engine's index. 24:1-24:74
Volume 55, Number 6, December 2008
- Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the impact of combinatorial structure on congestion games. 25:1-25:22 - Richard E. Korf:
Linear-time disk-based implicit graph search. 26:1-26:40 - Matthew Andrews, Lisa Zhang:
Almost-tight hardness of directed congestion minimization. 27:1-27:20 - Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. 28:1-28:32
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
