On the public citation graph
O(log(n)) parallel time finite field inversion
0 signed · 27 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4684-0047-2openalex-snapshot
p-adic Numbers, p-adic Analysis, and Zeta-Functions
inferredcites →https://doi.org/10.1007/bf02579205openalex-snapshot
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1049/el:19720017openalex-snapshot
Two-phase m.n.o.s. charge-coupled device
inferredcites →https://doi.org/10.1049/el:19720378openalex-snapshot
Inverse of elements of a Galois field
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0215070openalex-snapshot
Log Depth Circuits for Division and Related Problems
inferredcites →https://doi.org/10.1145/12130.12164openalex-snapshot
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_40openalex-snapshot
A DIV(N) depth Boolean circuit for smooth modular inverse
inferred← citeshttps://doi.org/10.1007/bfb0029653openalex-snapshot
Computing large polynomial powers very fast in parallel
inferred← citeshttps://doi.org/10.1007/bfb0054331openalex-snapshot
The CREW PRAM complexity of modular inversion
inferred← citeshttps://doi.org/10.1007/s10958-013-1350-5openalex-snapshot
Complexity of computation in finite fields
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90238-dopenalex-snapshot
A div(n) depth Boolean circuit for smooth modular inverse
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90078-gopenalex-snapshot
Boolean circuits versus arithmetic circuits
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80028-4openalex-snapshot
Inversion in finite fields using logarithmic depth
inferred← citeshttps://doi.org/10.1070/rm1991v046n01abeh002725openalex-snapshot
On some problems in the theory of finite fields
inferred← citeshttps://doi.org/10.1137/0218066openalex-snapshot
Very Fast Parallel Polynomial Arithmetic
inferred← citeshttps://doi.org/10.1145/1872007.1872051openalex-snapshot
Galois field hardware architectures for network coding
inferred← citeshttps://doi.org/10.1515/156939206779217952openalex-snapshot
An application of the method of additive chains to inversion in finite fields
inferred← citeshttps://doi.org/10.1515/dma.2008.035openalex-snapshot
On design of circuits of logarithmic depth for inversion in finite fields
inferred← citeshttps://doi.org/10.3103/s0027132207010068openalex-snapshot
Inversion in finite fields of characteristic 2 using logarithmic depth
inferred← citeshttps://doi.org/10.4213/dm1023openalex-snapshot
О построении схем логарифмической глубины для инвертирования в конечных полях
inferred← citeshttps://doi.org/10.4213/dm80openalex-snapshot
О применении метода аддитивных цепочек к инвертированию в конечных полях
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.