| |
 |
|
|
Cohn, Harvey
Center for Communications Research
San Diego, California
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 38
reviews
|
|
|
|
|
|
|
|
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 |
|
|
|
|
|
|
Methods in algorithmic analysis
Dobrushkin V., Chapman & Hall/CRC, Boca Raton, FL, 2009. 824 pp. Type: Book (978-1-420068-29-0), Reviews: (1 of 2)
Dobrushkin’s book provides background material in mathematics for writers of computer algorithms. In fact, it will be helpful to any mathematics student who wishes to acquire a background in classical probability and analysis...
|
May 27 2010 |
|
|
|
|
|
|
Associative digital network theory: an associative algebra approach to logic, arithmetic and state machines
Benschop N., Springer Publishing Company, Incorporated, New York, NY, 2009. 180 pp. Type: Book (9781402098284)
As a historical fact, mathematics developed from applications--in rational mechanics and number theory--for which commutative algebra was most natural. If the basic applications were from network theory--Turi...
|
Aug 18 2009 |
|
|
|
|
|
|
Geometric folding algorithms: linkages, origami, polyhedra
Demaine E., O’Rourke J., Cambridge University Press, New York, NY, 2007. 496 pp. Type: Book (9780521857574)
Rarely can a single work serve as both a guide to a serious innovative course and as an attractive coffee-table book. This book has that distinction, and is either way irresistible to a wide range of scientists. It embraces many concep...
|
Dec 12 2008 |
|
|
|
|
|
|
Geometric spanner networks
Narasimhan G., Smid M., Cambridge University Press, New York, NY, 2007. 516 pp. Type: Book (9780521815130)
In brief, here networks are embedded in a metric (for example, Euclidean) space. A typical problem involves creating a system of roads (edges) to connect a given set of cities (vertices) in an optimal manner in terms of mileage (thus t...
|
Apr 28 2008 |
|
|
|
|
|
|
Algorithmic aspects of bioinformatics (Natural Computing Series)
Böckenhauer H., Bongartz D., Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 396 pp. Type: Book (9783540719120)
This book is a worthy leader in what will surely be a torrent of high-level texts inspired by the success of DNA containing genetic instructions. Minimal knowledge of the new genetics, obtained from popular literature, is sufficient fo...
|
Feb 13 2008 |
|
|
|
|
|
|
General theory of information transfer and combinatorics (Lecture Notes in Computer Science 4123)
Ahlswede R., Bäumer L., Cai N., Aydinian H., Blinovsky V., Deppe C., Mashurian H., Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 1125 pp. Type: Book (9783540462446)
This conference report is a tour de force of the editor, Rudolf Ahlswede, based on his activities at the Center for Interdisciplinary Research (ZIF) in Bielefeld, Germany. He is the author or coauthor of 29 out of 80 papers, spread ove...
|
Aug 13 2007 |
|
|
|
|
|
|
Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem
Hallgren S. Journal of the ACM 54(1): 1-es, 2007. Type: Article
This is a comprehensive paper on how the (as yet unbuilt) quantum computers would be applied to widely known classical problems of number theory, such as Pell’s equation and class structure of a (real quadratic) field. It...
|
May 4 2007 |
|
|
|
|
|
|
The p-sized partitioning algorithm for fast computation of factorials of numbers
Ugur A., Thompson H. The Journal of Supercomputing 38(1): 73-82, 2006. Type: Article
The authors present an algorithm for calculating n! in fewer than the (naive) n-1 multiplications. The idea is to partition the sequence {1, ... , n} into approximately ...
|
Apr 11 2007 |
|
|
|
|
|
|
Quantum computation of zeta functions of curves
Kedlaya K. Computational Complexity 15(1): 1-19, 2006. Type: Article
Quantum computation presupposes that an extremely reliable probabilistic result found “logarithmically fast” by a quantum computer is in practice preferable to an accurate (but exponential time) result. The ...
|
Nov 22 2006 |
|
|
|
|
|
| |
|
|
| |
|
|
