Algorithmica

Label

• Algorithmica (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi

• Engineering a Lightweight Suffix Array Construction Algorithm. (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Distribution-aware compressed full-text indexes (Articolo in rivista) (Prodotto della ricerca)
• Quasi-upward planarity (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Blowing bubbles for multi-scale analysis and decomposition of triangle meshes (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (Articolo in rivista) (Prodotto della ricerca)
• Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes (Articolo in rivista) (Prodotto della ricerca)
• On optimally partitioning a text to improve its compression (Articolo in rivista) (Prodotto della ricerca)
• Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)

Alternative label

• Algorithmica (literal)
• Algorithmica (New York. Print) (literal)
• Algorithmica. (literal)

Language

• eng (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#issn

• 0178-4617 (literal)

Preferred label

• Algorithmica (literal)

Publisher

• Springer Science + Business Media New York : USA (literal)

Incoming links:

Rivista

• Quasi-upward planarity (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Exact and Approximate Truthful Mechanisms for the Shortest-Paths Tree Problem (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Blowing bubbles for multi-scale analysis and decomposition of triangle meshes (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Engineering a Lightweight Suffix Array Construction Algorithm. (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes (Articolo in rivista) (Prodotto della ricerca)
• On optimally partitioning a text to improve its compression (Articolo in rivista) (Prodotto della ricerca)
• Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems (Articolo in rivista) (Prodotto della ricerca)
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Articolo in rivista) (http://www.cnr.it/ontology/cnr/individuo/prodotto/TIPO1101)
• Distribution-aware compressed full-text indexes (Articolo in rivista) (Prodotto della ricerca)