Skip to main content
Go to the home page of the European Commission (opens in new window)
English English
CORDIS - EU research results
CORDIS

Engineering Scalable Algorithms for the Basic Toolbox ScAlBox

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Weighted Embeddings for Low-Dimensional Graph Representation (opens in new window)

Author(s): Thomas Bläsius, Jean-Pierre Von der Heydt, Maximilian Katzmann, Nikolai Maas
Published in: Proceedings of the AAAI Conference on Artificial Intelligence, Issue 39, 2025, Page(s) 15587-15595, ISSN 2374-3468
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v39i15.33711

Lilotane : A Lifted SAT-based Approach to Hierarchical Planning (opens in new window)

Author(s): Schreiber, Dominik
Published in: Journal of Artificial Intelligence Research, Issue 70, 2021, Page(s) 1117–1181, ISSN 1076-9757
Publisher: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12520

The 2023 International Planning Competition (opens in new window)

Author(s): 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
Published in: AI Magazine, Issue 45, 2024, Page(s) 280-296, ISSN 0738-4602
Publisher: American Association for Artificial Intelligence (AAAI) Press
DOI: 10.1002/aaai.12169

MallobSat: Scalable SAT Solving by Clause Sharing (opens in new window)

Author(s): Dominik Schreiber, Peter Sanders
Published in: Journal of Artificial Intelligence Research, Issue 80, 2024, Page(s) 1437-1495, ISSN 1076-9757
Publisher: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.15827

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling (opens in new window)

Author(s): Sanders, Peter; Schreiber, Dominik
Published in: Journal of Open Source Software, Issue 7(76), 2022, Page(s) 4591, ISSN 2475-9066
Publisher: JOSS
DOI: 10.21105/joss.04591

More Recent Advances in (Hyper)Graph Partitioning (opens in new window)

Author(s): Ç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
Published in: ACM Computing Surveys, Issue Volume 55, Issue 12, 2022, Page(s) 1--38, ISSN 0360-0300
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3571808

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions (opens in new window)

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

Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI (opens in new window)

Author(s): Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl
Published in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Page(s) 289-291
Publisher: ACM
DOI: 10.1145/3626183.3660260

Linear-Time Multilevel Graph Partitioning (opens in new window)

Author(s): Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier
Published in: 2025
Publisher: LIPIcs
DOI: 10.4230/lipics.esa.2025.32

Faster Block Tree Construction (opens in new window)

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

A Simple yet Exact Analysis of the MultiQueue (opens in new window)

Author(s): Stefan Walzer, Marvin Williams
Published in: 2025
Publisher: LIPIcs
DOI: 10.4230/lipics.esa.2025.85

A Sweep-Plane Algorithm for Calculating the Isolation of Mountains (opens in new window)

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

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers (opens in new window)

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

Distributed Deep Multilevel Graph Partitioning (opens in new window)

Author(s): Sanders, Peter; Seemaier, Daniel
Published in: Euro-Par 2023: Parallel Processing, Issue 29, 2023, Page(s) 443-457
Publisher: Springer
DOI: 10.1007/978-3-031-39698-4_30

Tera-Scale Multilevel Graph Partitioning (opens in new window)

Author(s): Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren, Peter Sanders
Published in: 2025 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2025, Page(s) 285-296
Publisher: IEEE
DOI: 10.1109/ipdps64566.2025.00033

Engineering a Distributed-Memory Triangle Counting Algorithm (opens in new window)

Author(s): Sanders, Peter; Uhl, Tim Niklas
Published in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Issue 5, 2023, Page(s) 702-712, ISBN 979-8-3503-3767-9
Publisher: IEEE
DOI: 10.1109/ipdps54959.2023.00076

Scalable SAT Solving on Demand (Abstract) (opens in new window)

Author(s): Dominik Schreiber, Peter Sanders
Published in: Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024, Page(s) 11-12
Publisher: ACM
DOI: 10.1145/3670684.3673414

Engineering MultiQueues: Fast relaxed concurrent priority queues (opens in new window)

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

Scalable SAT Solving in the Cloud (opens in new window)

Author(s): Schreiber, Dominik; Sanders, Peter
Published in: Theory and Applications of Satisfiability Testing – SAT 2021, Issue 24, 2021, Page(s) 518-534, ISBN 978-3-030-80223-3
Publisher: Springer
DOI: 10.1007/978-3-030-80223-3_35

Trusted Scalable SAT Solving with On-The-Fly LRAT Checking (opens in new window)

Author(s): Dominik Schreiber
Published in: 2024
Publisher: Schloss Dagstuhl – Leibniz Zentrum für Informatik
DOI: 10.4230/lipics.sat.2024.25

PaCHash: Packed and Compressed Hash Tables (opens in new window)

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

