default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 2024
- Dominik Schreiber:
Trusted Scalable SAT Solving with On-The-Fly LRAT Checking. SAT 2024: 25:1-25:19 - Christoph Scholl, Tobias Seufert, Fabian Siegwolf:
Hierarchical Stochastic SAT and Quality Assessment of Logic Locking. SAT 2024: 24:1-24:22 - Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn J. H. Heule, Bruno Dutertre:
Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving. SAT 2024: 29:1-29:18 - Markus Anders, Sofia Brenner
, Gaurav Rattan:
Satsuma: Structure-Based Symmetry Breaking in SAT. SAT 2024: 4:1-4:23 - Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche:
The Relative Strength of #SAT Proof Systems. SAT 2024: 5:1-5:19 - Armin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks:
Clausal Congruence Closure. SAT 2024: 6:1-6:25 - Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria:
MaxSAT Resolution with Inclusion Redundancy. SAT 2024: 7:1-7:15 - Yi Chu, Chu-Min Li, Furong Ye, Shaowei Cai:
Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme. SAT 2024: 8:1-8:18 - Alexis de Colnet:
On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF. SAT 2024: 11:1-11:21 - Robin Coutelier, Mathias Fleury, Laura Kovács:
Lazy Reimplication in Chronological Backtracking. SAT 2024: 9:1-9:19 - Yogesh Dahiya, Meena Mahajan, Sasank Mouli:
New Lower Bounds for Polynomial Calculus over Non-Boolean Bases. SAT 2024: 10:1-10:20 - Daniel Faber, Adalat Jabrayilov, Petra Mutzel:
SAT Encoding of Partial Ordering Models for Graph Coloring Problems. SAT 2024: 12:1-12:20 - Dror Fried, Alexander Nadel, Roberto Sebastiani, Yogev Shalmon:
Entailing Generalization Boosts Enumeration. SAT 2024: 13:1-13:14 - Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Cooking String-Integer Conversions with Noodles. SAT 2024: 14:1-14:19 - Lukás Holík, Pavol Vargovcík:
Antichain with SAT and Tries. SAT 2024: 15:1-15:24 - Alexey Ignatiev, Zi Li Tan, Christos Karamanos:
Towards Universally Accessible SAT Technology. SAT 2024: 16:1-16:11 - Yoichiro Iida, Tomohiro Sonobe, Mary Inaba:
Parallel Clause Sharing Strategy Based on Graph Structure of SAT Problem. SAT 2024: 17:1-17:18 - Markus Iser, Christoph Jabs:
Global Benchmark Database. SAT 2024: 18:1-18:10 - Dmitry Itsykson, Sergei Ovcharov:
On Limits of Symbolic Approach to SAT Solving. SAT 2024: 19:1-19:22 - Leszek Aleksander Kolodziejczyk, Neil Thapen:
The Strength of the Dominance Rule. SAT 2024: 20:1-20:22 - Jean-Marie Lagniez, Pierre Marquis, Armin Biere:
Dynamic Blocked Clause Elimination for Projected Model Counting. SAT 2024: 21:1-21:17 - Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Rui Zhao:
Speeding up Pseudo-Boolean Propagation. SAT 2024: 22:1-22:18 - Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
eSLIM: Circuit Minimization with SAT Based Local Improvement. SAT 2024: 23:1-23:14 - Martina Seidl:
Models and Counter-Models of Quantified Boolean Formulas (Invited Talk). SAT 2024: 1:1-1:7 - Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. SAT 2024: 26:1-26:18 - Hadar Shavit, Holger H. Hoos:
Revisiting SATZilla Features in 2024. SAT 2024: 27:1-27:26 - Friedrich Slivovsky:
Strategy Extraction by Interpolation. SAT 2024: 28:1-28:20 - Cesare Tinelli:
Scalable Proof Production and Checking in SMT (Invited Talk). SAT 2024: 2:1-2:2 - Moshe Y. Vardi:
Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk). SAT 2024: 3:1-3:1 - Front Matter, Table of Contents, Preface, Conference Organization. SAT 2024: 0:i-0:xviii
skipping 3 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2025-01-05 20:40 CET from data curated 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:
