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 Volume=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Security analysis of cryptographically controlled access to XML documents
Martín Abadi
,
Bogdan Warinschi
Journal of the ACM
55
(2), 2008, pp. 6: 1-29
On the impact of combinatorial structure on congestion games
Heiner Ackermann
,
Heiko Röglin
,
Berthold Vöcking
Journal of the ACM
55
(6), 2008, pp. 25: 1-22
Aggregating inconsistent information: Ranking and clustering
Nir Ailon
,
Moses Charikar
,
Alantha Newman
Journal of the ACM
55
(5), 2008, pp. 23: 1-27
Weak
\epsilon
-nets and interval chains
Noga Alon
,
Haim Kaplan
,
Gabriel Nivasch
,
Micha Sharir
,
Shakhar Smorodinsky
Journal of the ACM
55
(6), 2008, pp. 28: 1-32
Almost-tight hardness of directed congestion minimization
Matthew Andrews
,
Lisa Zhang
Journal of the ACM
55
(6), 2008, pp. 27: 1-20
XML data exchange: Consistency and query answering
Marcelo Arenas
,
Leonid Libkin
Journal of the ACM
55
(2), 2008, pp. 7: 1-72
Tight bounds for asynchronous randomized consensus
Hagit Attiya
,
Keren Censor
Journal of the ACM
55
(5), 2008, pp. 20: 1-26
Optimal maintenance of a spanning tree
Baruch Awerbuch
,
Israel Cidon
,
Shay Kutten
Journal of the ACM
55
(4), 2008, pp. 18: 1-45
Random sampling from a search engine's index
Ziv Bar-Yossef
,
Maxim Gurevich
Journal of the ACM
55
(5), 2008, pp. 24: 1-74
XPath satisfiability in the presence of DTDs
Michael Benedikt
,
Wenfei Fan
,
Floris Geerts
Journal of the ACM
55
(2), 2008, pp. 8: 1-79
Matching algorithmic bounds for finding a Brouwer fixed point
Xi Chen
,
Xiaotie Deng
Journal of the ACM
55
(3), 2008, pp. 13: 1-26
A fixed-parameter algorithm for the directed Feedback Vertex Set problem
Jianer Chen
,
Yang Liu
,
Songjian Lu
,
Barry O'Sullivan
,
Igor Razgon
Journal of the ACM
55
(5), 2008, pp. 21: 1-19
The approximability of MAX CSP with fixed-value constraints
Vladimir Deineko
,
Peter Jonsson
,
Mikael Klasson
,
Andrei Krokhin
Journal of the ACM
55
(4), 2008, pp. 16: 1-37
Market equilibrium via a primal-dual algorithm for a convex program
Nikhil R. Devanur
,
Christos H. Papadimitriou
,
Amin Saberi
,
Vijay V. Vazirani
Journal of the ACM
55
(5), 2008, pp. 22: 1-18
Bit complexity of breaking and achieving symmetry in chains and rings
Yefim Dinitz
,
Shlomo Moran
,
Sergio Rajsbaum
Journal of the ACM
55
(1), 2008, pp. 3: 1-28
On the minimization of XPath queries
S. Flesca
,
F. Furfaro
,
E. Masciari
Journal of the ACM
55
(1), 2008, pp. 2: 1-46
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
Alain Frisch
,
Giuseppe Castagna
,
Véronique Benzaken
Journal of the ACM
55
(4), 2008, pp. 19: 1-64
Efficient core computation in data exchange
Georg Gottlob
,
Alan Nash
Journal of the ACM
55
(2), 2008, pp. 9: 1-49
A formal foundation for XrML
Joseph Y. Halpern
,
Vicky Weissman
Journal of the ACM
55
(1), 2008, pp. 4: 1-42
Undecidability of bisimilarity by Defender's Forcing
Petr Janc̑ar
,
Jiȓí Srba
Journal of the ACM
55
(1), 2008, pp. 5: 1-26
Linear-time disk-based implicit graph search
Richard E. Korf
Journal of the ACM
55
(6), 2008, pp. 26: 1-40
Beyond separation of duty: An algebra for specifying high-level security policies
Ninghui Li
,
Qihua Wang
Journal of the ACM
55
(3), 2008, pp. 12: 1-46
Minimum-weight triangulation is
NP
-hard
Wolfgang Mulzer
,
Günter Rote
Journal of the ACM
55
(2), 2008, pp. 11: 1-29
Computing correlated equilibria in multi-player games
Christos H. Papadimitriou
,
Tim Roughgarden
Journal of the ACM
55
(3), 2008, pp. 14: 1-29
Undirected connectivity in log-space
Omer Reingold
Journal of the ACM
55
(4), 2008, pp. 17: 1-24
Seiten 1
2
>