Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Data (E) > Data Structures (E.1) > Lists, Stacks, And Queues (E.1...)  
 
Options:
 
  1-10 of 21 Reviews about "Lists, Stacks, And Queues (E.1...)": Date Reviewed
   Stack frames: a look from inside
Di Cataldo G., Apress, New York, NY, 2016. 171 pp.  Type: Book (978-1-484221-80-8)

Those of you who have written programs in C for Linux or Berkeley Software Distribution (BSD) computers may well have wondered how your compiled programs are loaded into memory for execution, and perhaps why you might select options li...

Jun 7 2017
  Quantitative relaxation of concurrent data structures
Henzinger T., Kirsch C., Payer H., Sezgin A., Sokolova A.  POPL 2013 (Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Rome, Italy, Jan 23-25, 2013) 317-328, 2013.  Type: Proceedings

Evolving trends in hardware, especially the shift from single-core to multicore and many-core processors, have pushed current programming to the center of the discussion in many designs and implementations. Many reports published in re...

May 2 2013
  From the stack principle to ALGOL
Bauer F. In Software pioneers. New York, NY: Springer-Verlag New York, Inc., 2002.  Type: Book Chapter

The principle of using a pushdown stack is so well established in computer science that it needs no explanation in this review. What is not so well known is how that principle came to be such a fundamental part of compilers and other s...

Nov 26 2003
  Stack and Queue Integrity on Hostile Platforms
Devanbu P., Stubblebine S. IEEE Transactions on Software Engineering 28(1): 100-108, 2002.  Type: Article

The authors present a protocol for maintaining the integrity of stacks and queues processed by a potentially hostile processor (H), when resources of the trusted processor (T) are too limited to allow for processing of stacks and queu...

Oct 7 2002
  Correspondence-based data structures for double-ended priority queues
 Journal of Experimental Algorithmics 52-es, 2000.  Type: Article

The authors describe three general correspondence methods--total, dual, and leaf--that can be used to derive efficient double-ended priority queues from single-ended priority queues. The methods are shown by developin...

May 22 2002
  A new lower bound for the list update problem in the partial cost model
 Theoretical Computer Science 268(1): 3-16, 2001.  Type: Article

The optimal competitive ratio for the list update problem is between 1.5 and 1.6. For lists of up to four elements, an optimal update algorithm exists. In this paper, the authors determine the lower bound for lists of at least five ele...

May 8 2002
  On the efficiency of pairing heaps and related data structures
Fredman M. Journal of the ACM 46(4): 473-501, 1999.  Type: Article

A pairing heap is a simple, easy-to-code, general tree data structure that enjoys logn amortized cost for standard heap operations. It is described here as an alternative to Fibonacci heaps, in that it also handles a...

Apr 1 2000
  Bounded capacity priority queues
Atkinson M., Tulley D. Theoretical Computer Science 182(1-2): 145-157, 1997.  Type: Article

Using the language of set algebra (such as cosets) and automata (for example, computation for a string manipulation), the authors consider the number of allowable orderings possible for a string that is processed through a limited buff...

Jun 1 1998
  A design of a parallel dictionary using skip lists
Gabarró J., Martínez C., Messeguer X. Theoretical Computer Science 158(1-2): 1-33, 1996.  Type: Article

There are several approaches to parallel search and maintenance of dictionaries, including priority queues, 2-3 trees, and B-trees. The authors discuss skip lists as an efficient alternative. This long paper is basically a meticulous d...

Dec 1 1996
  Fully persistent lists with catenation
Driscoll J., Sleator D., Tarjan R. Journal of the ACM 41(5): 943-959, 1994.  Type: Article

This work was motivated, as the authors state in the acknowledgments, by applications to the implementation of continuations in a functional programming language. The authors study the efficient implementation of a set of procedures
Apr 1 1996
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy