H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 32 Citations 5,728 114 World Ranking 7154 National Ranking 194

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Computer network
  • Combinatorics

The scientist’s investigation covers issues in Secret sharing, Upper and lower bounds, Combinatorics, Discrete mathematics and Verifiable secret sharing. His Secret sharing study frequently draws connections to adjacent fields such as Theoretical computer science. His Theoretical computer science study integrates concerns from other disciplines, such as Network topology and Protocol.

His Upper and lower bounds research incorporates elements of Group testing, Algorithm, Connectivity and Type. The Discrete mathematics study combines topics in areas such as Code rate, Information transmission and Set theory. His Verifiable secret sharing study combines topics in areas such as Secure multi-party computation and Conditional entropy.

His most cited work include:

  • Perfectly-Secure Key Distribution for Dynamic Conferences (1011 citations)
  • On the size of shares for secret sharing schemes (241 citations)
  • Perfectly secure key distribution for dynamic conferences (165 citations)

What are the main themes of his work throughout his whole career to date?

Ugo Vaccaro spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Algorithm and Theoretical computer science. Combinatorics and Entropy are commonly linked in his work. His Discrete mathematics study combines topics from a wide range of disciplines, such as Simple and Verifiable secret sharing.

His studies examine the connections between Upper and lower bounds and genetics, as well as such issues in Randomized algorithm, with regards to Asymptotically optimal algorithm. His biological study spans a wide range of topics, including Secure multi-party computation, Homomorphic secret sharing, Secret sharing and Parameterized complexity. His Secret sharing research is multidisciplinary, relying on both Code rate and Protocol.

He most often published in these fields:

  • Combinatorics (43.71%)
  • Discrete mathematics (30.54%)
  • Upper and lower bounds (20.96%)

What were the highlights of his more recent work (between 2012-2020)?

  • Combinatorics (43.71%)
  • Time complexity (12.57%)
  • Bounded function (11.38%)

In recent papers he was focusing on the following fields of study:

Ugo Vaccaro mainly investigates Combinatorics, Time complexity, Bounded function, Cardinality and Discrete mathematics. His Combinatorics research is multidisciplinary, incorporating elements of Entropy, Upper and lower bounds and Optimization problem. His Upper and lower bounds research includes elements of Asymptotically optimal algorithm and Randomized algorithm.

His Bounded function research incorporates themes from Small set and Graph. His work deals with themes such as Simple and Series, which intersect with Discrete mathematics. The concepts of his Theoretical computer science study are interwoven with issues in Wireless, Probabilistic logic and Secret sharing.

Between 2012 and 2020, his most popular works were:

  • Latency-bounded target set selection in social networks ☆ (49 citations)
  • On the approximability and exact algorithms for vector domination and related problems in graphs (24 citations)
  • Influence Diffusion in Social Networks under Time Window Constraints (20 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Computer network
  • Combinatorics

His primary scientific interests are in Combinatorics, Time complexity, Majorization, Discrete mathematics and Upper and lower bounds. He has researched Combinatorics in several fields, including Optimization problem, Cardinality and Order. His research investigates the connection between Time complexity and topics such as Bounded function that intersect with issues in Small set, Series, Simple and Directed graph.

His study in Graph and Vertex falls within the category of Discrete mathematics. His Graph study frequently intersects with other fields, such as Algorithm. His research in Upper and lower bounds intersects with topics in Combinatorial design, Matching, Heuristic, Asymptotically optimal algorithm and Randomized algorithm.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Perfectly-Secure Key Distribution for Dynamic Conferences

Carlo Blundo;Alfredo De Santis;Amir Herzberg;Shay Kutten.
international cryptology conference (1992)

1457 Citations

On the size of shares for secret sharing schemes

R. M. Capocelli;A. Santis;L. Gargano;U. Vaccaro.
Journal of Cryptology (1993)

381 Citations

Perfectly secure key distribution for dynamic conferences

Carlo Blundo;Alfredo De Santis;Ugo Vaccaro;Amir Herzberg.
Information & Computation (1998)

301 Citations

Graph decompositions and secret sharing schemes

C. Blundo;A. Santis;D. R. Stinson;U. Vaccaro.
Journal of Cryptology (1995)

253 Citations

Graph Problems Arising from Wavelength-Routing in All-Optical Networks

Bruno Beauquier;Jean-Claude Bermond;Luisa Gargano;Pavol Hell.
(2004)

237 Citations

Optimal Two-Stage Algorithms for Group Testing Problems

Annalisa De Bonis;Leszek Gasieniec;Ugo Vaccaro.
SIAM Journal on Computing (2005)

155 Citations

Tight Bounds on the Information Rate of Secret SharingSchemes

Carlo Blundo;Alfredo De Santis;Roberto De Simone;Ugo Vaccaro.
Designs, Codes and Cryptography (1997)

144 Citations

Asynchronous deterministic rendezvous in graphs

Gianluca De Marco;Luisa Gargano;Evangelos Kranakis;Danny Krizanc.
Theoretical Computer Science (2006)

138 Citations

Size of shares and probability of cheating in threshold schemes

Marco Carpentieri;Alfredo De Santis;Ugo Vaccaro.
theory and application of cryptographic techniques (1994)

134 Citations

Efficient Collective Communication in Optical Networks

Jean-Claude Bermond;Luisa Gargano;Stephan Perennes;Adele A. Rescigno.
international colloquium on automata languages and programming (1996)

128 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Ugo Vaccaro

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 70

Douglas R. Stinson

Douglas R. Stinson

University of Waterloo

Publications: 33

Huaxiong Wang

Huaxiong Wang

Nanyang Technological University

Publications: 28

Amos Beimel

Amos Beimel

Ben-Gurion University of the Negev

Publications: 26

Josef Pieprzyk

Josef Pieprzyk

Commonwealth Scientific and Industrial Research Organisation

Publications: 22

Lein Harn

Lein Harn

University of Missouri–Kansas City

Publications: 20

Alfredo De Santis

Alfredo De Santis

University of Salerno

Publications: 18

Sencun Zhu

Sencun Zhu

Pennsylvania State University

Publications: 18

Evangelos Kranakis

Evangelos Kranakis

Carleton University

Publications: 17

Ashok Kumar Das

Ashok Kumar Das

International Institute of Information Technology, Hyderabad

Publications: 17

Yvo Desmedt

Yvo Desmedt

The University of Texas at Dallas

Publications: 17

Reihaneh Safavi-Naini

Reihaneh Safavi-Naini

University of Calgary

Publications: 15

Hung-Min Sun

Hung-Min Sun

National Tsing Hua University

Publications: 15

Dariusz R. Kowalski

Dariusz R. Kowalski

Augusta University

Publications: 14

Dharma P. Agrawal

Dharma P. Agrawal

University of Cincinnati

Publications: 14

Something went wrong. Please try again later.