1 – 8 of 8
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
(
- Contribution to journal › Article
- 2019
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
(
- Contribution to journal › Article
- 2018
-
Mark
3D Rectangulations and Geometric Matrix Multiplication
(
- Contribution to journal › Article
- 2017
-
Mark
Bounds for semi-disjoint bilinear forms in a unit-cost computational model
2017) 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10185 LNCS. p.412-424(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
2017) 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10167 LNCS. p.217-227(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
3D Rectangulations and Geometric Matrix Multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficiently Correcting Matrix Products
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article