The following pages link to Jukka Kohonen (Q311530):
Displayed 22 items.
- Fast Möbius inversion in semimodular lattices and ER-labelable posets (Q311532) (← links)
- An improved lower bound for finite additive 2-bases (Q503745) (← links)
- Exponential lower bounds of lattice counts by vertical sum and 2-sum (Q1729793) (← links)
- Cartesian lattice counting by the vertical 2-sum (Q2141002) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- Generating modular lattices of up to 30 elements (Q2279675) (← links)
- Exact and approximate balanced data gathering in energy-constrained sensor networks (Q2575091) (← links)
- Computing exact clustering posteriors with subset convolution (Q2815984) (← links)
- A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases (Q2877897) (← links)
- A Faster Subquadratic Algorithm for Finding Outlier Correlations (Q4554359) (← links)
- A Faster Subquadratic Algorithm for Finding Outlier Correlations (Q4575671) (← links)
- (Q4606323) (← links)
- Planar additive bases for rectangles (Q4612113) (← links)
- Counting graded lattices of rank 3 that have few coatoms (Q4968235) (← links)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312967) (← links)
- Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications (Q5404377) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5915764) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
- Early Pruning in the Restricted Postage Stamp Problem (Q6259871) (← links)
- Counting graded lattices of rank three that have few coatoms (Q6300188) (← links)
- Cartesian lattice counting by the vertical 2-sum (Q6344550) (← links)
- Simplifying modular lattices by removing doubly irreducible elements (Q6461087) (← links)