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)  
 
Options:
 
  1-10 of 188 Reviews about "Data Structures (E.1)": Date Reviewed
  Handbook of data structures and applications (2nd ed.)
Mehta D., Sahni S., CRC Press, Inc., Boca Raton, FL, 2018. 1120 pp.  Type: Book (978-1-498701-85-3)

Data structures and algorithms are key elements of a computing system’s operation, determining its effectiveness and efficiency. Choosing the right ones is becoming increasingly important for two reasons. First, worldwide Int...

Apr 15 2019
   Guide to data structures: a concise introduction using Java
Streib J., Soma T., Springer International Publishing, New York, NY, 2018. 376 pp.  Type: Book (978-3-319700-83-0)

Data structures seem to be the bane of every computer science (CS) undergraduate’s education. Thus, a good data structures text aimed at undergraduates is a necessity. Even though relatively few programmers actually implement...

Jul 16 2018
  Toward optimal self-adjusting heaps
Elmasry A. ACM Transactions on Algorithms 13(4): 1-14, 2017.  Type: Article

A self-adjusting heap is a heap data structure “that does not [need to] explicitly maintain structural information”; instead, during each access or update operation, the heap is adjusted in a uniform way. Why is a s...

Mar 19 2018
  Compact data structures: a practical approach
Navarro G., Cambridge University Press, New York, NY, 2016. 570 pp.  Type: Book (978-1-107152-38-0)

Compact data structures address two aspects of the problem posed by large quantities of data: efficient storage of the data, and efficient access and processing of the data by the algorithms suitable for defined classes of problems. (T...

Oct 26 2017
  Basic concepts in data structures
Klein S., Cambridge University Press, Cambridge, UK, 2016.  Type: Book (9781316613849)

Data structures are a well-established part of the computer science (CS) curriculum. Courses and textbooks vary in emphasis. Often the introductory sequence for CS majors and others includes both programming and data structures so that...

Jun 15 2017
   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
  Edge-independent spanning trees in augmented cubes
Wang Y., Shen H., Fan J. Theoretical Computer Science 67023-32, 2017.  Type: Article

The efficient construction of edge-independent spanning trees (EISTs) is interesting in itself, but also has important applications in network communications, for example, protocol design, secure communication, and fault-tolerant commu...

Jun 6 2017
  Data structure practice: for collegiate programming contests and education
Wu Y., Wang J., CRC Press, Inc., Boca Raton, FL, 2016. 512 pp.  Type: Book (978-1-482215-39-7)

This 495-page book is devoted to working through 200 problems from the ACM International Collegiate Programming Contest. The problems are selected from competitions held between 1990 and 2015. The book has been translated from the orig...

Apr 13 2017
  Nonlinear Laplacian for digraphs and its applications to network analysis
Yoshida Y.  WSDM 2016 (Proceedings of the 9th ACM International Conference on Web Search and Data Mining, San Francisco, CA, Feb 22-25, 2016) 483-492, 2016.  Type: Proceedings

This paper relates to spectral graph theory and more specifically concerns the case of digraphs, directed graphs. It proposes an alternative framework to existing digraph approaches, such as Chung’s, or the Diplacian, relying...

Jul 28 2016
  Faster compressed suffix trees for repetitive collections
Navarro G., Ordóñez Pereira A. Journal of Experimental Algorithmics 21(1): 1-38, 2016.  Type: Article

The suffix tree is a celebrated data structure in stringology and is used in providing efficient solutions for a plethora of problems. The main problem of suffix trees is their space usage: they may even require 20 bytes per text symbo...

May 9 2016
 
 
 
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