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.
