|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 16 publication records. Showing 16 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco |
Local dependency dynamic programming in the presence of memory faults.  |
STACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri |
Dynamic programming in faulty memory hierarchies (cache-obliviously). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Rossella Petreschi |
Unified parallel encoding and decoding algorithms for Dandelion-like codes. |
J. Parallel Distrib. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi |
Bijective Linear Time Coding and Decoding for k-Trees. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Rossella Petreschi |
Parallel Algorithms for Encoding and Decoding Blob Code. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi, Stephan Olariu |
On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi |
Informative Labeling Schemes for the Least Common Ancestor Problem. |
ICTCS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Saverio Caminiti, Rossella Petreschi |
Parallel Algorithms for Dandelion-Like Codes. |
ICCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi |
A General Approach to L ( h, k )-Label Interconnection Networks. |
J. Comput. Sci. Technol. |
2008 |
DBLP DOI BibTeX RDF |
L(h, k)-labeling, multistage interconnection network, channel assignment problem |
| 1 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi |
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi |
On coding labeled trees. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi |
A Bijective Code for k -Trees with Linear Time Encoding and Decoding. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi |
On the L(h, k)-Labeling of Co-comparability Graphs. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
L(h and k)-Labeling, co-comparability graphs, unit-interval graphs, interval graphs |
| 1 | Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi |
A general approach to L(h, k)-label interconnection networks. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Rossella Petreschi |
String Coding of Trees with Locality and Heritability. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi |
A Unified Approach to Coding Labeled Trees. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #16 of 16 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")