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
  Browse All Reviews > Data (E) > Data Structures (E.1) > Lists, Stacks, And Queues (E.1...)  
  1-10 of 54 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 like position-...

Jun 7 2017
  Who’s #1?: The science of rating and ranking
Langville A., Meyer C.,  Princeton University Press, Princeton, NJ, 2012. 272 pp. Type: Book (978-0-691162-31-7)

The ranking/rating process is deeply embedded in human nature and our everyday lives. Whenever we need to make a decision that involves more than one alternative, such as buying a product, voting for a candidate, presenting a list of web pages aft...

Aug 13 2014
  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 recent years a...

May 2 2013
  Who’s #1?: The science of rating and ranking
Langville A., Meyer C.,  PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2012. 266 pp. Type: Book (978-0-691154-22-0)

As an award-winning 2007 advertising campaign by a German auto manufacturer emphasized, we love making lists. We make “best of” lists of places to visit, favorite movies, athletes, academic institutions, and great companies to work for...

Oct 25 2012
  Teaching strategies for reinforcing structural recursion with lists
Goldwasser M., Letscher D.  Object oriented programming systems and applications companion (Companion to the 22nd ACM SIGPLAN Conference on Object Oriented Programming Systems and Applications, Montreal, Quebec, Canada,  Oct 21-25, 2007) 889-896, 2007. Type: Proceedings

I read this paper with great anticipation, as I, too, attended Kim Bruce’s keynote address at the 2005 ACM SIGCSE Symposium. There was also a paper presentation on this topic [1]. I am interested in how others, such as the authors of this pa...

Mar 5 2008
  M/M/1 queueing systems with inventory
Schwarz M., Sauer C., Daduna H., Kulik R., Szekli R.  Queueing Systems: Theory and Applications 54(1): 55-78, 2006. Type: Article

Running out of inventory creates lost sales on one side, and a potential for losing customers on the other. The former is studied in inventory theory, and the latter in queueing theory. This paper combines both inventory management and customer qu...

Mar 27 2007
  Finding 3-shredders efficiently
Hegde R.  ACM Transactions on Algorithms 2(1): 14-43, 2006. Type: Article

A k-shredder in an undirected graph is a vertex cut of size k whose removal results in at least three components. The author presents a linear algorithm to find the set of 3-shredders in a 3-connected graph. The algorithm is quite in...

Jun 20 2006
  Effective bandwidth for a single server queueing system with fractional Brownian input
Kim S., Nam S., Sung D.  Performance Evaluation 61(2+3): 203-223, 2005. Type: Article

Kim, Nam, and Sung consider a single-server fluid queueing system with a service rate of C. The input follows a fractional Brownian motion....

Dec 14 2005
  Parallel controllable texture synthesis
Lefebvre S., Hoppe H.  ACM Transactions on Graphics 24(3): 777-786, 2005. Type: Article

The goal of texture synthesis is to generate large textures from a small exemplar image so the resulting texture does not contain obvious repetitions. This is a very active area of research in the graphics community, and a number of important pape...

Nov 10 2005
  Dynamic coverage in ad-hoc sensor networks
Huang H., Richa A., Segal M.  Mobile Networks and Applications 10(1-2): 9-17, 2005. Type: Article

Sensor networks have received a lot of research attention recently. A sensor can detect the environment around it. Assuming that a sensor’s detecting ability is omni-directional, we can model the coverage of a sensor as a disk centered a...

Jul 13 2005
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy