Skip to main content
  • Book
  • © 2011

Matters Computational

Ideas, Algorithms, Source Code

Authors:

  • Complete solutions with source code, examples, and illustrations Material that is rarely covered elsewhere or completely new Software is supplied online, including the examples

Buy it now

Buying options

eBook USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 279.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (42 chapters)

  1. Front Matter

    Pages i-xiv
  2. Low level algorithms

    1. Front Matter

      Pages 1-1
    2. Bit wizardry

      • Jörg Arndt
      Pages 2-101
    3. Permutations and their operations

      • Jörg Arndt
      Pages 102-133
    4. Sorting and searching

      • Jörg Arndt
      Pages 134-152
    5. Data structures

      • Jörg Arndt
      Pages 153-170
  3. Combinatorial generation

    1. Front Matter

      Pages 171-171
  4. Combinational generation

    1. Conventions and considerations

      • Jörg Arndt
      Pages 172-175
    2. Combinations

      • Jörg Arndt
      Pages 176-193
    3. Compositions

      • Jörg Arndt
      Pages 194-201
    4. Subsets

      • Jörg Arndt
      Pages 202-216
    5. Mixed radix numbers

      • Jörg Arndt
      Pages 217-231
    6. Permutations

      • Jörg Arndt
      Pages 232-276
    7. Permutations with special properties

      • Jörg Arndt
      Pages 277-290
    8. k-permutations

      • Jörg Arndt
      Pages 291-294
    9. Multisets

      • Jörg Arndt
      Pages 295-303
    10. Gray codes for strings with restrictions

      • Jörg Arndt
      Pages 304-322
    11. Parentheses strings

      • Jörg Arndt
      Pages 323-338
    12. Integer partitions

      • Jörg Arndt
      Pages 339-353
    13. Set partitions

      • Jörg Arndt
      Pages 354-369

About this book

This book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations is examined. The focus is on material that does not usually appear in textbooks on algorithms. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms such as the Linux and BSD operating systems.

Reviews

From the reviews:

“The book is a comprehensive compilation of well written software codes as well as short explanation texts for basic methods of computation. It fills a gap in the literature since most books in this area describe either the methods or the codes provided in specialized libraries.” (Dana Petcu, Zentralblatt MATH, Vol. 1210, 2011)

“It is thorough, and covers many algorithms that one does not often see in algorithmic texts. … This may be an invaluable reference to some people, since it does provide excellent coverage of algorithms that are not frequently compiled into a single volume. … In short, this is a wonderful compilation of many algorithms that don’t show up in other places, with reasonable … commentary and an abundance of code. … this is the kind of book libraries will put on their shelves … .” (Jeffrey Putnam, ACM Computing Reviews, July, 2011)

Authors and Affiliations

  • Nürnberg, Germany

    Jörg Arndt

About the author

Jörg Arndt: born 1964 in Berlin, Germany. Study of theoretical physics at the University of Bayreuth, and the Technical University of Berlin, Diploma in 1995. PhD in Mathematics, supervised by Richard Brent, at the Australian National University, Canberra, in 2010.

Bibliographic Information

  • Book Title: Matters Computational

  • Book Subtitle: Ideas, Algorithms, Source Code

  • Authors: Jörg Arndt

  • DOI: https://doi.org/10.1007/978-3-642-14764-7

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2011

  • Hardcover ISBN: 978-3-642-14763-0Published: 20 October 2010

  • Softcover ISBN: 978-3-662-50662-2Published: 23 August 2016

  • eBook ISBN: 978-3-642-14764-7Published: 01 October 2010

  • Edition Number: 1

  • Number of Pages: XIV, 966

  • Topics: Algorithm Analysis and Problem Complexity

Buy it now

Buying options

eBook USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 279.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access