Остановите войну!
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 150 matches
- 2024
- Jan Krajícek:
On the existence of Strong Proof Complexity Generators. Bull. Symb. Log. 30(1): 20-40 (2024) - Soubhik Deb, Robert Raynor, Sreeram Kannan:
STAKESURE: Proof of Stake Mechanisms with Strong Cryptoeconomic Safety. CoRR abs/2401.05797 (2024) - 2023
- Valentina Gliozzi, Gian Luca Pozzato, Alberto Valese:
Proof Methods and Theorem Proving for Conditional Logics with Strong Centering. CILC 2023 - Mihir Bellare, Hannah Davis, Zijing Di:
Hardening Signature Schemes via Derive-then-Derandomize: Stronger Security Proofs for EdDSA. Public Key Cryptography (1) 2023: 223-250 - Maurice Margenstern:
A strongly universal cellular automaton on the heptagrif with seven states, new proof. CoRR abs/2304.13575 (2023) - Mihir Bellare, Hannah Davis, Zijing Di:
Hardening Signature Schemes via Derive-then-Derandomize: Stronger Security Proofs for EdDSA. IACR Cryptol. ePrint Arch. 2023: 298 (2023) - 2022
- Hans-Jörg Schurr:
Stronger SMT Solvers for Proof Assistants: Proofs, Quantifier Simplification, Strategy Schedules. (Consolidation des solveurs SMT pour les assistants de preuve: preuves, simplification des quantificateurs, planification de stratégies). University of Lorraine, Nancy, France, 2022 - Stephan Merz, Vincent Trélat:
Correctness of a Set-based Algorithm for Computing Strongly Connected Components of a Graph. Arch. Formal Proofs 2022 (2022) - Pablo Cobreros, Elio La Rosa, Luca Tranchini:
Higher-level Inferences in the Strong-Kleene Setting: A Proof-theoretic Approach. J. Philos. Log. 51(6): 1417-1452 (2022) - Nicolas Curien:
Yet Another Proof of the Strong Law of Large Numbers. Am. Math. Mon. 129(10): 972-974 (2022) - Sebastián Urciuoli:
A Formal Proof of the Strong Normalization Theorem for System T in Agda. LSFA 2022: 81-99 - Martin Caminada, Sri Harikrishnan:
Strong Admissibility, a Tractable Algorithmic Approach (proofs). CoRR abs/2204.03551 (2022) - Jan Krajícek:
On the existence of strong proof complexity generators. CoRR abs/2208.11642 (2022) - Jan Krajícek:
On the existence of strong proof complexity generators. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Wei Yang, Baoyindureng Wu:
Proof of a conjecture on the strong chromatic index of Halin graphs. Discret. Appl. Math. 302: 92-102 (2021) - Maria Chudnovsky, Cemil Dibek:
Strongly perfect claw-free graphs - A short proof. J. Graph Theory 97(3): 359-381 (2021) - 2020
- Emin Karayel, Edgar Gonzàlez:
Strong Eventual Consistency of the Collaborative Editing Framework WOOT. Arch. Formal Proofs 2020 (2020) - Deniz Dizdar, Eugen Kovác:
A simple proof of strong duality in the linear persuasion problem. Games Econ. Behav. 122: 407-412 (2020) - Marijn J. H. Heule, Benjamin Kiesl, Armin Biere:
Strong Extension-Free Proof Systems. J. Autom. Reason. 64(3): 533-554 (2020) - Benjamin Kiesl, Adrián Rebola-Pardo, Marijn J. H. Heule, Armin Biere:
Simulating Strong Practical Proof Systems with Extended Resolution. J. Autom. Reason. 64(7): 1247-1267 (2020) - Xiang Li, Hongbin George Du:
A short proof for stronger version of DS decomposition in set function optimization. J. Comb. Optim. 40(4): 901-906 (2020) - Zakwan Jaroucheh, Baraq Ghaleb, William J. Buchanan:
SklCoin: Toward a Scalable Proof-of-Stake and Collective Signature Based Consensus Protocol for Strong Consistency in Blockchain. ICSA Companion 2020: 143-150 - Zakwan Jaroucheh, Baraq Ghaleb, William J. Buchanan:
SklCoin: Toward a Scalable Proof-of-Stake and Collective Signature Based Consensus Protocol for Strong Consistency in Blockchain. CoRR abs/2008.06763 (2020) - 2019
- Myungsun Kim, Hyung Tae Lee:
Experimenting With Non-Interactive Range Proofs Based on the Strong RSA Assumption. IEEE Access 7: 117505-117516 (2019) - Shifeng Sun, Dawu Gu, Man Ho Au, Shuai Han, Yu Yu, Joseph K. Liu:
Strong Leakage and Tamper-Resilient PKE from Refined Hash Proof System. ACNS 2019: 486-506 - Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee:
Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space. CRYPTO (1) 2019: 467-495 - Yasutada Oohama:
An Inequality Useful for Proofs of Strong Converse Theorems in Network Information Theory. ISIT 2019: 2883-2887 - Ran Chen, Cyril Cohen, Jean-Jacques Lévy, Stephan Merz, Laurent Théry:
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle. ITP 2019: 13:1-13:19 - Pawel Szalachowski, Daniël Reijsbergen, Ivan Homoliak, Siwei Sun:
StrongChain: Transparent and Collaborative Proof-of-Work Consensus. USENIX Security Symposium 2019: 819-836 - Yasutada Oohama:
A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks. CoRR abs/1901.04968 (2019)
skipping 120 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-25 07:22 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