![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 37 matches
- 2011
- Lidor Avigad, Oded Goldreich
:
Testing Graph Blow-Up. Studies in Complexity and Cryptography 2011: 156-172 - Mihir Bellare, Oded Goldreich
:
Proving Computational Ability. Studies in Complexity and Cryptography 2011: 6-12 - Mihir Bellare, Oded Goldreich
:
On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge. Studies in Complexity and Cryptography 2011: 114-123 - Zvika Brakerski, Oded Goldreich
:
From Absolute Distinguishability to Positive Distinguishability. Studies in Complexity and Cryptography 2011: 141-155 - Oded Goldreich
:
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard. Studies in Complexity and Cryptography 2011: 1-5 - Oded Goldreich
:
Strong Proofs of Knowledge. Studies in Complexity and Cryptography 2011: 54-58 - Oded Goldreich
:
Candidate One-Way Functions Based on Expander Graphs. Studies in Complexity and Cryptography 2011: 76-87 - Oded Goldreich
:
Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs. Studies in Complexity and Cryptography 2011: 88-97 - Oded Goldreich
:
The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles. Studies in Complexity and Cryptography 2011: 98-108 - Oded Goldreich
:
On the Average-Case Complexity of Property Testing. Studies in Complexity and Cryptography 2011: 124-135 - Oded Goldreich
:
A Candidate Counterexample to the Easy Cylinders Conjecture. Studies in Complexity and Cryptography 2011: 136-140 - Oded Goldreich
:
In a World of P=BPP. Studies in Complexity and Cryptography 2011: 191-232 - Oded Goldreich
:
Notes on Levin's Theory of Average-Case Complexity. Studies in Complexity and Cryptography 2011: 233-247 - Oded Goldreich
:
Three XOR-Lemmas - An Exposition. Studies in Complexity and Cryptography 2011: 248-272 - Oded Goldreich
:
A Sample of Samplers: A Computational Perspective on Sampling. Studies in Complexity and Cryptography 2011: 302-332 - Oded Goldreich
:
Short Locally Testable Codes and Proofs. Studies in Complexity and Cryptography 2011: 333-372 - Oded Goldreich
:
Bravely, Moderately: A Common Theme in Four Recent Works. Studies in Complexity and Cryptography 2011: 373-389 - Oded Goldreich
:
Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art. Studies in Complexity and Cryptography 2011: 406-421 - Oded Goldreich
:
Average Case Complexity, Revisited. Studies in Complexity and Cryptography 2011: 422-450 - Oded Goldreich
:
Basic Facts about Expander Graphs. Studies in Complexity and Cryptography 2011: 451-464 - Oded Goldreich
:
A Brief Introduction to Property Testing. Studies in Complexity and Cryptography 2011: 465-469 - Oded Goldreich
:
Introduction to Testing Graph Properties. Studies in Complexity and Cryptography 2011: 470-506 - Oded Goldreich
:
Randomness and Computation. Studies in Complexity and Cryptography 2011: 507-539 - Oded Goldreich
:
On Security Preserving Reductions - Revised Terminology. Studies in Complexity and Cryptography 2011: 540-546 - Oded Goldreich
:
Contemplations on Testing Graph Properties. Studies in Complexity and Cryptography 2011: 547-554 - Oded Goldreich
:
Another Motivation for Reducing the Randomness Complexity of Algorithms. Studies in Complexity and Cryptography 2011: 555-560 - Oded Goldreich
, Shafi Goldwasser, Shai Halevi:
Collision-Free Hashing from Lattice Problems. Studies in Complexity and Cryptography 2011: 30-39 - Oded Goldreich
, Tali Kaufman:
Proximity Oblivious Testing and the Role of Invariances. Studies in Complexity and Cryptography 2011: 173-190 - Oded Goldreich
, Leonid A. Levin, Noam Nisan:
On Constructing 1-1 One-Way Functions. Studies in Complexity and Cryptography 2011: 13-25 - Oded Goldreich
, Noam Nisan, Avi Wigderson:
On Yao's XOR-Lemma. Studies in Complexity and Cryptography 2011: 273-301
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-09-03 23:00 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