Остановите войну!
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 62 matches
- 2017
- Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. ITCS 2017: 23:1-23:34 - Amir Abboud, Arturs Backurs:
Towards Hardness of Approximation for Polynomial Time Problems. ITCS 2017: 11:1-11:26 - Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
Cumulative Space in Black-White Pebbling and Resolution. ITCS 2017: 38:1-38:21 - Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
Nash Social Welfare, Matrix Permanent, and Stable Polynomials. ITCS 2017: 36:1-36:12 - Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan:
Low-Complexity Cryptographic Hash Functions . ITCS 2017: 7:1-7:31 - Itai Arad, Zeph Landau, Umesh V. Vazirani, Thomas Vidick:
Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. ITCS 2017: 46:1-46:14 - Yakov Babichenko, Siddharth Barman:
Algorithmic Aspects of Private Bayesian Persuasion. ITCS 2017: 34:1-34:16 - Mohammad Bavarian, Thomas Vidick, Henry Yuen:
Parallel Repetition via Fortification: Analytic View and the Quantum Case. ITCS 2017: 22:1-22:33 - Shalev Ben-David, Pooya Hatami, Avishay Tal:
Low-Sensitivity Functions from Unambiguous Certificates. ITCS 2017: 28:1-28:23 - Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein:
Simultaneously Load Balancing for Every p-norm, With Reassignments. ITCS 2017: 51:1-51:14 - Amey Bhangale, Irit Dinur, Inbal Livni Navon:
Cube vs. Cube Low Degree Test. ITCS 2017: 40:1-40:31 - Eric Blais, Abhinav Bommireddi:
Testing Submodularity and Other Properties of Valuation Functions. ITCS 2017: 33:1-33:17 - Jeremiah Blocki, Manuel Blum, Anupam Datta, Santosh S. Vempala:
Towards Human Computable Passwords. ITCS 2017: 10:1-10:47 - Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, Gil Segev:
Hierarchical Functional Encryption. ITCS 2017: 8:1-8:27 - Mark Braverman, Sumegha Garg, Ariel Schvartzman:
Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All. ITCS 2017: 18:1-18:18 - Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. ITCS 2017: 20:1-20:19 - Harry Buhrman, Matthias Christandl, Jeroen Zuiddam:
Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication. ITCS 2017: 24:1-24:18 - Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký:
Expander Construction in VNC1. ITCS 2017: 31:1-31:26 - Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. ITCS 2017: 29:1-29:21 - Rui Chao, Ben W. Reichardt, Chris Sutherland, Thomas Vidick:
Overlapping Qubits. ITCS 2017: 48:1-48:21 - Bernard Chazelle, Chu Wang:
Self-Sustaining Iterated Learning. ITCS 2017: 17:1-17:17 - Xi Chen, Yu Cheng, Bo Tang:
Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games. ITCS 2017: 57:1-57:9 - Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli:
The Distortion of Locality Sensitive Hashing. ITCS 2017: 54:1-54:18 - Michael Dinitz, Zeyu Zhang:
Approximating Approximate Distance Oracles. ITCS 2017: 52:1-52:14 - Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen:
Multiplayer Parallel Repetition for Expanding Games. ITCS 2017: 37:1-37:16 - Vitaly Feldman, Badih Ghazi:
On the Power of Learning from k-Wise Queries. ITCS 2017: 41:1-41:32 - Martin Fürer:
Multi-Clique-Width. ITCS 2017: 14:1-14:13 - Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks. ITCS 2017: 21:1-21:13 - Badih Ghazi, Elad Haramaty, Pritish Kamath, Madhu Sudan:
Compression in a Distributed Setting. ITCS 2017: 19:1-19:22 - Arpita Ghosh, Robert Kleinberg:
Inferential Privacy Guarantees for Differentially Private Mechanisms. ITCS 2017: 9:1-9:3
skipping 32 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-24 23:16 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