default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSascha Kurz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j82]Theresa Körner, Sascha Kurz:
Lengths of divisible codes with restricted column multiplicities. Adv. Math. Commun. 18(2): 505-534 (2024)- [j81]Sascha Kurz:
Lengths of divisible codes: the missing cases. Des. Codes Cryptogr. 92(8): 2367-2378 (2024) - [j80]Sascha Kurz
:
Non-Projective Two-Weight Codes. Entropy 26(4): 289 (2024) - 2023
- [j79]Sascha Kurz:
The interplay of different metrics for the construction of constant dimension codes. Adv. Math. Commun. 17(1): 152-171 (2023) - [j78]Sascha Kurz, Ivan N. Landjev, Assia Rousseva:
Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $. Adv. Math. Commun. 17(1): 172-206 (2023) - [j77]Romar dela Cruz, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
On the minimum number of minimal codewords. Adv. Math. Commun. 17(2): 333-341 (2023) - [j76]Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese:
Combining subspace codes. Adv. Math. Commun. 17(3): 536-550 (2023) - [j75]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Ryazanov, Alexander V. Smal, Marc Vinyals:
Irreducible Subcube Partitions. Electron. J. Comb. 30(3) (2023) - [j74]Sascha Kurz, Dani Samaniego:
Enumeration of simple games with two equivalence classes of players. Discret. Appl. Math. 334: 26-35 (2023) - [j73]Michael Kiermaier, Sascha Kurz, Patrick Solé, Michael Stoll, Alfred Wassermann:
On strongly walk regular graphs, triple sum sets and their codes. Des. Codes Cryptogr. 91(2): 645-675 (2023) - [j72]Michael Kiermaier, Sascha Kurz:
Classification of Δ-Divisible Linear Codes Spanned by Codewords of Weight Δ. IEEE Trans. Inf. Theory 69(6): 3544-3551 (2023) - 2022
- [j71]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals:
Irreducible subcube partitions. CoRR abs/2212.14685: 1-38 (2022) - [j70]Sascha Kurz:
On the number of minimal codewords in codes generated by the adjacency matrix of a graph. Discret. Appl. Math. 309: 221-228 (2022) - [j69]Minjia Shi, Michael Kiermaier, Sascha Kurz, Patrick Solé:
Three-Weight Codes over Rings and Strongly Walk Regular Graphs. Graphs Comb. 38(3): 56 (2022) - [j68]Sascha Kurz, Sam Mattheus:
A Generalization of the Cylinder Conjecture for Divisible Codes. IEEE Trans. Inf. Theory 68(4): 2281-2289 (2022) - 2021
- [j67]Sascha Kurz:
The [46, 9, 20]2 code is unique. Adv. Math. Commun. 15(3): 415-422 (2021) - [j66]Sascha Kurz, Eitan Yaakobi:
PIR Codes with Short Block Length. Des. Codes Cryptogr. 89(3): 559-587 (2021) - [j65]Sascha Kurz:
Bounds for flag codes. Des. Codes Cryptogr. 89(12): 2759-2785 (2021) - [j64]Romar dela Cruz, Sascha Kurz:
On the maximum number of minimal codewords. Discret. Math. 344(9): 112510 (2021) - [j63]Sascha Kurz:
No Projective 16-Divisible Binary Linear Code of Length 131 Exists. IEEE Commun. Lett. 25(1): 38-40 (2021) - [j62]Sascha Kurz:
A note on the growth of the dimension in complete simple games. Math. Soc. Sci. 110: 14-18 (2021) - [j61]Sascha Kurz, Issofa Moyouwou, Hilaire Touyem:
Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output. Soc. Choice Welf. 56(3): 569-594 (2021) - [j60]Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz:
Computer Classification of Linear Codes. IEEE Trans. Inf. Theory 67(12): 7807-7814 (2021) - 2020
- [j59]Sascha Kurz:
Subspaces intersecting in at most a point. Des. Codes Cryptogr. 88(3): 595-599 (2020) - [j58]Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak:
Subspace packings: constructions and bounds. Des. Codes Cryptogr. 88(9): 1781-1810 (2020) - [j57]Sascha Kurz, Alexander Mayer, Stefan Napel:
Weighted committee games. Eur. J. Oper. Res. 282(3): 972-979 (2020) - [j56]Sascha Kurz:
Generalized LMRD Code Bounds for Constant Dimension Codes. IEEE Commun. Lett. 24(10): 2100-2103 (2020) - [j55]Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma:
Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. 54(4): 609-621 (2020) - [j54]Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
The Lengths of Projective Triply-Even Binary Codes. IEEE Trans. Inf. Theory 66(5): 2713-2716 (2020) - [j53]Michael Kiermaier, Sascha Kurz:
On the Lengths of Divisible Codes. IEEE Trans. Inf. Theory 66(7): 4051-4060 (2020) - 2019
- [j52]Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz:
Generalized vector space partitions. Australas. J Comb. 73: 162-178 (2019) - [j51]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. Adv. Math. Commun. 13(3): 457-475 (2019) - [j50]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Johnson Type Bounds for Mixed Dimension Subspace Codes. Electron. J. Comb. 26(3): 3 (2019) - [j49]Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87(2-3): 375-391 (2019) - [j48]Josep Freixas, Sascha Kurz:
Bounds for the Nakamura number. Soc. Choice Welf. 52(4): 607-634 (2019) - 2018
- [j47]Sascha Kurz:
Importance in Systems with interval Decisions. Adv. Complex Syst. 21(6-7): 1850024:1-1850024:23 (2018) - [j46]Daniel Heinlein, Sascha Kurz:
Binary subspace codes in small ambient spaces. Adv. Math. Commun. 12(4): 817-839 (2018) - [j45]Serguei Kaniovski, Sascha Kurz:
Representation-compatible power indices. Ann. Oper. Res. 264(1-2): 235-265 (2018) - [j44]Sascha Kurz:
Correction to: On minimum sum representations for weighted voting games. Ann. Oper. Res. 271(2): 1087-1089 (2018) - [j43]Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
The order of the automorphism group of a binary q -analog of the Fano plane is at most two. Des. Codes Cryptogr. 86(2): 239-250 (2018) - [j42]Sascha Kurz:
Heden's bound on the tail of a vector space partition. Discret. Math. 341(12): 3447-3452 (2018) - [j41]Sascha Kurz, Nicola Maaser, Stefan Napel:
Fair representation and a linear Shapley rule. Games Econ. Behav. 108: 152-161 (2018) - [j40]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group activity selection problem with approval preferences. Int. J. Game Theory 47(3): 767-796 (2018) - 2017
- [j39]Sascha Kurz:
Packing vector spaces into vector spaces. Australas. J Comb. 68: 122-130 (2017) - [j38]Sascha Kurz:
Improved upper bounds for partial spreads. Des. Codes Cryptogr. 85(1): 97-106 (2017) - [j37]Maurice Koster, Sascha Kurz, Ines Lindner, Stefan Napel:
The prediction value. Soc. Choice Welf. 48(2): 433-460 (2017) - [j36]Daniel Heinlein, Sascha Kurz:
Coset Construction for Subspace Codes. IEEE Trans. Inf. Theory 63(12): 7651-7660 (2017) - 2016
- [j35]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Constructions and bounds for mixed-dimension subspace codes. Adv. Math. Commun. 10(3): 649-682 (2016) - [j34]Sascha Kurz, Xavier Molinero, Martin Olsen, Maria José Serna Iglesias:
Dimension and codimension of simple games. Electron. Notes Discret. Math. 55: 147-150 (2016) - [j33]Josep Freixas, Sascha Kurz:
The cost of getting local monotonicity. Eur. J. Oper. Res. 251(2): 600-612 (2016) - [j32]Sascha Kurz, Stefan Napel:
Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record. Optim. Lett. 10(6): 1245-1256 (2016) - [j31]Sascha Kurz:
The inverse problem for power distributions in committees. Soc. Choice Welf. 47(1): 65-88 (2016) - 2015
- [j30]Sascha Kurz, Jörg Rambau, Jörg Schlüchtermann, Rainer Wolf:
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. Ann. Oper. Res. 229(1): 541-563 (2015) - [j29]Vadim M. Kartak, Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz:
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discret. Appl. Math. 187: 120-129 (2015) - [j28]Rainer Hegselmann, Stefan König, Sascha Kurz, Christoph Niemann, Jörg Rambau:
Optimal Opinion Control: The Campaign Problem. J. Artif. Soc. Soc. Simul. 18(3) (2015) - 2014
- [j27]Sascha Kurz, Stefan Napel:
Heuristic and exact solutions to the inverse power index problem for small voting bodies. Ann. Oper. Res. 215(1): 137-163 (2014) - [j26]Josep Freixas, Sascha Kurz:
Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum. Ann. Oper. Res. 222(1): 317-339 (2014) - [j25]Josep Freixas, Sascha Kurz:
On \({\alpha }\) -roughly weighted games. Int. J. Game Theory 43(3): 659-692 (2014) - [j24]Josep Freixas, Sascha Kurz:
On minimum integer representations of weighted games. Math. Soc. Sci. 67: 9-22 (2014) - 2013
- [j23]Sascha Kurz, Valery Mishkin:
Open Sets Avoiding Integral Distances. Discret. Comput. Geom. 50(1): 99-123 (2013) - [j22]Josep Freixas, Sascha Kurz:
The golden number and Fibonacci sequences in the design of voting structures. Eur. J. Oper. Res. 226(2): 246-257 (2013) - [j21]Sascha Kurz, Nikolas Tautenhahn:
On Dedekind's problem for complete simple games. Int. J. Game Theory 42(2): 411-437 (2013) - 2012
- [j20]Sascha Kurz:
On minimum sum representations for weighted voting games. Ann. Oper. Res. 196(1): 361-369 (2012) - [j19]Sascha Kurz, Martin Lätsch:
Bounds for the minimum oriented diameter. Discret. Math. Theor. Comput. Sci. 14(1): 109-140 (2012) - [j18]Sascha Kurz:
Bremst Richtervorbehalt den Datenschutz aus? - Richtervorbehalt versus datenschutzrechtliche Kontrollkompetenz. Datenschutz und Datensicherheit 36(4): 258-261 (2012) - [j17]Sascha Kurz:
Squaring the Square with Integer Linear Programming. Inf. Media Technol. 7(3): 986-991 (2012) - [j16]Sascha Kurz:
Squaring the Square with Integer Linear Programming. J. Inf. Process. 20(3): 680-685 (2012) - 2011
- [j15]Michael Kiermaier, Matthias Koch, Sascha Kurz:
2-arcs of maximal size in the affine and the projective Hjelmslev plane over ℤ25. Adv. Math. Commun. 5(2): 287-301 (2011) - [j14]Sascha Kurz, Alfred Wassermann:
On the minimum diameter of plane integral point sets. Ars Comb. 101: 265-287 (2011) - [j13]Sascha Kurz, Rom Pinchasi:
Regular Matchstick Graphs. Am. Math. Mon. 118(3): 264-267 (2011) - 2010
- [j12]Andrey Radoslavov Antonov, Sascha Kurz:
Maximal integral point sets over 2. Int. J. Comput. Math. 87(12): 2653-2676 (2010) - [j11]Constantin Gaul, Sascha Kurz, Jörg Rambau:
On the lot-type design problem. Optim. Methods Softw. 25(2): 217-227 (2010) - 2009
- [j10]Sascha Kurz:
Integral point sets over finite fields. Australas. J Comb. 43: 3-30 (2009) - [j9]Axel Kohnert, Sascha Kurz:
Integral point sets over Znm. Discret. Appl. Math. 157(9): 2105-2117 (2009) - [j8]Michael Kiermaier, Sascha Kurz:
Maximal integral point sets in affine planes over finite fields. Discret. Math. 309(13): 4564-4575 (2009) - [j7]Sascha Kurz, Harald Meyer:
Integral point sets in higher dimensional affine spaces over finite fields. J. Comb. Theory A 116(6): 1120-1139 (2009) - 2008
- [j6]Sascha Kurz:
Counting polyominoes with minimum perimeter. Ars Comb. 88 (2008) - [j5]Tobias Kreisel, Sascha Kurz:
There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle. Discret. Comput. Geom. 39(4): 786-790 (2008) - 2007
- [j4]Sascha Kurz, Reinhard Laue:
Bounds for the minimum diameter of integral point sets. Australas. J Comb. 39: 233-240 (2007) - 2006
- [j3]Sascha Kurz:
On the characteristic of integral point sets in 𝔼m. Australas. J Comb. 36: 241-248 (2006) - [j2]Sascha Kurz, Axel Kohnert:
Integral point sets over I. Electron. Notes Discret. Math. 27: 65-66 (2006) - [j1]Christian Haase, Sascha Kurz:
A bijection between the d-dimensional simplices with distances in {1, 2} and the partitions of d+1. J. Comb. Theory A 113(4): 736-738 (2006)
Conference and Workshop Papers
- 2024
- [c13]Sascha Kurz:
Computer Classification of Linear Codes Based on Lattice Point Enumeration. ICMS 2024: 97-105 - 2020
- [c12]Fatemeh Kazemi, Sascha Kurz, Emina Soljanin:
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes. ISIT 2020: 66-71 - [c11]Fatemeh Kazemi, Sascha Kurz, Emina Soljanin, Alex Sprintson:
Efficient Storage Schemes for Desired Service Rate Regions. ITW 2020: 1-5 - 2018
- [c10]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma:
Simple Games Versus Weighted Voting Games. SAGT 2018: 69-81 - 2017
- [c9]Daniel Heinlein, Sascha Kurz:
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound. ICMCTA 2017: 163-191 - 2016
- [c8]Martin Olsen, Sascha Kurz, Xavier Molinero:
On the Construction of High-Dimensional Simple Games. ECAI 2016: 880-885 - 2015
- [c7]Isabella Hoffmann, Sascha Kurz, Jörg Rambau:
The Maximum Scatter TSP on a Regular Grid. OR 2015: 63-70 - 2014
- [c6]Sascha Kurz, Nikolas Tautenhahn:
Classes of Complete Simple Games that are All Weighted. ICORES 2014: 288-293 - [c5]Sascha Kurz:
The Price of Fairness for a Small Number of Indivisible Items. OR 2014: 335-340 - 2012
- [c4]Miriam Kießling, Tobias Kreisel, Sascha Kurz, Jörg Rambau:
Evaluation of a New Supply Strategy for a Fashion Discounter. OR 2012: 515-520 - [c3]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. WINE 2012: 156-169 - 2008
- [c2]Axel Kohnert, Sascha Kurz:
Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance. MMICS 2008: 31-42 - 2007
- [c1]Sascha Kurz, Jörg Rambau:
Demand Forecasting for Companies with Many Branches, Low Sales Numbers per Product, and Non-Recurring Orderings. ISDA 2007: 196-204
Informal and Other Publications
- 2024
- [i84]Sascha Kurz:
Bounds on the minimum distance of locally recoverable codes. CoRR abs/2401.00418 (2024) - [i83]Sascha Kurz:
Non-projective two-weight codes. CoRR abs/2402.16643 (2024) - [i82]Sascha Kurz:
Computer classification of linear codes based on lattice point enumeration and integer linear programming. CoRR abs/2403.17509 (2024) - 2023
- [i81]Theresa Körner, Sascha Kurz:
Lengths of divisible codes with restricted column multiplicities. CoRR abs/2303.17172 (2023) - [i80]Sascha Kurz:
Trifferent codes with small lengths. CoRR abs/2310.13563 (2023) - [i79]Sascha Kurz:
Lengths of divisible codes - the missing cases. CoRR abs/2311.01947 (2023) - [i78]Sascha Kurz:
Divisible minimal codes. CoRR abs/2312.00885 (2023) - 2022
- [i77]Sascha Kurz:
Capacity of generalized diamond networks. CoRR abs/2212.00060 (2022) - 2021
- [i76]Sascha Kurz:
The Public Good index for games with several levels of approval in the input and output. CoRR abs/2107.10458 (2021) - [i75]Sascha Kurz, Ivan N. Landjev, Assia Rousseva:
Classification of 3 mod 5 arcs in PG(3, 5). CoRR abs/2108.04871 (2021) - [i74]Sascha Kurz:
The interplay of different metrics for the construction of constant dimension codes. CoRR abs/2109.07128 (2021) - [i73]Sascha Kurz, Dani Samaniego:
A note on simple games with two equivalence classes of players. CoRR abs/2112.00307 (2021) - [i72]Sascha Kurz:
Divisible Codes. CoRR abs/2112.11763 (2021) - [i71]Sascha Kurz:
Construction and bounds for subspace codes. CoRR abs/2112.11766 (2021) - [i70]Sascha Kurz, Alexander Mayer, Stefan Napel:
The Art and Beauty of Voting Power. CoRR abs/2112.11778 (2021) - 2020
- [i69]Sascha Kurz, Eitan Yaakobi:
PIR Codes with Short Block Length. CoRR abs/2001.03433 (2020) - [i68]Fatemeh Kazemi, Sascha Kurz, Emina Soljanin:
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes. CoRR abs/2001.09121 (2020) - [i67]Sascha Kurz, Issofa Moyouwou, Hilaire Touyem:
Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output. CoRR abs/2001.10197 (2020) - [i66]Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz:
Computer classification of linear codes. CoRR abs/2002.07826 (2020) - [i65]Sascha Kurz:
Lifted codes and the multilevel construction for constant dimension codes. CoRR abs/2004.14241 (2020) - [i64]Sascha Kurz:
A note on the growth of the dimension in complete simple games. CoRR abs/2006.05193 (2020) - [i63]Sascha Kurz:
Are weighted games sufficiently good for binary voting? CoRR abs/2006.05330 (2020) - [i62]Sascha Kurz:
No projective 16-divisible binary linear code of length 131 exists. CoRR abs/2006.10382 (2020) - [i61]Romar dela Cruz, Sascha Kurz:
On the maximum number of minimal codewords. CoRR abs/2010.10762 (2020) - [i60]Fatemeh Kazemi, Sascha Kurz, Emina Soljanin, Alex Sprintson:
Efficient Storage Schemes for Desired Service Rate Regions. CoRR abs/2010.12614 (2020) - [i59]Tao Feng, Sascha Kurz, Shuangqing Liu:
Bounds for the multilevel construction. CoRR abs/2011.06937 (2020) - [i58]Sascha Kurz:
Classification of 8-divisible binary linear codes with minimum distance 24. CoRR abs/2012.06163 (2020) - 2019
- [i57]Sascha Kurz:
The [46, 9, 20]2 code is unique. CoRR abs/1906.02621 (2019) - [i56]Sascha Kurz:
A note on the linkage construction for constant dimension codes. CoRR abs/1906.09780 (2019) - [i55]Sascha Kurz, Issofa Moyouwou, Hilaire Touyem:
An Axiomatization of the Shapley-Shubik Index for Interval Decisions. CoRR abs/1907.01323 (2019) - [i54]Sascha Kurz:
Subspaces intersecting in at most a point. CoRR abs/1907.02728 (2019) - [i53]Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak:
Subspace Packings - Constructions and Bounds. CoRR abs/1909.06081 (2019) - [i52]Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese:
Combining subspace codes. CoRR abs/1911.03387 (2019) - [i51]Sascha Kurz:
LinCode - computer classification of linear codes. CoRR abs/1912.09357 (2019) - [i50]Sascha Kurz, Alexander Mayer, Stefan Napel:
Influence in Weighted Committees. CoRR abs/1912.10208 (2019) - 2018
- [i49]Sascha Kurz:
Approximating power by weights. CoRR abs/1802.00497 (2018) - [i48]Sascha Kurz:
Influence in systems with convex decisions. CoRR abs/1803.04138 (2018) - [i47]Sascha Kurz:
The power of the largest player. CoRR abs/1803.04625 (2018) - [i46]Daniel Heinlein, Sascha Kurz:
Binary Subspace Codes in Small Ambient Spaces. CoRR abs/1804.02219 (2018) - [i45]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma:
Simple Games versus Weighted Voting Games. CoRR abs/1805.02192 (2018) - [i44]Sascha Kurz, Stefan Napel:
The roll call interpretation of the Shapley value. CoRR abs/1808.02696 (2018) - [i43]Sascha Kurz:
Bounds for the diameter of the weight polytope. CoRR abs/1808.03165 (2018) - [i42]Sascha Kurz:
A note on limit results for the Penrose-Banzhaf index. CoRR abs/1808.03197 (2018) - [i41]Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma:
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR abs/1810.08841 (2018) - [i40]Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak:
Subspace Packings. CoRR abs/1811.04611 (2018) - [i39]Sascha Kurz:
Which criteria qualify power indices for applications? - A comment to "The story of the poor Public Good index". CoRR abs/1812.05808 (2018) - [i38]Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
The lengths of projective triply-even binary codes. CoRR abs/1812.05957 (2018) - 2017
- [i37]Daniel Heinlein, Sascha Kurz:
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. CoRR abs/1705.03835 (2017) - [i36]Michael Kiermaier, Sascha Kurz:
An improvement of the Johnson bound for subspace codes. CoRR abs/1707.00650 (2017) - [i35]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. CoRR abs/1708.06224 (2017) - [i34]Sascha Kurz, Alexander Mayer, Stefan Napel:
Weighted Committee Games. CoRR abs/1712.03114 (2017) - 2016
- [i33]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
Tables of subspace codes. CoRR abs/1601.02864 (2016) - [i32]Martin Olsen, Sascha Kurz, Xavier Molinero:
On the Construction of High Dimensional Simple Games. CoRR abs/1602.01581 (2016) - [i31]Sascha Kurz, Xavier Molinero, Martin Olsen, Maria J. Serna:
Dimension and codimension of simple games. CoRR abs/1602.04328 (2016) - [i30]Sascha Kurz:
Generalized roll-call model for the Shapley-Shubik index. CoRR abs/1602.04331 (2016) - [i29]Josep Freixas, Marc Freixas, Sascha Kurz:
Characterization of threshold functions: state of the art, some new contributions and open problems. CoRR abs/1603.00329 (2016) - [i28]Sascha Kurz:
Computing the Power Distribution in the IMF. CoRR abs/1603.01443 (2016) - [i27]Sascha Kurz, Nicola Maaser, Stefan Napel:
Fair Representation and a Linear Shapley Rule. CoRR abs/1610.05436 (2016) - 2015
- [i26]Sascha Kurz, Stefan Napel:
Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record. CoRR abs/1503.02859 (2015) - [i25]Serguei Kaniovski, Sascha Kurz:
Representation-Compatible Power Indices. CoRR abs/1506.05963 (2015) - [i24]Isabella Hoffmann, Sascha Kurz, Jörg Rambau:
The Maximum Scatter TSP on a Regular Grid. CoRR abs/1512.02054 (2015) - [i23]Sascha Kurz:
Improved upper bounds for partial spreads. CoRR abs/1512.04297 (2015) - [i22]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Constructions and Bounds for Mixed-Dimension Subspace Codes. CoRR abs/1512.06660 (2015) - [i21]Daniel Heinlein, Sascha Kurz:
Coset Construction for Subspace Codes. CoRR abs/1512.07634 (2015) - 2014
- [i20]Sascha Kurz, Nikolas Tautenhahn:
Classes of Complete Simple Games that are All Weighted. CoRR abs/1401.1330 (2014) - [i19]Sascha Kurz, Jörg Rambau:
On the Hegselmann-Krause conjecture in opinion dynamics. CoRR abs/1401.4383 (2014) - [i18]Miriam Kießling, Sascha Kurz, Jörg Rambau:
An exact column-generation approach for the lot-type design problem - extended abstract. CoRR abs/1401.8071 (2014) - [i17]Sascha Kurz:
Competitive learning of monotone Boolean functions. CoRR abs/1401.8135 (2014) - [i16]Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger:
Group Activity Selection Problem. CoRR abs/1401.8151 (2014) - [i15]Sascha Kurz:
The inverse problem for power distributions in committees. CoRR abs/1402.0988 (2014) - [i14]Sascha Kurz:
Ready for the design of voting rules? CoRR abs/1405.0823 (2014) - [i13]Serguei Kaniovski, Sascha Kurz:
The average representation - a cornucopia of power indices? CoRR abs/1405.0825 (2014) - [i12]Sascha Kurz, Nicola Maaser, Stefan Napel, Matthias Weber:
Mostly Sunny: A Forecast of Tomorrow's Power Index Research. CoRR abs/1405.1510 (2014) - [i11]Sascha Kurz:
The price of fairness for a small number of indivisible items. CoRR abs/1406.5722 (2014) - [i10]Josep Freixas, Sascha Kurz:
The cost of getting local monotonicity. CoRR abs/1411.0944 (2014) - [i9]Sascha Kurz:
Optimal control of the convergence time in the Hegselmann-Krause dynamics. CoRR abs/1411.4814 (2014) - 2013
- [i8]Maurice Koster, Sascha Kurz, Ines Lindner, Stefan Napel:
The Prediction value. CoRR abs/1311.5728 (2013) - [i7]Sascha Kurz:
Measuring voting power in convex policy spaces. CoRR abs/1312.5936 (2013) - 2012
- [i6]Sascha Kurz, Nicola Maaser, Stefan Napel:
On the Egalitarian Weights of Nations. CoRR abs/1211.5908 (2012) - [i5]Sascha Kurz:
On the inverse power index problem. CoRR abs/1211.6353 (2012) - 2011
- [i4]Josep Freixas, Sascha Kurz:
On minimal integer representations of weighted games. CoRR abs/1103.0868 (2011) - [i3]Josep Freixas, Sascha Kurz:
On $α$-roughly weighted games. CoRR abs/1112.2861 (2011) - 2009
- [i2]Constantin Gaul, Sascha Kurz, Jörg Rambau:
The Combinatorics of (S, M, L, XL) or the best fitting delivery of T-shirts. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [i1]Axel Kohnert, Sascha Kurz:
Construction of Large Constant Dimension Codes With a Prescribed Minimum Distance. CoRR abs/0807.3212 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
