The following pages link to Indulis Strazdins (Q751623):
Displaying 50 items.
- A comment on the weight structure of generator matrices of linear codes (Q751624) (← links)
- Measuring-computational complex. Problems of reduction of the results of measurements (Q800293) (← links)
- Schur rings and cyclic association schemes of class three (Q912204) (← links)
- Oscillations spatio-temporelles engendrées par un automate cellulaire (Q1058296) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A generalization of a theorem of Kruskal (Q1073037) (← links)
- Enumeration with the lattice of periods (Q1074581) (← links)
- The number of tiered posets modulo six (Q1086236) (← links)
- Une combinatoire sous-jacente au théorème des fonctions implicites. (Combinatorics underlying the implicit functions theorem) (Q1088665) (← links)
- The complexity of the realization of subdefinite matrices by gate schemes (Q1101066) (← links)
- The number of fixed points of the majority rule (Q1112026) (← links)
- A combinatorial proof of the Giambelli identity for Schur functions (Q1112029) (← links)
- Combinatorics of Jacobi-configurations. III: The Srivastava-Singhal generating function revisited (Q1119582) (← links)
- Enumeration of lattice paths and generating functions for skew plane partitions (Q1119583) (← links)
- On the spiral property of the \(q\)-derangement numbers (Q1126223) (← links)
- Generalized Stirling and Lah numbers (Q1126295) (← links)
- Numerical computation of characteristic polynomials of Boolean functions and its applications (Q1264386) (← links)
- Enumeration of lozenge tilings of punctured hexagons (Q1269895) (← links)
- Inequalities for the crank (Q1269897) (← links)
- On the Shannon function for the generation of Boolean matrices (Q1279418) (← links)
- On upper bounds on the complexity of rational number generation of probabilistic \(\pi\)-nets (Q1279430) (← links)
- Properties of reversible polynomial functions (Q1280878) (← links)
- Representation of multichannel signature analyzers by linear polynomials over finite fields (Q1280895) (← links)
- Boolean differences for the monotone functions of the algebra of logic (Q1281076) (← links)
- Log-concavity and the exponential formula (Q1284158) (← links)
- Amenable groups and cellular automata (Q1288652) (← links)
- Realization of \(k\)-valued functions by circuits of functional elements (Q1290818) (← links)
- Computing Boolean functions by polynomials and threshold circuits (Q1293360) (← links)
- Catalan, Motzkin, and Riordan numbers (Q1300967) (← links)
- On sums over partially ordered sets (Q1305172) (← links)
- Partitions with \(k\) crossings (Q1306585) (← links)
- From the Bethe Ansatz to the Gessel-Viennot theorem (Q1306598) (← links)
- Partial difference equation method for lattice path problems (Q1306599) (← links)
- Adsorbing staircase walks and staircase polygons (Q1306617) (← links)
- A closer look at lattice points in rational simplices (Q1307019) (← links)
- Enumerative combinatorics and coding theory (Q1332388) (← links)
- Signs in the Laplace expansions and the parity of the distinguished representatives (Q1332413) (← links)
- Derangements and Genocchi numbers (Q1336648) (← links)
- Two combinatorial statistics on Dyck paths (Q1343781) (← links)
- Combinatorial variations on multidimensional quadtrees (Q1344226) (← links)
- Species on digraphs (Q1352291) (← links)
- Universal affine classification of Boolean functions (Q1355863) (← links)
- On pairs of lattice paths with a given number of intersections (Q1356026) (← links)
- Counting the \(n\)-chromos of I. J. Schoenberg (Q1364235) (← links)
- A unified approach to a class of Stirling-type pairs (Q1364895) (← links)
- On the synthesis of networks of functional elements (Q1380258) (← links)
- Implicit expressibility in two-valued logic and cryptoisomorphisms of two-element algebras (Q1380266) (← links)
- On estimates on the complexity of restrictions of Boolean functions (Q1380287) (← links)
- Catalan path statistics having the Narayana distribution (Q1381838) (← links)
- Polynomial expansion of symmetric Boolean functions by the table method (Q1385768) (← links)
