The following pages link to Karl-Heinz Zimmermann (Q218564):
Displaying 50 items.
- An all-pairs shortest path algorithm for bipartite graphs (Q469055) (← links)
- (Q587533) (redirect page) (← links)
- On the scalability of 2-D discrete wavelet transform algorithms (Q678247) (← links)
- Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble (Q709664) (← links)
- The weight distribution of indecomposable cyclic codes over 2-groups (Q1186112) (← links)
- On a complete decoding scheme for binary radical codes (Q1202442) (← links)
- Generating a Noetherian normalization of the invariant ring of a finite group (Q1264461) (← links)
- Properties of Gröbner bases and applications to doubly periodic arrays (Q1267068) (← links)
- On time optimal implementation of uniform recurrences onto array processors via quadratic programming (Q1270564) (← links)
- Efficient computation of Fourier transforms on compact groups (Q1271501) (← links)
- On the majority decodable distance of codes in filtrations of characteristic \(p>0\) (Q1312351) (← links)
- On weight spaces of polynomial representations of the general linear group as linear codes (Q1331140) (← links)
- Combinatorial \(S_ n\)-modules as codes (Q1344190) (← links)
- On new perfect binary nonlinear codes (Q1360995) (← links)
- A unifying lattice-based approach for the partitioning of systolic arrays via LPGS and LSGP (Q1376401) (← links)
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\) (Q1385406) (← links)
- A special purpose array processor architecture for the molecular dynamics simulation of point-mutated proteins (Q1430039) (← links)
- The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids (Q1570229) (← links)
- An algebraic method for public-key cryptography (Q1574733) (← links)
- Double coset decompositions and computational harmonic analysis on groups (Q1581065) (← links)
- Finding quadratic schedules for affine recurrence equations via nonsmooth optimization (Q1584052) (← links)
- Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127) (← links)
- Accelerating Viterbi algorithm on graphics processing units (Q1700985) (← links)
- A one round protocol for tripartite Diffie-Hellman (Q1772225) (← links)
- Heuristic decoding of linear codes using commutative algebra (Q2350923) (← links)
- (Q2724757) (← links)
- (Q2879674) (← links)
- (Q2893028) (← links)
- (Q2997735) (← links)
- (Q3081855) (← links)
- (Q3162358) (← links)
- (Q3546840) (← links)
- (Q3568025) (← links)
- Permutation parity machines for neural synchronization (Q3630097) (← links)
- (Q3821587) (← links)
- On indecomposable Abelian codes and their vertices (Q3987475) (← links)
- (Q3996932) (← links)
- (Q4220635) (← links)
- (Q4278286) (← links)
- (Q4300196) (← links)
- (Q4322868) (← links)
- Decoding of linear codes over Galois rings (Q4544596) (← links)
- On applying molecular computation to binary linear codes (Q4544803) (← links)
- On generalizations of repeated-root cyclic codes (Q4885700) (← links)
- A Variant of the Gr\"obner Basis Algorithm for Computing Hilbert Bases (Q4904755) (← links)
- (Q4911358) (← links)
- Abzähltheorie nach Pólya (Q5024269) (← links)
- Das Hidden-Markov-Modell (Q5102477) (← links)
- Berechenbarkeit (Q5140866) (← links)
- (Q5416577) (← links)
