default search action
Saverio Caminiti
Person information
- affiliation: Sapienza University of Rom
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j7]Saverio Caminiti, Irene Finocchi
, Emanuele G. Fusco, Francesco Silvestri
Resilient Dynamic Programming. Algorithmica 77(2): 389-425 (2017) - [p1]Vito D. P. Servedio, Saverio Caminiti, Pietro Gravino, Vittorio Loreto, Alina Sîrbu
Large Scale Engagement Through Web-Gaming and Social Computations. Participatory Sensing, Opinions and Collective Awareness 2017: 237-254 - 2016
- [c12]Pietro Gravino, Saverio Caminiti, Alina Sîrbu
Unveiling Political Opinion Structures with a Web-experiment. COMPLEXIS 2016: 39-47 - 2014
- [i1]Saverio Caminiti, Claudio Cicali, Pietro Gravino, Vittorio Loreto, Vito Domenico Pietro Servedio, Alina Sîrbu, Francesca Tria:
XTribe: a web-based social computation platform. CoRR abs/1401.4578 (2014) - 2013
- [c11]Saverio Caminiti, Claudio Cicali, Pietro Gravino, Vittorio Loreto, Vito Domenico Pietro Servedio
XTribe: A Web-Based Social Computation Platform. CGC 2013: 397-403 - 2011
- [c10]Saverio Caminiti, Irene Finocchi
Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS 2011: 433-444 - [c9]Saverio Caminiti, Irene Finocchi
Local dependency dynamic programming in the presence of memory faults. STACS 2011: 45-56 - 2010
- [j6]Saverio Caminiti, Rossella Petreschi:
Unified parallel encoding and decoding algorithms for Dandelion-like codes. J. Parallel Distributed Comput. 70(11): 1119-1127 (2010) - [j5]Saverio Caminiti, Emanuele G. Fusco
Bijective Linear Time Coding and Decoding for k-Trees. Theory Comput. Syst. 46(2): 284-300 (2010) - [c8]Saverio Caminiti, Rossella Petreschi:
Parallel Algorithms for Encoding and Decoding Blob Code. WALCOM 2010: 167-178
2000 – 2009
- 2009
- [j4]Tiziana Calamoneri
On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. Networks 53(1): 27-34 (2009) - [c7]Saverio Caminiti, Rossella Petreschi:
Parallel Algorithms for Dandelion-Like Codes. ICCS (1) 2009: 611-620 - [c6]Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
Informative Labeling Schemes for the Least Common Ancestor Problem. ICTCS 2009: 66-70 - 2008
- [j3]Tiziana Calamoneri
A General Approach to L ( h, k )-Label Interconnection Networks. J. Comput. Sci. Technol. 23(4): 652-659 (2008) - [c5]Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. ESA 2008: 234-245 - 2007
- [j2]Saverio Caminiti, Irene Finocchi
On coding labeled trees. Theor. Comput. Sci. 382(2): 97-108 (2007) - [c4]Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi:
On the L(h, k)-Labeling of Co-comparability Graphs. ESCAPE 2007: 116-127 - [c3]Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi:
A Bijective Code for k -Trees with Linear Time Encoding and Decoding. ESCAPE 2007: 408-420 - 2005
- [j1]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi:
A general approach to L(h, k)-label interconnection networks. Electron. Notes Discret. Math. 19: 211-217 (2005) - [c2]Saverio Caminiti, Rossella Petreschi:
String Coding of Trees with Locality and Heritability. COCOON 2005: 251-262 - 2004
- [c1]Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
A Unified Approach to Coding Labeled Trees. LATIN 2004: 339-348
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-04-25 05:52 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: