default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Benedetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Marco Benedetti, Francesco De Sclavis, Giuseppe Galano, Sara Giammusso, Antonio Muci, Matteo Nardelli:
Impact of Layer-1 Characteristics on Scalability of Layer-2 Semi-Hierarchical Payment Channel Networks. DLT 2024- [c21]Marco Benedetti, Francesco De Sclavis, Marco Favorito, Giuseppe Galano, Sara Giammusso, Antonio Muci, Matteo Nardelli:
Self-Balancing Semi-Hierarchical Payment Channel Networks for Central Bank Digital Currencies. PerCom Workshops 2024: 530-536 - [i5]Marco Benedetti, Francesco De Sclavis, Marco Favorito, Giuseppe Galano, Sara Giammusso, Antonio Muci, Matteo Nardelli:
Self-Balancing Semi-Hierarchical PCNs for CBDCs. CoRR abs/2401.11868 (2024) - 2023
- [j6]Luigi Bellomarini, Marco Benedetti, Andrea Gentili, Davide Magnanimi, Emanuel Sallinger:
KG-Roar: Interactive Datalog-based Reasoning on Virtual Knowledge Graphs. Proc. VLDB Endow. 16(12): 4014-4017 (2023) - [c20]Marco Benedetti, Marco Favorito, Matteo Nardelli:
Orchestration of Blockchain-based Digital Twins. DLT 2023 - [c19]Marco Benedetti, Francesco De Sclavis, Marco Favorito, Giuseppe Galano, Sara Giammusso, Antonio Muci, Matteo Nardelli:
Certified Byzantine Consensus with Confidential Quorum for a Bitcoin-derived Permissioned DLT. DLT 2023 - [c18]Marco Benedetti, Francesco De Sclavis, Marco Favorito
, Giuseppe Galano, Sara Giammusso, Antonio Muci, Matteo Nardelli:
PoW-less Bitcoin with Confidential Byzantine PoA. ICBC 2023: 1-3 - [i4]Marco Benedetti, Enrico Ventura:
Training neural networks with structured noise improves classification and generalization. CoRR abs/2302.13417 (2023) - [i3]Marco Benedetti, Louis Carillo, Enzo Marinari, Marc Mézard:
Eigenvector Dreaming. CoRR abs/2308.13445 (2023) - 2022
- [j5]Marco Benedetti, Gennaro Catapano, Francesco De Sclavis, Marco Favorito, Aldo Glielmo, Davide Magnanimi, Antonio Muci:
Black-it: A Ready-to-Use and Easy-to-Extend Calibration Kit for Agent-based Models. J. Open Source Softw. 7(79): 4622 (2022) - [i2]Marco Benedetti, Francesco De Sclavis, Marco Favorito, Giuseppe Galano, Sara Giammusso, Antonio Muci, Matteo Nardelli:
A PoW-less Bitcoin with Certified Byzantine Consensus. CoRR abs/2207.06870 (2022) - 2020
- [c17]Luigi Bellomarini, Marco Benedetti, Stefano Ceri, Andrea Gentili, Rosario Laurendi, Davide Magnanimi, Markus Nissl, Emanuel Sallinger:
Reasoning on Company Takeovers during the COVID-19 Crisis with Knowledge Graphs. RuleML+RR (Supplement) 2020: 145-156 - [i1]Luigi Bellomarini, Marco Benedetti, Andrea Gentili, Rosario Laurendi, Davide Magnanimi, Antonio Muci, Emanuel Sallinger:
COVID-19 and Company Knowledge Graphs: Assessing Golden Powers and Economic Impact of Selective Lockdown via AI Reasoning. CoRR abs/2004.10119 (2020)
2010 – 2019
- 2019
- [j4]Marco Benedetti, Marco Mori:
On the use of Max-SAT and PDDL in RBAC maintenance. Cybersecur. 2(1): 19 (2019) - 2018
- [c16]Marco Benedetti, Marco Mori:
Parametric RBAC Maintenance via Max-SAT. SACMAT 2018: 15-25 - 2010
- [j3]Hratch Mangassarian, Andreas G. Veneris, Marco Benedetti:
Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test. IEEE Trans. Computers 59(7): 981-994 (2010)
2000 – 2009
- 2008
- [j2]Marco Benedetti, Hratch Mangassarian:
QBF-Based Formal Verification: Experience and Perspectives. J. Satisf. Boolean Model. Comput. 5(1-4): 133-191 (2008) - [c15]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
Quantified Constraint Optimization. CP 2008: 463-477 - [c14]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
Modeling adversary scheduling with QCSP+. SAC 2008: 151-155 - 2007
- [c13]Hratch Mangassarian, Andreas G. Veneris, Sean Safarpour, Marco Benedetti, Duncan Exon Smith:
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test. ICCAD 2007: 240-245 - [c12]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
QCSP Made Practical by Virtue of Restricted Quantification. IJCAI 2007: 38-43 - 2006
- [c11]Marco Benedetti:
Abstract Branching for Quantified Formulas. AAAI 2006: 16-21 - [c10]Marco Benedetti, Arnaud Lallouet, Jérémie Vautard:
Reusing CSP Propagators for QCSPs. CSCLP 2006: 63-77 - 2005
- [j1]Marco Benedetti:
Hybrid Evaluation Procedures for QBF. Intelligenza Artificiale 2(3): 37-44 (2005) - [c9]Marco Benedetti, Luigia Carlucci Aiello:
SAT-Based Cooperative Planning: A Proposal. Mechanizing Mathematical Reasoning 2005: 494-513 - [c8]Marco Benedetti:
sKizzo: A Suite to Evaluate and Certify QBFs. CADE 2005: 369-376 - [c7]Marco Benedetti:
Extracting Certificates from Quantified Boolean Formulas. IJCAI 2005: 47-53 - [c6]Marco Benedetti:
Quantifier Trees for QBFs. SAT 2005: 378-385 - 2004
- [c5]Marco Benedetti:
Evaluating QBFs via Symbolic Skolemization. LPAR 2004: 285-300 - [c4]Marco Benedetti, Sara Bernardini:
Incremental Compilation-to-SAT Procedures. SAT 2004 - [c3]Marco Benedetti, Sara Bernardini:
Incremental Compilation-to-SAT Procedures. SAT (Selected Papers 2004: 46-58 - 2003
- [c2]Marco Benedetti, Alessandro Cimatti:
Bounded Model Checking for Past LTL. TACAS 2003: 18-33 - 2001
- [c1]Marco Benedetti:
Conditional Pure Literal Graphs. IJCAR 2001: 331-346
Coauthor Index
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.
last updated on 2024-10-22 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
