EPub Bayreuth
Veröffentlichungen "Kurz, Sascha"
Anzahl der Einträge: 129. 2024
Kurz, Sascha:
Bounds on the minimum distance of locally recoverable codes. Bayreuth , 2024 . - 23 S.
Kurz, Sascha:
Computer classification of linear codes based on lattice point enumeration and integer linear programming. Bayreuth , 2024 . - 7 S.
2023
Kurz, Sascha ; Landjev, Ivan ; Pavese, Francesco ; Rousseva, Assia:
The Geometry of (t mod q)-arcs. In: Designs, codes and cryptography. (14 November 2023) . ISSN 1573-7586 DOI der Verlagsversion: https://doi.org/10.1007/s10623-023-01290-w
Körner, Theresa ; Kurz, Sascha:
Lengths of divisible codes with restricted column multiplicities. Bayreuth , 2023 . - 26 S.
Kurz, Sascha:
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes. Bayreuth , 2023 . - 14 S.
Bamberg, John ; Filmus, Yuval ; Ihringer, Ferdinand ; Kurz, Sascha:
Affine vector space partitions. In: Designs, codes and cryptography. (23 Juni 2023) . ISSN 1573-7586
Kiermaier, Michael ; Kurz, Sascha:
Classification of Δ-divisible linear codes spanned by codewords of weight Δ. Bayreuth , 2023 . - 12 S.
Filmus, Yuval ; Hirsch, Edward ; Ihringer, Ferdinand ; Kurz, Sascha ; Riazanov, Artur ; Smal, Alexander ; Vinyals, Marc:
Irreducible Subcube Partitions. Bayreuth , 2023 . - 38 S. 2022
Kiermaier, Michael ; Kurz, Sascha ; Solé, Patrick ; Stoll, Michael ; Wassermann, Alfred:
On strongly walk regular graphs,triple sum sets and their codes. In: Designs, codes and cryptography. Bd. 91 (September 2022) . - S. 645-675. ISSN 1573-7586 DOI der Verlagsversion: https://doi.org/10.1007/s10623-022-01118-z
Kurz, Sascha ; Mayer, Alexander ; Napel, Stefan:
The Art and Beauty of Voting Power. Bayreuth , 2022 . - 20 S.
Kurz, Sascha:
The Public Good index for games with several levels of approval in the input and output. Bayreuth , 2022 . - 16 S.
Geißer, Michael ; Körner, Theresa ; Kurz, Sascha ; Zahn, Anne:
Squares with three digits. Bayreuth , 2022 . - 42 S. 2021
Kurz, Sascha:
Plane point sets with many squares or isosceles right triangles. Bayreuth , 2021 . - 31 S.
Kurz, Sascha ; Samaniego, Dani:
A note on simple games with two equivalence classes of players. Bayreuth , 2021 . - 13 S.
Cossidente, Antonio ; Kurz, Sascha ; Marino, Giuseppe ; Pavese, Francesco:
Combining subspace codes. Bayreuth , 2021 . - 17 S.
Kurz, Sascha ; Landjev, Ivan ; Rousseva, Assia:
Classification of (3 mod 5) arcs in PG(3,5). Bayreuth , 2021 . - 33 S.
Kurz, Sascha:
The interplay of different metrics for the construction of constant dimension codes. Bayreuth , 2021 . - 18 S.
Feng, Tao ; Kurz, Sascha ; Liu, Shuangqing:
Bounds for the multilevel construction. Bayreuth , 2021 . - 95 S.
2020
Kurz, Sascha:
Classification of 8-divisible binary linear codes with minimum distance 24. Bayreuth , 2020 . - 53 S.
Kurz, Sascha:
Classification of indecomposable 2<sup>r</sup>-divisible codes spanned by by codewords of weight 2<sup>r</sup>. Bayreuth , 2020 . - 7 S.
Kurz, Sascha ; Mattheus, Sam:
A generalization of the cylinder conjecture for divisible codes. Bayreuth , 2020 . - 16 S.
Kazemi, Fatemeh ; Kurz, Sascha ; Soljanin, Emina ; Sprintson, Alex:
Efficient Storage Schemes for Desired Service Rate Regions. Bayreuth , 2020 . - 5 S.
dela Cruz, Romar ; Kurz, Sascha:
On the maximum number of minimal codewords. Bayreuth , 2020 . - 13 S.
Kießling, Miriam ; Kurz, Sascha ; Rambau, Jörg:
An exact column-generation approach for the lot-type design problem. Bayreuth , 2020 . - 36 S.
Kurz, Sascha:
No projective $16$-divisible binary linear code of length $131$ exists. Bayreuth , 2020 . - 4 S.
Kurz, Sascha:
A note on the growth of the dimension in complete simple games. Bayreuth , 2020 . - 9 S.
Kurz, Sascha:
On the number of minimal codewords in codes generated by the adjacency matrix of a graph. Bayreuth , 2020 . - 11 S.
dela Cruz, Romar ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
On the minimum number of minimal codewords. Bayreuth , 2020 . - 9 S.
Kurz, Sascha:
Lifted codes and the multilevel construction for constant dimension codes. Bayreuth , 2020 . - 40 S.
Bouyukliev, Iliya ; Bouyuklieva, Stefka ; Kurz, Sascha:
Computer classification of linear codes. Bayreuth , 2020 . - 18 S.
Kurz, Sascha ; Moyouwou, Issofa ; Touyem, Hilaire:
Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output. Bayreuth , 2020 . - 25 S.
Kazemi, Fatemeh ; Kurz, Sascha ; Soljanin, Emina:
A geometric view of the service rates of codes problem and its application to the service rate of the first order Reed-Muller codes. Bayreuth , 2020 . - 8 S.
Kurz, Sascha:
A note on the linkage construction for constant dimension codes. Bayreuth , 2020 . - 9 S.
Etzion, Tuvi ; Kurz, Sascha ; Otal, Kamil ; Özbudak, Ferruh:
Subspace Packings : Constructions and Bounds. Bayreuth , 2020 . - 30 S.
Kurz, Sascha ; Rambau, Jörg:
Lösungshinweise zu den Übungsaufgaben "Mathematische Grundlagen für Wirtschaftswissenschaftler". Bayreuth , 2020 (Sonstiges) 2019
Heinlein, Daniel ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
Tables of subspace codes. Bayreuth , 2019 . - 44 S.
Kiermaier, Michael ; Kurz, Sascha ; Shi, Minjia ; Solé, Patrick:
Three-weight codes over rings and strongly walk regular graphs. Bayreuth , 2019 . - 28 S.
Kurz, Sascha ; Laue, Reinhard:
Bounds for the minimum diameter of integral point sets. Bayreuth , 2019 . - 8 S.
Kurz, Sascha ; Mayer, Alexander ; Napel, Stefan:
Weighted Committee Games. Bayreuth , 2019 . - 25 S.
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
The lengths of projective triply-even binary codes. Bayreuth , 2019 . - 6 S.
Kurz, Sascha ; Moyouwou, Issofa ; Touyem, Hilaire:
An Axiomatization of the Shapley-Shubik Index for Interval Decisions. Bayreuth , 2019 . - 28 S.
Kurz, Sascha:
Which criteria qualify power indices for applications? : A comment to "The story of the poor Public Good index". Bayreuth , 2019 . - 6 S.
Buratti, Marco ; Kiermaier, Michael ; Kurz, Sascha ; Nakić, Anamari ; Wassermann, Alfred:
q-analogs of group divisible designs. Bayreuth , 2019 . - 18 S.
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Johnson type bounds for mixed dimension subspace codes. Bayreuth , 2019 . - 16 S.
Heinlein, Daniel ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. Bayreuth , 2019 . - 18 S.
Heinlein, Daniel ; Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Generalized vector space partitions. Bayreuth , 2019 . - 12 S.
Kurz, Sascha ; Napel, Stefan:
Dimension of the Lisbon voting rules in the EU Council : a challenge and new world record. Bayreuth , 2019 . - 8 S. 2018
Etzion, Tuvi ; Kurz, Sascha ; Otal, Kamil ; Özbudak, Ferruh:
Subspace packings. Bayreuth , 2018 . - 10 S.
Hof, Frits ; Kern, Walter ; Kurz, Sascha ; Pashkovich, Kanstantsin ; Paulusma, Daniël:
Simple games versus weighted voting games: Bounding the critical threshold value. Bayreuth , 2018 . - 10 S.
Kurz, Sascha ; Napel, Stefan:
The roll-call interpretation of the Shapley value with dependent cooperation. Bayreuth , 2018 . - 15 S.
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Classification of large partial plane spreads in PG(6,2) and related combinatorial objects. Bayreuth , 2018 . - 31 S.
Hof, Frits ; Kern, Walter ; Kurz, Sascha ; Paulusma, Daniël:
Simple Games versus Weighted Voting Games. Bayreuth , 2018 . - 13 S.
Heinlein, Daniel ; Kurz, Sascha:
Binary subspace codes in small ambient spaces. Bayreuth , 2018 . - 20 S.
Kurz, Sascha:
Correction to "On minimum sum representations for weighted voting games". Bayreuth , 2018 . - 2 S.
Kiermaier, Michael ; Kurz, Sascha:
An improvement of the Johnson bound for subspace codes. Bayreuth , 2018 . - 12 S.
2017
Heinlein, Daniel ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
Tables of subspace codes. Bayreuth , 2017 . - 39 S.
Heinlein, Daniel ; Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Bayreuth , 2017 . - 16 S.
Heinlein, Daniel ; Kurz, Sascha:
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. Bayreuth , 2017 . - 30 S.
Heinlein, Daniel ; Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
Projective divisible binary codes. Bayreuth , 2017 . - 10 S.
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Partial spreads and vector space partitions. Bayreuth , 2017 . - 30 S.
Freixas, Josep ; Freixas, Marc ; Kurz, Sascha:
Characterization of threshold functions : state of the art, some new contributions and open problems. Bayreuth , 2017 . - 26 S.
2016
Kurz, Sascha ; Maaser, Nicola ; Napel, Stefan:
Fair Representation and a Linear Shapley Rule. Bayreuth , 2016 . - 20 S.
Olsen, Martin ; Kurz, Sascha ; Molinero, Xavier:
On the Construction of High Dimensional Simple Games. Bayreuth , 2016 . - 13 S.
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Constructions and Bounds for Mixed-Dimension Subspace Codes. Bayreuth , 2016 . - 35 S.
Kurz, Sascha ; Molinero, Xavier ; Olsen, Martin ; Serna, Maria:
Dimension and codimension of simple games. Bayreuth , 2016 . - 5 S.
Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
The order of the automorphism group of a binary q-analog of the Fano plane is at most two. Bayreuth , 2016 . - 10 S. 2015
Kurz, Sascha ; García-Valiñas, María ; Zaporozhets, Vera:
Key drivers of EU budget allocation: Does power matter? Universität Bayreuth Bayreuth , 2015 . - 32 S.
Kaniovski, Serguei ; Kurz, Sascha:
Representation-compatible power indices. Bayreuth , 2015 . - 28 S.
Hegselmann, Rainer ; König, Stefan ; Kurz, Sascha ; Niemann, Christoph ; Rambau, Jörg:
Optimal Opinion Control : The Campaign Problem. Bayreuth , 2015 . - 47 S.
Hoffmann, Isabella ; Kurz, Sascha ; Rambau, Jörg:
The Maximum Scatter TSP on a Regular Grid. Bayreuth , 2015 . - 6 S. 2014
Kurz, Sascha:
Optimal control of the convergence time in the Hegselmann-Krause dynamics. Universität Bayreuth Bayreuth , 2014 . - 14 S.
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4. Bayreuth , 2014 . - 24 S.
Kurz, Sascha ; Maaser, Nicola ; Napel, Stefan ; Weber, Matthias:
Mostly sunny : a forecast of tomorrow's power index research. Bayreuth , 2014 . - 17 S.
Kurz, Sascha ; Napel, Stefan:
Heuristic and exact solutions to the inverse power index problem for small voting bodies. Bayreuth , 2014
Kurz, Sascha ; Noll, Landon Curt ; Rathbun, Randall ; Simmons, Chuck:
Constructing 7-clusters. Bayreuth , 2014 . - 15 S. 2012
Kießling, Miriam ; Kurz, Sascha ; Rambau, Jörg:
The Integrated Size and Price Optimization problem. Bayreuth , 2012
Kießling, Miriam ; Kreisel, Tobias ; Kurz, Sascha ; Rambau, Jörg ; Schade, Konrad ; Schwarz, Cornelius:
Das Optimierungslabor – ein Erfahrungsbericht. Bayreuth , 2012 2008
Kurz, Sascha:
Discrete structures, algorithms, and applications. Bayreuth , 2008 . - 159 S. ( Habilitation, 2008 , Universität Bayreuth, Fakultät für Mathematik, Physik und Informatik)
Kurz, Sascha ; Rambau, Jörg ; Schlüchtermann, Jörg ; Wolf, Rainer:
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. Bayreuth , 2008 2007
Kiermaier, Michael ; Kurz, Sascha:
Inclusion-maximal integral point sets over finite fields. Bayreuth , 2007
Gaul, Constantin ; Kurz, Sascha ; Rambau, Jörg:
Lotsize optimization leading to a p-median problem with cardinalities. Bayreuth , 2007
Kurz, Sascha ; Wassermann, Alfred:
On the minimum diameter of plane integral point sets. Bayreuth , 2007
Kreisel, Tobias ; Kurz, Sascha:
There are integral heptagons, no three points on a line, no four on a circle. Bayreuth , 2007 2006
Kurz, Sascha ; Rambau, Jörg:
Demand forecasting for companies with many branches, low sales numbers per product, and non-recurring orderings. Bayreuth , 2006
2005
Kurz, Sascha:
Konstruktion und Eigenschaften ganzzahliger Punktmengen. Bayreuth , 2005 ( Dissertation, 2005 , Universität Bayreuth, Fakultät für Mathematik, Physik und Informatik)
Haase, Christian ; Kurz, Sascha:
A bijection between the d-dimensional simplices with distances in {1,2} and the partitions of d+1. Bayreuth , 2005
Kohnert, Axel ; Kurz, Sascha:
A note on Erdös-Diophantine graphs and Diophantine carpets. Bayreuth , 2005 |
