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 > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > General (F.2.0)  
  1-10 of 72 Reviews about "General (F.2.0)": Date Reviewed
  Once upon an algorithm: how stories explain computing
Erwig M., The MIT Press, Cambridge, MA, 2017. 336 pp.  Type: Book (978-0-262036-63-4)

Martin Erwig emphasizes the general nature of computation and the use of computer science (CS) in this book. He uses well-known stories to explain computing concepts to readers not familiar with the field....

Sep 21 2018
  Practical analysis of algorithms
Vrajitoru D., Knight W., Springer Publishing Company, Incorporated, New York, NY, 2014. 466 pp.  Type: Book (978-3-319098-87-6)

This textbook is a practical approach to the analysis of algorithms from a programmer’s perspective. The algorithms are presented in C/++ based code. The book overall is well written. The authors gear the discussion to the un...

Mar 11 2015
  The power of algorithms: inspiration and examples in everyday life
Ausiello G., Petreschi R., Springer Publishing Company, Incorporated, Berlin, Germany, 2013. 245 pp.  Type: Book (978-3-642396-51-9)

This is not your grandparents’ algorithm book. Sorting is not covered and big O is banned. Instead, the authors focus on topics like cryptography, DNA, web searches, TV networks, the life sciences, the P versus NP problem, au...

Apr 24 2014
  An almost optimal unrestricted fast Johnson-Lindenstrauss transform
Ailon N., Liberty E. ACM Transactions on Algorithms 9(3): 1-12, 2013.  Type: Article

This paper deals with the randomized construction of efficiently computable Johnson-Lindenstrauss transforms. The paper greatly improves previous results in the literature by establishing an almost optimal result in terms of the dimens...

Oct 15 2013
  More reputable recommenders give more accurate recommendations?
Yuan W., Guan D., Han Y., Lee S., Lee Y.  ICUIMC 2013 (Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, Kota Kinabalu, Malaysia, Jan 17-19, 2013) 1-8, 2013.  Type: Proceedings

Predictive analytics has hit the mainstream, thanks to the emergence of many day-to-day consumer applications such as Pandora, Netflix, Yelp, and Epinions, all of which contain some variation of a recommendation engine. These engines (...

May 6 2013
  On the termination of integer loops
Ben-Amram A., Genaim S., Masud A. ACM Transactions on Programming Languages and Systems 34(4): 1-24, 2012.  Type: Article

“Does a given program halt?” is perhaps the simplest question that one could ask of programs. It has fascinated computer scientists and has been at the root of a number of deep results ever since the earliest undeci...

Mar 7 2013
  Manipulation under voting rule uncertainty
Elkind E., Erdélyi G.  AAMAS 2012 (Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, Valencia, Spain, Jun 4-8, 2012) 627-634, 2012.  Type: Proceedings

There is a long line of research studying the computational complexity of manipulating elections. This line dates back to seminal papers of Bartholdi, Orlin, Tovey, and Trick from two decades ago. The paper reviewed here adds an intere...

Jan 10 2013
  Algorithmics: the spirit of computing (3rd ed.)
Harel D., Feldman Y., Springer Publishing Company, Incorporated, New York, NY, 2012. 590 pp.  Type: Book (978-3-642272-65-3)

This book should be on any short list for a central course in computer science. It is designed to provide a uniform background on which all students might draw. It has a good-humored, easy style, which would make any reader unwilling t...

Aug 16 2012
  Computability and complexity theory (2nd ed.)
Homer S., Selman A., Springer Publishing Company, Incorporated, New York, NY, 2011. 314 pp.  Type: Book (978-1-461406-81-5)

Every computer scientist should know the basic tenets of computability theory and computational complexity theory--this is why introductory courses on these two fields are quite standard. Consequently, there are several textbo...

Apr 27 2012
  Concise guide to computation theory
Maruoka A., Springer Publishing Company, Incorporated, New York, NY, 2011. 298 pp.  Type: Book (978-0-857295-34-7)

Computational theory (also known as computability theory) is a fundamental logical approach to understanding the capabilities of computation by machines. As technology advances at ever-increasing speeds, students not versed in the theo...

Mar 26 2012
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