Camil Demetrescu
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
28
Venues
16
Active years
1999–2022
Best venue rank
A*
Where they publish
Papers
28 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | ESORICS | Reach Me if You Can: On Native Vulnerability Reachability in Android Apps. | Luca Borzacchiello, Emilio Coppa, Davide Maiorca, Andrea Columbu, Camil Demetrescu, Giorgio Giacinto |
| 2021 | ICSE | Fuzzing Symbolic Expressions. | Luca Borzacchiello, Emilio Coppa, Camil Demetrescu |
| 2019 | SAC | The ROP needle: hiding trigger-based injection vectors via code reuse. | Pietro Borrello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu |
| 2019 | VizSec | SymNav: Visually Assisting Symbolic Execution. | Marco Angelini, Graziano Blasilli, Luca Borzacchiello, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Simone Lenti, Simone Nicchi, Giuseppe Santucci |
| 2018 | PLDI | On-stack replacement, distilled. | Daniele Cono D'Elia, Camil Demetrescu |
| 2016 | CGO | Flexible on-stack replacement in LLVM. | Daniele Cono D'Elia, Camil Demetrescu |
| 2014 | CGO | Estimating the Empirical Cost Function of Routines with Dynamic Workloads. | Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta |
| 2013 | OOPSLA | Ball-Larus path profiling across multiple loop iterations. | Daniele Cono D'Elia, Camil Demetrescu |
| 2012 | OOPSLA | k-Calling context profiling. | Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani |
| 2012 | PLDI | Input-sensitive profiling. | Emilio Coppa, Camil Demetrescu, Irene Finocchi |
| 2011 | OOPSLA | Reactive imperative programming with dataflow constraints. | Camil Demetrescu, Irene Finocchi, Andrea Ribichini |
| 2011 | PLDI | Mining hot calling contexts in small space. | Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi |
| 2007 | ESA | Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. | Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini |
| 2007 | MFCS | Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. | Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini |
| 2006 | AVI | Visual editing of animated algorithms: the Leonardo Web builder. | Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura |
| 2006 | ESA | Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? | Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup |
| 2006 | SODA | Trading off space for passes in graph streaming problems. | Camil Demetrescu, Irene Finocchi, Andrea Ribichini |
| 2005 | WISE | Portraying Algorithms with Leonardo Web. | Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura |
| 2004 | SAC | A portable virtual machine for program debugging and directing. | Camil Demetrescu, Irene Finocchi |
| 2004 | SODA | Experimental analysis of dynamic all pairs shortest path algorithms. | Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano |
| 2003 | GD | Engineering and Visualizing Algorithms. | Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano |
| 2003 | STOC | A new approach to dynamic all pairs shortest paths. | Camil Demetrescu, Giuseppe F. Italiano |
| 2002 | ICALP | Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths. | Camil Demetrescu, Giuseppe F. Italiano |
| 2002 | SODA | Oracles for distances avoiding a link-failure. | Camil Demetrescu, Mikkel Thorup |
| 2001 | FOCS | Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. | Camil Demetrescu, Giuseppe F. Italiano |
| 2000 | FOCS | Fully Dynamic Transitive Closure: Breaking Through the O(n | Camil Demetrescu, Giuseppe F. Italiano |
| 2000 | MFCS | What Do We Learn from Experimental Algorithmics? | Camil Demetrescu, Giuseppe F. Italiano |
| 1999 | GD | Infinite Trees and the Future. | Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia |