Irene Finocchi

Renan Leon Garcia

Blerina Sinaimeri

Comput. J., 2024

2023

An analysis of international mobility and research productivity in computer science.

[BibT_eX]

[DOI]

Andrea Ribichini

Marco Schaerf

Scientometrics, November, 2023

Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures.

[BibT_eX]

[DOI]

Marco D'Elia

Maurizio Patrignani

Proceedings of the AIxIA 2023 - Advances in Artificial Intelligence, 2023

2022

On computer science research and its temporal evolution.

[BibT_eX]

[DOI]

Scientometrics, 2022

Which Conference Is That? A Case Study in Computer Science.

[BibT_eX]

[DOI]

ACM J. Data Inf. Qual., 2022

2020

On bibliometrics in academic promotions: a case study in computer science and engineering in Italy.

[BibT_eX]

[DOI]

Scientometrics, 2020

2019

Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms.

[BibT_eX]

[DOI]

Emilio Coppa

Renan Leon Garcia

Inf. Sci., 2019

WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus.

[BibT_eX]

[DOI]

Stefano Faralli

Simone Paolo Ponzetto

Paola Velardi

Proceedings of the Sixth Italian Conference on Computational Linguistics, 2019

2018

CrumbTrail: An efficient methodology to reduce multiple inheritance in knowledge graphs.

[BibT_eX]

[DOI]

Stefano Faralli

Simone Paolo Ponzetto

Paola Velardi

Knowl. Based Syst., 2018

A Survey of Symbolic Execution Techniques.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2018

Efficient Pruning of Large Knowledge Graphs.

[BibT_eX]

[DOI]

Stefano Faralli

Simone Paolo Ponzetto

Paola Velardi

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Resilient Dynamic Programming.

[BibT_eX]

[DOI]

Algorithmica, 2017

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Nikhil Bansal

Algorithmica, 2017

2016

Mining hot calling contexts in small space.

[BibT_eX]

[DOI]

Daniele Cono D'Elia

Softw. Pract. Exp., 2016

2015

Clique Counting in MapReduce: Algorithms and Experiments.

[BibT_eX]

[DOI]

Marco Finocchi

ACM J. Exp. Algorithmics, 2015

Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

On data skewness, stragglers, and MapReduce progress indicators.

[BibT_eX]

[DOI]

Emilio Coppa

Proceedings of the Sixth ACM Symposium on Cloud Computing, 2015

2014

Input-Sensitive Profiling.

[BibT_eX]

[DOI]

Emilio Coppa

IEEE Trans. Software Eng., 2014

Reactive Imperative Programming with Dataflow Constraints.

[BibT_eX]

[DOI]

Andrea Ribichini

ACM Trans. Program. Lang. Syst., 2014

Counting small cliques in MapReduce.

[BibT_eX]

[DOI]

Marco Finocchi

CoRR, 2014

Experimental Evaluation of Algorithms for the Food-Selection Problem.

[BibT_eX]

[DOI]

CoRR, 2014

Estimating the Empirical Cost Function of Routines with Dynamic Workloads.

[BibT_eX]

[DOI]

Proceedings of the 12th Annual IEEE/ACM International Symposium on Code Generation and Optimization, 2014

2013

Ball-Larus Path Profiling Across Multiple Loop iterations

[BibT_eX]

[DOI]

Daniele Cono D'Elia

CoRR, 2013

Multithreaded Input-Sensitive Profiling

[BibT_eX]

[DOI]

CoRR, 2013

Software Streams: Big Data Challenges in Dynamic Program Analysis.

[BibT_eX]

[DOI]

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Editorial: Preface to the special issue.

[BibT_eX]

[DOI]

Tiziana Calamoneri

Networks, 2012

k-Calling context profiling.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

2011

Guest editors' foreword.

[BibT_eX]

[DOI]

John Hershberger

ACM J. Exp. Algorithmics, 2011

Local dependency dynamic programming in the presence of memory faults.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Dynamic programming in faulty memory hierarchies (cache-obliviously).

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Experimental Study of Resilient Algorithms and Data Structures.

