![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Vadim Ryvchin
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c13]Aviad Cohen, Alexander Nadel
, Vadim Ryvchin:
Local Search with a SAT Oracle for Combinatorial Optimization. TACAS (2) 2021: 87-104
2010 – 2019
- 2018
- [c12]Alexander Nadel
, Vadim Ryvchin:
Chronological Backtracking. SAT 2018: 111-121 - 2016
- [c11]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) - [c10]Jonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz:
Hints Revealed. SAT 2015: 71-87 - [c9]Alexander Ivrii, Vadim Ryvchin, Ofer Strichman
:
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data. SAT 2015: 88-103 - 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) - [c8]Alexander Nadel
, Vadim Ryvchin, Ofer Strichman:
Ultimately Incremental SAT. SAT 2014: 206-218 - 2013
- [c7]Yakir Vizel, Vadim Ryvchin, Alexander Nadel
:
Efficient Generation of Small Interpolants in CNF. CAV 2013: 330-346 - [c6]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Efficient MUS extraction with resolution. FMCAD 2013: 197-200 - 2012
- [c5]Alexander Nadel
, Vadim Ryvchin:
Efficient SAT Solving under Assumptions. SAT 2012: 242-255 - [c4]Alexander Nadel
, Vadim Ryvchin, Ofer Strichman:
Preprocessing in Incremental SAT. SAT 2012: 256-269 - 2011
- [c3]Vadim Ryvchin, Ofer Strichman:
Faster Extraction of High-Level Minimal Unsatisfiable Cores. SAT 2011: 174-187 - 2010
- [c2]Alexander Nadel
, Vadim Ryvchin:
Assignment Stack Shrinking. SAT 2010: 375-381
2000 – 2009
- 2008
- [c1]Vadim Ryvchin, Ofer Strichman
:
Local Restarts. SAT 2008: 271-276
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint