Engineering Scalable Algorithms for the Basic Toolbox ScAlBox

Informazioni relative al progetto

ScAlBox

ID dell’accordo di sovvenzione: 882500

DOI

10.3030/882500

Progetto chiuso

Data della firma CE 3 Luglio 2020

Data di avvio 1 Settembre 2020

Data di completamento 31 Agosto 2025

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 2 498 785,00

Contributo UE

€ 2 498 785,00

Coordinato da

KARLSRUHER INSTITUT FUER TECHNOLOGIE
Germany

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Peer reviewed articles (6)

Weighted Embeddings for Low-Dimensional Graph Representation

Autori: Thomas Bläsius, Jean-Pierre Von der Heydt, Maximilian Katzmann, Nikolai Maas
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 39, 2025, Pagina/e 15587-15595, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v39i15.33711

Lilotane : A Lifted SAT-based Approach to Hierarchical Planning

Autori: Schreiber, Dominik
Pubblicato in: Journal of Artificial Intelligence Research, Numero 70, 2021, Pagina/e 1117–1181, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12520

The 2023 International Planning Competition

Autori: Ayal Taitler, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fišer, Michael Gimelfarb, Florian Pommerening, Scott Sanner, Enrico Scala, Dominik Schreiber, Javier Segovia‐Aguas, Jendrik Seipp
Pubblicato in: AI Magazine, Numero 45, 2024, Pagina/e 280-296, ISSN 0738-4602
Editore: American Association for Artificial Intelligence (AAAI) Press
DOI: 10.1002/aaai.12169

MallobSat: Scalable SAT Solving by Clause Sharing

Autori: Dominik Schreiber, Peter Sanders
Pubblicato in: Journal of Artificial Intelligence Research, Numero 80, 2024, Pagina/e 1437-1495, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.15827

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling

Autori: Sanders, Peter; Schreiber, Dominik
Pubblicato in: Journal of Open Source Software, Numero 7(76), 2022, Pagina/e 4591, ISSN 2475-9066
Editore: JOSS
DOI: 10.21105/joss.04591

More Recent Advances in (Hyper)Graph Partitioning

Autori: Çatalyürek, Ümit V.; Devine, Karen D.; Fonseca Faraj, Marcelo; Gottesbüren, Lars; Heuer, Tobias; Meyerhenke, Henning; Sanders, Peter; Schlag, Sebastian; Schulz, Christian; Seemaier, Daniel; Wagner, Dorothea
Pubblicato in: ACM Computing Surveys, Numero Volume 55, Numero 12, 2022, Pagina/e 1--38, ISSN 0360-0300
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3571808

Conference proceedings (31)

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions

Autori: Bez, Dominik; Kurpicz, Florian; Lehmann, Hans-Peter; Sanders, Peter
Pubblicato in: 31st Annual European Symposium on Algorithms (ESA 2023), Numero 274, 2023, Pagina/e 19:1-19:16, ISBN 978-3-95977-295-2
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.esa.2023.19

Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI

Autori: Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl
Pubblicato in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Pagina/e 289-291
Editore: ACM
DOI: 10.1145/3626183.3660260

Linear-Time Multilevel Graph Partitioning

Autori: Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier
Pubblicato in: 2025
Editore: LIPIcs
DOI: 10.4230/lipics.esa.2025.32

Faster Block Tree Construction

Autori: Köppl, Dominik; Kurpicz, Florian; Meyer, Daniel
Pubblicato in: 31st Annual European Symposium on Algorithms (ESA 2023), Numero 274, 2023, Pagina/e 74:1-74:20, ISBN 978-3-95977-295-2
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.74

A Simple yet Exact Analysis of the MultiQueue

Autori: Stefan Walzer, Marvin Williams
Pubblicato in: 2025
Editore: LIPIcs
DOI: 10.4230/lipics.esa.2025.85

A Sweep-Plane Algorithm for Calculating the Isolation of Mountains

Autori: Funke, Daniel; Hüning, Nicolai; Sanders, Peter
Pubblicato in: 31st Annual European Symposium on Algorithms (ESA 2023), Numero 274, 2023, Pagina/e 51:1-51:17, ISBN 978-3-95977-295-2
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.51

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers

