Camil Demetrescu

Orcid: 0000-0002-4686-6745

Affiliations:
  • Sapienza University of Rome, Department of Computer and Systems Science, Italy (PhD 2001)


According to our database1, Camil Demetrescu authored at least 93 papers between 1997 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
10
5
1
5
2
1
3
1
2
2
2
1
3
1
3
4
1
1
3
3
3
1
2
2
2
1
3
1
4
1
3
1
1
1
1
1
4
1
3
1
2
1
5
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
SENinja: A symbolic execution plugin for Binary Ninja.
SoftwareX, December, 2022

On computer science research and its temporal evolution.
Scientometrics, 2022

Which Conference Is That? A Case Study in Computer Science.
ACM J. Data Inf. Qual., 2022

SymFusion: Hybrid Instrumentation for Concolic Execution.
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, 2022

Handling Memory-Intensive Operations in Symbolic Execution.
Proceedings of the ISEC 2022: 15th Innovations in Software Engineering Conference, Gandhinagar, India, February 24, 2022

Reach Me if You Can: On Native Vulnerability Reachability in Android Apps.
Proceedings of the Computer Security - ESORICS 2022, 2022

2021
FUZZOLIC: Mixing fuzzing and concolic execution.
Comput. Secur., 2021

Fuzzing Symbolic Expressions.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

2020
Are Italian research assessment exercises size-biased?
Scientometrics, 2020

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

2019
Memory models in symbolic execution: key ideas and new thoughts.
Softw. Test. Verification Reliab., 2019

On the Shapley value and its application to the Italian VQR research assessment exercise.
J. Informetrics, 2019

SymNav: Visually Assisting Symbolic Execution.
Proceedings of the 16th IEEE Symposium on Visualization for Cyber Security, VizSec 2019, 2019

The ROP needle: hiding trigger-based injection vectors via code reuse.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

Static Analysis of ROP Code.
Proceedings of the 12th European Workshop on Systems Security, 2019

Reconstructing C2 Servers for Remote Access Trojans with Symbolic Execution.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2019

2018
Accuracy of author names in bibliographic data sources: an Italian case study.
Scientometrics, 2018

A Survey of Symbolic Execution Techniques.
ACM Comput. Surv., 2018

On-stack replacement, distilled.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

2017
On-Stack Replacement à la Carte.
CoRR, 2017

Rethinking pointer reasoning in symbolic execution.
Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017

Assisting Malware Analysis with Symbolic Execution: A Case Study.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

My (fair) big data.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2016
Visualization Techniques for Algorithm Engineering.
Encyclopedia of Algorithms, 2016

Trade-Offs for Dynamic Graph Problems.
Encyclopedia of Algorithms, 2016

Single-Source Fully Dynamic Reachability.
Encyclopedia of Algorithms, 2016

Decremental All-Pairs Shortest Paths.
Encyclopedia of Algorithms, 2016

Implementation Challenge for Shortest Paths.
Encyclopedia of Algorithms, 2016

Mining hot calling contexts in small space.
Softw. Pract. Exp., 2016

Programming Language Techniques for Incremental and Reactive Computing (Dagstuhl Seminar 16402).
Dagstuhl Reports, 2016

Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111).
Dagstuhl Reports, 2016

Flexible on-stack replacement in LLVM.
Proceedings of the 2016 International Symposium on Code Generation and Optimization, 2016

2015
Front Matter, Table of Contents.
Dagstuhl Artifacts Ser., 2015

2014
Input-Sensitive Profiling.
IEEE Trans. Software Eng., 2014

Reactive Imperative Programming with Dataflow Constraints.
ACM Trans. Program. Lang. Syst., 2014

Experimental Evaluation of Algorithms for the Food-Selection Problem.
CoRR, 2014

Estimating the Empirical Cost Function of Routines with Dynamic Workloads.
Proceedings of the 12th Annual IEEE/ACM International Symposium on Code Generation and Optimization, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Ball-Larus Path Profiling Across Multiple Loop iterations
CoRR, 2013

