Matters computational. Ideas, algorithms, source code.

DOI10.1007/978-3-642-14764-7zbMATH Open1210.68128OpenAlexW4245107430MaRDI QIDQ4930173FDOQ4930173

Authors: Jörg Arndt 

Publication date: 28 September 2010

Full work available at URL: https://doi.org/10.1007/978-3-642-14764-7

Recommendations

• Algorithmic Mathematics
• scientific article; zbMATH DE number 779272
• Computational thinking. First algorithms, then code
• scientific article; zbMATH DE number 568894
• Algorithms from THE BOOK

zbMATH Keywords

algorithmscomputational methodscode libraries

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) General topics in the theory of algorithms (68W01)

Cited In (24)

• Inside your calculator. From simple programs to significant insights.
• Ordered line integral methods for solving the eikonal equation
• Flip-swap languages in binary reflected Gray code order
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• Binary Kloosterman sums with value 4
• Self-replication and Borwein-like algorithms
• Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms
• A Pascal-like bound for the number of necklaces with fixed density
• Efficient linear-time ranking and unranking of derangements
• Texture description through histograms of equivalent patterns
• Totally non-negativity of a family of change-of-basis matrices
• Towards using the history in online computation with advice
• Fast three-valued abstract bit-vector arithmetic
• FXT
• hfloat
• Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
• A numeral system for the middle-levels graphs
• A new form of the Machin-like formula for \(\pi\) by iteration with increasing integers
• Title not available (Why is that?)
• Finite size corrections relating to distributions of the length of longest increasing subsequences
• A unified strategy to compute some special functions of number-theoretic interest
• Sorting on graphs by adjacent swaps using permutation groups
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r

Uses Software

• RRtools
• BRENT

This page was built for publication: Matters computational. Ideas, algorithms, source code.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930173)