Camil Demetrescu
Camil Demetrescu
Professor of Computer Science, Sapienza University of Rome
Bestätigte E-Mail-Adresse bei diag.uniroma1.it - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Handbook of graph theory
JL Gross, J Yellen
CRC press, 2003
12092003
A new approach to dynamic all pairs shortest paths
C Demetrescu, GF Italiano
Journal of the ACM (JACM) 51 (6), 968-992, 2004
3872004
Handbook of data structures and applications
DP Mehta, S Sahni
Taylor & Francis, 2018
2922018
A survey of symbolic execution techniques
R Baldoni, E Coppa, DC D’elia, C Demetrescu, I Finocchi
ACM Computing Surveys (CSUR) 51 (3), 1-39, 2018
2772018
The Shortest Path Problem: Ninth DIMACS Implementation Challenge
C Demetrescu, AV Goldberg, DS Johnson
American Mathematical Soc., 2009
210*2009
Experimental analysis of dynamic all pairs shortest path algorithms
C Demetrescu, GF Italiano
ACM Transactions on Algorithms (TALG) 2 (4), 578-601, 2006
1542006
Fully dynamic transitive closure: breaking through the o (n/sup 2/) barrier
C Demetrescu, GF Italiano
Proceedings 41st Annual Symposium on Foundations of Computer Science, 381-389, 2000
1262000
Trading off space for passes in graph streaming problems
C Demetrescu, I Finocchi, A Ribichini
ACM Transactions on Algorithms (TALG) 6 (1), 1-17, 2009
1102009
Input-sensitive profiling
E Coppa, C Demetrescu, I Finocchi
ACM SIGPLAN Notices 47 (6), 89-98, 2012
1062012
Oracles for distances avoiding a failed node or link
C Demetrescu, M Thorup, RA Chowdhury, V Ramachandran
SIAM Journal on Computing 37 (5), 1299-1318, 2008
1012008
Reversible execution and visualization of programs with LEONARDO
P Crescenzi, C Demetrescu, I Finocchi, R Petreschi
Journal of Visual Languages & Computing 11 (2), 125-150, 2000
922000
Combinatorial algorithms for feedback problems in directed graphs
C Demetrescu, I Finocchi
Information Processing Letters 86 (3), 129-136, 2003
812003
Fully dynamic all pairs shortest paths with real edge weights
C Demetrescu, GF Italiano
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 260-267, 2001
782001
Specifying algorithm visualizations: Interesting events or state mapping?
C Demetrescu, I Finocchi, JT Stasko
Software Visualization, 16-30, 2002
672002
Fully dynamic all pairs shortest paths with real edge weights
C Demetrescu, GF Italiano
Journal of Computer and System Sciences 72 (5), 813-837, 2006
642006
Dynamic graph algorithms
C Demetrescu, D Eppstein, Z Galil, GF Italiano
Algorithms and Theory of Computation Handbook, Volume 1, 235-262, 2009
562009
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study
C Demetrescu, D Frigioni, A Marchetti-Spaccamela, U Nanni
International Workshop on Algorithm Engineering, 218-229, 2000
512000
Mining hot calling contexts in small space
DC D'Elia, C Demetrescu, I Finocchi
ACM SIGPLAN Notices 46 (6), 516-527, 2011
44*2011
Reactive imperative programming with dataflow constraints
C Demetrescu, I Finocchi, A Ribichini
ACM SIGPLAN Notices 46 (10), 407-426, 2011
412011
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
C Demetrescu, GF Italiano
Journal of Discrete Algorithms 4 (3), 353-383, 2006
412006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20