Multithreaded Input-Sensitive Profiling
CoRR, 2013

Editorial.
Algorithmica, 2013

Ball-Larus path profiling across multiple loop iterations.
Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, 2013

The Quest for the Shortest Route.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
k-Calling context profiling.
Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

2011
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191).
Dagstuhl Reports, 2011

2010
Adapting parallel algorithms to the W-Stream model, with applications to graph problems.
Theor. Comput. Sci., 2010

2009
Trading off space for passes in graph streaming problems.
ACM Trans. Algorithms, 2009

Preface.
ACM J. Exp. Algorithmics, 2009

Graph Spanners in the Streaming Model: An Experimental Study.
Algorithmica, 2009

2008
Visualization Techniques for Algorithm Engineering.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Trade-Offs for Dynamic Graph Problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Single-Source Fully Dynamic Reachability.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Decremental All-Pairs Shortest Paths.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Implementation Challenge for Shortest Paths.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Oracles for Distances Avoiding a Failed Node or Link.
SIAM J. Comput., 2008

Papers from ALENEX 2005.
ACM J. Exp. Algorithmics, 2008

Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure.
Algorithmica, 2008

2007
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments.
Proceedings of the Algorithms, 2007

2006
Experimental analysis of dynamic all pairs shortest path algorithms.
ACM Trans. Algorithms, 2006

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures.
J. Discrete Algorithms, 2006

Fully dynamic all pairs shortest paths with real edge weights.
J. Comput. Syst. Sci., 2006

Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks.
Proceedings of the Second Workshop on Cryptography for Ad-hoc Networks, 2006

A data-driven graphical toolkit for software visualization.
Proceedings of the ACM 2006 Symposium on Software Visualization, 2006

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
Proceedings of the Algorithms, 2006

Visual editing of animated algorithms: the Leonardo Web builder.
Proceedings of the working conference on Advanced visual interfaces, 2006

2005
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n<sup>2</sup> barrier.
J. ACM, 2005

Portraying Algorithms with Leonardo Web.
Proceedings of the Web Information Systems Engineering - WISE 2005 Workshops, 2005

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

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

A Java-based system for building animated presentations over the Web.
Sci. Comput. Program., 2004

A new approach to dynamic all pairs shortest paths.
J. ACM, 2004

Engineering Shortest Path Algorithms.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Experimental analysis of dynamic all pairs shortest path algorithms.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A portable virtual machine for program debugging and directing.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

2003
Combinatorial algorithms for feedback problems in directed graphs.
Inf. Process. Lett., 2003

Algorithm engineering, Algorithmics Column.
Bull. EATCS, 2003

Engineering and Visualizing Algorithms.
Proceedings of the Graph Drawing, 11th International Symposium, 2003


2002
Oracles for distances avoiding a link-failure.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Fully Dynamic Algorithms for Path Problems on Directed Graphs.
PhD thesis, 2001

Smooth Animation of Algorithms in a Declarative Framework.
J. Vis. Lang. Comput., 2001

Removing Cycles for Minimizing Crossings.
ACM J. Exp. Algorithmics, 2001

Specifying Algorithm Visualizations: Interesting Events or State Mapping?
Proceedings of the Software Visualization, 2001

2000
Reversible Execution and Visualization of Programs with LEONARDO.
J. Vis. Lang. Comput., 2000

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.
Proceedings of the Algorithm Engineering, 2000

Visualizing Algorithms over the Web with the Publication-Driven Approach.
Proceedings of the Algorithm Engineering, 2000

What Do We Learn from Experimental Algorithmics?
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Fully Dynamic Transitive Closure: Breaking Through the O(n<sup>2</sup>) Barrier.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Visualization in Algorithm Engineering: Tools and Techniques.
Proceedings of the Experimental Algorithmics, 2000

1999
A Technique for Generating Graphical Abstractions of Program Data Structures.
Proceedings of the Visual Information and Information Systems, 1999

Infinite Trees and the Future.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1997
LEONARDO: a software visualization system.
Proceedings of the Workshop on Algorithm Engineering, 1997


  Loading...