Logo INRIA MAESTRO: models for performance analysis and control of network

It's me!!

Danil Nemirovsky
INRIA Sophia Antipolis - Projet MAESTRO
2004 Route des Lucioles
B.P. 93
06902 Sophia Antipolis Cedex, France

Office: L005
Email: Danil(dot)Nemirovsky(at)sophia(else dot)inria(dot again)fr
Tel: +33 (0)4 9238 7626
Fax: +33 (0)4 9238 7971

Position
Ph.D. student Curriculum Vitae
Organization
INRIA Publication list
Research unit
Sophia Antipolis
Project-Team
MAESTRO

Biography

I graduated from St.Petersburg State University with diploma with honors of specialist degree in applied mathematics and informatics in 2005. I was an instern student at MAESTRO Project several times (in September 2004, April-May 2005, January-February 2006). Currently I am PhD student of St.Petersburg State University and INRIA Sophia Antipolis.

Research activities

  • Tensors and probability theory
  • Trust and reputation measures, PageRank
  • Web and information retrieval in global collections of documents

Publications

Journals

  • Konstastin Avrachenkov, Vivek Borkar, and Danil Nemirovsky
    Quasi-Stationary Distributions as Centrality Measures for the Giant Strongly Connected Component of a Reducible Graph
    Accepted to Journal of Computational and Applied Mathematics.

Conferences and workshops

  • Konstastin Avrachenkov, Vivek Borkar, and Danil Nemirovsky
    Quasi-stationary distributions as a centrality measure of reducible graph
    XXXVIII Conference of PhD students and students Control Processes and Stability, St.Petersburg State University, April 2007. Short version, in Russian.

  • Konstastin Avrachenkov, Danil Nemirovsky, and Natalia Osipova
    Web Graph Analyzer Tool
    In Proceedings
    of the IEEE ValueTools conference, 2006.

  • Danil Nemirovsky
    Clustering and information retrieval in medical collection Medline
    XXXV Conference
    of PhD students and students Control Processes and Stability, St.Petersburg State University, April 2004. In Russian.

Reprints


This site is best viewed with Netscape 6 or later.