Waiting patterns for a printer

Authors:
D. Merlini;R. Sprugnoli;M. C. Verri
Affiliations:
Dipartimento di Sistemi e Informatica, Universita di Firenze, via Lombroso 6/17, 50134 Firenze, Italy;Dipartimento di Sistemi e Informatica, Universita di Firenze, via Lombroso 6/17, 50134 Firenze, Italy;Dipartimento di Sistemi e Informatica, Universita di Firenze, via Lombroso 6/17, 50134 Firenze, Italy
Venue:
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Year:
2004

Citing 6
Cited 3

Riordan arrays and combinatorial sums

Discrete Mathematics
Generating trees and the Catalan and Schro¨der numbers

Discrete Mathematics
Generating trees and forbidden subsequences

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Generating trees and proper Riordan arrays

Discrete Mathematics
Operating System Concepts

Operating System Concepts
Generating functions for generating trees

Discrete Mathematics

Proper generating trees and their internal path length

Discrete Applied Mathematics
Ultrametrics, Banach's fixed point theorem and the Riordan group

Discrete Applied Mathematics
Note: Combined data structure for previous- and next-smaller-values

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a model based on some combinatorial objects, which we call l-histograms, to study the behaviour of devices like printers and use the combinatorial properties of these objects to study some important distributions such as the waiting time for a job and the length of the device queue. This study is based on an important relation between 1-histograms, generating trees and binary trees.