default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Nadel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Dror Fried, Alexander Nadel, Roberto Sebastiani, Yogev Shalmon:
Entailing Generalization Boosts Enumeration. SAT 2024: 13:1-13:14- 2023
- [c32]Dror Fried, Alexander Nadel, Yogev Shalmon:
AllSAT for Combinational Circuits. SAT 2023: 9:1-9:18 - [c31]Alexander Nadel:
Solving Huge Instances with Intel(R) SAT Solver. SAT 2023: 17:1-17:12 - [e2]Alexander Nadel, Kristin Yvonne Rozier:
Formal Methods in Computer-Aided Design, FMCAD 2023, Ames, IA, USA, October 24-27, 2023. IEEE 2023, ISBN 978-3-85448-060-0 [contents] - 2022
- [c30]Alexander Nadel
:
Introducing Intel(R) SAT Solver. SAT 2022: 8:1-8:23 - 2021
- [c29]Aviad Cohen, Alexander Nadel, Vadim Ryvchin:
Local Search with a SAT Oracle for Combinatorial Optimization. TACAS (2) 2021: 87-104 - [e1]Alexander Nadel, Aina Niemetz:
Proceedings of the 19th International Workshop on Satisfiability Modulo Theories co-located with 33rd International Conference on Computer Aided Verification(CAV 2021), Online (initially located in Los Angeles, USA), July 18-19, 2021. CEUR Workshop Proceedings 2908, CEUR-WS.org 2021 [contents] - 2020
- [j3]Alexander Nadel:
Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT. J. Satisf. Boolean Model. Comput. 12(1): 17-22 (2020) - [c28]Alexander Nadel:
Anytime Algorithms for MaxSAT and Beyond. FMCAD 2020: 1 - [c27]Alexander Nadel:
On Optimizing a Generic Function in SAT. FMCAD 2020: 205-213
2010 – 2019
- 2019
- [c26]Alexander Nadel:
Anytime Weighted MaxSAT with Improved Polarity Selection and Bit-Vector Optimization. FMCAD 2019: 193-202 - 2018
- [c25]Alexander Nadel:
Solving MaxSAT with Bit-Vector Optimization. SAT 2018: 54-72 - [c24]Alexander Nadel, Vadim Ryvchin:
Chronological Backtracking. SAT 2018: 111-121 - 2017
- [c23]Alexander Nadel:
A Correct-by-Decision Solution for Simultaneous Place and Route. CAV (2) 2017: 436-452 - [c22]Yakir Vizel, Alexander Nadel, Sharad Malik:
Solving linear arithmetic with SAT-based model checking. FMCAD 2017: 47-54 - [c21]Yakir Vizel, Alexander Nadel, Sharad Malik:
Solving Constraints over Bit-Vectors with SAT-based Model Checking. SMT 2017: 101-107 - 2016
- [c20]Alexander Nadel:
Routing under constraints. FMCAD 2016: 125-132 - [c19]Alexander Nadel, Vadim Ryvchin:
Bit-Vector Optimization. TACAS 2016: 851-867 - 2015
- [j2]Yakir Vizel, Alexander Nadel, Vadim Ryvchin:
Efficient generation of small interpolants in CNF. Formal Methods Syst. Des. 47(1): 51-74 (2015) - [c18]Amit Erez, Alexander Nadel:
Finding Bounded Path in Graph Using SMT for Automatic Clock Routing. CAV (2) 2015: 20-36 - 2014
- [j1]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores. J. Satisf. Boolean Model. Comput. 9(1): 27-51 (2014) - [c17]Alexander Nadel:
Bit-Vector Rewriting with Automatic Rule Generation. CAV 2014: 663-679 - [c16]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Ultimately Incremental SAT. SAT 2014: 206-218 - 2013
- [c15]Yakir Vizel, Vadim Ryvchin, Alexander Nadel:
Efficient Generation of Small Interpolants in CNF. CAV 2013: 330-346 - [c14]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Efficient MUS extraction with resolution. FMCAD 2013: 197-200 - 2012
- [c13]Alexander Nadel, Vadim Ryvchin:
Efficient SAT Solving under Assumptions. SAT 2012: 242-255 - [c12]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Preprocessing in Incremental SAT. SAT 2012: 256-269 - 2011
- [c11]Zurab Khasidashvili, Alexander Nadel:
Implicative Simultaneous Satisfiability and Applications. Haifa Verification Conference 2011: 66-79 - [c10]Alexander Nadel:
Generating Diverse Solutions in SAT. SAT 2011: 287-301 - [i2]Nachum Dershowitz, Alexander Nadel:
From Total Assignment Enumeration to Modern SAT Solver. CoRR abs/1110.5867 (2011) - 2010
- [c9]Sabih Agbaria, Dan Carmi, Orly Cohen, Dmitry Korchemny, Michael Lifshits, Alexander Nadel:
SAT-based semiformal verification of hardware. FMCAD 2010: 25-32 - [c8]Anders Franzén, Alessandro Cimatti, Alexander Nadel, Roberto Sebastiani, Jonathan Shalev:
Applying SMT in symbolic execution of microcode. FMCAD 2010: 121-128 - [c7]Alexander Nadel:
Boosting minimal unsatisfiable core extraction. FMCAD 2010: 221-229 - [c6]Alexander Nadel, Vadim Ryvchin:
Assignment Stack Shrinking. SAT 2010: 375-381
2000 – 2009
- 2009
- [b1]Alexander Nadel:
Understanding and improving a modern SAT solver. Tel Aviv University, Israel, 2009 - 2007
- [c5]Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Ziyad Hanna, Alexander Nadel, Amit Palti, Roberto Sebastiani:
A Lazy and Layered SMT($\mathcal{BV}$) Solver for Hard Industrial Verification Problems. CAV 2007: 547-560 - [c4]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. SAT 2007: 287-293 - 2006
- [c3]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. SAT 2006: 36-41 - [i1]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. CoRR abs/cs/0605085 (2006) - 2005
- [c2]Zurab Khasidashvili, Alexander Nadel, Amit Palti, Ziyad Hanna:
Simultaneous SAT-Based Model Checking of Safety Properties. Haifa Verification Conference 2005: 56-75 - [c1]Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
A Clause-Based Heuristic for SAT Solvers. SAT 2005: 46-60
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-08-22 20:48 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:
