Oliver Kullmann

72 papers A* 1A 16B 2C 1Journal 39Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Simple minimally unsatisfiable subsets of 2-CNFs. CoRR Oliver Kullmann, Edward Clewer
2024	J	`jnl`	Optimized massively parallel solving of N-Queens on GPGPUs. Concurr. Comput. Pract. Exp. Filippos Pantekis, Phillip James, Oliver Kullmann, Liam O'Reilly
2023	—	`conf`	Transforming Quantified Boolean Formulas Using Biclique Covers. TACAS (2) Oliver Kullmann, Ankit Shukla
2022	—	`conf`	Scalable N-Queens Solving on GPGPUs via Interwarp Collaborations. CANDAR Filippos Pantekis, Phillip James, Oliver Kullmann
2021	—	`ch.`	Fundaments of Branching Heuristics. Handbook of Satisfiability Oliver Kullmann
2021	—	`ch.`	Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability Hans Kleine Büning, Oliver Kullmann
2021	A	`conf`	Projection Heuristics for Binary Branchings Between Sum and Product. SAT Oliver Kullmann, Oleg Zaikin
2020	J	`jnl`	Classification of minimally unsatisfiable 2-CNFs. CoRR Hoda Abbasizanjani, Oliver Kullmann
2019	B	`conf`	Autarkies for DQCNF. FMCAD Oliver Kullmann, Ankit Shukla
2019	J	`jnl`	Introducing Autarkies for DQCNF. CoRR Oliver Kullmann, Ankit Shukla
2019	A	`conf`	On Computing the Union of MUSes. SAT Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva
2018	—	`ch.`	Cube-and-Conquer for Satisfiability. Handbook of Parallel Constraint Reasoning Marijn J. H. Heule, Oliver Kullmann, Armin Biere
2018	A	`conf`	Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. SAT Hoda Abbasizanjani, Oliver Kullmann
2017	A*	`conf`	Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method. IJCAI Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
2017	J	`jnl`	The science of brute force. Commun. ACM Marijn J. H. Heule, Oliver Kullmann
2016	J	`jnl`	Minimal unsatisfiability and deficiency: recent developments. CoRR Oliver Kullmann
2016	A	`conf`	Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. SAT Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
2016	J	`jnl`	Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer. CoRR Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
2016	J	`jnl`	Unsatisfiable hitting clause-sets with three more clauses than variables. CoRR Oliver Kullmann, Xishun Zhao
2015	A	`conf`	Computing Maximal Autarkies with Few and Simple Oracle Queries. SAT Oliver Kullmann, João Marques-Silva
2015	J	`jnl`	Computing maximal autarkies with few and simple oracle queries. CoRR Oliver Kullmann, João Marques-Silva
2015	J	`jnl`	Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. CoRR Oliver Kullmann, Xishun Zhao
2014	J	`jnl`	A framework for good SAT translations, with applications to CNF representations of XOR constraints. CoRR Matthew Gwynne, Oliver Kullmann
2014	J	`jnl`	Bounds for variables with few occurrences in conjunctive normal forms. CoRR Oliver Kullmann, Xishun Zhao
2014	J	`jnl`	Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution. J. Autom. Reason. Matthew Gwynne, Oliver Kullmann
2014	C	`conf`	On SAT Representations of XOR Constraints. LATA Matthew Gwynne, Oliver Kullmann
2014	J	`jnl`	On the van der Waerden numbers w(2; 3, t). Discret. Appl. Math. Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily
2014	A	`conf`	Unified Characterisations of Resolution Hardness Measures. SAT Olaf Beyersdorff, Oliver Kullmann
2013	B	`conf`	Generalising and Unifying SLUR and Unit-Refutation Completeness. SOFSEM Matthew Gwynne, Oliver Kullmann
2013	J	`jnl`	Hardness measures and resolution lower bounds. CoRR Oliver Kullmann
2013	J	`jnl`	On Davis-Putnam reductions for minimally unsatisfiable clause-sets. Theor. Comput. Sci. Oliver Kullmann, Xishun Zhao
2013	J	`jnl`	On SAT representations of XOR constraints. CoRR Matthew Gwynne, Oliver Kullmann
2013	J	`jnl`	Towards a theory of good SAT representations CoRR Matthew Gwynne, Oliver Kullmann
2013	J	`jnl`	Trading inference effort versus size in CNF Knowledge Compilation. CoRR Matthew Gwynne, Oliver Kullmann
2012	J	`jnl`	Generalising unit-refutation completeness and SLUR via nested input resolution CoRR Matthew Gwynne, Oliver Kullmann
2012	A	`conf`	On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT Oliver Kullmann, Xishun Zhao
2012	J	`jnl`	On Davis-Putnam reductions for minimally unsatisfiable clause-sets CoRR Oliver Kullmann, Xishun Zhao
2012	J	`jnl`	SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer
2011	J	`jnl`	Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency. Fundam. Informaticae Oliver Kullmann
2011	J	`jnl`	Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. Fundam. Informaticae Oliver Kullmann
2011	J	`jnl`	Constraint satisfaction problems in clausal form CoRR Oliver Kullmann
2011	—	`conf`	Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. Haifa Verification Conference Marijn Heule, Oliver Kullmann, Siert Wieringa, Armin Biere
2011	A	`conf`	On Variables with Few Occurrences in Conjunctive Normal Forms. SAT Oliver Kullmann, Xishun Zhao
2011	J	`jnl`	On the van der Waerden numbers w(2;3,t) CoRR Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily
2010	J	`jnl`	Exact Ramsey Theory: Green-Tao numbers and SAT CoRR Oliver Kullmann
2010	A	`conf`	Green-Tao Numbers and SAT. SAT Oliver Kullmann
2010	J	`jnl`	On variables with few occurrences in conjunctive normal forms CoRR Oliver Kullmann, Xishun Zhao
2010	A	`conf`	The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce
2009	—	`ch.`	Fundaments of Branching Heuristics. Handbook of Satisfiability Oliver Kullmann
2009	—	`ch.`	Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability Hans Kleine Büning, Oliver Kullmann
2009	A	`ed.`	Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings SAT Oliver Kullmann
2008	—	`conf`	Present and Future of Practical SAT Solving. Complexity of Constraints Oliver Kullmann
2007	J	`jnl`	Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. Electron. Colloquium Comput. Complex. Oliver Kullmann
2007	A	`conf`	Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. SAT Oliver Kullmann
2006	A	`conf`	Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. SAT Oliver Kullmann, Inês Lynce, João Marques-Silva
2006	—	`conf`	Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. Complexity of Constraints Oliver Kullmann
2006	J	`jnl`	The SAT 2005 Solver Competition on Random Instances. J. Satisf. Boolean Model. Comput. Oliver Kullmann
2004	A	`conf`	Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT Nicola Galesi, Oliver Kullmann
2004	—	`conf`	Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers Nicola Galesi, Oliver Kullmann
2004	J	`jnl`	Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. Ann. Math. Artif. Intell. Oliver Kullmann
2003	J	`jnl`	Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. Discret. Appl. Math. Oliver Kullmann
2003	A	`conf`	The Combinatorics of Conflicts between Clauses. SAT Oliver Kullmann
2002	J	`jnl`	Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. Herbert Fleischner, Oliver Kullmann, Stefan Szeider
2001	J	`jnl`	On the use of autarkies for satisfiability decision. Electron. Notes Discret. Math. Oliver Kullmann
2000	A	`conf`	An Application of Matroid Theory to the SAT Problem. CCC Oliver Kullmann
2000	J	`jnl`	An application of matroid theory to the SAT problem Electron. Colloquium Comput. Complex. Oliver Kullmann
2000	—	`conf`	An improved version of width restricted resolution. AI&M Oliver Kullmann
2000	J	`jnl`	Investigations on autark assignments. Discret. Appl. Math. Oliver Kullmann
1999	J	`jnl`	Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs Electron. Colloquium Comput. Complex. Oliver Kullmann
1999	J	`jnl`	New Methods for 3-SAT Decision and Worst-case Analysis. Theor. Comput. Sci. Oliver Kullmann
1999	J	`jnl`	On a Generalization of Extended Resolution. Discret. Appl. Math. Oliver Kullmann
1997	—	`—`	Das SAT-Problem: ein systematischer Ansatz für effiziente Algorithmen zum aussagenlogischen Erfüllbarkeitsproblem, ausgehend von neuen Instrumenten der "worst case"-Analyse. Oliver Kullmann

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.