1 – 9 of 9
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2024
-
Mark
Perpetual maintenance of machines with different urgency requirements
(
- Contribution to journal › Article
- 2023
-
Mark
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
2023) In International Journal of Foundations of Computer Science(
- Contribution to journal › Article
- 2022
-
Mark
Perpetual maintenance of machines with different urgency requirements
2022)(
- Book/Report › Report
-
Mark
Lower bounds for Boolean circuits of bounded negation width
(
- Contribution to journal › Article
- 2018
-
Mark
Forest-like abstract Voronoi diagrams in linear time
(
- 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
Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
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.401-411(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Determining the consistency of resolved triplets and fan triplets
2017) 21st Annual International Conference on Research in Computational Molecular Biology, RECOMB 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10229 LNCS. p.82-98(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2015
-
Mark
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
(
- Contribution to journal › Article