The following pages link to József Dénes (Q588122):
Displaying 50 items.
- (Q686150) (redirect page) (← links)
- Chords, trees and permutations (Q686151) (← links)
- Enumeration formulas for latin and frequency squares (Q686458) (← links)
- Four MOLS of orders 20, 30, 38, and 44 (Q690037) (← links)
- (Q754873) (redirect page) (← links)
- Generalized complete mappings, neofields, sequenceable groups and block designs. I (Q762163) (← links)
- More super P-groups (Q788110) (← links)
- The complexity of completing partial Latin squares (Q793029) (← links)
- Further results on incomplete (3,2,1)-conjugate orthogonal idempotent Latin squares (Q918555) (← links)
- Possible orders for the stabilizer of a set of M. O. L. S (Q919001) (← links)
- (Q1062139) (redirect page) (← links)
- Research problem 39: Perfect groups and Cayley graphs (Q1062140) (← links)
- Generalized complete mappings, neofields, sequenceable groups and block designs. II (Q1063606) (← links)
- On some connections between permutations and coding (Q1068049) (← links)
- Splittings of infinite Abelian groups (Q1073919) (← links)
- On orthogonal arrays of strength 3 and 5 achieving Rao's bound (Q1080855) (← links)
- Four pairwise orthogonal Latin squares of order 24 (Q1084106) (← links)
- Research problem 40 (Q1086570) (← links)
- (Q1109037) (redirect page) (← links)
- On orthogonal arrays attaining Rao's bounds (Q1109038) (← links)
- Enumeration of Latin arrays. I: Case \(n\leq 3\) (Q1176064) (← links)
- Enumeration of Latin arrays. II: Case \(n=4\), \(k\leq 4\) (Q1177968) (← links)
- On a class of completable partial edge-colourings (Q1186316) (← links)
- Sets of mutually orthogonal Latin squares with ``like subsquares'' (Q1194749) (← links)
- Perfect Latin squares (Q1199432) (← links)
- A new authentication scheme based on latin squares (Q1199596) (← links)
- Maximal sets of mutually orthogonal Latin squares. II (Q1199771) (← links)
- The capacity of the subarray partial concentrators (Q1201810) (← links)
- A formula for the number of Latin squares (Q1208376) (← links)
- Erratum: ''Some combinatorial properties of transformations and their connection with the theory of graphs'' (Q1245855) (← links)
- Generalized Latin squares. I (Q1262866) (← links)
- A new conjecture concerning admissibility of groups (Q1262949) (← links)
- Some new Latin power sets not based on groups (Q1279657) (← links)
- A coding theoretic solution to the 36 officer problem (Q1321562) (← links)
- Fast software encryption. Cambridge, GB, December 9-11, 1993. Proceedings (Q1328412) (← links)
- Classic squares and broadcast squares (Q1336643) (← links)
- \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures (Q1346764) (← links)
- On connected transversals to nonabelian subgroups (Q1348744) (← links)
- Construction of orthogonal latin squares using left neofields (Q1801682) (← links)
- Cubic arcs in cubic nets (Q1802187) (← links)
- Alan Turing, Enigma. Aus dem Englischen übersetzt von Rolf Herken und Eva Lack. (Q1895003) (← links)
- Digital signature schemes: general framework and fail-stop signatures (Q1923137) (← links)
- A type of factorization of finite Abelian groups (Q2266771) (← links)
- Labelled trees and factorizations of a cycle into transpositions (Q2366027) (← links)
- On some statistical properties of the alternating group of degree \(n\) (Q2536640) (← links)
- On P-quasigroups and decompositions of complete undirected graphs (Q2550403) (← links)
- (Q2942174) (← links)
- Some Connections Between Groups and Graphs. A Survey (Q3035684) (← links)
- (Q3042404) (← links)
- (Q3043181) (← links)
