Harold Nieuwboer

Orcid: 0000-0003-3627-3636

According to our database¹, Harold Nieuwboer authored at least 10 papers between 2020 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Explicit non-free tensors.

[BibT_eX]

[DOI]

CoRR, March, 2025

The moment polytope of matrix multiplication is not maximal.

[BibT_eX]

[DOI]

CoRR, March, 2025

Asymptotic Tensor Rank Is Characterized by Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Basic quantum subroutines: finding multiple marked elements and summing numbers.

[BibT_eX]

[DOI]

Joran van Apeldoorn

Sander Gribling

Harold Nieuwboer

Quantum, March, 2024

2023

The minimal canonical form of a tensor network.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Interior-point methods on manifolds: theory and applications.

[BibT_eX]

[DOI]

Hiroshi Hirai

Harold Nieuwboer

Michael Walter

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Improved Quantum Lower and Upper Bounds for Matrix Scaling.

[BibT_eX]

[DOI]

Sander Gribling

Harold Nieuwboer

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Quantum Algorithms for Matrix Scaling and Matrix Balancing.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Interior-point methods for unconstrained geometric programming and scaling problems.

[BibT_eX]

[DOI]

CoRR, 2020

Harold Nieuwboer

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...