default search action
Fabrizio d'Amore
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i4]Fabrizio d'Amore, Lorenzo Zarfati:
Source Code Anti-Plagiarism: a C# Implementation using the Routing Approach. CoRR abs/2201.02241 (2022) - [i3]Fabrizio d'Amore:
Quality increases as the error rate decreases. CoRR abs/2207.00308 (2022) - 2021
- [c17]Diego Padovan
, Javid Taheri, Fabrizio d'Amore:
Safeguarding Information in Service Science with Service Integration. IESS 2021: 2005 - [c16]Andrea Bissoli, Fabrizio d'Amore:
Authentication as A Service Based on Shamir Secret Sharing. ISCSIC 2021: 368-373 - [i2]Fabrizio d'Amore, Alessandro Serpi:
Traitor-Proof PDF Watermarking. CoRR abs/2109.09712 (2021)
2010 – 2019
- 2018
- [j9]Fabrizio d'Amore
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs. Int. J. Comput. Geom. Appl. 28(3): 227-253 (2018) - [c15]Nicolò Cardamone, Fabrizio d'Amore:
DWT and QR Code Based Watermarking for Document DRM. IWDW 2018: 137-150 - [i1]Andrea Bissoli, Fabrizio d'Amore:
Authentication as a service: Shamir Secret Sharing with byzantine components. CoRR abs/1806.07291 (2018) - 2015
- [c14]Daniele Capolupo, Fabrizio d'Amore:
Synthetic Speech Detection and Audio Steganography in VoIP Scenarios. IWDW 2015: 145-159 - 2014
- [c13]Roberto Baldoni, Fabrizio d'Amore
A Software Architecture for Progressive Scanning of On-line Communities. ICDCS Workshops 2014: 207-212 - 2012
- [c12]Fabrizio d'Amore, Luigi Laura, Luca Luciani, Fabio Pagliarini:
Planning, Designing and Evaluating Multiple eGovernment Interventions. DCNET/ICE-B/OPTICS 2012: 85-92 - [c11]Fabrizio d'Amore, Luigi Laura:
eGovernment Interventions: The Multiple Projects Evaluation Problem. ICETE (Selected Papers) 2012: 88-100
2000 – 2009
- 2003
- [j8]Fabrizio d'Amore
On-line algorithms for networks of temporal constraints. J. Discrete Algorithms 1(3-4): 303-312 (2003)
1990 – 1999
- 1999
- [j7]Fabrizio d'Amore, Roberto Giaccio:
Intersection Problems on Segments Under Boundary Updates with Application to Persistent Lists. Int. J. Comput. Geom. Appl. 9(6): 553-576 (1999) - 1998
- [c10]Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta:
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). ESA 1998: 175-186 - [c9]Fabrizio d'Amore, Roberto Giaccio:
Logical Data Partitioning in Bitemporal Databases. IADT 1998: 320-327 - 1997
- [c8]Fabrizio d'Amore
Maintaining Maxima under Boundary Updates. CIAC 1997: 100-109 - [c7]Fabrizio d'Amore, Luca Becchetti
On the Embedding of Refinements of 2-dimensional Grids. Euro-Par 1997: 950-957 - [c6]Fabrizio d'Amore, Fabio Iacobini:
On-Line Algorithms for Networks of Temporal Constraints. WG 1997: 144-156 - [e1]Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela:
Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Lecture Notes in Computer Science 1197, Springer 1997, ISBN 3-540-62559-3 [contents] - 1995
- [j6]Fabrizio d'Amore
On Optimal Cuts of Hyperrectangles. Computing 55(3): 191-206 (1995) - [j5]Fabrizio d'Amore, P. Kohler:
Asymptotically Sharp Error Estimates for Modified Compound Quadrature Formulae for Cauchy Principal Value Integrals. Computing 55(3): 255-269 (1995) - [c5]Fabrizio d'Amore, Roberto Giaccio:
Incremental Hive Graph. WG 1995: 49-61 - 1994
- [j4]Fabrizio d'Amore
The List Update Problem and the Retrieval of Sets. Theor. Comput. Sci. 130(1): 101-123 (1994) - 1993
- [j3]Fabrizio d'Amore, Paolo Giulio Franciosa:
Separating sets of hyperrectangles. Int. J. Comput. Geom. Appl. 3(2): 155-165 (1993) - [j2]Fabrizio d'Amore
The Weighted List Update Problem and the Lazy Adversary. Theor. Comput. Sci. 108(2): 371-384 (1993) - [c4]Fabrizio d'Amore, Thomas Roos, Peter Widmayer:
An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. ICCG 1993: 215-224 - 1992
- [j1]Fabrizio d'Amore
On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles. Inf. Process. Lett. 44(5): 255-259 (1992) - [c3]Fabrizio d'Amore, Vincenzo Liberatore
The List Update Problem and the Retrieval of Sets. SWAT 1992: 178-191 - 1991
- [c2]Fabrizio d'Amore, Alberto Marchetti-Spaccamela
Competitive Algorithms for the Weighted List Update Problem. WADS 1991: 240-248 - 1990
- [c1]Fabrizio d'Amore, Paolo Giulio Franciosa:
Separating Sets of Hyperrectangles. MFCS 1990: 165-172
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-08-05 20:23 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: