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 > Mathematics Of Computing (G) > Numerical Analysis (G.1) > General (G.1.0)  
 
Options:
 
  1-10 of 222 Reviews about "General (G.1.0)": Date Reviewed
  Automata theory: an algorithmic approach
Esparza J., Blondin M., MIT Press, Cambridge, MA, 2023. 560 pp.  Type: Book (0262048639)

Novices to automata theory may want to start with Dines Bjørner’s narrative on principles and techniques, found in the automata theory chapter of his enjoyable three-volume set [1], which covers intuition, motivation, and pragmatics. Bjørner...

Feb 27 2024
   Applied linear analysis for chemical engineers: a multi-scale approach with Mathematica
Balakotaiah V., Ratnakar R., DE GRUYTER, Berlin, Germany, 2022. 590 pp.  Type: Book (3110739690)

This 750-plus-page book on applied linear analysis is the culmination of the authors’ more than three decades of experience teaching graduate students in chemical engineering, as well as a continuation of their own mentors’ legacy. It ...

May 2 2023
  Numbers and computers (2nd ed.)
Kneusel R., Springer Publishing Company, Incorporated, New York, NY, 2017. 346 pp.  Type: Book (978-3-319505-07-7)

Numbers, wonderful mathematical idealizations that they are, have fascinated humans for as long as there have been humans. Computers, much more recent creations, are fascinating in their own way. For many, both are useful but intractab...

May 24 2018
  Reprint of "A parallel connectivity algorithm for de Bruijn graphs in metagenomic applications"
Flick P., Jain C., Pan T., Aluru S. Parallel Computing 70 54-65, 2017.  Type: Article

Ed. note: This paper is a reprint, included in a special issue of Parallel Computing. It was identified by the ACM Artifact Review and Badging Initiative, and received the “Results Replicated” badge. The other papers in this ...

Apr 13 2018
  A linear algorithm for a perfect matching in polyomino graphs
Lin Y., Zhang F. Theoretical Computer Science 67582-88, 2017.  Type: Article

Perfect matching in a graph is a set of edges where any pair does not share a common vertex and every vertex of the graph is the endpoint of an edge from that set. From the paper’s introduction: “A polyomino graph i...

Aug 10 2017
  Numerical methods and modelling for engineering
Khoury R., Harder D., Springer International Publishing, New York, NY, 2016. 332 pp.  Type: Book (978-3-319211-75-6)

I always appreciated numerical methods courses, possibly because I found the field a simpler and more versatile alternative to learning the analytic solutions across many application domains. Although this book is intended as a textboo...

Feb 23 2017
  Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
Eraşcu M., Hong H. Journal of Symbolic Computation 75(C): 110-126, 2016.  Type: Article

If we know that lies in [L,U], can we produce a better bounding interval? The obvious answer is the Secant-Newton map, replacing [L
Jul 25 2016
  The concept of stability in numerical mathematics
Hackbusch W., Springer Publishing Company, Incorporated, New York, NY, 2014. 188 pp.  Type: Book (978-3-642393-85-3)

Common wisdom demands that unstable algorithms be avoided when numerically solving problems given in a mathematical formulation. But what does “(un)stable” actually mean? The usual answer to this question is that st...

Oct 1 2015
   Nature-inspired optimization algorithms
Yang X., ELSEVIER, Waltham, MA, 2014. 300 pp.  Type: Book (978-0-124167-43-8)

Solving optimization problems has been the bane of scientific and combinatorial computing. Even though polynomial-time algorithms exist for some problems such as linear programming, matching, and network flow, most problems are intract...

Jan 13 2015
   A unified method for finding impossible differentials of block cipher structures
Luo Y., Lai X., Wu Z., Gong G. Information Sciences 263211-220, 2014.  Type: Article

Impossible differential analysis is widely used as a cryptographic tool for key recovering or distinguishing attacks on block ciphers. There are mainly two methods for searching impossible differentials: one is case-by-case analysis an...

Nov 6 2014
 
 
 
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