Modern Computer Arithmetic
by Richard P. Brent, Paul Zimmermann
Publisher: LORIA 2009
Number of pages: 239
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics, researchers in discrete mathematics, computer algebra, number theory, cryptography, and developers of multiple-precision libraries.
Home page url
Download or read it online for free here:
by Jianer Chen
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.
by Herbert Edelsbrunner - Duke University
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
by Solomon I. Khmelnik - MiC
This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.
by John Morris
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.