Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Katherine Van Kirk

dblp:336/3406 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0001-8280-8350ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 67% Computational complexity · 33%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › cryptographic assumptions
factoring
1.012026
Parallel Spooky Pebbling Makes Regev Factoring More Practical · EUROCRYPT (1) 2026
Computational complexity
circuit complexity
0.912025
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth · STOC 2025
Quantum computing and quantum information
quantum algorithms
0.912025
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth · STOC 2025
Quantum computing and quantum information › quantum algorithms
quantum factoring
0.912025
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth · STOC 2025
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.312026
Parallel Spooky Pebbling Makes Regev Factoring More Practical · EUROCRYPT (1) 2026
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
learning with errors
0.312026
Parallel Spooky Pebbling Makes Regev Factoring More Practical · EUROCRYPT (1) 2026

Methods — techniques the papers use, named apart from their topics

pebbling · 1.0parallel algorithms · 1.0space-depth tradeoffs · 0.9reversible circuit design · 0.9
YearPublicationVenuePosition
2026 Parallel Spooky Pebbling Makes Regev Factoring More Practical
Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Katherine Van Kirk
EUROCRYPT (1)3
2025 The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Vinod Vaikuntanathan, Katherine Van Kirk
STOC4