11 – 20 of 36
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Clique Is Hard on Average for Unary Sherali-Adams
(2023) 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS p.12-25
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2022
-
Mark
Polarised random k-SAT
(2022)
- Working paper/Preprint › Preprint in preprint archive
-
Mark
The shortest even cycle problem is tractable
(2022) 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 In Proceedings of the Annual ACM Symposium on Theory of Computing p.117-130
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Graphical modeling of stochastic processes driven by correlated noise
- Contribution to journal › Article
- 2021
-
Mark
Clique Is Hard on Average for Regular Resolution
- Contribution to journal › Article
-
Mark
Entire functions arising from trees
- Contribution to journal › Article
- 2020
-
Mark
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
- Contribution to journal › Article
-
Mark
The Phases of a Discrete Flow of Particles on Graphs
- Contribution to journal › Article
-
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
- 2019
-
Mark
Approximate counting of K-paths : Deterministic and in polynomial space
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
