- Home
- Best Scientists - Engineering and Technology
- Dmitri Krioukov

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Engineering and Technology
D-index
33
Citations
7,341
70
World Ranking
4243
National Ranking
1589

- Quantum mechanics
- Computer network
- Artificial intelligence

His main research concerns The Internet, Network topology, Degree distribution, Complex network and Topology. His The Internet research integrates issues from Structure, Computer network and Data mining. Dmitri Krioukov has included themes like Policy-based routing, DSRFLOW, Destination-Sequenced Distance Vector routing, Dynamic Source Routing and Distributed computing in his Network topology study.

He usually deals with Degree distribution and limits it to topics linked to Random graph and Degree and Shortest path problem. Dmitri Krioukov is interested in Evolving networks, which is a branch of Complex network. His studies in Topology integrate themes in fields like Triangle inequality and Metric space.

- Hyperbolic geometry of complex networks (588 citations)
- Systematic topology analysis and generation using degree correlations (428 citations)
- Popularity versus similarity in growing networks (386 citations)

His primary areas of study are Theoretical computer science, Complex network, The Internet, Network topology and Degree distribution. Dmitri Krioukov combines subjects such as Evolving networks, Preferential attachment and Cluster analysis with his study of Theoretical computer science. His work on Network science is typically connected to Information theory as part of general Complex network study, connecting several disciplines of science.

His The Internet research incorporates themes from Topology and Structure. His study focuses on the intersection of Network topology and fields such as Distributed computing with connections in the field of Routing table. His study explores the link between Degree distribution and topics such as Random graph that cross with problems in Degree.

- Theoretical computer science (34.88%)
- Complex network (29.46%)
- The Internet (27.13%)

- Theoretical computer science (34.88%)
- Network science (19.38%)
- Complex network (29.46%)

Dmitri Krioukov spends much of his time researching Theoretical computer science, Network science, Complex network, Principle of maximum entropy and Network model. His biological study spans a wide range of topics, including Spatial network, Metric space and Cluster analysis. His Network science study combines topics from a wide range of disciplines, such as Mathematical proof and Scale-free network.

His Complex network research is multidisciplinary, incorporating elements of Network topology, Connected component and Robustness. His work deals with themes such as Applied mathematics and Degree distribution, which intersect with Principle of maximum entropy. His Degree distribution research is multidisciplinary, incorporating perspectives in Entropy, Hyperparameter, Discrete mathematics and Random graph.

- Scale-free networks well done (64 citations)
- Vacuum Selection from Cosmology on Networks of String Geometries (38 citations)
- Stability of a giant connected component in a complex network. (26 citations)

- Quantum mechanics
- Computer network
- Artificial intelligence

Dmitri Krioukov focuses on Theoretical computer science, Spatial network, Small worlds, Cluster analysis and Homogeneous. The various areas that Dmitri Krioukov examines in his Theoretical computer science study include Routing, The Internet, Shortest path problem and Homogeneous space.

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.

Hyperbolic geometry of complex networks

Dmitri V. Krioukov;Fragkiskos Papadopoulos;Maksim Kitsak;Amin Vahdat.

Physical Review E **(2010)**

657 Citations

Systematic topology analysis and generation using degree correlations

Priya Mahadevan;Dmitri Krioukov;Kevin Fall;Amin Vahdat.

acm special interest group on data communication **(2006)**

533 Citations

Popularity versus similarity in growing networks

Fragkiskos Papadopoulos;Maksim Kitsak;M. Ángeles Serrano;Marián Boguñá.

Nature **(2012)**

527 Citations

Navigability of complex networks

Marián Boguñá;Dmitri V. Krioukov;Kimberly C. Claffy.

Nature Physics **(2009)**

459 Citations

The internet AS-level topology: three data sources and one definitive metric

Priya Mahadevan;Dmitri Krioukov;Marina Fomenkov;Xenofontas Dimitropoulos.

acm special interest group on data communication **(2006)**

454 Citations

AS relationships: inference and validation

Xenofontas Dimitropoulos;Dmitri Krioukov;Marina Fomenkov;Bradley Huffaker.

acm special interest group on data communication **(2007)**

405 Citations

Sustaining the Internet with Hyperbolic Mapping

Marián Boguñá;Fragkiskos Papadopoulos;Dmitri V. Krioukov.

Nature Communications **(2010)**

397 Citations

Orbis: rescaling degree correlations to generate annotated internet topologies

Priya Mahadevan;Calvin Hubble;Dmitri Krioukov;Bradley Huffaker.

acm special interest group on data communication **(2007)**

322 Citations

The Internet AS-Level Topology: Three Data Sources and One Definitive Metric

Priya Mahadevan;Dmitri Krioukov;Marina Fomenkov;Bradley Huffaker.

arXiv: Networking and Internet Architecture **(2005)**

314 Citations

Self-Similarity of Complex Networks and Hidden Metric Spaces

M. Ángeles Serrano;Dmitri V. Krioukov;Marián Boguñá.

Physical Review Letters **(2008)**

284 Citations

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

Contact us

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 Barcelona

University of California, San Diego

Google (United States)

Georgia Institute of Technology

Queen Mary University of London

University of Memphis

Eindhoven University of Technology

University of California, Los Angeles

University of Arizona

University of Zaragoza

Something went wrong. Please try again later.