Department of Computer Science
281 – 290 of 1729
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
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
-
Mark
Exploring grounded theory perspectives of cognitive load in software engineering
2021)(
- Thesis › Licentiate thesis
-
Mark
Open source languages and methods for cyber-physical system development : Overview and case studies
(
- Contribution to journal › Article
-
Mark
Automating algebraic proof systems is NP-hard
2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Test automation with grad-CAM Heatmaps - A future pipe segment in MLOps for Vision AI?
2021) 14th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2021 p.175-181(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Progger: Programming by Errors (Work In Progress)
2021) Psychology of Programming Interest Group Annual Workshop 2021(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Yttrande över Europeiska kommissionens förslag till förordning om harmoniserade regler för artificiell intelligens
2021)(
- Other contribution › Consultation response
-
Mark
Political polarization as a media narrative: the Swedish case, 2011-2020.
2021) NordMedia 2021:(
- Contribution to conference › Paper, not in proceeding
-
Mark
The fine-grained complexity of computing the tutte polynomial of a linear matroid
2021) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms p.2333-2345(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism
2021) 11th Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021 In Procedia Computer Science 195. p.163-171(
- Contribution to journal › Article