EN FR
EN FR


Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 2L. Addario-Berry, N. Broutin, C. Goldschmidt.

    The continuum limit of critical random graphs, in: Probability Theory and Related Fields, 2012, vol. 152, p. 367–406.

    http://dx.doi.org/10.1007/s00440-010-0325-4
  • 3N. Broutin, L. Devroye, N. Fraiman, G. Lugosi.

    Connectivity threshold of Bluetooth graphs, in: Random Structures and Algorithms, 2012, (21 pages) to appear.
  • 4N. Broutin, O. Fawzi.

    Longest distance in random circuits, in: Combinatorics, Probability & Computing, 2012, vol. 21, p. 856–881.
  • 5N. Broutin, P. Flajolet.

    The distribution of the height and diameter in random non-plane binary trees, in: Random Structures & Algorithms, 2012, vol. 41, p. 215–252.
  • 6N. Broutin, C. Holmgren.

    The total path length of split trees, in: The Annals of Applied Probability, 2012, vol. 22, 1745—1777 p.
  • 7N. Broutin, J.-F. Marckert.

    Asymptotic of trees with a prescribed degree sequence and applications, in: Random Structures and Algorithms, 2012, (26 pages) to appear.
  • 8N. Broutin, R. Neininger, H. Sulzbach.

    A limit process for partial match queries in random quadtrees and 2-d trees, in: The Annals of Applied Probability, 2012, (30 pages) to appear.
  • 9E. Coffman, P. Robert, F. Simatos, S. Tarumi, G. Zussman.

    A performance analysis of channel fragmentation in dynamic spectrum access systems, in: Queueing Systems, Theory and Applications, 2012, vol. 71, no 3, p. 293–320.

    http://www.springerlink.com/content/gv07032073277n06/fulltext.pdf
  • 10M. Feuillet.

    On the flow-level stability of data networks without congestion control: the case of linear networks and upstream trees, in: Queueing Systems, February 2012, vol. 70, no 2, p. 105-143. [ DOI : 10.1007/s11134-011-9265-7 ]

    http://hal.inria.fr/hal-00660115
  • 11M. Feuillet, P. Robert.

    On the Transient Behavior of Ehrenfest and Engset Processes, in: Advances in Applied Probability, 2012, vol. 44, no 2, p. 792–826.

    http://arxiv.org/abs/1108.6228
  • 12V. Fromion, E. Leoncini, P. Robert.

    Stochastic Gene Expression in Cells: A Point Process Approach, in: SIAM Journal on Applied Mathematics, June 2012, To Appear.

    http://arxiv.org/abs/1206.0362
  • 13N. Litvak, P. Robert.

    A Scaling analysis of a Cat and Mouse Markov chain, in: Annals of Applied Probability, 2012, vol. 22, no 2, p. 792–826.

    http://arxiv.org/abs/0905.2259

International Conferences with Proceedings

  • 14N. Broutin, R. Neininger, H. Sulzbach.

    Partial match queries in random quadtrees, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), Y. Rabani (editor), 2012, p. 1056–1065.
  • 15Y. Chabchoub, C. Fricker, P. Robert.

    Improving the detection of On-line Vertical Port Scan in IP Traffic, in: IEEE 7th International Conference on Risks and Security of Internet and Systems, Cork, Ireland, IEEE Communications Society, October 2012.
  • 16D. Cuda, R.-M. Indre, E. Le Rouzic, J. Roberts.

    Dynamic bandwidth allocation for all-optical wide-area networks, in: AlgoTel 2012 : 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, La Grande Motte, France, April 2012, p. 1-4.

    http://hal.inria.fr/hal-00690596
  • 17C. Fricker, N. Gast, H. Mohamed.

    Mean field analysis for inhomogeneous large bike-sharing systems, in: Proceedings of the DMTCS Conference, 2012, p. 365-376.
  • 18C. Fricker, P. Robert, J. Roberts.

    A versatile and accurate approximation for cache performance, in: 24th International Teletraffic Congress, Kraków, IEEE Communications Society, September 2012.

    http://arxiv.org/abs/1202.3974
  • 19C. Fricker, P. Robert, J. Roberts, N. Sbihi.

    Impact of traffic mix on caching performance in a content-centric network, in: IEEE NOMEN, Workshop on Emerging Design Choices in Name-Oriented Networking, Orlando, USA, March 2012.

    http://arxiv.org/abs/1202.0108
  • 20S. Oueslati, J. Roberts, N. Sbihi.

    Flow-Aware traffic control for a content-centric network, in: Proc of IEEE Infocom 2012, 2012.

Other Publications

  • 21L. Addario-Berry, N. Broutin, C. Goldschmidt, G. Miermont.

    The scaling limit of the minimum spanning tree of a complete graph, 2012, Submitted (55 pages).
  • 22N. Broutin, O. Devillers, R. Hemsley.

    A cone can help you find your way in a Poisson Delaunay triangulation, 2012, Submitted.
  • 23N. Broutin, H. Sulzbach.

    The dual tree of a recursive triangulation of the disk, 2012, arXiv:1211.1343 [math.PR].
  • 24D. Cuda, R.-M. Indre, E. Le Rouzic, J. Roberts.

    Getting routers out of the core: Building an optical wide area network with “multipaths”, 2012.

    http://arxiv.org/abs/1110.1245
  • 25M. Feuillet, P. Robert.

    A Scaling Analysis of a Transient Stochastic Network, 2012, Preprint.
  • 26C. Fricker, N. Gast.

    Incentives and regulations in bike-sharing systems with stations of finite capacity, January 05 2012.

    http://arxiv.org/abs/1201.1178
  • 27I. Ignatiouk-Robert, D. Tibi.

    Explicit Lyapunov functions and estimates of the essential spectral radius for Jackson networks, 2012, Preprint.

    http://arxiv.org/abs/1206.3066
  • 28P. Robert, A. Veber.

    On the Fluid Limits of a Resource Sharing Algorithm with Logarithmic Weights, November 2012.

    http://arxiv.org/abs/1211.5968