Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Demetrescu, Camil - Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza"
Fully Dynamic Transitive Closure: Breaking Through the O(n 2 ) Barrier \Lambda
A System for Building Animated Presentations over the Web Benedetto A. Colombo
Infinite Trees and the Future (Extended Abstract) ?
What Do We Learn from Experimental Algorithmics? ?
AlcomFT Technical Report Series ALCOMFTTR01148
Visualizing Geometric Algorithms with WAVE: System Demonstration (Short Abstract)
Reversible Execution and Visualization of Programs with Pierluigi Crescenzi y , Camil Demetrescu \Lambda , Irene Finocchi x , and Rossella Petreschi x
Visualizing Algorithms over the Web with the Publicationdriven Approach \Lambda
Trading off space for passes in graph streaming problems Camil Demetrescu
Specifying Algorithm Visualizations: Interesting Events or State Mapping?
Engineering Shortest Path Algorithms Camil Demetrescu1
Universit` a degli Studi di Roma ``La Sapienza'' Dottorato di Ricerca in Ingegneria Informatica
Combinatorial Algorithms for Feedback Problems in Directed Graphs
LEONARDO: a software visualization system P. Crescenzi 1 C. Demetrescu I. Finocchi R. Petreschi
A GENERALPURPOSE LOGICBASED VISUALIZATION FRAMEWORK
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study ?
10.2 DYNAMIC GRAPH ALGORITHMS & ' ( ) 0 1 %
Trade-offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n2
Break the ``Right'' Cycles and Get the ``Best'' Drawing Camil Demetrescu
A New Approach to Dynamic All Pairs Shortest Paths
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms
A technique for generating graphical abstractions of program data structures
Algorithm Engineering Camil Demetrescu
AlcomFT Technical Report Series ALCOMFTTR01149
Smooth Animation of Algorithms in a Declarative Framework Camil Demetrescu
Smooth Animation of Algorithms in a Declarative Framework \Lambda
Approximate Solutions to the Food Selection Problem (or How to Pig Out in the Eternal City)
Oracles for Distances Avoiding a Node or Link Failure Camil Demetrescu
AlcomFT Technical Report Series ALCOMFTTR01150
