Cited in
(23)- 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
- Texture description through histograms of equivalent patterns
- RRtools
- hfloat
- libstdc++
- AdjacentSwaps
- Algorithm 360
- libeikonal
- libolim
- infCS
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
- Gray codes for Fibonacci \(q\)-decreasing words
- A numeral system for the middle-levels graphs
- 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
This page was built for software: FXT
