Остановите войну!
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 49 matches
- 2014
- Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. ITCS 2014: 251-260 - Elaine Angelino, Varun Kanade:
Attribute-efficient evolvability of linear functions. ITCS 2014: 287-300 - Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Energy-efficient circuit design. ITCS 2014: 303-312 - Yossi Azar, Uriel Feige, Michal Feldman, Moshe Tennenholtz:
Sequential decision making with vector outcomes. ITCS 2014: 195-206 - László Babai:
On the automorphism groups of strongly regular graphs I. ITCS 2014: 359-368 - Afonso S. Bandeira, Moses Charikar, Amit Singer, Andy Zhu:
Multireference alignment using semidefinite programming. ITCS 2014: 459-470 - Jonathan W. Berry, Luke K. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson:
Why do simple algorithms for triangle enumeration work in the real world? ITCS 2014: 225-234 - Sayan Bhattacharya, Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Coordination mechanisms from (almost) all scheduling policies. ITCS 2014: 121-134 - Zvika Brakerski, Guy N. Rothblum:
Black-box obfuscation for d-CNFs. ITCS 2014: 235-250 - Zvika Brakerski, Vinod Vaikuntanathan:
Lattice-based FHE as secure as PKE. ITCS 2014: 1-12 - Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements. ITCS 2014: 183-194 - Mark Braverman, Jing Chen, Sampath Kannan:
Optimal provision-after-wait in healthcare. ITCS 2014: 541-542 - Mark Braverman, Kanika Pasricha:
The computational hardness of pricing compound options. ITCS 2014: 103-104 - Joshua Brody, Sune K. Jakobsen, Dominik Scheder, Peter Winkler:
Cryptogenography. ITCS 2014: 13-22 - Nader H. Bshouty:
Testers and their applications. ITCS 2014: 327-352 - Deeparnab Chakrabarty, Chaitanya Swamy:
Welfare maximization and truthfulness in mechanism design with ordinal preferences. ITCS 2014: 105-120 - Karthekeyan Chandrasekaran, Justin Thaler, Jonathan R. Ullman, Andrew Wan:
Faster private release of marginals on small databases. ITCS 2014: 387-402 - Karthekeyan Chandrasekaran, Santosh S. Vempala:
Integer feasibility of random polytopes: random integer programs. ITCS 2014: 449-458 - Ho-Lin Chen, David Doty, David Soloveichik:
Rate-independent computation in continuous chemical reaction networks. ITCS 2014: 313-326 - Mahdi Cheraghchi, Venkatesan Guruswami:
Capacity of non-malleable codes. ITCS 2014: 155-168 - Erez Druk, Yuval Ishai:
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications. ITCS 2014: 169-182 - Uriel Feige, Moshe Tennenholtz:
Invitation games and the price of stability. ITCS 2014: 93-102 - Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Partial tests, universal tests and decomposability. ITCS 2014: 483-500 - David Gamarnik, Madhu Sudan:
Limits of local algorithms over sparse random graphs. ITCS 2014: 369-376 - Ran Gelles, Amit Sahai, Akshay Wadia:
Private interactive communication across an adversarial channel. ITCS 2014: 135-144 - Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally testable codes and cayley graphs. ITCS 2014: 81-92 - Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational arguments: single round delegation with sublinear verification. ITCS 2014: 523-540 - Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of triangle-dense graphs. ITCS 2014: 471-482 - Venkatesan Guruswami, Euiwoong Lee:
Complexity of approximating CSP with balance / hard constraints. ITCS 2014: 439-448 - Joseph Y. Halpern, Rafael Pass, Lior Seeman:
The truth behind the myth of the folk theorem. ITCS 2014: 543-554
skipping 19 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-03 16:28 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