[BibT_eX]

[DOI]

Umberto Ferraro Petrillo

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

Optimal resilient sorting and searching in the presence of memory faults.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Resilient dictionaries.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Trading off space for passes in graph streaming problems.

[BibT_eX]

[DOI]

Andrea Ribichini

ACM Trans. Algorithms, 2009

The Price of Resiliency: a Case Study on Sorting with Memory Faults.

[BibT_eX]

[DOI]

Umberto Ferraro Petrillo

Algorithmica, 2009

Informative Labeling Schemes for the Least Common Ancestor Problem.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

Sorting and Searching in Faulty Memories.

[BibT_eX]

[DOI]

Algorithmica, 2008

A Note on Algebraic Hypercube Colorings.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

On coding labeled trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Designing reliable algorithms in unreliable memories.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2007

Resilient search trees.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Optimal Resilient Dynamic Dictionaries.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Allan Grønlund Jørgensen

Gabriel Moruz

Thomas Mølhave

Proceedings of the Algorithms, 2007

2006

Conflict-free star-access in parallel memory systems.

[BibT_eX]

[DOI]

Sajal K. Das

J. Parallel Distributed Comput., 2006

Crossing-constrained hierarchical drawings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

A data-driven graphical toolkit for software visualization.

[BibT_eX]

[DOI]

Proceedings of the ACM 2006 Symposium on Software Visualization, 2006

Visual editing of animated algorithms: the Leonardo Web builder.

[BibT_eX]

[DOI]

Proceedings of the working conference on Advanced visual interfaces, 2006

2005

Structure-Preserving Hierarchical Decompositions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.

[BibT_eX]

[DOI]

Alessandro Panconesi

Riccardo Silvestri

Algorithmica, 2005

Portraying Algorithms with Leonardo Web.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2005 Workshops, 2005

Graph Coloring with Distance Constraints.

[BibT_eX]

Tiziana Calamoneri

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

2004

Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Dynamic Trees.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

A Java-based system for building animated presentations over the Web.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2004

Divider-based algorithms for hierarchical tree partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Sorting and searching in the presence of memory faults (without redundancy).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

A portable virtual machine for program debugging and directing.

[BibT_eX]

[DOI]

Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

A Unified Approach to Coding Labeled Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems.

[BibT_eX]

[DOI]

Sajal K. Das

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Combinatorial algorithms for feedback problems in directed graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Algorithm engineering, Algorithmics Column.

[BibT_eX]

Bull. EATCS, 2003

Engineering and Visualizing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Graphs in Computer Science.

[BibT_eX]

[DOI]

Harold N. Gabow

Giuseppe Francesco Italiano

Proceedings of the Handbook of Graph Theory., 2003

2002

On max cut in cubic graphs.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 2002

Experimental analysis of simple, distributed vertex coloring algorithms.

[BibT_eX]

[DOI]

Alessandro Panconesi

Riccardo Silvestri

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Smooth Animation of Algorithms in a Declarative Framework.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2001

Removing Cycles for Minimizing Crossings.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2001

Tree partitioning via vertex deletion.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Graph Sketches.

[BibT_eX]

[DOI]

James Abello

Jeffrey L. Korn

Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01), 2001

Specifying Algorithm Visualizations: Interesting Events or State Mapping?

[BibT_eX]

[DOI]

John T. Stasko

Proceedings of the Software Visualization, 2001

On the Validity of Hierarchical Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Layered Drawings of Graphs with Crossing Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Hierarchical Clustering of Trees: Algorithms and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Reversible Execution and Visualization of Programs with LEONARDO.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2000

Visualizing Algorithms over the Web with the Publication-Driven Approach.

[BibT_eX]

[DOI]

Giuseppe Liotta

Proceedings of the Algorithm Engineering, 2000

Visualization in Algorithm Engineering: Tools and Techniques.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithmics, 2000

1999

A Technique for Generating Graphical Abstractions of Program Data Structures.

[BibT_eX]

[DOI]