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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Medha Durisheti

dblp:397/2163 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0006-0585-7435ORCID · corroborated

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

Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
Coding theory · 67% Quantum computing and quantum information · 33%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › code classification › code equivalence
linear code equivalence		 1.012026
Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem · IEEE Trans. Inf. Theory 2026
Quantum computing and quantum information
quantum algorithms		 1.012026
Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem · IEEE Trans. Inf. Theory 2026

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

randomized algorithm · 1.0quantum algorithm · 1.0deterministic algorithm · 1.0
YearPublicationVenuePosition
2026 Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem
abstract
We present several new provable algorithms for two variants of the code equivalence problem on linear error-correcting codes, the Linear Code Equivalence Problem (LCE) and the Permutation Code Equivalence Problem (PCE). Specifically, for arbitrary codes of block lengthnand dimensionkover any finite field Fq, we show: 1) A deterministic algorithm running in 2n+o(n+q)time for LCE. 2) A randomized algorithm running in 2n/2+o(n+q)time for LCE and PCE. 3) A quantum algorithm running in 2n/3+o(n+q)time for LCE and PCE. The second two algorithms improve on recent work of Nowakowski (PQCrypto 2025), which gave algorithms with similar running times but only for code equivalence onrandomcodes and only over fields of orderq≥ 7.
Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
 IEEE Trans. Inf. Theory4
2025 Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem
abstract
We present several new provable algorithms for two variants of the code equivalence problem on linear error-correcting codes, the Linear Code Equivalence Problem (LCE) and the Permutation Code Equivalence Problem (PCE). Specifically, for arbitrary codes of block length$n$and dimension$k$over any finite field$\mathbb{F}_{q}$, we show: 1)A deterministic algorithm running in$2^{n+o(n+q)}$time for LCE. 2)A randomized algorithm running in$2^{n / 2+o(n+q)}$time for LCE and PCE. 3)A quantum algorithm running in$2^{n / 3+o(n+q)}$time for LCE and PCE. The second two algorithms improve on recent work of Nowakowski (PQCrypto 2025), which gave algorithms with similar running times but only for code equivalence on random codes and only over fields of order$q \geq 7$.
Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
 ISIT4