Autori: Michaelson, Dawn; Schreiber, Dominik; Heule, Marijn M.J.; Kiesl-Reiter, Benjamin; Whalen, Mike W.
Pubblicato in: Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2023), Numero 13993, 2023, Pagina/e 348-366, ISBN 978-3-031-30822-2
Editore: Springer
DOI: 10.1007/978-3-031-30823-9_18

Distributed Deep Multilevel Graph Partitioning

Autori: Sanders, Peter; Seemaier, Daniel
Pubblicato in: Euro-Par 2023: Parallel Processing, Numero 29, 2023, Pagina/e 443-457
Editore: Springer
DOI: 10.1007/978-3-031-39698-4_30

Tera-Scale Multilevel Graph Partitioning

Autori: Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren, Peter Sanders
Pubblicato in: 2025 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2025, Pagina/e 285-296
Editore: IEEE
DOI: 10.1109/ipdps64566.2025.00033

Engineering a Distributed-Memory Triangle Counting Algorithm

Autori: Sanders, Peter; Uhl, Tim Niklas
Pubblicato in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Numero 5, 2023, Pagina/e 702-712, ISBN 979-8-3503-3767-9
Editore: IEEE
DOI: 10.1109/ipdps54959.2023.00076

Scalable SAT Solving on Demand (Abstract)

Autori: Dominik Schreiber, Peter Sanders
Pubblicato in: Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024, Pagina/e 11-12
Editore: ACM
DOI: 10.1145/3670684.3673414

Engineering MultiQueues: Fast relaxed concurrent priority queues

Autori: Williams, Marvin; Sanders, Peter; Dementiev, Roman
Pubblicato in: 29th Annual European Symposium on Algorithms (ESA 2021), Numero 81, 2021, Pagina/e 1-17, ISBN 978-3-95977-204-4
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI)
DOI: 10.4230/lipics.esa.2021.81

Scalable SAT Solving in the Cloud

Autori: Schreiber, Dominik; Sanders, Peter
Pubblicato in: Theory and Applications of Satisfiability Testing – SAT 2021, Numero 24, 2021, Pagina/e 518-534, ISBN 978-3-030-80223-3
Editore: Springer
DOI: 10.1007/978-3-030-80223-3_35

Trusted Scalable SAT Solving with On-The-Fly LRAT Checking

Autori: Dominik Schreiber
Pubblicato in: 2024
Editore: Schloss Dagstuhl – Leibniz Zentrum für Informatik
DOI: 10.4230/lipics.sat.2024.25

PaCHash: Packed and Compressed Hash Tables

Autori: Kurpicz, Florian; Lehmann, Hans-Peter; Sanders, Peter
Pubblicato in: 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2023, Pagina/e 162--175, ISBN 978-1-61197-756-1
Editore: SIAM: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977561.ch14

Deep multilevel graph partitioning

Autori: Gottesbüren, Lars; Heuer, Tobias; Sanders, Peter; Schulz, Christian; Seemaier, Daniel
Pubblicato in: 29th Annual European Symposium on Algorithms (ESA 2021), Numero 48, 2021, Pagina/e 1-17, ISBN 978-3-95977-204-4
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI)
DOI: 10.5445/ir/1000138388

Mallob{32,64,1600} in the SAT Competition 2023

Autori: Schreiber, Dominik
Pubblicato in: Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions, 2023, Pagina/e 46-47
Editore: University of Helsinki

Bit-Parallel (Compressed) Wavelet Tree

Autori: Dinklage, Patrick; Fischer, Johannes; Kurpicz, Florian; Tarnowski, Jan-Philipp
Pubblicato in: 2023 Data Compression Conference (DCC), 2023, Pagina/e 81-90, ISBN 979-8-3503-4795-1
Editore: IEEE
DOI: 10.1109/dcc55655.2023.00016

Exploring Parallel MPI Fault Tolerance Mechanisms for Phylogenetic Inference with RAxML-NG.

Autori: Lukas Hübner; Alexey M. Kozlov; Demian Hespe; Peter Sanders; Alexandros Stamatakis; Alexandros Stamatakis
Pubblicato in: ISSN: 1367-4803, 1460-2059, Numero 1, 2021
Editore: Oxford University Press
DOI: 10.1093/bioinformatics/btab399

Fast and Lightweight Distributed Suffix Array Construction

