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

Raitis Ozols

dblp:18/5561 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Theory of computation · 1Applied, 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
Quantum computing and quantum information · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum games		 0.112012
Quantum Strategies Are Better Than Classical in Almost Any XOR Game · ICALP (1) 2012
Quantum computing and quantum information › quantum games
quantum strategy		 0.112012
Quantum Strategies Are Better Than Classical in Almost Any XOR Game · ICALP (1) 2012
Quantum computing and quantum information › quantum games
XOR games		 0.112012
Quantum Strategies Are Better Than Classical in Almost Any XOR Game · ICALP (1) 2012
YearPublicationVenuePosition
2012 Quantum Strategies Are Better Than Classical in Almost Any XOR Game
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitrijs Kravcenko, Raitis Ozols, Juris Smotrovs, Madars Virza
 ICALP (1)5
2005 Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms
Raitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina
 SOFSEM1