Остановите войну!
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 68 matches
- 2019
- Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee:
Semi-Online Bipartite Matching. ITCS 2019: 50:1-50:20 - Oded Goldreich, Dana Ron:
The Subgraph Testing Model. ITCS 2019: 37:1-37:19 - Shipra Agrawal, Mohammad Shadravan, Cliff Stein:
Submodular Secretary Problem with Shortlists. ITCS 2019: 1:1-1:19 - Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
Fisher Zeros and Correlation Decay in the Ising Model. ITCS 2019: 55:1-55:8 - Wei Chen, Shang-Hua Teng, Hanrui Zhang:
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. ITCS 2019: 24:1-24:20 - Dorit Aharonov, Leo Zhou:
Hamiltonian Sparsification and Gap-Simulation. ITCS 2019: 2:1-2:21 - Alexandr Andoni, Robert Krauthgamer, Yosef Pogrow:
On Solving Linear Systems in Sublinear Time. ITCS 2019: 3:1-3:19 - Benny Applebaum, Prashant Nalini Vasudevan:
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. ITCS 2019: 4:1-4:14 - Nick Arnosti, S. Matthew Weinberg:
Bitcoin: A Natural Oligopoly. ITCS 2019: 5:1-5:1 - Sepehr Assadi, Michael Kapralov, Sanjeev Khanna:
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. ITCS 2019: 6:1-6:20 - Per Austrin, Petteri Kaski, Kaie Kubjas:
Tensor Network Complexity of Multilinear Maps. ITCS 2019: 7:1-7:21 - Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. ITCS 2019: 8:1-8:20 - Boaz Barak, Pravesh K. Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. ITCS 2019: 9:1-9:12 - Omri Ben-Eliezer:
Testing Local Properties of Arrays. ITCS 2019: 11:1-11:20 - Eli Ben-Sasson, Eden Saig:
The Complexity of User Retention. ITCS 2019: 12:1-12:30 - Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao:
Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. ITCS 2019: 13:1-13:16 - Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. ITCS 2019: 14:1-14:21 - Markus Bläser, Gorav Jindal:
On the Complexity of Symmetric Polynomials. ITCS 2019: 47:1-47:14 - Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani:
"Quantum Supremacy" and the Complexity of Random Circuit Sampling. ITCS 2019: 15:1-15:2 - Elette Boyle, Rio LaVigne, Vinod Vaikuntanathan:
Adversarially Robust Property-Preserving Hash Functions. ITCS 2019: 16:1-16:20 - André Chailloux:
A Note on the Quantum Query Complexity of Permutation Symmetric Functions. ITCS 2019: 19:1-19:7 - Deeparnab Chakrabarty, C. Seshadhri:
Adaptive Boolean Monotonicity Testing in Total Influence Time. ITCS 2019: 20:1-20:7 - Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. ITCS 2019: 21:1-21:17 - Zachary Chase, Siddharth Prasad:
Learning Time Dependent Choice. ITCS 2019: 62:1-62:19 - Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal:
Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. ITCS 2019: 22:1-22:15 - Lijie Chen, Ruosong Wang:
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. ITCS 2019: 23:1-23:20 - Alessandro Chiesa, Peter Manohar, Igor Shinkar:
Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing. ITCS 2019: 25:1-25:17 - Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu:
On the Algorithmic Power of Spiking Neural Networks. ITCS 2019: 26:1-26:20 - Constantinos Daskalakis, Ioannis Panageas:
Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. ITCS 2019: 27:1-27:18 - Anindya De, Philip M. Long, Rocco A. Servedio:
Density Estimation for Shift-Invariant Multidimensional Distributions. ITCS 2019: 28:1-28:20
skipping 38 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-06-06 07:15 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