The following pages link to (Q3393339):
Displaying 33 items.
- Influence of addition modulo \(2^n\) on algebraic attacks (Q269574) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Permutation pattern avoidance and the Catalan triangle (Q350823) (← links)
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation (Q431520) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- Concatenations of the hidden weighted bit function and their cryptographic properties (Q476337) (← links)
- Best-order streaming model (Q534570) (← links)
- The topology of isospectral manifolds of tridiagonal matrices (Q762807) (← links)
- On the silhouette of binary search trees (Q983879) (← links)
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities (Q1305419) (← links)
- On tree-growing search strategies (Q1354845) (← links)
- Determining the majority: The biased case (Q1364402) (← links)
- Normal convergence problem? Two moments and a recurrence may be the clues (Q1578596) (← links)
- Substitutions, coding prescriptions and integer representation (Q1753835) (← links)
- The number of winners in a discrete geometrically distributed sample (Q1814758) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265) (← links)
- Faster compressed quadtrees (Q2084740) (← links)
- Product optimization in stepwise design (Q2115903) (← links)
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402) (← links)
- Fast and simple compact hashing via bucketing (Q2165038) (← links)
- Eigenlogic in the spirit of George Boole (Q2183712) (← links)
- Constructing unlabelled lattices (Q2282992) (← links)
- DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
- On the error resilience of ordered binary decision diagrams (Q2354761) (← links)
- Towards a generic view of primality through multiset decompositions of natural numbers (Q2453539) (← links)
- The Boolean Constraint Solver of SWI-Prolog (System Description) (Q2798256) (← links)
- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams (Q2818019) (← links)
- Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
- Algebraic Attacks Using Binary Decision Diagrams (Q2947100) (← links)
- πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space (Q3007676) (← links)
- A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams (Q4617985) (← links)
- Pruned Discrete Random Samples (Q5299577) (← links)
