Search for Topics All Reviews
	Browse All Reviews > Data (E) > Data Structures (E.1) > Lists, Stacks, And Queues (E.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 50 Reviews about "Lists, Stacks, And Queues (E.1...)": Date Reviewed   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... 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... 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... 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... 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... Jul 13 2005   A memory-efficient doubly linked list Sinha P.  Linux Journal 2005(129): 102005. Type: Article For small devices to be cost effective, manufacturers often need to impose restrictions on memory size for the software components. Such situations often require developers to find alternative implementations of data structures. It is well known... Jul 5 2005   Making data structures confluently persistent Fiat A., Kaplan H.  Journal of Algorithms 48(1): 16-58, 2003. Type: Article This paper presents a general technique to transform any pointer-based data structure into one that is “confluently persistent,” thus answering a longstanding open problem posed by Driscoll, Sarnak, Sleator, and Tarjan [1], and... Aug 5 2004   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 symbol... Nov 26 2003   From datalog rules to efficient programs with time and space guarantees Liu Y., Stoller S.  Principles and practice of declaritive programming (Proceedings of the 5th ACM SIGPLAN international conference, Uppsala, Sweden,  Aug 27-29, 2003) 172-183, 2003. Type: Proceedings Database queries, model checking, and graph problems can be succinctly specified with relational rules, and then expressed with a rule-based language such as Datalog. This paper develops a method for automatic generation of efficient programs... Nov 17 2003       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2010 Reviews.com Terms of Use | Privacy Policy