"An efficient stable recursion to compute multiservice blocking probabilities."

S. A. Berezner, Anthony E. Krzesinski (2001)

> Home

Details and statistics

DOI: 10.1016/S0166-5316(00)00042-0

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pe/BereznerK01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pe/BereznerK01
S. A. Berezner, Anthony E. Krzesinski:
An efficient stable recursion to compute multiservice blocking probabilities. Perform. Evaluation 43(2-3): 151-164 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.