Остановите войну!
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 57 matches
- 2012
- Anil Ada, Omar Fawzi, Hamed Hatami:
Spectral Norm of Symmetric Functions. APPROX-RANDOM 2012: 338-349 - Noga Alon, Shachar Lovett:
Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions. APPROX-RANDOM 2012: 350-361 - Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva:
Testing Permanent Oracles - Revisited. APPROX-RANDOM 2012: 362-373 - Per Austrin, Ryan O'Donnell, John Wright:
A New Point of NP-Hardness for 2-to-1 Label Cover. APPROX-RANDOM 2012: 1-12 - Per Austrin, Toniann Pitassi, Yu Wu:
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems. APPROX-RANDOM 2012: 13-24 - Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet:
Additive Approximation for Near-Perfect Phylogeny Construction. APPROX-RANDOM 2012: 25-36 - Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. APPROX-RANDOM 2012: 374-386 - Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. APPROX-RANDOM 2012: 387-398 - Pranjal Awasthi, Or Sheffet:
Improved Spectral-Norm Bounds for Clustering. APPROX-RANDOM 2012: 37-49 - Eli Ben-Sasson, Ariel Gabizon:
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. APPROX-RANDOM 2012: 399-410 - Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel:
Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM 2012: 411-422 - Piotr Berman, Grigory Yaroslavtsev:
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. APPROX-RANDOM 2012: 50-60 - Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan:
Optimal Hitting Sets for Combinatorial Shapes. APPROX-RANDOM 2012: 423-434 - Eric Blais, Daniel M. Kane:
Tight Bounds for Testing k-Linearity. APPROX-RANDOM 2012: 435-446 - Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for Linear Length Branching Programs and Stack Machines. APPROX-RANDOM 2012: 447-458 - Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss:
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. APPROX-RANDOM 2012: 61-72 - Mark Braverman, Omri Weinstein:
A Discrepancy Lower Bound for Information Complexity. APPROX-RANDOM 2012: 459-470 - Nader H. Bshouty:
On the Coin Weighing Problem with the Presence of Noise. APPROX-RANDOM 2012: 471-482 - Amit Chakrabarti, Ranganath Kondapally, Zhenghui Wang:
Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming. APPROX-RANDOM 2012: 483-494 - Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna:
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply. APPROX-RANDOM 2012: 73-84 - Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
Online Flow Time Scheduling in the Presence of Preemption Overhead. APPROX-RANDOM 2012: 85-97 - Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari:
An Explicit VC-Theorem for Low-Degree Polynomials. APPROX-RANDOM 2012: 495-504 - Chandra Chekuri, Alina Ene, Ali Vakilian:
Prize-Collecting Survivable Network Design in Node-Weighted Graphs. APPROX-RANDOM 2012: 98-109 - Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. APPROX-RANDOM 2012: 110-121 - Varsha Dani, Cristopher Moore, Anna Olson:
Tight Bounds on the Threshold for Permuted k-Colorability. APPROX-RANDOM 2012: 505-516 - Anirban Dasgupta, Ravi Kumar, D. Sivakumar:
Sparse and Lopsided Set Disjointness via Information Theory. APPROX-RANDOM 2012: 517-528 - Michael Dinitz, Gordon T. Wilfong:
iBGP and Constrained Connectivity. APPROX-RANDOM 2012: 122-133 - Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. APPROX-RANDOM 2012: 529-540 - Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. APPROX-RANDOM 2012: 134-145 - Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa:
A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. APPROX-RANDOM 2012: 146-157
skipping 27 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-30 13:21 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