Autori: Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek
Pubblicato in: 2025
Editore: LIPIcs
DOI: 10.4230/lipics.esa.2025.47

Scalable Distributed String Sorting

Autori: Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Pubblicato in: 2024
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.83

Brief Announcement: Scalable Distributed String Sorting

Autori: Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Pubblicato in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Pagina/e 375-377
Editore: ACM
DOI: 10.1145/3626183.3660256

Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines

Autori: Matthew Akram, Dominik Schreiber
Pubblicato in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Pagina/e 137-139
Editore: ACM
DOI: 10.1145/3626183.3660268

Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors

Autori: Kurpicz, Florian
Pubblicato in: Proceedings of the Twenty-Ninth International Symposium on String Processing and Information Retrieval (SPIRE), 2022, Pagina/e 257–272, ISBN 978-3-031-20642-9
Editore: Springer
DOI: 10.1007/978-3-031-20643-6_19

Engineering Massively Parallel MST Algorithms

Autori: Sanders, Peter; Schimek, Matthias
Pubblicato in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Numero 5, 2023, Pagina/e 691-701, ISBN 979-8-3503-3767-9
Editore: IEEE
DOI: 10.1109/ipdps54959.2023.00075

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing

Autori: Lehmann, Hans-Peter; Sanders, Peter; Walzer, Stefan
Pubblicato in: 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2023, Pagina/e 176-189, ISBN 978-1-61197-756-1
Editore: SIAM: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977561.ch15

KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI

Autori: Tim Niklas Uhl, Matthias Schimek, Lukas Hübner, Demian Hespe, Florian Kurpicz, Daniel Seemaier, Christoph Stelz, Peter Sanders
Pubblicato in: SC24: International Conference for High Performance Computing, Networking, Storage and Analysis, 2024, Pagina/e 1-21
Editore: IEEE
DOI: 10.1109/sc41406.2024.00050

Decentralized Online Scheduling of Malleable NP-hard Jobs

Autori: Sanders, Peter; Schreiber, Dominik
Pubblicato in: Euro-Par 2022: Parallel Processing, Numero 13440, 2022, Pagina/e 119-135, ISBN 978-3-031-12596-6
Editore: Springer
DOI: 10.1007/978-3-031-12597-3_8

Buffered Streaming Edge Partitioning

Autori: Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier
Pubblicato in: 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.sea.2024.5

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning

Autori: Peter Sanders, Daniel Seemaier
Pubblicato in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Pagina/e 443-445
Editore: ACM
DOI: 10.1145/3626183.3660257

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms

Autori: Hübner, Lukas; Hespe, Demian; Sanders, Peter; Stamatakis, Alexandros
Pubblicato in: 2022 IEEE/ACM 12th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS), 2022, Pagina/e 24-35, ISBN 978-1-6654-8848-8
Editore: IEEE
DOI: 10.1109/ftxs56515.2022.00008

Book chapters (4)

Concepts for Designing Modern C++ Interfaces for MPI

Autori: C. Nicole Avans, Alfredo A. Correa, Sayan Ghosh, Matthias Schimek, Joseph Schuchart, Anthony Skjellum, Evan D. Suggs, Tim Niklas Uhl
Pubblicato in: Lecture Notes in Computer Science, Recent Advances in the Message Passing Interface, 2025, Pagina/e 165-183
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-07194-1_10

Parallel Unconstrained Local Search for Partitioning Irregular Graphs

Autori: Nikolai Maas, Lars Gottesbüren, Daniel Seemaier
Pubblicato in: 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2024, Pagina/e 32-45
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977929.3

Deterministic Parallel High-Quality Hypergraph Partitioning

Autori: Robert Krause, Lars Gottesbüren, Nikolai Maas
Pubblicato in: 2025 Proceedings of the Conference on Applied and Computational Discrete Algorithms (ACDA), 2025, Pagina/e 222-236
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978759.17

Engineering Optimal Parallel Task Scheduling

Autori: Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
Pubblicato in: 2025 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2025, Pagina/e 168-180
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978339.14

Other (1)

A Simple yet Exact Analysis of the MultiQueue

Autori: Stefan Walzer, Marvin Williams
Pubblicato in: 2024
Editore: ArXiv
DOI: 10.48550/arxiv.2410.08714