Références

Livres et monographies

1

G. Fayolle, R. Iasnogorodski, V. Malyshev, Random walks in the Quarter Plane, Springer-Verlag, Applications of Mathematics., À paraître.

2

G. Fayolle, V. Malyshev, M. Menshikov, Topics in the Constructive Theory of Countable Markov Chains, Cambridge University Press, 1995.

3

V. Malyshev, R. Minlos, Linear Operators in Infinite Particle Systems, AMS Publications, Moscou, 1995, English translation.

Thèses

4

A. Lasgouttes, Contribution à l'analyse de réseaux stochastiques et application aux systèmes de transport, Thèse de Doctorat, École Poytechnique, 30 Mars 1995.

Articles et chapitres de livre

5

S. Aspandiiarov, R. Iasnogorodski, ``General criteria for integrability of functions of passage-times for non-negative stochastic processes and their applications'', Soumis à Journal of Theoretical Probability, Rapport de recherche , Université Paris VI, Laboratoire de Probabilités.

6

S. Aspandiiarov, R. Iasnogorodski, ``Tails of passage-times and an application to stochastic processes with boundary reflection in wedges'', Stochastic Processes and their Applications,, À paraître. Cf. Rapport de recherche 251, Université Paris VI, Laboratoire de Probabilités.

7

S. Aspandiiarov, R. Iasnogorodski, M. Menshikov, ``Passage-time moments for non-negative stochastic processes and an application to reflected random walks in a quadrant'', Annals of Probability.

8

I. Asymont, G. Fayolle, M. Menshikov, ``Random walks in a quarter plane with zero drifts: Transience and recurrence'', Journal of Applied Probability 32, 4, 1995.

9

G. Fayolle, J. Lasgouttes, ``A State-dependent polling model with Markovian routing'', The IMA Volumes in Mathematics and its Applications, Stochastic Networks 71, 1995.

10

G. Fayolle, J. Lasgouttes, ``Limit laws for large product-form networks: connections with the central limit theorem'', Markov processes and related fields 1, 1996, À paraître. Cf. Rapport de Recherche INRIA , Mars 1995.

11

C. Fricker, ``On memory contention in vector-multiprocessors'', IEEE Transactions on Computers 44, 1, Janvier 1995.

12

A. Gajrat, V. Malyshev, M. Menshikov, K. Pelih, ``Classification of Markov chains describing the evolution of random strings'', Uspekhi Math. Nauk 50, 2, 1995.

13

A. Gajrat, V. Malyshev, A. Zamyatin, ``Two-sided evolution of random strings'', Markov processes and related fields 1, 2, 1995.

14

F. Karpelevich, V. Malyshev, S. Rybko, ``Stochastic evolution of neural networks'', Markov Processes and Related Fields 1, 2, 1995.

15

V. Malyshev, F. Spieksma, ``Intrinsic convergence rates of countable Markov Chains'', Markov Processes and related fields 1, 2, 1995.

16

A. Manita, V. Malyshev, ``Macro-convergence in large finite Markov Chains'', Theoretical and Applied Mathematics, 1995, in russian.

Communications à des congrès, colloques, etc.

17

C. Allal, F. Dumontet, M. Parent, ``Design tools for public car transportation'', in: Fourth Int. Conf. on Applications of Advanced Technologies in Transportation Engineering, Capri, 1995.

Rapports de recherche et publications internes

18

L. Afanassieva, F. Delcoigne, G. Fayolle, ``Polling systems where servers wait for customers'', rapport de recherche, INRIA, À paraître.

19

L. Afanassieva, G. Fayolle, L. Nazarov, ``Preliminary models for moving server networks'', Rapport de recherche n°2469, INRIA, Janvier 1995.

20

S. Aspandiiarov, R. Iasnogorodski, ``General results on stationary measures of recurrent countable Markov chains and their applications'', Rapport de recherche n°278, Université Paris VI, Laboratoire de Probabilités, 1995, soumis à Bernouilli.

21

C. Fricker, R. Jaïbi, ``Stability of multi-server-polling models with Markovian routing'', Rapport de recherche, INRIA, À paraître.