The following pages link to (Q4344097):
Displaying 50 items.
- Computing quadratic function fields with high 3-rank via cubic field tabulation (Q261672) (← links)
- Success runs in symmetric Bernoulli process (Q387430) (← links)
- Asymptotic properties of Fibonacci cubes and Lucas cubes (Q404538) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Random subshifts of finite type (Q414282) (← links)
- A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm (Q491961) (← links)
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Statistics on wreath products, perfect matchings, and signed words (Q557602) (← links)
- The oscillatory distribution of distances in random tries (Q558689) (← links)
- Fast sort of floating-point data for data engineering (Q617504) (← links)
- Descent polynomials for permutations with bounded drop size (Q709255) (← links)
- The sorting index (Q719341) (← links)
- Longest alternating subsequences of permutations (Q841561) (← links)
- Computing with algebraically closed fields (Q846355) (← links)
- Theoretical and empirical convergence results for additive congruential random number generators (Q847181) (← links)
- Rounding of continuous random variables and oscillatory asymptotics (Q858983) (← links)
- Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments (Q869025) (← links)
- Multiway in-place merging (Q964398) (← links)
- Approximating a real number by a rational number with a limited denominator: a geometric approach (Q967407) (← links)
- A low-complexity LUT-based squaring algorithm (Q971658) (← links)
- Solving the conjugacy problem in Garside groups by cyclic sliding. (Q972844) (← links)
- On the silhouette of binary search trees (Q983879) (← links)
- A functional limit theorem for the profile of \(b\)-ary trees (Q988760) (← links)
- An efficient parallel implementation of the MSPAI preconditioner (Q991107) (← links)
- Accurate simple zeros of polynomials in floating point arithmetic (Q1004779) (← links)
- Maximum likelihood analysis of algorithms and data structures (Q1041238) (← links)
- An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
- A fast modular semi-Lagrangian method for moving interfaces (Q1578083) (← links)
- Log-concavity of some independence polynomials via a partial ordering (Q1618216) (← links)
- Generic hardness of the Boolean satisfiability problem (Q1676251) (← links)
- Modeling of an asymptotically central Markov process on 3D Young graph (Q1701645) (← links)
- The necklace process: a generating function approach (Q1726705) (← links)
- Polynomially complete quasigroups of prime order (Q1731318) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics (Q1755656) (← links)
- Signed bits and fast exponentiation (Q1826277) (← links)
- A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0 (Q1872246) (← links)
- Limit laws for partial match queries in quadtrees (Q1872463) (← links)
- How can we explain different number systems? (Q1979845) (← links)
- Algorithm design through the optimization of reuse-based generation (Q1980486) (← links)
- \texttt{FASTSET}: a fast data structure for the representation of sets of integers (Q2004853) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- Doubly stochastic matrices and Schur-Weyl duality for partition algebras (Q2112559) (← links)
- Pattern-functions, statistics, and shallow permutations (Q2112582) (← links)
- Enumeration of Gelfand-Cetlin type reduced words (Q2121754) (← links)
- The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram (Q2135139) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- Optimizing registration based encryption (Q2149790) (← links)
