The following pages link to (Q4349924):
Displaying 50 items.
- Development of a Stokes flow solver robust to large viscosity jumps using a Schur complement approach with mixed precision arithmetic (Q422516) (← links)
- Keyed hash function based on a chaotic map (Q425540) (← links)
- Average best \(m\)-term approximation (Q443892) (← links)
- High-precision computation: mathematical physics and dynamics (Q449457) (← links)
- Chains-into-bins processes (Q450541) (← links)
- Sum-based weighted belief base merging: from commensurable to incommensurable framework (Q465608) (← links)
- Computing the throughput of probabilistic and replicated streaming applications (Q472492) (← links)
- Quantifier elimination for a class of exponential polynomial formulas (Q480651) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Practical algorithms for generating a random ordering of the elements of a weighted set (Q489756) (← links)
- Applications of an expressive statistical model checking approach to the analysis of genetic circuits (Q498908) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- The \(p\lambda n\) fractal decomposition: nontrivial partitions of conserved physical quantities (Q509200) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems (Q521243) (← links)
- Bitonic sorters of minimal depth (Q533870) (← links)
- Isomorphism check in fractional factorial designs via letter interaction pattern matrix (Q546082) (← links)
- Consistency of Markov chain quasi-Monte Carlo on continuous state spaces (Q548531) (← links)
- The expected profile of digital search trees (Q549244) (← links)
- Relations between adjacency trees (Q554222) (← links)
- Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
- Minimal redundant digit expansions in the Gaussian integers (Q558126) (← links)
- Distribution results for low-weight binary representations for pairs of integers (Q596061) (← links)
- Eulerian quasisymmetric functions (Q607335) (← links)
- Fractal tiles associated with shift radix systems (Q610668) (← links)
- Accurate evaluation of a polynomial and its derivative in Bernstein form (Q611362) (← links)
- Automorphism groups of finite groupoids. (Q616129) (← links)
- Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour (Q626943) (← links)
- The strongest model of computation obeying 0-1 Principles (Q633766) (← links)
- Decoding permutation arrays with ternary vectors (Q634128) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- On the expected longest length probe sequence for hashing with separate chaining (Q635746) (← links)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566) (← links)
- The enumeration of prudent polygons by area and its unusual asymptotics (Q640842) (← links)
- Recursive merge sort with erroneous comparisons (Q642963) (← links)
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form (Q643356) (← links)
- A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
- Accurate, validated and fast evaluation of elementary symmetric functions and its application (Q668592) (← links)
- Authenticated key agreement in dynamic peer groups (Q703558) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- On chaotic and random sequences (Q707193) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- Preserving positivity in solutions of discretised stochastic differential equations (Q711313) (← links)
- Asymptotic distribution of two-protected nodes in random binary search trees (Q714563) (← links)
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic (Q714626) (← links)
- Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models (Q729550) (← links)
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
- Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
