Riccardo Silvestri

According to our database1, Riccardo Silvestri authored at least 92 papers between 1990 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Simple dynamics for plurality consensus.
Distributed Computing, 2017

2016
Rumor spreading in random evolving graphs.
Random Struct. Algorithms, 2016

2015
Distributed community detection in dynamic graphs.
Theor. Comput. Sci., 2015

Parsimonious flooding in geometric random-walks.
J. Comput. Syst. Sci., 2015

Information spreading in dynamic graphs.
Distributed Computing, 2015

Plurality Consensus in the Gossip Model.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times.
IEEE Trans. Parallel Distrib. Syst., 2014

Simple dynamics for plurality consensus.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power.
IEEE/ACM Trans. Netw., 2013

Fast flooding over Manhattan.
Distributed Computing, 2013

Distributed Community Detection in Dynamic Graphs - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2013

Rumor Spreading in Random Evolving Graphs.
Proceedings of the Algorithms - ESA 2013, 2013

Randomness and Complexity.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Optimal gossiping in geometric radio networks in the presence of dynamical faults.
Networks, 2012

Information spreading in dynamic graphs.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
Information Spreading in Stationary Markovian Evolving Graphs.
IEEE Trans. Parallel Distrib. Syst., 2011

Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks.
IEEE Trans. Parallel Distrib. Syst., 2011

Modelling mobility: A discrete revolution.
Ad Hoc Networks, 2011

Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract).
Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010
Flooding Time of Edge-Markovian Evolving Graphs.
SIAM J. Discrete Math., 2010

Fast flooding over Manhattan.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Modelling Mobility: A Discrete Revolution.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Broadcasting in dynamic radio networks.
J. Comput. Syst. Sci., 2009

Pseudonyms in Cost-Sharing Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Information spreading in stationary Markovian evolving graphs.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

MANETS: High Mobility Can Make Up for Low Transmission Power.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Minimum-Energy Broadcast and disk cover in grid wireless networks.
Theor. Comput. Sci., 2008

Flooding time in edge-Markovian dynamic graphs.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms.
Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2008

2007
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci., 2007

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Communication in dynamic radio networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
On the importance of having an identity or, is consensus really universal?.
Distributed Computing, 2006

Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.
Proceedings of the Structural Information and Communication Complexity, 2006

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006

2005
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
Theor. Comput. Sci., 2005

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.
Algorithmica, 2005

Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
Proceedings of the Structural Information and Communication Complexity, 2005

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
On the Power Assignment Problem in Radio Networks.
MONET, 2004

Round Robin is optimal for fault-tolerant broadcasting on wireless networks.
J. Parallel Distrib. Comput., 2004

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
Proceedings of the STACS 2004, 2004

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Distributed broadcast in radio networks of unknown topology.
Theor. Comput. Sci., 2003

The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Theor. Comput. Sci., 2003

Polynomial Time Introreducibility.
Theory Comput. Syst., 2003

Bounded size dictionary compression: SCk-completeness and NC algorithms.
Inf. Comput., 2003

The Minimum Range Assignment Problem on Linear Radio Networks.
Algorithmica, 2003

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002
A note on the spatiality degree of graphs.
Ars Comb., 2002

Experimental analysis of simple, distributed vertex coloring algorithms.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Dot operators.
Theor. Comput. Sci., 2001

The Helping Hierarchy.
ITA, 2001

On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.
Inf. Comput., 2001

Selective families, superimposed codes, and broadcasting on unknown radio networks.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On Computing Ad-hoc Selective Families.
Proceedings of the Approximation, 2001

Distributed multi-broadcast in unknown radio networks.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks.
Proceedings of the Algorithms, 2001

2000
On the power assignment problem in radio networks
Electronic Colloquium on Computational Complexity (ECCC), 2000

On the Importance of Having an Identity or is Consensus Really Universal?
Proceedings of the Distributed Computing, 14th International Conference, 2000

The Power Range Assignment Problem in Radio Networks on the Plane.
Proceedings of the STACS 2000, 2000

The Minimum Range Assignment Problem on Linear Radio Networks.
Proceedings of the Algorithms, 2000

1999
Structure in Approximation Classes.
SIAM J. Comput., 1999

Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks.
Proceedings of the Randomization, 1999

1998
Sperner's Lemma and Robust Machines.
Computational Complexity, 1998

Bounded Size Dictionary Compression: SCk-Completeness and NC Algorithms.
Proceedings of the STACS 98, 1998

1997
On Compact Representations of Propositional Circumscription.
Theor. Comput. Sci., 1997

Helping by Unambiguous Computation and Probabilistic Computation.
Theory Comput. Syst., 1997

Revisiting a Result of Ko.
Inf. Process. Lett., 1997

A Characterization of the Leaf Language Classes.
Inf. Process. Lett., 1997

A Worst-Case Analysis of the LZ2 Compression Algorithm.
Inf. Comput., 1997

The General Notion of a Dot-Operator.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
Structure in Approximation Classes
Electronic Colloquium on Computational Complexity (ECCC), 1996

Parallel approximation of optimization problems.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

To Weight or Not to Weight: Where is the Question?
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Easily Checked Generalized Self-Reducibility.
SIAM J. Comput., 1995

Complexity Classes and Sparse Oracles.
J. Comput. Syst. Sci., 1995

Structure in Approximation Classes (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993
A Note on the Descriptive Complexity of Maximization.
Inf. Process. Lett., 1993

Average Measure, Descriptive Complexity and Approximation of Maximization Problems.
Int. J. Found. Comput. Sci., 1993

Easity Checked Self-Reducibility (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Sperner's Lemma and Robust Machines.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
A Uniform Approach to Define Complexity Classes.
Theor. Comput. Sci., 1992

Reductions to Sets of Low Information Content.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Reductions to Sets of Low Information Content.
Proceedings of the Complexity Theory: Current Research, 1992

1991
A Note on the Approximation of the MAX CLIQUE Problem.
Inf. Process. Lett., 1991

Complexity Classes and Sparse Oracles.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.
Inf. Process. Lett., 1990


  Loading...