scispace - formally typeset
K

Konstantin Avrachenkov

Researcher at French Institute for Research in Computer Science and Automation

Publications -  330
Citations -  7260

Konstantin Avrachenkov is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: Random walk & Graph (abstract data type). The author has an hindex of 39, co-authored 322 publications receiving 6626 citations. Previous affiliations of Konstantin Avrachenkov include Laboratory for Analysis and Architecture of Systems & University of South Australia.

Papers
More filters
Journal ArticleDOI

Cooperative Game Theory Approaches for Network Partitioning

TL;DR: The paper proposes to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation, and suggests two approaches from Cooperative game theory based on the Myerson value and the hedonic games.
Journal ArticleDOI

Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient

TL;DR: This work proposes and analyzes Monte Carlo-type methods for the PageRank computation and suggests several advantages of the probabilistic Monte Carlo methods over the deterministic power iteration method.
Journal ArticleDOI

A stochastic model of TCP/IP with stationary random losses

TL;DR: It is shown that dynamic content, streaming media and other traffic that is not caught by today's Web caches is nonetheless likely to derive from similar information, and similarity detection techniques are adapted to the problem of designing a system to eliminate redundant transfers.
Journal ArticleDOI

A stochastic model of TCP/IP with stationary random losses

TL;DR: A model for TCP/IP congestion control mechanism is presented and an explicit expression for the throughput of a TCP connection is obtained and bounds on the throughput when there is a limit on the window size.
Book ChapterDOI

Cooperative Game Theory Approaches for Network Partitioning

TL;DR: The paper proposes to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation, and suggests two approaches from Cooperative game theory based on the Myerson value and the hedonic games.