Matters computational. Ideas, algorithms, source code.

DOI10.1007/978-3-642-14764-7MaRDI QIDQ4930173zbMATH OpenOpenAlexFDO

Authors Jörg Arndt

Publication date 28 September 2010

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

zbMATH Keywords

algorithmscode librariescomputational methods

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)

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

Cited in

(27)

• Self-replication and Borwein-like algorithms
• FXT
• hfloat
• Efficient linear-time ranking and unranking of derangements
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• Fast three-valued abstract bit-vector arithmetic
• Ordered line integral methods for solving the eikonal equation
• Sorting on graphs by adjacent swaps using permutation groups
• A Pascal-like bound for the number of necklaces with fixed density
• Texture description through histograms of equivalent patterns
• Flip-swap languages in binary reflected Gray code order
• 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
• Binary Kloosterman sums with value 4
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• scientific article; zbMATH DE number 641702 (Why is no real title available?)
• Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
• scientific article; zbMATH DE number 813748 (Why is no real title available?)
• A numeral system for the middle-levels graphs
• A new form of the Machin-like formula for \(\pi\) by iteration with increasing integers
• Towards using the history in online computation with advice
• Inside your calculator. From simple programs to significant insights.
• Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms
• A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r
• Totally non-negativity of a family of change-of-basis matrices
• Asymptotic Expansions Relating to the Lengths of Longest Monotone Subsequences of Involutions
• Cryptographic applications of combinatorial ranking for integer compositions

Describes a project that uses

Uses Software

• BRENT
• RRtools

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)