Waiting patterns for a printer

DOI10.1016/j.dam.2003.11.012zbMath1076.68019OpenAlexW2077683825MaRDI QIDQ1765244

Donatella Merlini, Maria Cecilia Verri, Renzo Sprugnoli

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.012

zbMATH Keywords

Generating functionsBinary treesFCFS1-histogramsGenerating trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

An application of Riordan arrays to the transient analysis of \(M/M/1\) queues, Binary words excluding a pattern and proper Riordan arrays, Finding range minima in the middle: approximations and applications, Space-efficient data structure for next/previous larger/smaller value queries, The effective entropy of next/previous larger/smaller value queries, Ultrametrics, Banach's fixed point theorem and the Riordan group, Proper generating trees and their internal path length, Combined data structure for previous- and next-smaller-values

Cites Work

• Unnamed Item
• Unnamed Item
• The number of Baxter permutations
• Riordan arrays and combinatorial sums
• Generating functions for generating trees
• Generating trees and the Catalan and Schröder numbers
• Generating trees and forbidden subsequences
• Generating trees and proper Riordan arrays
• On Some Alternative Characterizations of Riordan Arrays
• ECO:a methodology for the enumeration of combinatorial objects