Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Saverio Caminiti
2010 – today
- 2011
[c10]Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri: Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS 2011: 433-444- [c9]Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco: 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 Distrib. Comput. 70(11): 1119-1127 (2010)
- [j5]Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi: 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, Saverio Caminiti, Rossella Petreschi, Stephan Olariu: 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, Saverio Caminiti, Rossella Petreschi: 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, Rossella Petreschi: 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. Electronic Notes in Discrete Mathematics 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 16:05 CEST by the dblp team