5 Publications

Mark all

[5]
2023 | Journal Article | LibreCat-ID: 50298
Schmidt, Kai-Uwe, and Charlene Weiß. “Packings and Steiner Systems in Polar Spaces.” Combinatorial Theory, vol. 3, no. 1, 2023, doi:10.5070/c63160424.
LibreCat | DOI
 
[4]
2023 | Journal Article | LibreCat-ID: 50297
Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal Arrays.” Journal of Combinatorial Designs, vol. 31, no. 9, Wiley, 2023, pp. 422–31, doi:10.1002/jcd.21903.
LibreCat | DOI
 
[3]
2023 | Dissertation | LibreCat-ID: 50300
Weiß, Charlene. Linear Programming Bounds in Classical Association Schemes. 2023, doi:10.17619/UNIPB/1-1672.
LibreCat | DOI
 
[2]
2023 | Preprint | LibreCat-ID: 50299
Weiß, Charlene. “Nontrivial $t$-Designs in Polar Spaces Exist for All $t$.” ArXiv:2311.08288.
LibreCat | arXiv
 
[1]
2023 | Report | LibreCat-ID: 52127
Moura, Lucia, et al. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 40–57, doi:10.4230/DagRep.13.4.40.
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

5 Publications

Mark all

[5]
2023 | Journal Article | LibreCat-ID: 50298
Schmidt, Kai-Uwe, and Charlene Weiß. “Packings and Steiner Systems in Polar Spaces.” Combinatorial Theory, vol. 3, no. 1, 2023, doi:10.5070/c63160424.
LibreCat | DOI
 
[4]
2023 | Journal Article | LibreCat-ID: 50297
Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal Arrays.” Journal of Combinatorial Designs, vol. 31, no. 9, Wiley, 2023, pp. 422–31, doi:10.1002/jcd.21903.
LibreCat | DOI
 
[3]
2023 | Dissertation | LibreCat-ID: 50300
Weiß, Charlene. Linear Programming Bounds in Classical Association Schemes. 2023, doi:10.17619/UNIPB/1-1672.
LibreCat | DOI
 
[2]
2023 | Preprint | LibreCat-ID: 50299
Weiß, Charlene. “Nontrivial $t$-Designs in Polar Spaces Exist for All $t$.” ArXiv:2311.08288.
LibreCat | arXiv
 
[1]
2023 | Report | LibreCat-ID: 52127
Moura, Lucia, et al. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 40–57, doi:10.4230/DagRep.13.4.40.
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed