default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominik Schreiber 0001
Person information
- affiliation: Karlsruher Institut für Technologie, Germany
Other persons with the same name
- Dominik Schreiber 0002 — TU Darmstadt, Distributed Multimedia Systems, Germany
- Dominik-Philip Schreiber (aka: Dominik Schreiber 0003) — SBA Research, Vienna, Austria
- Dominik Schreiber 0004 — Fraunhofer EMI / IOSB / IVI, Dresden, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]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:
The 2023 International Planning Competition. AI Mag. 45(2): 280-296 (2024)- [j3]Dominik Schreiber, Peter Sanders:
MallobSat: Scalable SAT Solving by Clause Sharing. J. Artif. Intell. Res. 80: 1437-1495 (2024) - [c10]Dominik Schreiber, Peter Sanders:
Scalable SAT Solving on Demand (Abstract). HOPC@SPAA 2024 - [c9]Dominik Schreiber:
Trusted Scalable SAT Solving with On-The-Fly LRAT Checking. SAT 2024: 25:1-25:19 - [c8]Matthew Akram, Dominik Schreiber:
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines. SPAA 2024: 137-139 - [i3]Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber:
Engineering Optimal Parallel Task Scheduling. CoRR abs/2405.15371 (2024) - 2023
- [b1]Dominik Schreiber:
Scalable SAT Solving and its Application. Karlsruhe University, Germany, 2023 - [c7]Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen:
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. TACAS (1) 2023: 348-366 - 2022
- [j2]Peter Sanders, Dominik Schreiber:
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. J. Open Source Softw. 7(77): 4591 (2022) - [c6]Peter Sanders, Dominik Schreiber:
Decentralized Online Scheduling of Malleable NP-hard Jobs. Euro-Par 2022: 119-135 - [d1]Dominik Schreiber, Peter Sanders:
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. Zenodo, 2022
- [i2]Dominik Schreiber, Peter Sanders:
Scalable SAT Solving in the Cloud. CoRR abs/2205.06590 (2022) - 2021
- [j1]Dominik Schreiber:
Lilotane: A Lifted SAT-based Approach to Hierarchical Planning. J. Artif. Intell. Res. 70: 1117-1181 (2021) - [c5]Dominik Schreiber, Peter Sanders:
Scalable SAT Solving in the Cloud. SAT 2021: 518-534
2010 – 2019
- 2019
- [c4]Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo:
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. ICAPS 2019: 382-390 - [c3]Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo:
Efficient SAT Encodings for Hierarchical Planning. ICAART (2) 2019: 531-538 - [c2]Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS 2019: 61-69 - [c1]Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber:
PASAR - Planning as Satisfiability with Abstraction Refinement. SOCS 2019: 70-78 - [i1]Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. CoRR abs/1905.03645 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-17 01:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
