Остановите войну!
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 53 matches
- 2017
- Pranjal Awasthi, Maria-Florina Balcan, Philip M. Long:
The Power of Localization for Efficiently Learning Linear Separators with Noise. J. ACM 63(6): 50:1-50:27 (2017) - Amin Coja-Oghlan:
Belief Propagation Guided Decimation Fails on Random Formulas. J. ACM 63(6): 49:1-49:55 (2017) - Mohab Safey El Din, Éric Schost:
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. J. ACM 63(6): 48:1-48:37 (2017) - David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Faster Polynomial Multiplication over Finite Fields. J. ACM 63(6): 52:1-52:23 (2017) - 2016
- George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. J. ACM 63(2): 11:1-11:19 (2016) - Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck:
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63(5): 41:1-41:26 (2016) - Dimitris Achlioptas, Fotis Iliopoulos:
Random Walks That Find Perfect Objects and the Lovász Local Lemma. J. ACM 63(3): 22:1-22:29 (2016) - Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are Lock-Free Concurrent Algorithms Practically Wait-Free? J. ACM 63(4): 31:1-31:20 (2016) - Shaull Almagor, Udi Boker, Orna Kupferman:
Formally Reasoning About Quality. J. ACM 63(3): 24:1-24:56 (2016) - Reid Andersen, Shayan Oveis Gharan, Yuval Peres, Luca Trevisan:
Almost Optimal Local Graph Clustering Using Evolving Sets. J. ACM 63(2): 15:1-15:31 (2016) - Sanjeev Arora, Satyen Kale:
A Combinatorial, Primal-Dual Approach to Semidefinite Programs. J. ACM 63(2): 12:1-12:35 (2016) - Yakov Babichenko:
Query Complexity of Approximate Nash Equilibria. J. ACM 63(4): 36:1-36:24 (2016) - Leonid Barenboim:
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks. J. ACM 63(5): 47:1-47:22 (2016) - Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
The Locality of Distributed Symmetry Breaking. J. ACM 63(3): 20:1-20:45 (2016) - Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM 63(4): 32:1-32:57 (2016) - Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. J. ACM 63(1): 3:1-3:36 (2016) - Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016) - Siu On Chan:
Approximation Resistance from Pairwise-Independent Subgroups. J. ACM 63(3): 27:1-27:32 (2016) - Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. J. ACM 63(4): 34:1-34:22 (2016) - Chandra Chekuri, Julia Chuzhoy:
Polynomial Bounds for the Grid-Minor Theorem. J. ACM 63(5): 40:1-40:65 (2016) - Ventsislav Chonev, Joël Ouaknine, James Worrell:
On the Complexity of the Orbit Problem. J. ACM 63(3): 23:1-23:18 (2016) - Julia Chuzhoy, Shi Li:
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. J. ACM 63(5): 45:1-45:51 (2016) - Shahar Dobzinski, Jan Vondrák:
Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations. J. ACM 63(1): 5:1-5:19 (2016) - Benjamin Doerr, Carola Doerr, Reto Spöhel, Henning Thomas:
Playing Mastermind With Many Colors. J. ACM 63(5): 42:1-42:23 (2016) - Shaddin Dughmi, Tim Roughgarden, Qiqi Yan:
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding. J. ACM 63(4): 30:1-30:33 (2016) - Zeev Dvir, Sivakanth Gopi:
2-Server PIR with Subpolynomial Communication. J. ACM 63(4): 39:1-39:15 (2016) - Javier Esparza, Pierre Ganty, Rupak Majumdar:
Parameterized Verification of Asynchronous Shared-Memory Systems. J. ACM 63(1): 10:1-10:48 (2016) - Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM 63(4): 29:1-29:60 (2016) - Pierre Fraigniaud, Amos Korman:
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. J. ACM 63(1): 6:1-6:31 (2016) - Murdoch James Gabbay:
Semantics Out of Context: Nominal Absolute Denotations for First-Order Logic and Computation. J. ACM 63(3): 25:1-25:66 (2016)
skipping 23 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-23 17:27 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