default search action
Mate Soos
Person information
- affiliation: Ethereum Foundation, Berlin, Germany
- affiliation (former): National University of Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c21]Yong Kiam Tan
, Jiong Yang
Formally Certified Approximate Model Counting. CAV (1) 2024: 153-177 - [c20]Dxo, Mate Soos, Zoe Paraskevopoulou, Martin Lundfall, Mikael Brockman:
Hevm, a Fast Symbolic Execution Framework for EVM Bytecode. CAV (1) 2024: 453-465 - [c19]Mate Soos
Engineering an Efficient Preprocessor for Model Counting. DAC 2024: 108:1-108:6 - [i7]Yong Kiam Tan, Jiong Yang, Mate Soos, Magnus O. Myreen, Kuldeep S. Meel:
Formally Certified Approximate Model Counting. CoRR abs/2406.11414 (2024) - [i6]Mate Soos, Uddalok Sarkar, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski:
Engineering an Efficient Approximate DNF-Counter. CoRR abs/2407.19946 (2024) - 2023
- [c18]Renzo Roel Perez Tan
The Pancake Graph of Order 10 Is 4-Colorable. ICoMS 2023: 1-6 - [c17]Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski:
Engineering an Efficient Approximate DNF-Counter. IJCAI 2023: 2031-2038 - [c16]Markus Anders, Pascal Schweitzer
Algorithms Transcending the SAT-Symmetry Interface. SAT 2023: 1:1-1:21 - [c15]Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel:
Explaining SAT Solving Using Causal Reasoning. SAT 2023: 28:1-28:19 - [i5]Mate Soos, Randal E. Bryant:
Proof Generation for CDCL Solvers Using Gauss-Jordan Elimination. CoRR abs/2304.04292 (2023) - [i4]Markus Anders, Pascal Schweitzer, Mate Soos:
Algorithms Transcending the SAT-Symmetry Interface. CoRR abs/2306.00613 (2023) - [i3]Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel:
Explaining SAT Solving Using Causal Reasoning. CoRR abs/2306.06294 (2023) - 2022
- [c14]Mate Soos, Priyanka Golia, Sourav Chakraborty, Kuldeep S. Meel:
On Quantitative Testing of Samplers. CP 2022: 36:1-36:16 - [c13]Mate Soos, Kuldeep S. Meel:
Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling. ICCAD 2022: 71:1-71:9 - 2021
- [c12]Priyanka Golia, Mate Soos, Sourav Chakraborty, Kuldeep S. Meel:
Designing Samplers is Easy: The Boon of Testers. FMCAD 2021: 222-230 - [c11]Mate Soos, Kuldeep S. Meel:
Gaussian Elimination Meets Maximum Satisfiability. KR 2021: 581-587 - [c10]Nicolas Prevot, Mate Soos, Kuldeep S. Meel:
Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving. SAT 2021: 471-487 - [i2]Mate Soos, Kuldeep S. Meel:
Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling. CoRR abs/2110.09026 (2021) - 2020
- [c9]Mate Soos, Stephan Gocht, Kuldeep S. Meel:
Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. CAV (1) 2020: 463-484
2010 – 2019
- 2019
- [c8]Mate Soos, Kuldeep S. Meel:
BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting. AAAI 2019: 1592-1599 - [c7]Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel:
Bosphorus: Bridging ANF and CNF Solvers. DATE 2019: 468-473 - [c6]Shubham Sharma
GANAK: A Scalable Probabilistic Exact Model Counter. IJCAI 2019: 1169-1176 - [c5]Mate Soos, Raghav Kulkarni, Kuldeep S. Meel:
CrystalBall: Gazing in the Black Box of SAT Solving. SAT 2019: 371-387 - 2018
- [i1]Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel:
BOSPHORUS: Bridging ANF and CNF Solvers. CoRR abs/1812.04580 (2018) - 2012
- [c4]Vijay Ganesh
Lynx: A Programmatic SAT Solver for the RNA-Folding Problem. SAT 2012: 143-156 - 2011
- [c3]Manuel San Pedro, Mate Soos, Sylvain Guilley:
FIRE: Fault Injection for Reverse Engineering. WISTP 2011: 280-293 - 2010
- [c2]Mate Soos:
Enhanced Gaussian Elimination in DPLL-based SAT Solvers. POS@SAT 2010: 2-14
2000 – 2009
- 2009
- [c1]Mate Soos, Karsten Nohl, Claude Castelluccia:
Extending SAT Solvers to Cryptographic Problems. SAT 2009: 244-257
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-12-02 21:33 CET 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: