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 30 matches
- 2024
- Complexity:
Retracted: An Anonymous Authentication Scheme in VANETs of Smart City Based on Certificateless Group Signature. Complex. 2024: 9840567:1-9840567:1 (2024) - Meng Luo, Bo Feng, Long Lu, Engin Kirda, Kui Ren:
On the Complexity of the Web's PKI: Evaluating Certificate Validation of Mobile Browsers. IEEE Trans. Dependable Secur. Comput. 21(1): 419-433 (2024) - 2022
- Jing Zhang, Yuan Li:
Certificate complexity of elementary symmetric Boolean functions. Theor. Comput. Sci. 938: 16-23 (2022) - Siddhesh Chaubal, Anna Gál:
Diameter versus Certificate Complexity of Boolean Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Yuan Li, Frank Ingram, Huaming Zhang:
Certificate complexity and symmetry of nested canalizing functions. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - Siddhesh Chaubal, Anna Gál:
Diameter Versus Certificate Complexity of Boolean Functions. MFCS 2021: 31:1-31:22 - (Withdrawn) Certificate complexity and symmetry of nested canalizing functions. CoRR abs/2102.05435 (2021)
- 2020
- Tomer Grossman, Ilan Komargodski, Moni Naor:
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. ITCS 2020: 56:1-56:38 - 2019
- Huifang Yu, Zhicang Wang:
Certificateless Blind Signcryption With Low Complexity. IEEE Access 7: 115181-115191 (2019) - Kun He, Qian Li, Xiaoming Sun:
A tighter relation between sensitivity complexity and certificate complexity. Theor. Comput. Sci. 762: 1-12 (2019) - Tomer Grossman, Ilan Komargodski, Moni Naor:
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Electron. Colloquium Comput. Complex. TR19 (2019) - 2017
- Kun He, Qian Li, Xiaoming Sun:
A Tighter Relation Between Sensitivity Complexity and Certificate Complexity. COCOON 2017: 262-274 - 2016
- Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Sensitivity Versus Certificate Complexity of Boolean Functions. CSR 2016: 16-28 - Lisa Hellerstein:
Certificate Complexity and Exact Learning. Encyclopedia of Algorithms 2016: 286-290 - Kun He, Qian Li, Xiaoming Sun:
A Tighter Relation between Sensitivity and Certificate Complexity. CoRR abs/1609.04342 (2016) - 2015
- Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Sensitivity versus Certificate Complexity of Boolean Functions. CoRR abs/1503.07691 (2015) - 2014
- Hiroki Morizumi:
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions. IFIP TCS 2014: 104-110 - Andris Ambainis, Krisjanis Prusis:
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. MFCS (2) 2014: 33-44 - Krisjanis Prusis, Andris Ambainis:
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. CoRR abs/1402.5078 (2014) - Andris Ambainis, Krisjanis Prusis:
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- Andris Ambainis, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo:
New upper bound on block sensitivity and certificate complexity in terms of sensitivity. CoRR abs/1306.4466 (2013) - 2012
- Ondrej Cepek, Petr Kucera, Petr Savický:
Boolean functions with a simple certificate for CNF complexity. Discret. Appl. Math. 160(4-5): 365-382 (2012) - 2008
- Scott Aaronson:
Quantum certificate complexity. J. Comput. Syst. Sci. 74(3): 313-322 (2008) - Lisa Hellerstein:
Certificate Complexity and Exact Learning. Encyclopedia of Algorithms 2008 - 2007
- Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Infeasibility Certificates and the Complexity of the Core in Coalitional Games. IJCAI 2007: 1402-1407 - 2005
- Ya-Fen Chang, Chin-Chen Chang:
Schemes for Digital Gift Certificates with Low Computation Complexity. Informatica 16(4): 503-518 (2005) - 2003
- Scott Aaronson:
Quantum Certificate Complexity. CCC 2003: 171-178 - Scott Aaronson:
Quantum Certificate Complexity. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- Scott Aaronson:
Quantum Certificate Complexity. CoRR quant-ph/0210020 (2002) - 2001
- Diana Berbecaru, Antonio Lioy, Marius Marian:
On the Complexity of Public-Key Certificate Validation. ISC 2001: 183-203
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-09-20 18:47 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