Riccardo Silvestri
According to our database1,
Riccardo Silvestri
authored at least 84 papers
between 1990 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2017
2016
Normally-off GaN-HEMTs with p-type gate: Off-state degradation, forward gate stress and ESD failure.
Microelectron. Reliab., 2016
2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Evidence for temperature-dependent buffer-induced trapping in GaN-on-silicon power transistors.
Proceedings of the IEEE International Reliability Physics Symposium, 2015
2014
Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times.
IEEE Trans. Parallel Distributed Syst., 2014
Proceedings of the 44th European Solid State Device Research Conference, 2014
2013
IEEE/ACM Trans. Netw., 2013
Comparison of the performances of an InAlN/GaN HEMT with a Mo/Au gate or a Ni/Pt/Au gate.
Microelectron. Reliab., 2013
Proceedings of the Structural Information and Communication Complexity, 2013
Proceedings of the Algorithms - ESA 2013, 2013
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013
2012
Networks, 2012
2011
IEEE Trans. Parallel Distributed Syst., 2011
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks.
IEEE Trans. Parallel Distributed Syst., 2011
Proceedings of the Distributed Computing - 25th International Symposium, 2011
2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009
2008
Theor. Comput. Sci., 2008
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
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
Distributed Comput., 2006
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
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
J. Parallel Distributed Comput., 2004
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
Proceedings of the STACS 2004, 2004
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004
2003
Theor. Comput. Sci., 2003
The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Theor. Comput. Sci., 2003
Inf. Comput., 2003
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003
2002
A note on the spatiality degree of graphs.
Ars Comb., 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2001
Inf. Comput., 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001
2000
Proceedings of the STACS 2000, 2000
1999
Proceedings of the Randomization, 1999
1998
1997
Theor. Comput. Sci., 1997
Theory Comput. Syst., 1997
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
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
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1993
Int. J. Found. Comput. Sci., 1993
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
1992
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
1991
1990
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.
Inf. Process. Lett., 1990