Dominik Schreiber

26 papers A* 1A 4B 3Journal 10Unranked 6
YearRankTypeTitle / Venue / Authors
2026 — conf
Massively Parallel Bit-Precise Verification with Bitwuzla and Mallob.
TACAS (1)
Dominik Schreiber, Aina Niemetz, Mathias Preiner
2026 — conf
Real-time Proof Checking for Distributed Incremental SAT Solving.
TACAS (1)
Dominik Schreiber, Mathias Fleury, Katalin Fazekas, Armin Biere
2025 J jnl
Distributed Incremental SAT Solving with Mallob: Report and Case Study with Hierarchical Planning.
CoRR
Dominik Schreiber
2025 A conf
Engineering Optimal Parallel Task Scheduling.
ALENEX
Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
2025 J jnl
On the dissertation "Scalable SAT Solving and its Application".
it Inf. Technol.
Dominik Schreiber
2025 J jnl
Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers.
J. Autom. Reason.
Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen
2025 A conf
Streamlining Distributed SAT Solver Design.
SAT
Dominik Schreiber, Niccolò Rigi-Luperti, Armin Biere
2024 B conf
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines.
SPAA
Matthew Akram, Dominik Schreiber
2024 J jnl
Engineering Optimal Parallel Task Scheduling.
CoRR
Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
2024 J jnl
MallobSat: Scalable SAT Solving by Clause Sharing.
J. Artif. Intell. Res.
Dominik Schreiber, Peter Sanders
2024 — conf
Scalable SAT Solving on Demand (Abstract).
HOPC@SPAA
Dominik Schreiber, Peter Sanders
2024 J jnl
The 2023 International Planning Competition.
AI Mag.
Ayal Taitler, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fiser, Michael Gimelfarb, Florian Pommerening, Scott Sanner, Enrico Scala, Dominik Schreiber, Javier Segovia-Aguas, Jendrik Seipp
2024 A conf
Trusted Scalable SAT Solving with On-The-Fly LRAT Checking.
SAT
Dominik Schreiber
2023 — —
Scalable SAT Solving and its Application
Dominik Schreiber
2023 — ch.
Skalierbares SAT Solving und dessen Anwendung.
Ausgezeichnete Informatikdissertationen
Dominik Schreiber
2023 — conf
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers.
TACAS (1)
Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen
2022 — conf
Decentralized Online Scheduling of Malleable NP-hard Jobs.
Euro-Par
Peter Sanders, Dominik Schreiber
2022 J jnl
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.
J. Open Source Softw.
Peter Sanders, Dominik Schreiber
2022 J jnl
Scalable SAT Solving in the Cloud.
CoRR
Dominik Schreiber, Peter Sanders
2021 J jnl
Lilotane: A Lifted SAT-based Approach to Hierarchical Planning.
J. Artif. Intell. Res.
Dominik Schreiber
2021 A conf
Scalable SAT Solving in the Cloud.
SAT
Dominik Schreiber, Peter Sanders
2019 — conf
Efficient SAT Encodings for Hierarchical Planning.
ICAART (2)
Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo
2019 B conf
Finding Optimal Longest Paths by Dynamic Programming in Parallel.
SOCS
Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
2019 J jnl
Finding Optimal Longest Paths by Dynamic Programming in Parallel.
CoRR
Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
2019 B conf
PASAR - Planning as Satisfiability with Abstraction Refinement.
SOCS
Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber
2019 A* conf
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning.
ICAPS
Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo