![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2008
- Martín Abadi, Bogdan Warinschi:
Security analysis of cryptographically controlled access to XML documents. J. ACM 55(2): 6:1-6:29 (2008) - Heiner Ackermann, Heiko Röglin
, Berthold Vöcking:
On the impact of combinatorial structure on congestion games. J. ACM 55(6): 25:1-25:22 (2008) - Nir Ailon, Moses Charikar
, Alantha Newman:
Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5): 23:1-23:27 (2008) - Noga Alon, Haim Kaplan, Gabriel Nivasch
, Micha Sharir, Shakhar Smorodinsky
:
Weak ε-nets and interval chains. J. ACM 55(6): 28:1-28:32 (2008) - Matthew Andrews, Lisa Zhang:
Almost-tight hardness of directed congestion minimization. J. ACM 55(6): 27:1-27:20 (2008) - Marcelo Arenas, Leonid Libkin
:
XML data exchange: Consistency and query answering. J. ACM 55(2): 7:1-7:72 (2008) - Hagit Attiya
, Keren Censor:
Tight bounds for asynchronous randomized consensus. J. ACM 55(5): 20:1-20:26 (2008) - Baruch Awerbuch, Israel Cidon, Shay Kutten:
Optimal maintenance of a spanning tree. J. ACM 55(4): 18:1-18:45 (2008) - Ziv Bar-Yossef, Maxim Gurevich:
Random sampling from a search engine's index. J. ACM 55(5): 24:1-24:74 (2008) - Michael Benedikt
, Wenfei Fan
, Floris Geerts
:
XPath satisfiability in the presence of DTDs. J. ACM 55(2): 8:1-8:79 (2008) - Xi Chen
, Xiaotie Deng
:
Matching algorithmic bounds for finding a Brouwer fixed point. J. ACM 55(3): 13:1-13:26 (2008) - Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan
, Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5): 21:1-21:19 (2008) - Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
:
The approximability of MAX CSP with fixed-value constraints. J. ACM 55(4): 16:1-16:37 (2008) - Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5): 22:1-22:18 (2008) - Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
:
Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1): 3:1-3:28 (2008) - Sergio Flesca
, Filippo Furfaro
, Elio Masciari
:
On the minimization of XPath queries. J. ACM 55(1): 2:1-2:46 (2008) - Alain Frisch, Giuseppe Castagna, Véronique Benzaken
:
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types. J. ACM 55(4): 19:1-19:64 (2008) - Georg Gottlob
, Alan Nash:
Efficient core computation in data exchange. J. ACM 55(2): 9:1-9:49 (2008) - Joseph Y. Halpern, Vicky Weissman:
A formal foundation for XrML. J. ACM 55(1): 4:1-4:42 (2008) - Petr Jancar
, Jirí Srba
:
Undecidability of bisimilarity by defender's forcing. J. ACM 55(1): 5:1-5:26 (2008) - Richard E. Korf:
Linear-time disk-based implicit graph search. J. ACM 55(6): 26:1-26:40 (2008) - Ninghui Li, Qihua Wang:
Beyond separation of duty: An algebra for specifying high-level security policies. J. ACM 55(3): 12:1-12:46 (2008) - Wolfgang Mulzer
, Günter Rote:
Minimum-weight triangulation is NP-hard. J. ACM 55(2): 11:1-11:29 (2008) - Christos H. Papadimitriou, Tim Roughgarden:
Computing correlated equilibria in multi-player games. J. ACM 55(3): 14:1-14:29 (2008) - Omer Reingold:
Undirected connectivity in log-space. J. ACM 55(4): 17:1-17:24 (2008) - Benjamin Rossman:
Homomorphism preservation theorems. J. ACM 55(3): 15:1-15:53 (2008) - Gábor Tardos
:
Optimal probabilistic fingerprint codes. J. ACM 55(2): 10:1-10:24 (2008) - Sergey Yekhanin:
Towards 3-query locally decodable codes of subexponential length. J. ACM 55(1): 1:1-1:16 (2008)
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-20 20:48 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint