1 – 10 of 24
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
The fine-grained complexity of computing the tutte polynomial of a linear matroid
2021) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms p.2333-2345(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2019
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Contribution to journal › Article
-
Mark
Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
2019) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 In Leibniz International Proceedings in Informatics (LIPIcs) 132. p.1-26(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting thin subgraphs via packings faster than meet-in-the-middle time
(
- Contribution to journal › Article
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 2016
-
Mark
How Proofs are Prepared at Camelot
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Constrained Multilinear Detection and Generalized Graph Motifs
(
- Contribution to journal › Article