Combinatorics, Discrete mathematics, Mathematical optimization, Distributed algorithm and Distributed computing are his primary areas of study. His Conductance, Connectivity, Vertex and Graph study in the realm of Combinatorics connects with subjects such as High probability. His biological study spans a wide range of topics, including Completeness, Class, Graph theory and Graph.
His Graph theory study deals with Upper and lower bounds intersecting with Randomized algorithm. The concepts of his Distributed algorithm study are interwoven with issues in Simple, Enhanced Data Rates for GSM Evolution and Theory of computation. His work deals with themes such as Wireless sensor network, Computer network and Constant, which intersect with Distributed computing.
Alessandro Panconesi mainly investigates Combinatorics, Discrete mathematics, Algorithm, Distributed algorithm and Theoretical computer science. Binary logarithm, Randomized algorithm, Graph theory, Time complexity and Graph are among the areas of Combinatorics where the researcher is concentrating his efforts. He combines subjects such as Completeness, Class, Approximation algorithm and Degree with his study of Discrete mathematics.
His Algorithm research includes elements of Graph and Probabilistic analysis of algorithms. His Distributed algorithm research integrates issues from Sequential algorithm, Bounded function and Vertex. His studies examine the connections between Theoretical computer science and genetics, as well as such issues in Computational complexity theory, with regards to Existential quantification.
Alessandro Panconesi mainly focuses on Algorithm, Theoretical computer science, Graph, Color-coding and Computational complexity theory. His research in Algorithm intersects with topics in Generalization and Pairwise similarity. Alessandro Panconesi has researched Theoretical computer science in several fields, including Value, Upper and lower bounds and Wireless sensor network.
His Computational complexity theory research includes themes of Open problem and Existential quantification. His Conductance course of study focuses on Distributed algorithm and The Internet. To a larger extent, Alessandro Panconesi studies Discrete mathematics with the aim of understanding Reduction.
The scientist’s investigation covers issues in Graph, Color-coding, Theoretical computer science, Algorithm and Markov chain. In his study, Alessandro Panconesi carries out multidisciplinary Graph and Motif research. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Construct, Upper and lower bounds and Hash function.
Alessandro Panconesi interconnects The Internet and Spanning tree in the investigation of issues within Algorithm. His Markov chain study frequently involves adjacent topics like Conductance. His study brings together the fields of Distributed algorithm and Conductance.
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.
Concentration of Measure for the Analysis of Randomized Algorithms
Devdatt P. Dubhashi;Alessandro Panconesi.
(2009)
Concentration of Measure for the Analysis of Randomized Algorithms
Devdatt P. Dubhashi;Alessandro Panconesi.
(2009)
On compressing social networks
Flavio Chierichetti;Ravi Kumar;Silvio Lattanzi;Michael Mitzenmacher.
knowledge discovery and data mining (2009)
On compressing social networks
Flavio Chierichetti;Ravi Kumar;Silvio Lattanzi;Michael Mitzenmacher.
knowledge discovery and data mining (2009)
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Devdatt Dubhashi;Alessandro Mei;Alessandro Panconesi;Jaikumar Radhakrishnan.
Journal of Computer and System Sciences (2005)
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Devdatt Dubhashi;Alessandro Mei;Alessandro Panconesi;Jaikumar Radhakrishnan.
Journal of Computer and System Sciences (2005)
Rumor spreading in social networks
Flavio Chierichetti;Silvio Lattanzi;Alessandro Panconesi.
Theoretical Computer Science (2011)
Rumor spreading in social networks
Flavio Chierichetti;Silvio Lattanzi;Alessandro Panconesi.
Theoretical Computer Science (2011)
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
Alessandro Panconesi;Aravind Srinivasan.
SIAM Journal on Computing (1997)
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
Alessandro Panconesi;Aravind Srinivasan.
SIAM Journal on Computing (1997)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Maryland, College Park
Dalle Molle Institute for Artificial Intelligence Research
Royal Institute of Technology
Google (United States)
Google (United States)
Centrum Wiskunde & Informatica
University of Bologna
Sapienza University of Rome
University of Leicester
Sapienza University of Rome
Polytechnique Montréal
Microsoft (United States)
Shimane University
Friedrich Miescher Institute
University of Arizona
University of Messina
École Polytechnique Fédérale de Lausanne
University of Vienna
Northeast Forestry University
Heidelberg University
MRC Laboratory of Molecular Biology
University of Pittsburgh
Brigham and Women's Hospital
VU University Medical Center
University of North Carolina at Chapel Hill
University of New South Wales