Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Vinyals
Person information
- affiliation: University of Auckland, New Zealand
- affiliation (former): Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. ITCS 2024: 48:1-48:20- 2023
- [j4]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Ryazanov, Alexander V. Smal, Marc Vinyals:
Irreducible Subcube Partitions. Electron. J. Comb. 30(3) (2023) - [j3]Yuval Filmus
, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. ACM Trans. Comput. Log. 24(1): 8:1-8:27 (2023) - [c18]Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. SAT 2023: 27:1-27:19 - [i15]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. CoRR abs/2302.06241 (2023) - [i14]Marc Vinyals, Chunxiao (Ian) Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. CoRR abs/2304.09422 (2023) - [i13]Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals:
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. CoRR abs/2305.19104 (2023) - [i12]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - [i11]Noah Fleming, Vijay Ganesh, Antonina Kolokolova, Chunxiao Li, Marc Vinyals:
Limits of CDCL Learning via Merge Resolution. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j2]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals:
Irreducible subcube partitions. CoRR abs/2212.14685: 1-38 (2022) - 2021
- [c17]Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
Complexity Measures on the Symmetric Group and Beyond (Extended Abstract). ITCS 2021: 87:1-87:5 - [c16]Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh:
On the Hierarchical Community Structure of Practical Boolean Formulas. SAT 2021: 359-376 - [i10]Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh:
On the Hierarchical Community Structure of Practical SAT Formulas. CoRR abs/2103.14992 (2021) - [i9]Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c15]Marc Vinyals:
Hard Examples for Common Variable Decision Heuristics. AAAI 2020: 1652-1659 - [c14]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS 2020: 24-30 - [c13]Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström:
Simplified and Improved Separations Between Regular and General Resolution by Lifting. SAT 2020: 182-200 - [c12]Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh:
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. SAT 2020: 233-249 - [c11]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. SAT 2020: 295-311 - [i8]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR abs/2001.02144 (2020) - [i7]Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh:
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers. CoRR abs/2003.02323 (2020) - [i6]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. CoRR abs/2005.11589 (2020) - [i5]Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
Complexity Measures on the Symmetric Group and Beyond. CoRR abs/2010.07405 (2020) - [i4]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c10]Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals:
Equality Alone Does not Simulate Randomness. CCC 2019: 14:1-14:11 - 2018
- [c9]Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals:
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. SAT 2018: 75-93 - [c8]Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström:
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. SAT 2018: 292-310 - [i3]Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals:
Equality Alone Does Not Simulate Randomness. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Marc Vinyals:
Space in Proof Complexity. Royal Institute of Technology, Stockholm, Sweden, 2017 - [c7]Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
Cumulative Space in Black-White Pebbling and Resolution. ITCS 2017: 38:1-38:21 - [c6]Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals:
CNFgen: A Generator of Crafted Benchmarks. SAT 2017: 464-473 - 2016
- [c5]Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). FOCS 2016: 295-304 - [c4]Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals:
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. SAT 2016: 160-176 - 2015
- [j1]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. ACM Trans. Comput. Log. 16(4): 28:1-28:15 (2015) - [c3]Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals:
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. FOCS 2015: 466-485 - 2014
- [c2]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. STACS 2014: 300-311 - [i2]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. CoRR abs/1409.2978 (2014) - [i1]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c1]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). ICALP (1) 2013: 437-448
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-01-25 19:53 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:
