Остановите войну!
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 41 matches
- 2016
- Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee:
The Space "Just Above" BQP. ITCS 2016: 271-280 - Alexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin, David P. Woodruff, Qin Zhang:
On Sketching Quadratic Forms. ITCS 2016: 311-319 - Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
Spectral Embedding of k-Cliques, Graph Partitioning and k-Means. ITCS 2016: 301-310 - Pablo Daniel Azar, Shafi Goldwasser, Sunoo Park:
How to Incentivize Data-Driven Collaboration Among Competing Parties. ITCS 2016: 213-225 - Yakov Babichenko, Christos H. Papadimitriou, Aviad Rubinstein:
Can Almost Everybody be Almost Happy? ITCS 2016: 1-9 - Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz:
Distribution Design. ITCS 2016: 81-92 - Olaf Beyersdorff, Ilario Bonacina, Leroy Chew:
Lower Bounds: From Circuits to QBF Proof Systems. ITCS 2016: 249-260 - Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters:
Time-Lock Puzzles from Randomized Encodings. ITCS 2016: 345-356 - Christian Borgs, Jennifer T. Chayes, Adrian Marple, Shang-Hua Teng:
An Axiomatic Approach to Community Detection. ITCS 2016: 135-146 - Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? ITCS 2016: 357-368 - Zvika Brakerski, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Obfuscating Conjunctions under Entropic Ring LWE. ITCS 2016: 147-156 - Mark Bun, Kobbi Nissim, Uri Stemmer:
Simultaneous Private Learning of Multiple Concepts. ITCS 2016: 369-380 - Ran Canetti, Justin Holmgren:
Fully Succinct Garbled RAM. ITCS 2016: 169-178 - Clément L. Canonne, Themis Gouleakis, Ronitt Rubinfeld:
Sampling Correctors. ITCS 2016: 93-102 - Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility. ITCS 2016: 261-270 - Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin, Hong-Sheng Zhou:
Cryptography for Parallel RAM from Indistinguishability Obfuscation. ITCS 2016: 179-190 - Jing Chen, Samuel McCauley, Shikha Singh:
Rational Proofs with Multiple Provers. ITCS 2016: 237-248 - Jing Chen, Silvio Micali:
Auction Revenue in the General Spiteful-Utility Model. ITCS 2016: 201-211 - Ruiwen Chen, Rahul Santhanam:
Satisfiability on Mixed Instances. ITCS 2016: 393-402 - Gil Cohen, Igor Shinkar:
The Complexity of DNF of Parities. ITCS 2016: 47-58 - Rachel Cummings, Katrina Ligett, Jaikumar Radhakrishnan, Aaron Roth, Zhiwei Steven Wu:
Coordination Complexity: Small Information Coordinating Large Populations. ITCS 2016: 281-290 - Erik D. Demaine, Jayson Lynch, Geronimo J. Mirano, Nirvan Tyagi:
Energy-Efficient Algorithms. ITCS 2016: 321-332 - Alexander Golovnev, Alexander S. Kulikov:
Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds. ITCS 2016: 405-411 - Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS 2016: 59-70 - Rishi Gupta, Tim Roughgarden:
A PAC Approach to Application-Specific Algorithm Selection. ITCS 2016: 123-134 - Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal Rabin:
Secure Multiparty Computation with General Interaction Patterns. ITCS 2016: 157-168 - Moritz Hardt, Nimrod Megiddo, Christos H. Papadimitriou, Mary Wootters:
Strategic Classification. ITCS 2016: 111-122 - Atalay Mert Ileri, Silvio Micali:
Mechanisms With Costly Knowledge. ITCS 2016: 11-19 - Sune K. Jakobsen, Claudio Orlandi:
How To Bootstrap Anonymous Communication. ITCS 2016: 333-344 - Sune K. Jakobsen, Troels Bjerre Sørensen, Vincent Conitzer:
Timeability of Extensive-Form Games. ITCS 2016: 191-199
skipping 11 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-19 15:01 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