Остановите войну!
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 49 matches
- 2013
- Emmanuel Abbe, Andrea Montanari:
Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration. APPROX-RANDOM 2013: 332-346 - Kook Jin Ahn, Sudipto Guha, Andrew McGregor:
Spectral Sparsification in Dynamic Graph Streams. APPROX-RANDOM 2013: 1-10 - Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat:
The Online Stochastic Generalized Assignment Problem. APPROX-RANDOM 2013: 11-25 - Per Austrin, Rajsekar Manokaran, Cenny Wenner:
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. APPROX-RANDOM 2013: 26-41 - Lucia Batman, Russell Impagliazzo, Cody Murray, Ramamohan Paturi:
Finding Heavy Hitters from Lossy or Noisy Data. APPROX-RANDOM 2013: 347-362 - Amos Beimel, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. APPROX-RANDOM 2013: 363-378 - Antonio Blanca, David J. Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2. APPROX-RANDOM 2013: 379-394 - Avrim Blum, Aaron Roth:
Fast Private Data Release Algorithms for Sparse Queries. APPROX-RANDOM 2013: 395-410 - Vladimir Braverman, Rafail Ostrovsky:
Approximating Large Frequency Moments with Pick-and-Drop Sampling. APPROX-RANDOM 2013: 42-57 - Vladimir Braverman, Rafail Ostrovsky:
Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams. APPROX-RANDOM 2013: 58-70 - Andrea Campagna, Alan Guo, Ronitt Rubinfeld:
Local Reconstructors and Tolerant Testers for Connectivity and Diameter. APPROX-RANDOM 2013: 411-424 - Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan:
Capacitated Network Design on Undirected Graphs. APPROX-RANDOM 2013: 71-80 - Deeparnab Chakrabarty, C. Seshadhri:
An Optimal Lower Bound for Monotonicity Testing over Hypergrids. APPROX-RANDOM 2013: 425-435 - Sixia Chen, Cristopher Moore, Alexander Russell:
Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem. APPROX-RANDOM 2013: 436-451 - Edith Cohen, Haim Kaplan:
What You Can Do with Coordinated Samples. APPROX-RANDOM 2013: 452-467 - Edith Cohen, Haim Kaplan, Yishay Mansour:
Scheduling Subset Tests: One-Time, Continuous, and How They Relate. APPROX-RANDOM 2013: 81-95 - Matthew Coudron, Thomas Vidick, Henry Yuen:
Robust Randomness Amplifiers: Upper and Lower Bounds. APPROX-RANDOM 2013: 468-483 - Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. APPROX-RANDOM 2013: 484-496 - Roee David, Uriel Feige:
Connectivity of Random High Dimensional Geometric Graphs. APPROX-RANDOM 2013: 497-512 - Adrian Dumitrescu, Csaba D. Tóth:
On the Total Perimeter of Homothetic Convex Bodies in a Convex Container. APPROX-RANDOM 2013: 96-109 - Zeev Dvir, Guangda Hu:
Matching-Vector Families and LDCs over Large Modulo. APPROX-RANDOM 2013: 513-526 - Katherine Edwards, Simon Griffiths, William Sean Kennedy:
Partial Interval Set Cover - Trade-Offs between Scalability and Optimality. APPROX-RANDOM 2013: 110-125 - Sándor P. Fekete, Hella-Franziska Hoffmann:
Online Square-into-Square Packing. APPROX-RANDOM 2013: 126-141 - Michael A. Forbes, Amir Shpilka:
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. APPROX-RANDOM 2013: 527-542 - Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions. APPROX-RANDOM 2013: 142-157 - Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén:
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. APPROX-RANDOM 2013: 158-172 - Zachary Friggstad:
Multiple Traveling Salesmen in Asymmetric Metrics. APPROX-RANDOM 2013: 173-188 - Shayan Oveis Gharan, Luca Trevisan:
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. APPROX-RANDOM 2013: 303-316 - Yonatan Goldhirsh, Michael Viderman:
Testing Membership in Counter Automaton Languages. APPROX-RANDOM 2013: 543-558 - Elena Grigorescu, Karl Wimmer, Ning Xie:
Tight Lower Bounds for Testing Linear Isomorphism. APPROX-RANDOM 2013: 559-574
skipping 19 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 12:37 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