Home   |   Chapter   |   News    |    Personalities   |    Service   |    e-Journal   |    History   |    Bibliography  Rus / Eng   |    Contacts   |    Forum    |    Links

 

 

Vyacheslav Abramov

Ph. Doctor

 

Short biography

Vyacheslav M. Abramov graduated from Tadzhik State University (Dushanbe, Tadzhikistan) in 1977.

During the period 1977-1992 he worked at the Research Institute of Economics under the Tadzhikistan State Planning Committee (GosPlan). In 1992 he repatriated to Israel and during 1994-2001 worked in software companies of Israel as a software engineer and algorithms developer.

In 2002-2005 he was an assistant and lecturer in Judea and Samaria College, Tel Aviv University and Holon Institute of Technology.

In 2004 he received a PhD degree from Tel Aviv University, and since 2005 has been working at the School of Mathematical Sciences of Monash University (Australia).

The scientific interests of him are mainly focused on the theory and application of queueing systems.

He is an author of a monograph and various papers published in leading scientific journals on operations research and applied probability.

Major Publications:

(The papers are listed in chronological order)

1. Abramov, V.M. (1994). Asymptotic distribution of the maximum number of infectives in epidemic models with immigration. Journal of Applied Probability, 31: 606-613.

2. Abramov, V.M. (1997). On a property of a refusals stream. Journal of Applied Probability, 34: 800-805.

3. Abramov, V.M. (2000). A large closed queueing network with autonomous service and bottleneck. Queueing Systems, 35: 23-54.

4. Abramov, V.M. (2001). Some results for large closed queueing networks with and without bottleneck: Up- and down-crossings approach. /Queueing Systems/, 38: 149-184.

5. Abramov, V.M. (2001). Inequalities in the GI/M/1/n loss system. Journal of Applied Probability, 38: 232-234.

6. Abramov, V.M. (2001). On losses in MX/GI/1/n queues. Journal of Applied Probability, 38: 1079-1080.

7. Abramov, V.M. (2002). Asymptotic analysis of the GI/M/1/n queueing system as n increases to infinity. Annals of Operations Research, 112: 35-41.

8. Abramov, V.M. (2004). Asymptotic behavior of the number of lost messages. SIAM Journal on Applied Mathematics, 64: 746-761.

9. Abramov, V.M. (2004). A large closed queueing network containing two types of node and multiple customer classes: One bottleneck station. Queueing Systems, 48: 45-73.

10. Abramov, V.M. (2006). Analysis of multiserver retrial queueing system: A martingale approach and algorithm of solution. Annals of Operations Research, 141: 19-50.

Address:

 

School of Mathematical Sciences, Monash University,

Building 28M, Clayton campus, Clayton, VIC 3800, Australia

 

Phone:   +61 3 9905 4474

Fax:        +61 3 9905 4403

 

e-mail:  vyacheslav.abramov@sci.monash.edu.au