1 – 31 of 31
- show: 250
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2024
-
Mark
Tight Security of TNT and Beyond : Attacks, Proofs and Possibilities for the Cascaded LRW Paradigm
2024) 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 14651 LNCS. p.249-279(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
End-to-End Verification for Subgraph Solving
2024) 38th AAAI Conference on Artificial Intelligence, AAAI 2024 In Proceedings of the AAAI Conference on Artificial Intelligence 38. p.8038-8047(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2023
-
Mark
Online and Approximate Network Construction from Bounded Connectivity Constraints
2023) In International Journal of Foundations of Computer Science(
- Contribution to journal › Article
-
Mark
Finding Small Complete Subgraphs Efficiently
2023) 34th International Workshop on Combinatorial Algorithms, IWOCA 2023 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13889 LNCS. p.185-196(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Minimal H-factors and covers
2023)(
- Working paper/Preprint › Preprint in preprint archive
-
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
Entire functions arising from trees
(
- Contribution to journal › Article
-
Mark
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
- 2020
-
Mark
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
(
- 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
-
Mark
The Phases of a Discrete Flow of Particles on Graphs
(
- Contribution to journal › Article
- 2019
-
Mark
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
(
- Contribution to journal › Article
-
Mark
A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
(
- Contribution to journal › Article
-
Mark
Shortest two disjoint paths in polynomial time
(
- Contribution to journal › Article
-
Mark
Approximate counting of K-paths : Deterministic and in polynomial space
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2018
-
Mark
Extensor-Coding
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Towards almost global synchronization on the Stiefel manifold
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Spotting Trees with Few Leaves
(
- Contribution to journal › Article
-
Mark
Distributed methods for synchronization of orthogonal matrices over graphs
(
- Contribution to journal › Article
- 2016
-
Mark
Studies in Efficient Discrete Algorithms
2016)(
- Thesis › Doctoral thesis (compilation)
- 2015
-
Mark
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- Contribution to journal › Article
-
Mark
Democratic Tone Mapping Using Optimal K-means Clustering
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Detecting and Counting Small Pattern Graphs
(
- Contribution to journal › Article
-
Mark
Finite Fields and Error-Correcting Codes - Lecture Notes in Mathematics
2015)(
- Other contribution › Miscellaneous
-
Mark
On the proper orientation number of bipartite graphs
(
- Contribution to journal › Article
- 2013
-
Mark
Intersecting longest paths
(
- Contribution to journal › Article
- 2011
-
Mark
Intersection of Longest Paths in a Graph
2011) Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011 In Electronic Notes in Discrete Mathematics 38. p.743-748(
- Contribution to journal › Article
- 1997
-
Mark
Estimation of escape probabilities for PPM based on universal source coding theory
1997) 1997 IEEE International Symposium on Information Theory, ISIT 1997 In IEEE International Symposium on Information Theory - Proceedings p.65-65(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding