Waiting patterns for a printer

DOI10.1016/J.DAM.2003.11.012MaRDI QIDQ1765244zbMATH OpenOpenAlexFDO

Authors Donatella Merlini, Renzo Sprugnoli, Maria Cecilia Verri

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

1-histogramsBinary treesFCFSGenerating functionsGenerating trees

Mathematics Subject Classification ID

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

Recommendations

• Waiting times in classical priority queues via elementary lattice path counting
• Waiting time distribution of generalized later patterns
• On waiting time distributions associated with compound patterns in a sequence of multi-state trials
• On waiting time distributions for patterns in a sequence of multistate trials
• On the waiting time till each of some given patterns occurs as a run

Cites work

• ECO:a methodology for the enumeration of combinatorial objects
• Generating functions for generating trees
• Generating trees and forbidden subsequences
• Generating trees and proper Riordan arrays
• Generating trees and the Catalan and Schröder numbers
• scientific article; zbMATH DE number 47258 (Why is no real title available?)
• scientific article; zbMATH DE number 1033414 (Why is no real title available?)
• On Some Alternative Characterizations of Riordan Arrays
• Riordan arrays and combinatorial sums
• The number of Baxter permutations

Cited in

(9)

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

This page was built for publication: Waiting patterns for a printer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765244)