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

Markus Kirschmer

dblp:03/7811 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2026
—ORCID · none

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

Theory of computation · 2 · 2 first-authorSecurity and privacy · 1 · 1 first-author · 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
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › symbolic computation
computational algebra		 0.112010
Algorithmic Enumeration of Ideal Classes for Quaternion Orders · SIAM J. Comput. 2010
Algorithms and data structures
number-theoretic algorithms		 0.112010
Algorithmic Enumeration of Ideal Classes for Quaternion Orders · SIAM J. Comput. 2010

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

number field computation · 0.1algorithm analysis · 0.1
YearPublicationVenuePosition
2026 Cryptanalysis of Definite and Indefinite Lattice Isomorphism Problems with Applications to DEFI
Markus Kirschmer, Cong Ling 0001, Ali Sadreddin
 CRYPTO (3)1
2012 Corrigendum: Algorithmic Enumeration of Ideal Classes for Quaternion Orders
abstract
This note corrects a mathematical error in the article “Algorithmic enumeration of ideal classes for quaternion orders” [ SIAM J. Comput., 39 (2010), pp. 1714--1747].
Markus Kirschmer, John Voight
 SIAM J. Comput.1
2010 Algorithmic Enumeration of Ideal Classes for Quaternion Orders
abstract
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related problems, including the computation of two-sided ideal classes, isomorphism classes of orders, connecting ideals for orders, and ideal principalization. We conclude by giving the complete list of definite Eichler orders with class number at most 2.
Markus Kirschmer, John Voight
 SIAM J. Comput.1