Show simple item record

dc.contributor.authorHood, Robert T.en_US
dc.contributor.authorMelville, Robert C.en_US
dc.date.accessioned2007-04-23T16:40:02Z
dc.date.available2007-04-23T16:40:02Z
dc.date.issued1980-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-433en_US
dc.identifier.urihttps://hdl.handle.net/1813/6273
dc.description.abstractSeveral methods of implementing a queue in Pure LISP are presented. A technique to distribute the reversal of a list over a number of operations leads to a real-time queue implementation.en_US
dc.format.extent439623 bytes
dc.format.extent167835 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleReal Time Queue Operations in Pure LISPen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics