#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2005

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Camil Demetrescu, Irene Finocchi, Andrea Ribichini
- ACM Trans. Algorithms
- 2006

Data stream processing has recently received increasing attention as a computational paradigm for dealing with massive data sets. Surprisingly, no algorithm with both sublinear space and passes is known for natural graph problems in classical read-only streaming. Motivated by technological factors of modern storage systems, some authors have recently… (More)

- Camil Demetrescu, Irene Finocchi, Andrea Ribichini
- ACM Trans. Program. Lang. Syst.
- 2011

Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes in their environment. In this article, we show that one-way dataflow constraints, largely explored in the context of interactive applications, can be seamlessly integrated in any imperative… (More)

In this paper we show how parallel algorithms can be turned into efficient streaming algorithms for several classical combinatorial problems in the W-Streammodel. In this model, at each pass one input stream is read, one output stream is written, and data items have to be processed using limited space; streams are pipelined in such a way that the output… (More)

- Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
- Algorithmica
- 2008

This article reports the results of an extensive experimental analysis of efficient algorithms for computing graph spanners in the data streaming model, where an (α,β)-spanner of a graph G is a subgraph S⊆G such that for each pair of vertices the distance in S is at most α times the distance in G plus β. To the best of our knowledge, this is the first… (More)

- Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
- Algorithmica
- 2013

We introduce and investigate a new notion of resilience in graph spanners. Let $$S$$ S be a spanner of a weighted graph $$G$$ G . Roughly speaking, we say that $$S$$ S is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $$G$$ G fails, then as a consequence of this failure all distances do not degrade… (More)

- Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano
- Discrete Math., Alg. and Appl.
- 2010

- Andrea Ribichini
- 2006

In this report I will focus on the research activity carried on during the first two years of my PhD program, at the University of Rome “La Sapienza”, in the field of massive data sets, with particular emphasis on the streaming computational model: in this model data stored in external memory can be accessed only sequentially, in one or several passes, and… (More)

We present a new algorithm for maintaining a DFS tree of an arbitrary directed graph under any sequence of edge insertions. Our algorithm requires a total of $O(m\cdot n)$ time in the worst case to process a sequence of edge insertions, where $n$ is the number of vertices in the graph and $m$ is the total number of edges in the final graph. We also prove… (More)

- CAHIER DU LAMSADE, Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
- 2006

In this paper we show how PRAM algorithms can be turned into efficient streaming algorithms for several classical combinatorial problems in the W-Stream model. In this model, at each pass one input stream is read and one output stream is written; streams are pipelined in such a way that the output stream produced at pass i is given as input stream at pass i… (More)