![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 135 matches
- 2022
- Fabrizio Grandoni, Afrouz Jabal Ameli
, Vera Traub:
Breaching the 2-approximation barrier for the forest augmentation problem. STOC 2022: 1598-1611 - Nikhil Bansal, Ohad N. Feldheim:
The power of two choices in graphical allocation. STOC 2022: 52-63 - Fabrizio Grandoni
, Tobias Mömke, Andreas Wiese:
A PTAS for unsplittable flow on a path. STOC 2022: 289-302 - Yang Cai
, Argyris Oikonomou, Mingfei Zhao:
Computing simple mechanisms: Lift-and-round over marginal reduced forms. STOC 2022: 704-717 - Nikhil Bansal, Lars Rohwedder
, Ola Svensson:
Flow time scheduling and prefix Beck-Fiala. STOC 2022: 331-342 - Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Pricing ordered items. STOC 2022: 722-735 - Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. STOC 2022: 938-947 - Peter Dixon, Aduri Pavan
, Jason Vander Woude, N. V. Vinodchandran
:
Pseudodeterminism: promises and lowerbounds. STOC 2022: 1552-1565 - Zhiyi Huang
, Xinkai Shu
, Shuyi Yan:
The power of multiple choices in online stochastic matching. STOC 2022: 91-103 - Robert Andrews, Michael A. Forbes:
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals. STOC 2022: 389-402 - Emmanuel Abbe, Shuangping Li, Allan Sly:
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster. STOC 2022: 860-873 - Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir:
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. STOC 2022: 1487-1500 - Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao:
Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching. STOC 2022: 1052-1065 - Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu
, Maciej Obremski, Sruthi Sekar:
Rate one-third non-malleable codes. STOC 2022: 1364-1377 - Dorit Aharonov, Sandy Irani:
Hamiltonian complexity in the thermodynamic limit. STOC 2022: 750-763 - Xavier Allamigeon, Stéphane Gaubert, Nicolas Vandame:
No self-concordant barrier interior point method is strongly polynomial. STOC 2022: 515-528 - Daniel Amir
, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, Rachit Agarwal:
Optimal oblivious reconfigurable networks. STOC 2022: 1339-1352 - Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm:
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. STOC 2022: 736-749 - Nima Anari
, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Entropic independence: optimal mixing of down-up random walks. STOC 2022: 1418-1430 - Anurag Anshu, Itai Arad, David Gosset:
An area law for 2d frustration-free spin systems. STOC 2022: 12-18 - Anurag Anshu, Zeph Landau, Yunchao Liu:
Distributed Quantum inner product estimation. STOC 2022: 44-51 - Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedra: invariance principles and pseudorandom generators. STOC 2022: 208-221 - Vahid R. Asadi, Alexander Golovnev, Tom Gur
, Igor Shinkar:
Worst-case to average-case reductions via additive combinatorics. STOC 2022: 1566-1574 - Sepehr Assadi, Andrew Chen, Glenn Sun
:
Deterministic graph coloring in the streaming model. STOC 2022: 261-274 - Sepehr Assadi, Pankaj Kumar, Parth Mittal:
Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. STOC 2022: 234-247 - Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on high dimensional expanders. STOC 2022: 185-194 - Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff:
Low-rank approximation with 1/ε1/3 matrix-vector products. STOC 2022: 1130-1143 - Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, Santosh S. Vempala:
Robustly learning mixtures of k arbitrary Gaussians. STOC 2022: 1234-1247 - Alkida Balliu
, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti
:
Distributed ∆-coloring plays hide-and-seek. STOC 2022: 464-477 - Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak
, Uri Stemmer:
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC 2022: 1671-1684
skipping 105 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-25 08:51 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