Gatis Midrijanis

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

dblp:45/5866 · DBLP profile ↗

← Back

2ranked-venue papers

2as first author

0since 2021 · last 2004

—ORCID · none

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

Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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

Computational complexity · 100%

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

Topic	Papers	Last	Evidence papers
Computational complexity lower bounds	1	2004	A Polynomial Quantum Query Lower Bound for the Set Equality Problem · ICALP 2004
Computational complexity › query complexity quantum query complexity	1	2004	A Polynomial Quantum Query Lower Bound for the Set Equality Problem · ICALP 2004
Computational complexity query complexity	1	2004	A Polynomial Quantum Query Lower Bound for the Set Equality Problem · ICALP 2004
Computational complexity › property testing set equality testing	1	2004	A Polynomial Quantum Query Lower Bound for the Set Equality Problem · ICALP 2004

Year	Publication	Venue	Position
2004	A Polynomial Quantum Query Lower Bound for the Set Equality Problem Gatis Midrijanis	ICALP	1
2002	The Complexity of Probabilistic versus Quantum Finite Automata Gatis Midrijanis	SOFSEM	1