The following pages link to Sascha Kurz (Q315488):
Displayed 50 items.
- Dimension of the Lisbon voting rules in the EU council: a challenge and new world record (Q315490) (← links)
- The cost of getting local monotonicity (Q322726) (← links)
- Constructions and bounds for mixed-dimension subspace codes (Q326349) (← links)
- On \(\alpha\)-roughly weighted games (Q403979) (← links)
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum (Q490225) (← links)
- The top-dog index: a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches (Q492833) (← links)
- Dimension and codimension of simple games (Q510973) (← links)
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects (Q669602) (← links)
- Heuristic and exact solutions to the inverse power index problem for small voting bodies (Q744673) (← links)
- There are integral heptagons, no three points on a line, no four on a circle (Q938307) (← links)
- Integral point sets over \(\mathbb Z_n^m\) (Q1026112) (← links)
- Integral point sets in higher dimensional affine spaces over finite fields (Q1040829) (← links)
- Maximal integral point sets in affine planes over finite fields (Q1043989) (← links)
- Simple games versus weighted voting games (Q1617644) (← links)
- Binary subspace codes in small ambient spaces (Q1620978) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- The roll call interpretation of the Shapley value (Q1627000) (← links)
- Representation-compatible power indices (Q1639286) (← links)
- Fair representation and a linear Shapley rule (Q1651264) (← links)
- The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two (Q1696040) (← links)
- On the characterization of weighted simple games (Q1698978) (← links)
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound (Q1705522) (← links)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
- Correction to: ``On minimum sum representations for weighted voting games'' (Q1730597) (← links)
- On minimum sum representations for weighted voting games (Q1761826) (← links)
- The power of the largest player (Q1787621) (← links)
- Heden's bound on the tail of a vector space partition (Q1800417) (← links)
- The integrated size and price optimization problem (Q1940953) (← links)
- An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- A note on the growth of the dimension in complete simple games (Q2019365) (← links)
- The \([46, 9, 20]_2\) code is unique (Q2025377) (← links)
- On the maximum number of minimal codewords (Q2037586) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- Three-weight codes over rings and strongly walk regular graphs (Q2117518) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output (Q2235092) (← links)
- Bounds for flag codes (Q2243893) (← links)
- Implementation of Jefferson-d'Hondt rule in the formation of a parliamentary committee (Q2247939) (← links)
- The golden number and Fibonacci sequences in the design of voting structures (Q2253562) (← links)
- 2-arcs of maximal size in the affine and the projective Hjelmslev plane over \(\mathbb Z_{25}\) (Q2275882) (← links)
- A note on limit results for the Penrose-Banzhaf index (Q2300611) (← links)
- Subspaces intersecting in at most a point (Q2302159) (← links)
- A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane (Q2311610) (← links)
- Johnson type bounds for mixed dimension subspace codes (Q2323816) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- On Dedekind's problem for complete simple games (Q2376066) (← links)
- Open sets avoiding integral distances (Q2391837) (← links)
- The prediction value (Q2397666) (← links)
- Improved upper bounds for partial spreads (Q2402972) (← links)