Pages that link to "Item:Q972819"
From MaRDI portal
The following pages link to Lattice path counting and the theory of queues (Q972819):
Displaying 5 items.
- Waiting times in classical priority queues via elementary lattice path counting (Q1691914) (← links)
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns (Q1736650) (← links)
- A base-stock inventory model with service differentiation and response time guarantees (Q1749497) (← links)
- On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue (Q2176360) (← links)
- A combinatorial study of two-periodic random walks (Q2803408) (← links)
