Остановите войну!
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 59 matches
- 2011
- Mohammed Amin Abdullah, Colin Cooper, Moez Draief:
Viral Processes by Random Walks on Random Regular Graphs. APPROX-RANDOM 2011: 351-364 - Andris Ambainis, Andrew M. Childs, Yi-Kai Liu:
Quantum Property Testing for Bounded-Degree Graphs. APPROX-RANDOM 2011: 365-376 - Sanjeev Arora, Rong Ge:
New Tools for Graph Coloring. APPROX-RANDOM 2011: 1-12 - Sergei Artemenko, Ronen Shaltiel:
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. APPROX-RANDOM 2011: 377-388 - Per Austrin, Mark Braverman, Eden Chlamtac:
Inapproximability of NP-Complete Variants of Nash Equilibrium. APPROX-RANDOM 2011: 13-25 - Lidor Avigad, Oded Goldreich:
Testing Graph Blow-Up. APPROX-RANDOM 2011: 389-399 - Khanh Do Ba, Piotr Indyk:
Sparse Recovery with Partial Support Knowledge. APPROX-RANDOM 2011: 26-37 - Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha:
On Capacitated Set Cover Problems. APPROX-RANDOM 2011: 38-49 - Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and Low Dimensional Embedding. APPROX-RANDOM 2011: 50-61 - Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties. APPROX-RANDOM 2011: 400-411 - Eli Ben-Sasson, Madhu Sudan:
Limits on the Rate of Locally Testable Affine-Invariant Codes. APPROX-RANDOM 2011: 412-423 - Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam:
O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74 - Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. APPROX-RANDOM 2011: 75-86 - Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Social Welfare in One-Sided Matching Markets without Money. APPROX-RANDOM 2011: 87-98 - Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel:
The Computational Complexity of Estimating MCMC Convergence Time. APPROX-RANDOM 2011: 424-435 - Joshua Brody, David P. Woodruff:
Streaming Algorithms with One-Sided Estimation. APPROX-RANDOM 2011: 436-447 - Tim Carnes, David B. Shmoys:
Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem. APPROX-RANDOM 2011: 99-110 - Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Throughput Maximization. APPROX-RANDOM 2011: 111-122 - Amit Chakrabarti, Ranganath Kondapally:
Everywhere-Tight Information Cost Tradeoffs for Augmented Index. APPROX-RANDOM 2011: 448-459 - Parinya Chalermsook:
Coloring and Maximum Independent Set of Rectangles. APPROX-RANDOM 2011: 123-134 - Maurice Cheung, David B. Shmoys:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. APPROX-RANDOM 2011: 135-146 - Nachshon Cohen, Zeev Nutov:
A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius. APPROX-RANDOM 2011: 147-157 - Michael S. Crouch, Andrew McGregor:
Periodicity and Cyclic Shifts via Linear Sketches. APPROX-RANDOM 2011: 158-170 - Dana Dachman-Soled, Rocco A. Servedio:
A Canonical Form for Testing Boolean Function Properties. APPROX-RANDOM 2011: 460-471 - Varsha Dani, Cristopher Moore:
Independent Sets in Random Graphs from the Weighted Second Moment Method. APPROX-RANDOM 2011: 472-482 - Anindya De, Thomas Watson:
Extractors and Lower Bounds for Locally Samplable Sources. APPROX-RANDOM 2011: 483-494 - Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. APPROX-RANDOM 2011: 495-506 - Irit Dinur, Tali Kaufman:
Dense Locally Testable Codes Cannot Have Constant Rate and Distance. APPROX-RANDOM 2011: 507-518 - Feodor F. Dragan, Ekkehard Köhler:
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. APPROX-RANDOM 2011: 171-183 - Andrew Drucker:
Efficient Probabilistically Checkable Debates. APPROX-RANDOM 2011: 519-529
skipping 29 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-11 15:49 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