![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 1,273 matches
- 2023
- Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM 2023: 12:1-12:19 - Shuchi Chawla, Evangelia Gergatsouli
, Jeremy McMahan, Christos Tzamos:
Approximating Pandora's Box with Correlations. APPROX/RANDOM 2023: 26:1-26:24 - Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio
:
Subset Sum in Time 2n/2 / poly(n). APPROX/RANDOM 2023: 39:1-39:18 - Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar
, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. APPROX/RANDOM 2023: 63:1-63:23 - Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin:
On Complexity of 1-Center in Various Metrics. APPROX/RANDOM 2023: 1:1-1:19 - Dorna Abdolazimi, Kasper Lindberg, Shayan Oveis Gharan:
On Optimization and Counting of Non-Broken Bases of Matroids. APPROX/RANDOM 2023: 40:1-40:14 - Eric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, Pengxiang Wang:
Robustness for Space-Bounded Statistical Zero Knowledge. APPROX/RANDOM 2023: 56:1-56:21 - Prashanth Amireddy, Srikanth Srinivasan
, Madhu Sudan:
Low-Degree Testing over Grids. APPROX/RANDOM 2023: 41:1-41:22 - Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins:
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. APPROX/RANDOM 2023: 38:1-38:18 - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. APPROX/RANDOM 2023: 22:1-22:16 - Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne:
Improved Local Computation Algorithms for Constructing Spanners. APPROX/RANDOM 2023: 42:1-42:23 - Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang:
Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. APPROX/RANDOM 2023: 58:1-58:23 - Sepehr Assadi, Michael Kapralov, Huacheng Yu:
On Constructing Spanners from Random Gaussian Projections. APPROX/RANDOM 2023: 57:1-57:18 - Nikhil Ayyadevara, Nikhil Bansal, Milind Prabhu:
On Minimizing Generalized Makespan on Unrelated Machines. APPROX/RANDOM 2023: 21:1-21:13 - Tanvi Bajpai, Chandra Chekuri:
Bicriteria Approximation Algorithms for Priority Matroid Median. APPROX/RANDOM 2023: 7:1-7:22 - Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur:
Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. APPROX/RANDOM 2023: 14:1-14:14 - Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric
, Malte Renken, Michael Raskin, Viktor Zamaraev
:
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - Huck Bennett, Chris Peikert:
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. APPROX/RANDOM 2023: 37:1-37:20 - Mark de Berg, Arpan Sadhukhan
, Frits C. R. Spieksma:
Stable Approximation Algorithms for Dominating Set and Independent Set. APPROX/RANDOM 2023: 27:1-27:19 - Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache:
Testing Connectedness of Images. APPROX/RANDOM 2023: 66:1-66:15 - Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
On the Complexity of Triangle Counting Using Emptiness Queries. APPROX/RANDOM 2023: 48:1-48:22 - Antonio Blanca, Xusheng Zhang:
Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case. APPROX/RANDOM 2023: 53:1-53:19 - Jeremiah Blocki
, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou:
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. APPROX/RANDOM 2023: 59:1-59:24 - Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh
, John C. S. Lui:
Classical Simulation of One-Query Quantum Distinguishers. APPROX/RANDOM 2023: 43:1-43:17 - Vladimir Braverman, Joel Manning, Zhiwei Steven Wu, Samson Zhou:
Private Data Stream Analysis for Universal Symmetric Norm Estimation. APPROX/RANDOM 2023: 45:1-45:24 - Nader H. Bshouty:
Superpolynomial Lower Bounds for Learning Monotone Classes. APPROX/RANDOM 2023: 34:1-34:20 - Karthekeyan Chandrasekaran, Weihang Wang:
Approximating Submodular k-Partition via Principal Partition Sequence. APPROX/RANDOM 2023: 3:1-3:16 - Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM 2023: 24:1-24:22 - Eden Chlamtác, Yury Makarychev, Ali Vakilian:
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. APPROX/RANDOM 2023: 11:1-11:19 - Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth
, Joon Lee, Noëla Müller, Maurice Rolvien:
The Full Rank Condition for Sparse Random Matrices. APPROX/RANDOM 2023: 54:1-54:14
skipping 1,243 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-20 14:03 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