On the public citation graph
Fast Polynomial Factorization and Modular Composition
0 signed · 223 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.1006/jcom.1998.0476openalex-snapshot
Fast Rectangular Matrix Multiplication and Applications
inferredcites →https://doi.org/10.1006/jsco.1994.1025openalex-snapshot
Fast Construction of Irreducible Polynomials over Finite Fields
inferredcites →https://doi.org/10.1006/jsco.1998.0216openalex-snapshot
Composing Power Series Over a Finite Ring in Essentially Linear Time
inferredcites →https://doi.org/10.1006/jsco.1999.1002openalex-snapshot
Factoring Polynomials Over Finite Fields: A Survey
inferredcites →https://doi.org/10.1007/bf01272074openalex-snapshot
Computing Frobenius maps and factoring polynomials
inferredcites →https://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferredcites →https://doi.org/10.1007/s10208-007-9000-2openalex-snapshot
Point Counting in Families of Hyperelliptic Curves
inferredcites →https://doi.org/10.1007/s10623-008-9236-0openalex-snapshot
Efficient pth root computations in finite fields of characteristic p
inferredcites →https://doi.org/10.1016/0304-3975(95)80018-2openalex-snapshot
On the cell probe complexity of polynomial evaluation
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.047openalex-snapshot
The Cell Probe Complexity of Succinct Data Structures
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1070/rm1966v021n01abeh004147openalex-snapshot
METHODS OF COMPUTING VALUES OF POLYNOMIALS
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0606517-5openalex-snapshot
A New Algorithm for Factoring Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1090/s0025-5718-98-00944-2openalex-snapshot
Subquadratic-time factoring of polynomials over finite fields
inferredcites →https://doi.org/10.1137/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields
inferredcites →https://doi.org/10.1145/322092.322099openalex-snapshot
Fast Algorithms for Manipulating Formal Power Series
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-60026-6_3openalex-snapshot
On the Complexity of Computing Integral Bases of Function Fields
inferred← citeshttps://doi.org/10.1007/978-3-030-67080-1_7openalex-snapshot
Automated Analytic Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_1openalex-snapshot
Background and Fundamental Concepts
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_2openalex-snapshot
The Recurrence Case in One Variable
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_3openalex-snapshot
The Differential Case in One Variable
inferred← citeshttps://doi.org/10.1007/978-3-031-34652-1_5openalex-snapshot
Summation and Integration
inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_1openalex-snapshot
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-031-68397-8_1openalex-snapshot
Reusable Online-Efficient Commitments
inferred← citeshttps://doi.org/10.1007/978-3-031-69070-9_14openalex-snapshot
Sparse Tensors and Subdivision Methods for Finding the Zero Set of Polynomial Equations
inferred← citeshttps://doi.org/10.1007/978-3-031-78020-2_15openalex-snapshot
Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-031-78679-2_14openalex-snapshot
Towards Practical Doubly-Efficient Private Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-031-82380-0_1openalex-snapshot
On the Efficient Representation of Isogenies
inferred← citeshttps://doi.org/10.1007/978-3-031-91095-1_2openalex-snapshot
On Algebraic Homomorphic Encryption and Its Applications to Doubly-Efficient PIR
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_19openalex-snapshot
Scalable Multi-server Private Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_20openalex-snapshot
Multi-server Doubly Efficient PIR in the Classical Model and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-032-36264-3_29openalex-snapshot
On the Power of Polynomial Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_27openalex-snapshot
A Local-Global Approach to Solving Ideal Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-15943-0_4openalex-snapshot
Algebraic Cryptanalysis of Yasuda, Takagi and Sakurai’s Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-55227-9_9openalex-snapshot
A Generalised Successive Resultants Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-70694-8_1openalex-snapshot
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-44371-2_5openalex-snapshot
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
inferred← citeshttps://doi.org/10.1007/978-3-662-54970-4openalex-snapshot
Financial Cryptography and Data Security
inferred← citeshttps://doi.org/10.1007/978-3-662-54970-4_9openalex-snapshot
VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
inferred← citeshttps://doi.org/10.1007/978-981-95-2961-2_15openalex-snapshot
A Round-Optimal Near-Linear Third-Party Private Set Intersection Protocol
inferred← citeshttps://doi.org/10.1007/978-981-95-5099-9_14openalex-snapshot
Lattice-Based Multi-message Multi-recipient KEM/PKE with Malicious Security
inferred← citeshttps://doi.org/10.1007/978-981-95-5113-2_7openalex-snapshot
A Complete Characterization of One-More Assumptions in the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-981-97-0859-8_23openalex-snapshot
Test-and-Decode: A Partial Recovery Scheme for Verifiable Coded Computing
inferred← citeshttps://doi.org/10.1007/978-981-97-0859-8_24openalex-snapshot
RecAGT: Shard Testable Codes with Adaptive Group Testing for Malicious Nodes Identification in Sharding Permissioned Blockchain
inferred← citeshttps://doi.org/10.1007/s00037-013-0063-yopenalex-snapshot
Modular Composition Modulo Triangular Sets and Applications
inferred← citeshttps://doi.org/10.1007/s00037-020-00204-9openalex-snapshot
Subquadratic-Time Algorithms for Normal Bases
inferred← citeshttps://doi.org/10.1007/s00145-017-9274-8openalex-snapshot
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
inferred← citeshttps://doi.org/10.1007/s00145-019-09316-0openalex-snapshot
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
inferred← citeshttps://doi.org/10.1007/s00200-015-0280-5openalex-snapshot
Deterministic root finding over finite fields using Graeffe transforms
inferred← citeshttps://doi.org/10.1007/s00200-018-0362-2openalex-snapshot
On the Cipolla–Lehmer type algorithms in finite fields
inferred← citeshttps://doi.org/10.1007/s00200-021-00536-1openalex-snapshot
Univariate polynomial factorization over large finite fields
inferred← citeshttps://doi.org/10.1007/s00200-022-00588-xopenalex-snapshot
Efficient computation of Riemann–Roch spaces for plane curves with ordinary singularities
inferred← citeshttps://doi.org/10.1007/s00200-024-00669-zopenalex-snapshot
Approximate contact factorization of germs of plane curves
inferred← citeshttps://doi.org/10.1007/s00200-025-00704-7openalex-snapshot
Faster multi-point evaluation over any field
inferred← citeshttps://doi.org/10.1007/s00453-018-0513-7openalex-snapshot
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
inferred← citeshttps://doi.org/10.1007/s00453-023-01102-6openalex-snapshot
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
inferred← citeshttps://doi.org/10.1007/s10208-020-09453-0openalex-snapshot
On the Complexity Exponent of Polynomial System Solving
inferred← citeshttps://doi.org/10.1007/s10623-013-9875-7openalex-snapshot
Computing in degree $$2^k$$ 2 k -extensions of finite fields of odd characteristic
inferred← citeshttps://doi.org/10.1007/s10623-025-01719-4openalex-snapshot
Towards computing canonical lifts of ordinary elliptic curves in medium characteristic
inferred← citeshttps://doi.org/10.1007/s41114-022-00035-wopenalex-snapshot
Reduced order and surrogate models for gravitational waves
inferred← citeshttps://doi.org/10.1016/j.csi.2024.103961openalex-snapshot
Efficient private information retrievals for single-server based on verifiable homomorphic encryption
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.04.018openalex-snapshot
Newton iteration for lexicographic Gröbner bases in two variables
inferred← citeshttps://doi.org/10.1016/j.jco.2015.11.009openalex-snapshot
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
inferred← citeshttps://doi.org/10.1016/j.jco.2018.05.002openalex-snapshot
Modular composition via factorization
inferred← citeshttps://doi.org/10.1016/j.jco.2019.03.002openalex-snapshot
Accelerated tower arithmetic
inferred← citeshttps://doi.org/10.1016/j.jco.2019.04.001openalex-snapshot
Fast multivariate multi-point evaluation revisited
inferred← citeshttps://doi.org/10.1016/j.jco.2020.101499openalex-snapshot
Fast computation of generic bivariate resultants
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101574openalex-snapshot
Fast amortized multi-point evaluation
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101588openalex-snapshot
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density
inferred← citeshttps://doi.org/10.1016/j.jco.2022.101693openalex-snapshot
Amortized multi-point evaluation of multivariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jco.2023.101803openalex-snapshot
High-order lifting for polynomial Sylvester matrices
inferred← citeshttps://doi.org/10.1016/j.jco.2024.101885openalex-snapshot
Interpolation by decomposable univariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jco.2025.101934openalex-snapshot
Factoring sparse polynomials fast
inferred← citeshttps://doi.org/10.1016/j.jnt.2022.01.013openalex-snapshot
Root repulsion and faster solving for very sparse polynomials over p-adic fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.05.008openalex-snapshot
On the complexity of computing with zero-dimensional triangular sets
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.02.011openalex-snapshot
Deterministic polynomial factoring over finite fields: A uniform approach via P -schemes
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.01.001openalex-snapshot
Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.007openalex-snapshot
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.10.001openalex-snapshot
Efficiently Factoring Polynomials Modulo p4
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102314openalex-snapshot
Solving polynomial systems over non-fields and applications to modular polynomial factoring
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102367openalex-snapshot
Bivariate polynomial reduction and elimination ideal over finite fields
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.019openalex-snapshot
Optimal Las Vegas reduction from one-way set reconciliation to error correction
inferred← citeshttps://doi.org/10.1049/cmu2.70038openalex-snapshot
A Study on New EPC‐MPSI for an Inputless External Party to Compute the Intersection of Multiple Private Datasets
inferred← citeshttps://doi.org/10.1063/5.0350433openalex-snapshot
Memory-aware SIMD-enabled permutationally invariant polynomial code-generation procedure: Application to the MB-pol water potential
inferred← citeshttps://doi.org/10.1090/mcom/2946openalex-snapshot
Character sums and deterministic polynomial root finding in finite fields
inferred← citeshttps://doi.org/10.1090/mcom/3363openalex-snapshot
Computing isomorphisms and embeddings of finite fields
inferred← citeshttps://doi.org/10.1090/mcom/3431openalex-snapshot
Randomized polynomial-time root counting in prime power rings
inferred← citeshttps://doi.org/10.1090/mcom/4052openalex-snapshot
Algorithms for computing norms and characteristic polynomials on general Drinfeld modules
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02715-9openalex-snapshot
Taking roots over high extensions of finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-2014-02857-3openalex-snapshot
A fast algorithm for reversion of power series
inferred← citeshttps://doi.org/10.1109/access.2019.2908024openalex-snapshot
On the Capacity and Straggler-Robustness of Distributed Secure Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/access.2020.3031590openalex-snapshot
Squeezed Polynomial Codes: Communication-Efficient Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/access.2021.3135581openalex-snapshot
Securely Straggler-Exploiting Coded Computation for Distributed Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028589openalex-snapshot
Multi-party set reconciliation using characteristic polynomials
inferred← citeshttps://doi.org/10.1109/allerton.2017.8262778openalex-snapshot
Coded fourier transform
inferred← citeshttps://doi.org/10.1109/arith54963.2022.00023openalex-snapshot
PMNS for efficient arithmetic and small memory cost
inferred← citeshttps://doi.org/10.1109/focs.2013.18openalex-snapshot
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence
inferred← citeshttps://doi.org/10.1109/focs.2015.18openalex-snapshot
Probabilistic Polynomials and Hamming Nearest Neighbors
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00028openalex-snapshot
Fast Multivariate Multipoint Evaluation Over All Finite Fields
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00088openalex-snapshot
Fast Numerical Multivariate Multipoint Evaluation
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00080openalex-snapshot
How to Simulate Random Oracles with Auxiliary Input
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00127openalex-snapshot
Power Series Composition in Near-Linear Time
inferred← citeshttps://doi.org/10.1109/icc.2019.8761275openalex-snapshot
The Need for Alignment in Rate-Efficient Distributed Two-Sided Secure Matrix Computation
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00105openalex-snapshot
Coded Computing at Full Speed
inferred← citeshttps://doi.org/10.1109/iciteics64870.2025.11341571openalex-snapshot
Analysis of Average Running Times and Complexity in Root-Finding Algorithms for Polynomial Factorization
inferred← citeshttps://doi.org/10.1109/isit.2018.8437549openalex-snapshot
Straggler-Proofing Massive-Scale Distributed Matrix Multiplication with D-Dimensional Product Codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517789openalex-snapshot
Private and Secure Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518282openalex-snapshot
FastShare: Scalable Secret Sharing by Leveraging Locality
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619404openalex-snapshot
Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm
inferred← citeshttps://doi.org/10.1109/jiot.2021.3138855openalex-snapshot
Distributed Decoding for Coded Distributed Computing
inferred← citeshttps://doi.org/10.1109/jsac.2022.3142364openalex-snapshot
Hierarchical Group Testing for Byzantine Attack Identification in Distributed Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/jsac.2023.3242702openalex-snapshot
SwiftAgg+: Achieving Asymptotically Optimal Communication Loads in Secure Aggregation for Federated Learning
inferred← citeshttps://doi.org/10.1109/jsait.2021.3054610openalex-snapshot
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00055openalex-snapshot
Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation
inferred← citeshttps://doi.org/10.1109/tcc.2024.3415165openalex-snapshot
Secure and Flexible Coded Distributed Matrix Multiplication Based on Edge Computing for Industrial Metaverse
inferred← citeshttps://doi.org/10.1109/tccn.2022.3174615openalex-snapshot
Edge Computing-Aided Coded Vertical Federated Linear Regression
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3083730openalex-snapshot
Codes Trading Upload for Download Cost in Secure Distributed Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3165201openalex-snapshot
Rook Coding for Batch Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3308954openalex-snapshot
SCALR: Communication-Efficient Secure Multi-Party Logistic Regression
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3366394openalex-snapshot
Secure Aggregation for Clustered Federated Learning With Passive Adversaries
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3403475openalex-snapshot
Secure Gradient Aggregation With Sparsification for Resource-Limited Federated Learning
inferred← citeshttps://doi.org/10.1109/tdsc.2017.2708710openalex-snapshot
Efficient Delegated Private Set Intersection on Outsourced Private Datasets
inferred← citeshttps://doi.org/10.1109/tetc.2022.3187786openalex-snapshot
PMNS for Efficient Arithmetic and Small Memory Cost
inferred← citeshttps://doi.org/10.1109/tifs.2024.3377929openalex-snapshot
Group-Wise Verifiable Coded Computing Under Byzantine Attacks and Stragglers
inferred← citeshttps://doi.org/10.1109/tit.2019.2929328openalex-snapshot
On the Optimal Recovery Threshold of Coded Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/tit.2019.2930538openalex-snapshot
Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound
inferred← citeshttps://doi.org/10.1109/tit.2021.3050853openalex-snapshot
Secure Coded Multi-Party Computation for Massive Matrix Operations
inferred← citeshttps://doi.org/10.1109/tit.2021.3068165openalex-snapshot
CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/tit.2023.3345270openalex-snapshot
Privacy-Preserving Collaborative Learning With Linear Communication Complexity
inferred← citeshttps://doi.org/10.1109/tit.2024.3425808openalex-snapshot
Access-Redundancy Tradeoffs in Quantized Linear Computations
inferred← citeshttps://doi.org/10.1109/tit.2024.3441509openalex-snapshot
Scalable Multi-Round Multi-Party Privacy-Preserving Neural Network Training
inferred← citeshttps://doi.org/10.1109/tit.2025.3577019openalex-snapshot
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment
inferred← citeshttps://doi.org/10.1109/tit.2025.3619049openalex-snapshot
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity
inferred← citeshttps://doi.org/10.1109/tmc.2024.3418449openalex-snapshot
Resilient, Secure, and Private Coded Distributed Convolution Computing for Mobile-Assisted Metaverse
inferred← citeshttps://doi.org/10.1112/jlms.12487openalex-snapshot
Fast computation of elliptic curve isogenies in characteristic two
inferred← citeshttps://doi.org/10.1112/s1461157013000296openalex-snapshot
Deterministic polynomial factoring and association schemes
inferred← citeshttps://doi.org/10.1112/s1461157014000138openalex-snapshot
Finding roots in with the successive resultants algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611974782.143openalex-snapshot
Beating Brute Force for Systems of Polynomial Equations over Finite Fields
inferred← citeshttps://doi.org/10.1137/1.9781611975031.69openalex-snapshot
A Two-pronged Progress in Structured Dense Matrix Vector Multiplication
inferred← citeshttps://doi.org/10.1137/140990401openalex-snapshot
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1137/23m1598507openalex-snapshot
Doubly Efficient Private Information Retrieval and Fully Homomorphic Ram Computation from Ring LWE
inferred← citeshttps://doi.org/10.1142/9789814719261_0016openalex-snapshot
On coefficients of powers of polynomials and their compositions over finite fields
inferred← citeshttps://doi.org/10.1145/1940475.1940486openalex-snapshot
Almost linear time operations with triangular sets
inferred← citeshttps://doi.org/10.1145/2422436.2422470openalex-snapshot
An energy complexity model for algorithms
inferred← citeshttps://doi.org/10.1145/2442829.2442848openalex-snapshot
Power series solutions of singular (q)-differential equations
inferred← citeshttps://doi.org/10.1145/2465506.2465514openalex-snapshot
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
inferred← citeshttps://doi.org/10.1145/2465506.2465950openalex-snapshot
On the complexity of solving bivariate systems
inferred← citeshttps://doi.org/10.1145/2465506.2465956openalex-snapshot
Fast algorithms for l -adic towers over finite fields
inferred← citeshttps://doi.org/10.1145/2608628.2608650openalex-snapshot
A fast algorithm for computing the characteristic polynomial of the p-curvature
inferred← citeshttps://doi.org/10.1145/2608628.2608672openalex-snapshot
Fast arithmetic for the algebraic closure of finite fields
inferred← citeshttps://doi.org/10.1145/2755996.2756637openalex-snapshot
Algorithms for Finite Field Arithmetic
inferred← citeshttps://doi.org/10.1145/2755996.2756650openalex-snapshot
Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields
inferred← citeshttps://doi.org/10.1145/2930889.2930912openalex-snapshot
On p-Adic Differential Equations with Separation of Variables
inferred← citeshttps://doi.org/10.1145/2930889.2930913openalex-snapshot
Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables
inferred← citeshttps://doi.org/10.1145/3087604.3087634openalex-snapshot
Composition Modulo Powers of Polynomials
inferred← citeshttps://doi.org/10.1145/3145573openalex-snapshot
Simultaneous Conversions with the Residue Number System Using Linear Algebra
inferred← citeshttps://doi.org/10.1145/3313276.3316348openalex-snapshot
Static data structure lower bounds imply rigidity
inferred← citeshttps://doi.org/10.1145/3326229.3326251openalex-snapshot
Standard Lattices of Compatibly Embedded Finite Fields
inferred← citeshttps://doi.org/10.1145/3326229.3326256openalex-snapshot
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module
inferred← citeshttps://doi.org/10.1145/3326229.3326260openalex-snapshot
Quadratic-Time Algorithms for Normal Elements
inferred← citeshttps://doi.org/10.1145/3373207.3404032openalex-snapshot
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
inferred← citeshttps://doi.org/10.1145/3419048.3419049openalex-snapshot
Ultimate complexity for numerical algorithms
inferred← citeshttps://doi.org/10.1145/3452143.3465523openalex-snapshot
Fast Computation of Hyperelliptic Curve Isogenies in Odd Characteristic
inferred← citeshttps://doi.org/10.1145/3452143.3465531openalex-snapshot
Amortized Bivariate Multi-point Evaluation
inferred← citeshttps://doi.org/10.1145/3476446.3535493openalex-snapshot
On the Complexity of Symbolic Computation
inferred← citeshttps://doi.org/10.1145/3519935.3519968openalex-snapshot
Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
inferred← citeshttps://doi.org/10.1145/3555307openalex-snapshot
Nearly Optimal Pseudorandomness from Hardness
inferred← citeshttps://doi.org/10.1145/3564246.3585175openalex-snapshot
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
inferred← citeshttps://doi.org/10.1145/3597066.3597080openalex-snapshot
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
inferred← citeshttps://doi.org/10.1145/3597066.3597087openalex-snapshot
New Sparse Multivariate Polynomial Factorization Algorithms over Integers
inferred← citeshttps://doi.org/10.1145/3597066.3597100openalex-snapshot
Elimination ideal and bivariate resultant over finite fields
inferred← citeshttps://doi.org/10.1145/3597066.3597115openalex-snapshot
An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
inferred← citeshttps://doi.org/10.1145/3618260.3649723openalex-snapshot
Self-Improvement for Circuit-Analysis Problems
inferred← citeshttps://doi.org/10.1145/3625226openalex-snapshot
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications
inferred← citeshttps://doi.org/10.1145/3637528.3671660openalex-snapshot
HiFGL: A Hierarchical Framework for Cross-silo Cross-device Federated Graph Learning
inferred← citeshttps://doi.org/10.1145/3652025openalex-snapshot
Fast Multivariate Multipoint Evaluation over All Finite Fields
inferred← citeshttps://doi.org/10.1145/3815436.3815451openalex-snapshot
Faster Modular Composition Using Two Relation Matrices
inferred← citeshttps://doi.org/10.1145/3816782.3819189openalex-snapshot
Cell-Probe Lower Bounds for Data Structures in CRCW PRAM
inferred← citeshttps://doi.org/10.1145/3832046.3832055openalex-snapshot
Modular Composition for Decomposable Polynomials
inferred← citeshttps://doi.org/10.1186/s42400-025-00506-xopenalex-snapshot
HET-PIR: practical Keyword PIR via a Novel homomorphic equality test Algorithm
inferred← citeshttps://doi.org/10.13140/rg.2.2.21206.14406openalex-snapshot
Cryptanalysis of Yasuda, Takagi and Sakurai's Signature Scheme Using Invariant Subspaces
inferred← citeshttps://doi.org/10.14495/jsiaml.11.1openalex-snapshot
Counting points on hyperelliptic curves of genus 2 with real models
inferred← citeshttps://doi.org/10.14722/ndss.2019.23170openalex-snapshot
Establishing Software Root of Trust Unconditionally
inferred← citeshttps://doi.org/10.1515/jmc-2024-0036openalex-snapshot
First-degree prime ideals of composite extensions
inferred← citeshttps://doi.org/10.1561/0100000103openalex-snapshot
Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning
inferred← citeshttps://doi.org/10.15760/honors.1701openalex-snapshot
An Exposition of "Probabilistic Polynomials and Hamming Nearest Neighbors"
inferred← citeshttps://doi.org/10.2139/ssrn.5822236openalex-snapshot
An effective description of the roots of multivariates mod pk and the related Igusa's local zeta function
inferred← citeshttps://doi.org/10.2140/obs.2019.2.191openalex-snapshot
Counting roots for polynomials modulo prime powers
inferred← citeshttps://doi.org/10.22215/etd/2015-10627openalex-snapshot
Deterministic Factorization of Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.23919/isita.2018.8664310openalex-snapshot
Improved Verifiable Delegated Private Set Intersection
inferred← citeshttps://doi.org/10.26904/rf-137-1595702835openalex-snapshot
A rest stop on the unending road to provable security
inferred← citeshttps://doi.org/10.3103/s0027132218050029openalex-snapshot
Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic
inferred← citeshttps://doi.org/10.3103/s0027132221030049openalex-snapshot
Fast Algorithms for Solving Equations of Degree $$\boldsymbol{{\leqslant}4}$$ in Some Finite Fields
inferred← citeshttps://doi.org/10.3390/cryptography6010013openalex-snapshot
On the IND-CCA1 Security of FHE Schemes
inferred← citeshttps://doi.org/10.46586/tosc.v2024.i4.138-190openalex-snapshot
Exploring the Six Worlds of Gröbner Basis Cryptanalysis: Application to Anemoi
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4772openalex-snapshot
A fast algorithm for reversion of power series
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01569openalex-snapshot
A Two Pronged Progress in Structured Dense Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10464openalex-snapshot
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09934openalex-snapshot
Polynomially Coded Regression: Optimal Straggler Mitigation via Data Encoding
inferred← citeshttps://doi.org/10.48550/arxiv.1806.00939openalex-snapshot
Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy
inferred← citeshttps://doi.org/10.48550/arxiv.1806.06140openalex-snapshot
Straggler-Resilient and Communication-Efficient Distributed Iterative Linear Solver
inferred← citeshttps://doi.org/10.48550/arxiv.1903.03278openalex-snapshot
Quadratic Probabilistic Algorithms for Normal Bases
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13849openalex-snapshot
Uplink-Downlink Tradeoff in Secure Distributed Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.2002.04156openalex-snapshot
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2011.09093openalex-snapshot
Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines
inferred← citeshttps://doi.org/10.48550/arxiv.2102.01626openalex-snapshot
Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings
inferred← citeshttps://doi.org/10.48550/arxiv.2102.08018openalex-snapshot
Computing isogenies between jacobians of hyperelliptic curves of arbitrary genus via differential equations
inferred← citeshttps://doi.org/10.48550/arxiv.2103.15926openalex-snapshot
Interpolation by decomposable univariate polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.2312.17380openalex-snapshot
Factoring sparse polynomials fast
inferred← citeshttps://doi.org/10.70675/5094cdcbz9865z4674z8591z6383aef42092openalex-snapshot
Arithmétique efficace des extensions de corps finis
showing the first 200 of 206 · page through all 206
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.