Show simple item record

dc.contributor.authorHawkin, Simonen_US
dc.contributor.authorAgrawala, Ashoken_US
dc.date.accessioned2004-05-31T22:54:14Z
dc.date.available2004-05-31T22:54:14Z
dc.date.created1998-11en_US
dc.date.issued1998-11-12en_US
dc.identifier.urihttp://hdl.handle.net/1903/978
dc.description.abstractWe study permutations of the job order performed by various LIFO service disciplines. The sets of such permutations are shown to be equivalent to sets of string permutations with simple characteristics. In particular, it is easy to test whether a given permutation belongs to these sets. Several algorithms that efficiently perform such tests are presented. (Also cross-referenced as UMIACS-TR-98-65)en_US
dc.format.extent197525 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3953en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-98-65en_US
dc.titleA Study of Permutations Permissible by LIFO Service Disciplinesen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record