On the public citation graph

Algorithmic properties of maximal orders in simple algebras over Q

https://doi.org/10.1007/bf01272075
0 signed · 46 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-08442-8_106openalex-snapshot
Polynomial Time Algorithms in the Theory of Linear Diophantine Equations
inferredcites →https://doi.org/10.1007/978-1-4615-4439-5_14openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/978-1-4684-0296-4openalex-snapshot
Algebraic Number Theory
inferredcites →https://doi.org/10.1007/978-1-4757-0163-0openalex-snapshot
Associative Algebras
inferredcites →https://doi.org/10.1007/978-1-4757-1779-2openalex-snapshot
A Classical Introduction to Modern Number Theory
inferredcites →https://doi.org/10.1007/978-3-0348-5821-2_10openalex-snapshot
Ein Algorithmus zur Berechnung einer Minimalbasis über Gegebener Ordnung
inferredcites →https://doi.org/10.1007/978-3-642-62031-7openalex-snapshot
Introduction to Quadratic Forms
inferredcites →https://doi.org/10.1007/978-3-662-41922-9openalex-snapshot
Introduction to Quadratic Forms
inferredcites →https://doi.org/10.1007/bf01200061openalex-snapshot
Decompositions of algebras over ? and ?
inferredcites →https://doi.org/10.1007/bf01272520openalex-snapshot
Decomposition of algebras over finite fields and number fields
inferredcites →https://doi.org/10.1016/0021-8693(80)90151-9openalex-snapshot
An algorithm for computing modular forms on Γ0(N)
inferredcites →https://doi.org/10.1016/0196-6774(88)90014-4openalex-snapshot
Zero divisors in quaternion algebras
inferredcites →https://doi.org/10.1016/s0747-7171(08)80017-xopenalex-snapshot
Computing the structure of finite algebras
inferredcites →https://doi.org/10.1017/cbo9780511661952openalex-snapshot
Algorithmic Algebraic Number Theory
inferredcites →https://doi.org/10.1017/cbo9780511661952.001openalex-snapshot
Preface
inferredcites →https://doi.org/10.1017/cbo9781139171762openalex-snapshot
Commutative Ring Theory
inferredcites →https://doi.org/10.1090/mmono/186/05openalex-snapshot
Algebraic number theory
inferredcites →https://doi.org/10.1090/s0025-5718-1968-0226829-0openalex-snapshot
Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1035925-1openalex-snapshot
Computing irreducible representations of finite groups
inferredcites →https://doi.org/10.1090/s0025-5718-60-99239-5openalex-snapshot
Mathematics of Computation
inferredcites →https://doi.org/10.1137/0208040openalex-snapshot
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
inferredcites →https://doi.org/10.1145/22145.22162openalex-snapshot
Polynomial time solutions of some problems of computational algebra
inferredcites →https://doi.org/10.1145/800057.808679openalex-snapshot
Factorization of polynomials over finite fields and factorization of primes in algebraic number fields
inferredcites →https://doi.org/10.1201/9780429493638openalex-snapshot
Introduction To Commutative Algebra
inferredcites →https://doi.org/10.5948/upo9781614440154openalex-snapshot
Noncommutative Rings
inferredcites →https://doi.org/10.6028/jres.071b.033openalex-snapshot
Systems of distinct representatives and linear algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jsco.1999.0308openalex-snapshot
Efficient Decomposition of Associative Algebras over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-1-4614-7488-3_10openalex-snapshot
Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms
inferred← citeshttps://doi.org/10.1007/978-3-031-07082-2_13openalex-snapshot
Orientations and the Supersingular Endomorphism Ring Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_11openalex-snapshot
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions
inferred← citeshttps://doi.org/10.1007/bf01200061openalex-snapshot
Decompositions of algebras over ? and ?
inferred← citeshttps://doi.org/10.1007/bf01271370openalex-snapshot
Finding maximal orders in semisimple algebras over Q
inferred← citeshttps://doi.org/10.1007/bf01272520openalex-snapshot
Decomposition of algebras over finite fields and number fields
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00135-jopenalex-snapshot
Lattice basis reduction for indefinite forms and an application
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2005.06.022openalex-snapshot
A Lie algebra method for rational parametrization of Severi–Brauer surfaces
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.01.008openalex-snapshot
Splitting full matrix algebras over algebraic number fields
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00071-3openalex-snapshot
Efficient decomposition of separable algebras
inferred← citeshttps://doi.org/10.1090/s0025-5718-96-00760-0openalex-snapshot
Solvability of norm equations over cyclic number fields of prime degree
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00109openalex-snapshot
The supersingular isogeny path and endomorphism ring problems are equivalent
inferred← citeshttps://doi.org/10.1109/itw.2006.1633838openalex-snapshot
A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras
inferred← citeshttps://doi.org/10.1109/tit.2008.2011449openalex-snapshot
Construction Methods for Asymmetric and Multiblock Space–Time Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928998openalex-snapshot
Maximal Orders in the Design of Dense Space-Time Lattice Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2023713openalex-snapshot
On the Densest MIMO Lattices From Cyclic Division Algebras
inferred← citeshttps://doi.org/10.1137/1.9781611975031.152openalex-snapshot
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1145/236869.236931openalex-snapshot
Efficient decomposition of associative algebras
inferred← citeshttps://doi.org/10.62056/ab0lmpxqiopenalex-snapshot
The Supersingular l-Isogeny Path and Endomorphism Ring Problems: Tighter Unconditional Reductions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.