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 16 matches
- 2024
- Sunny Atalig, Marek Chrobak:
A Tight Threshold Bound for Search Trees with 2-Way Comparisons. TAMC 2024: 99-110 - Jiangxia Ge, Heming Liao, Rui Xue:
Measure-Rewind-Extract: Tighter Proofs of One-Way to Hiding and CCA Security in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2024: 777 (2024) - 2023
- Sunny Atalig, Marek Chrobak:
A Tight Threshold Bound for Search Trees with 2-way Comparisons. CoRR abs/2312.03896 (2023) - 2021
- Veronika Kuchta, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Shifeng Sun:
Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security. IACR Cryptol. ePrint Arch. 2021: 454 (2021) - 2020
- Veronika Kuchta, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Shifeng Sun:
Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security. EUROCRYPT (3) 2020: 703-728 - Ben S. Southworth, Wayne Mitchell, Andreas Hessenthaler, Federico Danieli:
Tight two-level convergence of Linear Parareal and MGRIT: Extensions and implications in practice. CoRR abs/2010.11879 (2020) - 2018
- Johannes Ax, Gregor Sievers, Julian Daberkow, Martin Flasskamp, Marten Vohrmann, Thorsten Jungeblut, Wayne Kelly, Mario Porrmann, Ulrich Rückert:
CoreVA-MPSoC: A Many-Core Architecture with Tightly Coupled Shared and Local Data Memories. IEEE Trans. Parallel Distributed Syst. 29(5): 1030-1043 (2018) - Jian-Jia Weng, Fady Alajaji, Tamás Linder, Lin Song:
Sufficient Conditions for the Tightness of Shannon's Capacity Bounds for Two-Way Channels. ISIT 2018: 1410-1414 - Jian-Jia Weng, Lin Song, Fady Alajaji, Tamás Linder:
Sufficient Conditions for the Tightness of Shannon's Capacity Bounds for Two-Way Channels. CoRR abs/1801.03163 (2018) - 2011
- Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. Algorithmica 59(4): 510-520 (2011) - Xiangdong Jia, Longxiang Yang, Haiyang Fu:
Tight performance bounds for two-way opportunistic amplify-and-forward wireless relaying networks with TDBC protocols. EURASIP J. Wirel. Commun. Netw. 2011: 192 (2011) - Ming Lam Leung, Yang Li, Shengyu Zhang:
Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models. TAMC 2011: 403-408 - Ming Lam Leung, Yang Li, Shengyu Zhang:
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models. CoRR abs/1101.4555 (2011) - Ming Lam Leung, Yang Li, Shengyu Zhang:
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models. Electron. Colloquium Comput. Complex. TR11 (2011) - 2008
- Mingyu Xiao, Leizhen Cai, Andrew C. Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. CoRR abs/0811.3723 (2008) - 2004
- Christopher M. Homan:
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions. J. Comput. Syst. Sci. 68(3): 657-674 (2004)
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-24 15:29 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