Next generation algorithms for grabbing and exploiting symmetry

Engineering a Fast Probabilistic Isomorphism Test

Autori: Markus Anders, Pascal Schweitzer
Pubblicato in: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), 2021, Pagina/e 73-84, ISBN 978-1-61197-647-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976472.6

2.5-Connectivity: Unique Components, Critical Graphs, and Applications

Autori: Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher
Pubblicato in: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, Numero 12301, 2020, Pagina/e 352-363, ISBN 978-3-030-60439-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-60440-0_28

Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case

Autori: Anders, Markus; Schweitzer, Pascal; Wetzels, Florian
Pubblicato in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Numero 1, 2021
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.15

Choiceless Polynomial Time with Witnessed Symmetric Choice

Autori: Lichter, Moritz; Schweitzer, Pascal
Pubblicato in: LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer ScienceAugust 2022, 2022
Editore: ACM
DOI: 10.1145/3531130.3533348

A Characterization of Individualization-Refinement Trees

Autori: Anders, Brachter, Schweitzer
Pubblicato in: 32nd International Symposium on Algorithms and Computation (ISAAC 2021), Numero 212, 2021, Pagina/e 24:1--24:14, ISBN 978-3-95977-214-3
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.isaac.2021.24

Parallel Computation of Combinatorial Symmetries

Autori: Anders, Schweitzer
Pubblicato in: ESA 2021, Numero 6, 2021
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2021.6

Resolution with Symmetry Rule Applied to Linear Equations

Autori: Schweitzer, Pascal; Seebach, Constantin
Pubblicato in: Symposium on Theoretical Aspects of Computer Science (STACS), Numero 3, 2021
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2021.58

SAT Preprocessors and Symmetry.

Autori: Markus Anders
Pubblicato in: 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), 2022
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.sat.2022.1

Separating Rank Logic from Polynomial Time

Autori: Moritz Lichter
Pubblicato in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021, Pagina/e 1-13, ISBN 978-1-6654-4895-6
Editore: IEEE
DOI: 10.1109/lics52264.2021.9470598

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm

Autori: Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Pubblicato in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Pagina/e 1-13, ISBN 978-1-7281-3608-0
Editore: IEEE
DOI: 10.1109/lics.2019.8785694

On the Weisfeiler-Leman Dimension of Finite Groups

Autori: Jendrik Brachter, Pascal Schweitzer
Pubblicato in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Pagina/e 287-300, ISBN 9781450371049
Editore: ACM
DOI: 10.1145/3373718.3394786

A unifying method for the design of algorithms canonizing combinatorial objects

Autori: Pascal Schweitzer, Daniel Wiebking
Pubblicato in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Pagina/e 1247-1258, ISBN 9781450367059
Editore: ACM Press
DOI: 10.1145/3313276.3316338

Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms

Autori: Anders, Markus; Schweitzer, Pascal
Pubblicato in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Numero 4, 2021
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.16

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time

Autori: Lichter, Moritz; Schweitzer, Pascal
Pubblicato in: CSL 2021, Numero 3, 2021
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.csl.2021.31

Limitations of the Invertible-Map Equivalences

Autori: Anuj Dawar, Erich Grädel, Moritz Lichter,
Pubblicato in: Journal of Logic and Computation, Numero 0955792X, 2022, ISSN 0955-792X
Editore: Oxford University Press
DOI: 10.1093/logcom/exac058

Pubblicazioni

Condividi questa pagina

Scarica