Deep multilevel graph partitioning (opens in new window)

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

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

Author(s): Schreiber, Dominik
Published in: Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions, 2023, Page(s) 46-47
Publisher: University of Helsinki

Bit-Parallel (Compressed) Wavelet Tree (opens in new window)

Author(s): Dinklage, Patrick; Fischer, Johannes; Kurpicz, Florian; Tarnowski, Jan-Philipp
Published in: 2023 Data Compression Conference (DCC), 2023, Page(s) 81-90, ISBN 979-8-3503-4795-1
Publisher: IEEE
DOI: 10.1109/dcc55655.2023.00016

Exploring Parallel MPI Fault Tolerance Mechanisms for Phylogenetic Inference with RAxML-NG. (opens in new window)

Author(s): Lukas Hübner; Alexey M. Kozlov; Demian Hespe; Peter Sanders; Alexandros Stamatakis; Alexandros Stamatakis
Published in: ISSN: 1367-4803, 1460-2059, Issue 1, 2021
Publisher: Oxford University Press
DOI: 10.1093/bioinformatics/btab399

Fast and Lightweight Distributed Suffix Array Construction (opens in new window)

Author(s): Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek
Published in: 2025
Publisher: LIPIcs
DOI: 10.4230/lipics.esa.2025.47

Scalable Distributed String Sorting (opens in new window)

Author(s): Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Published in: 2024
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2024.83

Brief Announcement: Scalable Distributed String Sorting (opens in new window)

Author(s): Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek
Published in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Page(s) 375-377
Publisher: ACM
DOI: 10.1145/3626183.3660256

Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines (opens in new window)

Author(s): Matthew Akram, Dominik Schreiber
Published in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Page(s) 137-139
Publisher: ACM
DOI: 10.1145/3626183.3660268

Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors (opens in new window)

Author(s): Kurpicz, Florian
Published in: Proceedings of the Twenty-Ninth International Symposium on String Processing and Information Retrieval (SPIRE), 2022, Page(s) 257–272, ISBN 978-3-031-20642-9
Publisher: Springer
DOI: 10.1007/978-3-031-20643-6_19

Engineering Massively Parallel MST Algorithms (opens in new window)

Author(s): Sanders, Peter; Schimek, Matthias
Published in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Issue 5, 2023, Page(s) 691-701, ISBN 979-8-3503-3767-9
Publisher: IEEE
DOI: 10.1109/ipdps54959.2023.00075

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing (opens in new window)

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

KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI (opens in new window)

Author(s): Tim Niklas Uhl, Matthias Schimek, Lukas Hübner, Demian Hespe, Florian Kurpicz, Daniel Seemaier, Christoph Stelz, Peter Sanders
Published in: SC24: International Conference for High Performance Computing, Networking, Storage and Analysis, 2024, Page(s) 1-21
Publisher: IEEE
DOI: 10.1109/sc41406.2024.00050

Decentralized Online Scheduling of Malleable NP-hard Jobs (opens in new window)

Author(s): Sanders, Peter; Schreiber, Dominik
Published in: Euro-Par 2022: Parallel Processing, Issue 13440, 2022, Page(s) 119-135, ISBN 978-3-031-12596-6
Publisher: Springer
DOI: 10.1007/978-3-031-12597-3_8

Buffered Streaming Edge Partitioning (opens in new window)

Author(s): Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier
Published in: 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.sea.2024.5

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning (opens in new window)

Author(s): Peter Sanders, Daniel Seemaier
Published in: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024, Page(s) 443-445
Publisher: ACM
DOI: 10.1145/3626183.3660257

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms (opens in new window)

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

Concepts for Designing Modern C++ Interfaces for MPI (opens in new window)

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

Parallel Unconstrained Local Search for Partitioning Irregular Graphs (opens in new window)

Author(s): Nikolai Maas, Lars Gottesbüren, Daniel Seemaier
Published in: 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2024, Page(s) 32-45
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977929.3

Deterministic Parallel High-Quality Hypergraph Partitioning (opens in new window)

Author(s): Robert Krause, Lars Gottesbüren, Nikolai Maas
Published in: 2025 Proceedings of the Conference on Applied and Computational Discrete Algorithms (ACDA), 2025, Page(s) 222-236
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978759.17

Engineering Optimal Parallel Task Scheduling (opens in new window)

Author(s): Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
Published in: 2025 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2025, Page(s) 168-180
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978339.14

A Simple yet Exact Analysis of the MultiQueue (opens in new window)

Author(s): Stefan Walzer, Marvin Williams
Published in: 2024
Publisher: ArXiv
DOI: 10.48550/arxiv.2410.08714

Searching for OpenAIRE data...

There was an error trying to search data from OpenAIRE

No results available

My booklet 0 0