Остановите войну!
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 88 matches
- 2020
- Arnab Bhattacharyya, L. Sunil Chandran, Suprovat Ghoshal:
Combinatorial Lower Bounds for 3-Query LDCs. ITCS 2020: 85:1-85:8 - Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. ITCS 2020: 52:1-52:15 - Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, Justin Thaler:
Ad Hoc Multi-Input Functional Encryption. ITCS 2020: 40:1-40:41 - Maryam Aliakbarpour, Sandeep Silwal:
Testing Properties of Multiple Distributions with Few Samples. ITCS 2020: 69:1-69:41 - Josh Alman, Virginia Vassilevska Williams:
OV Graphs Are (Probably) Hard Instances. ITCS 2020: 83:1-83:18 - Mohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou:
Computationally Data-Independent Memory Hard Functions. ITCS 2020: 36:1-36:28 - Nima Anari, Vijay V. Vazirani:
Matching Is as Easy as the Decision Problem, in the NC Model. ITCS 2020: 54:1-54:25 - Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Separating Two-Round Secure Computation From Oblivious Transfer. ITCS 2020: 71:1-71:18 - Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. ITCS 2020: 81:1-81:27 - Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Limits to Non-Malleability. ITCS 2020: 80:1-80:32 - Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin:
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? ITCS 2020: 86:1-86:22 - Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Computational Hardness of Certifying Bounds on Constrained PCA Problems. ITCS 2020: 78:1-78:29 - James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry:
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption. ITCS 2020: 82:1-82:39 - Ruben Becker, Yuval Emek, Christoph Lenzen:
Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS 2020: 50:1-50:29 - Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, Xiaoming Sun:
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces. ITCS 2020: 8:1-8:48 - Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard Properties with (Very) Short PCPPs and Their Applications. ITCS 2020: 9:1-9:27 - Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS 2020: 5:1-5:32 - Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. ITCS 2020: 38:1-38:20 - Nils Bertschinger, Martin Hoefer, Daniel Schmand:
Strategic Payments in Financial Networks. ITCS 2020: 46:1-46:16 - Amartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee:
Local Access to Huge Random Objects Through Partial Sampling. ITCS 2020: 27:1-27:65 - Nir Bitansky, Idan Gerichter:
On the Cryptographic Hardness of Local Search. ITCS 2020: 6:1-6:29 - Nir Bitansky, Nathan Geier:
On Oblivious Amplification of Coin-Tossing Protocols. ITCS 2020: 30:1-30:13 - Guy Blanc, Jane Lange, Li-Yang Tan:
Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations. ITCS 2020: 44:1-44:44 - Jeremiah Blocki, Seunghoon Lee, Samson Zhou:
Approximating Cumulative Pebbling Cost Is Unique Games Hard. ITCS 2020: 13:1-13:27 - Avrim Blum, Thodoris Lykouris:
Advancing Subgroup Fairness via Sleeping Experts. ITCS 2020: 55:1-55:24 - Greg Bodwin, Ofer Grossman:
Strategy-Stealing Is Non-Constructive. ITCS 2020: 21:1-21:12 - Andrej Bogdanov, Baoxiang Wang:
Learning and Testing Variable Partitions. ITCS 2020: 37:1-37:22 - Shant Boodaghians, Rucha Kulkarni, Ruta Mehta:
Smoothed Efficient Algorithms and Reductions for Network Coordination Games. ITCS 2020: 73:1-73:15 - Adam Bouland, Bill Fefferman, Umesh V. Vazirani:
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract). ITCS 2020: 63:1-63:2 - Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic:
Robust Algorithms for the Secretary Problem. ITCS 2020: 32:1-32:26
skipping 58 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-04-25 06:52 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