Stochastic service systems, random interval graphs and search algorithms

DOI10.1002/rsa.20485zbMath1303.90027arXiv1107.4113OpenAlexW2032616797MaRDI QIDQ2930056

Nicholas J. Pippenger, Patrick Eschenfeldt, Ben Gross

Publication date: 17 November 2014

Published in: Random Structures & Algorithms, Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.4113

zbMATH Keywords

M/M/1stochastic service systems

Mathematics Subject Classification ID

Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Queues and service in operations research (90B22) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• An evolution of interval graphs
• Random interval graphs
• A new proof of the Voronoï summation formula
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A Proof for the Queuing Formula: L = λW
• The Random Walk Between a Reflecting and an Absorbing Barrier
• Random interval graphs
• On the connectivity of a random interval graph
• On a property of the variance of the waiting time of a queue

This page was built for publication: Stochastic service systems, random interval graphs and search algorithms