The following pages link to (Q4349924):
Displaying 50 items.
- A simple measure of conditional dependence (Q128731) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- An accurate updating formula to calculate sample variance from weighted successive differences (Q277260) (← links)
- Faster algorithms for single machine scheduling with release dates and rejection (Q280934) (← links)
- Improved error bounds for floating-point products and Horner's scheme (Q285288) (← links)
- On the definition of unit roundoff (Q285290) (← links)
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- Batcher's odd-even exchange revisited: a generating functions approach (Q290531) (← links)
- A fast algorithm for computing large Fibonacci numbers (Q294835) (← links)
- Measurement of preferences with self-explicated approaches: a classification and merge of trade-off- and non-trade-off-based evaluation types (Q296725) (← links)
- Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
- On the linear complexity profile of some sequences derived from elliptic curves (Q306337) (← links)
- Even faster integer multiplication (Q306687) (← links)
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Perfect necklaces (Q308973) (← links)
- Finding the best portable congruential random number generators (Q310292) (← links)
- An obstruction to solvability of the reach control problem using affine feedback (Q313222) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Genetic algorithms for condition-based maintenance optimization under uncertainty (Q319420) (← links)
- Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts (Q319754) (← links)
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? (Q335016) (← links)
- Scheduling with compressible and stochastic release dates (Q336364) (← links)
- Integer complexity: representing numbers of bounded defect (Q338388) (← links)
- Signed enumeration of upper-right corners in path shuffles (Q338583) (← links)
- Sharp error bounds for complex floating-point inversion (Q342874) (← links)
- Merging almost sorted sequences yields a 24-sorter (Q344521) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194) (← links)
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- Controlled random tests (Q376499) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Running time of the treapsort algorithm (Q387004) (← links)
- Fibonacci BSTs: a new balancing method for binary search trees (Q390913) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases (Q394267) (← links)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Scheduling modular projects on a bottleneck resource (Q398901) (← links)
- Combinatorics of non-ambiguous trees (Q402584) (← links)
- Combinatorics of balanced carries (Q404287) (← links)
- Some new binomial sums related to the Catalan triangle (Q405119) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Numeration and discrete dynamical systems (Q411444) (← links)
- Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups (Q413568) (← links)
- Weighted Flow Algorithms (WFA) for stochastic particle coagulation (Q414013) (← links)
- String matching with alphabet sampling (Q414445) (← links)
- Parallel modular exponentiation using load balancing without precomputation (Q414922) (← links)
- Notes on protected nodes in digital search trees (Q419140) (← links)
- Pseudorandom number generators based on random covers for finite groups (Q420634) (← links)
- Efficient computer search of large-order multiple recursive pseudo-random number generators (Q421831) (← links)
