Остановите войну!
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 51 matches
- 2017
- Xi Chen, Adam Freilich, Rocco A. Servedio, Timothy Sun:
Sample-Based High-Dimensional Convexity Testing. APPROX-RANDOM 2017: 37:1-37:20 - Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten:
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces. APPROX-RANDOM 2017: 38:1-38:21 - Rupam Acharyya, Daniel Stefankovic:
Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences. APPROX-RANDOM 2017: 23:1-23:22 - Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan:
On the Expansion of Group-Based Lifts. APPROX-RANDOM 2017: 24:1-24:13 - Vedat Levi Alev, Lap Chi Lau:
Approximating Unique Games Using Low Diameter Graph Decomposition. APPROX-RANDOM 2017: 18:1-18:15 - Noga Alon, Omri Ben-Eliezer:
Efficient Removal Lemmas for Matrices. APPROX-RANDOM 2017: 25:1-25:18 - Omer Angel, Abbas Mehrabian, Yuval Peres:
The String of Diamonds Is Tight for Rumor Spreading. APPROX-RANDOM 2017: 26:1-26:9 - Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, Roger Wattenhofer:
Min-Cost Bipartite Perfect Matching with Delays. APPROX-RANDOM 2017: 1:1-1:20 - Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Sharper Bounds for Regularized Data Fitting. APPROX-RANDOM 2017: 27:1-27:22 - Jess Banks, Robert Kleinberg, Cristopher Moore:
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime. APPROX-RANDOM 2017: 28:1-28:22 - Anna Ben-Hamou, Yuval Peres:
Cutoff for a Stratified Random Walk on the Hypercube. APPROX-RANDOM 2017: 29:1-29:10 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM 2017: 2:1-2:20 - Arnab Bhattacharyya, Sivakanth Gopi, Avishay Tal:
Lower Bounds for 2-Query LCCs over Large Alphabet. APPROX-RANDOM 2017: 30:1-30:20 - Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee:
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere. APPROX-RANDOM 2017: 31:1-31:20 - Jaroslaw Blasiok, Jian Ding, Jelani Nelson:
Continuous Monitoring of l_p Norms in Data Streams. APPROX-RANDOM 2017: 32:1-32:13 - Glencora Borradaile, Baigong Zheng:
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs. APPROX-RANDOM 2017: 3:1-3:13 - Joshua Brakensiek:
Vertex Isoperimetry and Independent Set Stability for Tensor Powers of Cliques. APPROX-RANDOM 2017: 33:1-33:15 - Joshua Brakensiek, Venkatesan Guruswami:
The Quest for Strong Inapproximability Results with Perfect Completeness. APPROX-RANDOM 2017: 4:1-4:20 - Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. APPROX-RANDOM 2017: 34:1-34:21 - Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Agnostic Learning from Tolerant Natural Proofs. APPROX-RANDOM 2017: 35:1-35:19 - L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi:
On the Complexity of Constrained Determinantal Point Processes. APPROX-RANDOM 2017: 36:1-36:22 - Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Axis-Parallel Tests for Tensor Product Codes. APPROX-RANDOM 2017: 39:1-39:22 - Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos:
Charting the Replica Symmetric Phase. APPROX-RANDOM 2017: 40:1-40:17 - Dean Doron, François Le Gall, Amnon Ta-Shma:
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. APPROX-RANDOM 2017: 41:1-41:20 - Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming Periodicity with Mismatches. APPROX-RANDOM 2017: 42:1-42:21 - S. Luna Frank-Fischer, Venkatesan Guruswami, Mary Wootters:
Locality via Partially Lifted Codes. APPROX-RANDOM 2017: 43:1-43:17 - Cody R. Freitag, Eric Price, William J. Swartworth:
Testing Hereditary Properties of Sequences. APPROX-RANDOM 2017: 44:1-44:10 - Alan M. Frieze, Wesley Pegden:
Traveling in Randomly Embedded Random Graphs. APPROX-RANDOM 2017: 45:1-45:17 - Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang:
Scheduling Problems over Network of Machines. APPROX-RANDOM 2017: 5:1-5:18 - Michel X. Goemans, Francisco Unda:
Approximating Incremental Combinatorial Optimization Problems. APPROX-RANDOM 2017: 6:1-6:14
skipping 21 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-24 07: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