default search action
Lucila M. S. Bento
Person information
- affiliation: Federal University of Rio de Janeiro, COPPE
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Lucila M. S. Bento
, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius G. P. de Sá, Jayme Luiz Szwarcfiter:
Structured Watermarks for Structured Software. SN Comput. Sci. 5(5): 568 (2024) - [c8]Augusto Parisot, Lucila M. S. Bento, Raphael C. S. Machado:
Ransomware Detection: Leveraging Sandbox, Text Mining Techiques and Machine Learning. MetroInd4.0 & IoT 2024: 446-451 - 2022
- [j4]Wilson S. Melo Jr.
Using blockchains to protect critical infrastructures: a comparison between Ethereum and Hyperledger Fabric. Int. J. Secur. Networks 17(2): 77-91 (2022) - [c7]Alan Oliveira de Sá, Lucila Maria Souza Bento, Mariana Luiza Flavio, Marco Pasetti
ANN-Based Stealth Attack to Battery Energy Storage Systems by Using a Low-Cost Device. MetroInd4.0& IoT 2022: 201-206 - [c6]Lucila M. S. Bento
Software Watermark Scheme. MetroInd4.0& IoT 2022: 306-310 - 2021
- [c5]Augusto Parisot, Lucila M. S. Bento
Testing and selecting lightweight pseudo-random number generators for IoT devices. MetroInd4.0&IoT 2021: 715-720 - [c4]Davidson R. Boccardo, Lucila M. S. Bento
Towards a Practical Information Security Maturity Evaluation Method focused on People, Process and Technology. MetroInd4.0&IoT 2021: 721-726 - 2020
- [c3]Lucas S. dos Santos, Paulo R. M. Nascimento
Development of security mechanisms for a remote sensing system based on opportunistic and mesh networks. MetroInd4.0&IoT 2020: 418-422 - [c2]Raphael Machado, Wilson S. Melo, Lucila M. S. Bento
Proficiency Testing for Software Analysis and Cybersecurity Laboratories. MetroInd4.0&IoT 2020: 441-446
2010 – 2019
- 2019
- [j3]Lucila M. S. Bento
Full Characterization of a Class of Graphs Tailored for Software Watermarking. Algorithmica 81(7): 2899-2916 (2019) - [j2]Lucila M. S. Bento
Dijkstra graphs. Discret. Appl. Math. 261: 52-62 (2019) - 2018
- [j1]Lucila M. S. Bento
On the resilience of canonical reducible permutation graphs. Discret. Appl. Math. 234: 32-46 (2018) - 2016
- [i3]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Dijkstra Graphs. CoRR abs/1602.08653 (2016) - 2015
- [i2]Lucila M. S. Bento, Davidson R. Boccardo, Raphael Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
The Graphs of Structured Programming. CTW 2015: 105-108 - 2013
- [c1]Lucila Maria Souza Bento
Towards a Provably Resilient Scheme for Graph-Based Watermarking. WG 2013: 50-63 - [i1]Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Towards a provably robust graph-based watermarking scheme. CoRR abs/1302.7262 (2013)
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-07-16 20:48 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: