31 – 40 of 456
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
2021) 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12601 LNCS. p.440-451(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)
(
- Contribution to journal › Article
-
Mark
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
(
- Contribution to journal › Article
-
Mark
Modular counting of subgraphs : Matchings, matching-splittable graphs, and paths
2021) 29th Annual European Symposium on Algorithms, ESA 2021 In Leibniz International Proceedings in Informatics, LIPIcs 204.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The power of negative reasoning
2021) 36th Computational Complexity Conference, CCC 2021 In Leibniz International Proceedings in Informatics, LIPIcs 200.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2020
-
Mark
A framework to generate domain-specific manycore architectures from dataflow programs
(
- Contribution to journal › Article
-
Mark
Graphs with equal domination and covering numbers
(
- Contribution to journal › Article
-
Mark
Using Resolution Proofs to Analyse CDCL Solvers
2020) 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 In Lecture Notes in Computer Science 12333. p.427-444(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
2020) 35th Computational Complexity Conference, CCC 2020 In Leibniz International Proceedings in Informatics, LIPIcs 169.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Simplified and Improved Separations Between Regular and General Resolution by Lifting
2020) 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 In Lecture Notes in Computer Science 12178. p.182-200(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding