11 – 20 of 137
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 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
Lower Bounds for Monotone q-Multilinear Boolean Circuits
(2023) 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13878 LNCS. p.301-312
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On parallel time in population protocols
- Contribution to journal › Article
- 2022
-
Mark
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs
(2022) 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13179 LNCS. p.140-151
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
- Contribution to journal › Article
-
Mark
Perpetual maintenance of machines with different urgency requirements
(2022)
- Book/Report › Report
-
Mark
Efficient Assignment of Identities in Anonymous Populations
(2022) 25th International Conference on Principles of Distributed Systems (OPODIS 2021) In Leibniz International Proceedings in Informatics (LIPIcs) 217. p.1-21
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Lower bounds for Boolean circuits of bounded negation width
- Contribution to journal › Article
- 2021
-
Mark
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
- Contribution to journal › Article
-
Mark
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
(2021) 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12601 LNCS. p.440-451
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
