Waiting patterns for a printer

Discrete Applied Mathematics

Volumn 144, Issue 3, 2004, Pages 359-373

  Merlini, D ^a   Sprugnoli, R ^a   Verri, M C ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

1 histograms; Binary trees; FCFS; Generating functions; Generating trees

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BUFFER CIRCUITS; COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS);

1-HISTOGRAM; BINARY TREES; GENERATING FUNCTIONS; GENERATING TREES;

COMBINATORIAL CIRCUITS;

EID: 9644296129     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.11.012     Document Type: Conference Paper

References (15)

1. C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, D. Gouyou-Beauchamps, Generating functions of generating trees, Discrete Math. 246 (2002) 29-55.
2. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Eco: a methodology for the enumeration of combinatorial objects, J. Difference Equations Appl. 5 (1999) 435-490.
3. G.C. Buttazzo, Sistcmi in Tempo Reale, Pitagora Editrice, Bologna, 1995.
4. F.R.K. Chung, R.L. Graham, V.E. Hoggat, M. Kleiman, The number of Baxter permutations, J. Combin. Theory Ser. A 24 (1978) 382-394.
5. M.P. Delest, S. Dulucq, Enumeration of directed column-convex animals with given perimeters and area, Croat. Chem. Acta 66 (1993) 59-80.
6. P. Flajolet, J. Francon, J. Vuillemin, Towards analysing sequences of operations for dynamic data structures, in: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, IEEE, 1979, pp. 183-195.
7. J. Francon, O. Viennot, J. Vuillemin, Description and analysis of an efficient priority queue representation, in: 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, IEEE, 1978, pp. 1-7.
8. D. Merlini, A generating tree approach to schedule printing devices, The Sixth Seminar on the Analysis of Algorithms, Krynica Morska, Danzica, July 2000.
9. D. Merlini, D.G. Rogers, R. Sprugnoli, M.C. Verri, On some alternative characterizations of Riordan arrays, Canad. J. Math. 49 (2) (1997) 301-320.
10. D. Merlini, M.C. Verri, Generating trees and proper Riordan arrays, Discrete Math. 218 (2000) 167-183.
11. A. Silberschat, P. Calvin, Operating System Concepts, 5th Edition, Addison Wesley, Reading, MA, 1998.
12. R. Sprugnoli, Riordan arrays and combinatorial sums, Discrete Math. 132 (1994) 267-290.
13. J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1995) 247-262.
14. J. West, Generating trees and forbidden subsequences, Discrete Math. 157 (1996) 363-374.
15. R.W. Wolff, Stochastic Modeling and the Theory of Queues, Prentice-Hall, Englewood Cliffs, NJ, 1989.