Остановите войну!
for scientists:
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 45 matches
- 2013
- Noga Alon, Raphael Yuster:
Matrix sparsification and nested dissection over arbitrary fields. J. ACM 60(4): 25:1-25:18 (2013) - Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. J. ACM 60(2): 15:1-15:38 (2013) - Spyros Angelopoulos, Pascal Schweitzer:
Paging and list update under bijective analysis. J. ACM 60(2): 7:1-7:18 (2013) - Marcelo Arenas, Jorge Pérez, Juan L. Reutter:
Data exchange beyond complete data. J. ACM 60(4): 28:1-28:59 (2013) - Maria-Florina Balcan, Avrim Blum, Anupam Gupta:
Clustering under approximation stability. J. ACM 60(2): 8:1-8:34 (2013) - Anindya Banerjee, David A. Naumann:
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries. J. ACM 60(3): 19:1-19:73 (2013) - Anindya Banerjee, David A. Naumann, Stan Rosenberg:
Local Reasoning for Global Invariants, Part I: Region Logic. J. ACM 60(3): 18:1-18:56 (2013) - Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing Closeness of Discrete Distributions. J. ACM 60(1): 4:1-4:25 (2013) - Avrim Blum, Katrina Ligett, Aaron Roth:
A learning theory approach to noninteractive database privacy. J. ACM 60(2): 12:1-12:25 (2013) - Andrei A. Bulatov:
The complexity of the counting constraint satisfaction problem. J. ACM 60(5): 34:1-34:41 (2013) - Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM 60(5): 32:1-32:36 (2013) - Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità:
Steiner Tree Approximation via Iterative Randomized Rounding. J. ACM 60(1): 6:1-6:33 (2013) - Frédéric Chazal, Leonidas J. Guibas, Steve Y. Oudot, Primoz Skraba:
Persistence-Based Clustering in Riemannian Manifolds. J. ACM 60(6): 41:1-41:38 (2013) - Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast matrix rank algorithms and applications. J. ACM 60(5): 31:1-31:25 (2013) - Michael Drmota, Wojciech Szpankowski:
A Master Theorem for Discrete Divide and Conquer Recurrences. J. ACM 60(3): 16:1-16:49 (2013) - Zdenek Dvorák, Daniel Král, Robin Thomas:
Testing first-order properties for subclasses of sparse graphs. J. ACM 60(5): 36:1-36:24 (2013) - Omar Fawzi, Patrick M. Hayden, Pranab Sen:
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking. J. ACM 60(6): 44:1-44:61 (2013) - Pierre Fraigniaud, Amos Korman, David Peleg:
Towards a complexity theory for local distributed computing. J. ACM 60(5): 35:1-35:26 (2013) - Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski:
Asynchronous gossip. J. ACM 60(2): 11:1-11:42 (2013) - Guillem Godoy, Omer Giménez:
The HOM problem is decidable. J. ACM 60(4): 23:1-23:44 (2013) - Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower bounds for local approximation. J. ACM 60(5): 39:1-39:23 (2013) - Georg Gottlob, Gianluigi Greco:
Decomposing combinatorial auctions and set packing problems. J. ACM 60(4): 24:1-24:39 (2013) - Navin Goyal, Neil Olver, F. Bruce Shepherd:
The VPN Conjecture Is True. J. ACM 60(3): 17:1-17:17 (2013) - Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick:
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor. J. ACM 60(1): 1:1-1:16 (2013) - Aram W. Harrow, Ashley Montanaro:
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization. J. ACM 60(1): 3:1-3:43 (2013) - Christopher J. Hillar, Lek-Heng Lim:
Most Tensor Problems Are NP-Hard. J. ACM 60(6): 45:1-45:39 (2013) - Naoki Kobayashi:
Model Checking Higher-Order Programs. J. ACM 60(3): 20:1-20:62 (2013) - Phokion G. Kolaitis, Swastik Kopparty:
Random graphs and the parity quantifier. J. ACM 60(5): 37:1-37:34 (2013) - Vladimir Kolmogorov, Stanislav Zivný:
The complexity of conservative valued CSPs. J. ACM 60(2): 10:1-10:38 (2013) - James Laird:
Game semantics for a polymorphic programming language. J. ACM 60(4): 29:1-29:27 (2013)
skipping 15 more matches
loading more results
failed to load more results, please try again later
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-05-12 05: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