Tellegen's principle into practice

No abstract is available for this paper.

• Publication year

  2003

• Venue

  International Symposium on Symbolic and Algebraic Computation

• Publication date

  2003-08-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/860854.860870
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Middle Product Algorithm I

  2004influential reference
• Fast Multivariate Power Series Multiplication in Characteristic Zero

  2003cited by this paper
• Relax, but Don't be Too Lazy

  2002cited by this paper
• Modern computer algebra

  2002influential reference
• Speeding up the Division and Square Root of Power Series

  2000cited by this paper
• Challenges of Symbolic Computation: My Favorite Open Problems

  2000influential reference
• Efficient computation of minimal polynomials in algebraic extensions of finite fields

  1999cited by this paper
• Algebraic complexity theory

  1997cited by this paper
• A New Polynomial Factorization Algorithm and its Implementation

  1995influential reference
• An FFT extension of the elliptic curve method of factorization

  1992cited by this paper
• A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic

  1991cited by this paper
• Algebraic Complexity Theory

  1991cited by this paper
• Interpolating Polynomials from Their Values

  1990cited by this paper
• Solving systems of nonlinear polynomial equations faster

  1989cited by this paper
• A deterministic algorithm for sparse multivariate polynomial interpolation

  1988cited by this paper
• Addition Requirements for Matrix and Transposed Matrix Products

  1988cited by this paper
• Improved Sparse Multivariate Polynomial Interpolation Algorithms

  1988cited by this paper
• Digital filters: Analysis and design

  1981cited by this paper
• On the algebraic complexity of matrix multiplication.

  1973cited by this paper
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms

  1973cited by this paper
• Complexity of Computer Computations

  1972cited by this paper
• On Obtaining Upper Bounds on the Complexity of Matrix Multiplication

  1972cited by this paper
• Tellegen's theorem and electrical networks

  1970cited by this paper
• Inter-Reciprocity Applied to Electrical Networks

  1956cited by this paper

• Faster modular composition using two relation matrices

  2026cites this paper
• Multi-Party Private Set Intersection With One-Round Online Interaction

  2025cites this paper
• Quasi-Linear Guessing of Minimal Lexicographic Gröbner Bases of Ideals of C-Relations of Random Bi-Indexed Sequences

  2025cites this paper
• Improved NTT and CRT-based RNR Blinding for Side-Channel and Fault Resistant Kyber

  2025cites this paper
• Towards automated generation of fast and accurate algorithms for recursive matrix multiplication

  2025cites this paper
• Elliptic butterflies

  2025cites this paper
• Fast interpolation of multivariate polynomials with sparse exponents

  2024cites this paper
• Bivariate polynomial reduction and elimination ideal over finite fields

  2024influential citation
• Power Series Composition in Near-Linear Time

  2024cites this paper
• Optimal Communication Unbalanced Private Set Union

  2024cites this paper
• Strassen's algorithm is not optimally accurate

  2024cites this paper
• Sparse polynomial interpolation: faster strategies over finite fields

  2024cites this paper
• Fast interpolation of sparse multivariate polynomials

  2023cites this paper
• In-place sub-quadratic polynomial modular remainder

  2023cites this paper
• High-order lifting for polynomial Sylvester matrices

  2023cites this paper
• Elimination ideal and bivariate resultant over finite fields

  2023influential citation
• Faster Modular Composition

  2023cites this paper
• Factoring sparse polynomials fast

  2023cites this paper
• On the Complexity of Symbolic Computation

  2022cites this paper
• Efficient computation of Riemann–Roch spaces for plane curves with ordinary singularities

  2022cites this paper
• Amortized multi-point evaluation of multivariate polynomials

  2022cites this paper
• Sparse Polynomial Interpolation and Division in Soft-linear Time

  2022cites this paper
• Bellman's, Knut's, Lupanov's, Pippenger's problems and their variations as generalizations of the addition chain problem

  2022cites this paper
• PSI from Ring-OLE

  2022cites this paper
• Fast computation of generic bivariate resultants

  2021cites this paper
• Multilinear polynomial systems: Root isolation and bit complexity

  2021cites this paper
• Computing the N-th term of a q-holonomic sequence

  2020cites this paper
• Fast Computation of the N-th Term of a q-Holonomic Sequence and Applications

  2020cites this paper
• Fast amortized multi-point evaluation

  2020cites this paper
• Computing one billion roots using the tangent Graeffe method

  2020cites this paper
• A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence

  2020cites this paper
• Ultimate complexity for numerical algorithms

  2020cites this paper
• Implementing the Tangent Graeffe Root Finding Method

  2020cites this paper
• Faster computation of isogenies of large prime degree

  2020cites this paper
• Fast in-place algorithms for polynomial operations: division, evaluation, interpolation

  2020influential citation
• Fast multivariate multi-point evaluation revisited

  2020cites this paper
• Generic Reductions for In-place Polynomial Multiplication

  2019influential citation
• Fast finite field arithmetic

  2019cites this paper
• Accelerated tower arithmetic

  2019influential citation
• Sparse polynomial interpolation. Exploring fast heuristic algorithms over finite fields

  2019cites this paper
• Efficient algorithms and implementation in exact linear algebra. (Algorithmes et implantations efficaces en algèbre linéaire exacte)

  2019cites this paper
• Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography

  2019cites this paper
• Standard Lattices of Compatibly Embedded Finite Fields

  2019cites this paper
• Change of Basis for m-primary Ideals in One and Two Variables

  2019cites this paper
• Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants

  2019cites this paper
• A fast algorithm for solving linearly recurrent sequences

  2018cites this paper
• What Can (and Can't) we Do with Sparse Polynomials?

  2018cites this paper
• Fast Hermite interpolation and evaluation over finite fields of characteristic two

  2018cites this paper
• Error Correction in Fast Matrix Multiplication and Inverse

  2018cites this paper
• A probabilistic algorithm for verifying polynomial middle product in linear time

  2018cites this paper
• Modular composition via factorization

  2018cites this paper
• DETERMINISTIC CONSTRUCTION OF SYNCHRONIZATION STRING OVER SMALL ALPHABET

  2017cites this paper
• On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms

  2017cites this paper
• Fast Parallel Multi-point Evaluation of Sparse Polynomials

  2017cites this paper
• Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets

  2017cites this paper
• Computing isomorphisms and embeddings of finite fields

  2017cites this paper
• Algorithms for Structured Linear Systems Solving and Their Implementation

  2017cites this paper
• Fast parallel multi-point evaluation of sparse polynomials

  2017cites this paper
• Fast Chinese Remaindering in Practice

  2017cites this paper
• Composition Modulo Powers of Polynomials

  2017cites this paper
• Smith Normal Form over Local Rings and Related Problems

  2017cites this paper
• Solving multivariate diophantine equations and their role in multivariate polynomial factorization

  2017cites this paper
• Certification of Polynomial Middle Product

  2017cites this paper
• Modular composition via complex roots

  2017cites this paper
• Controlled Chaos Based on Tellegen’s Principle in Electric Power Systems - Basic Approach

  2016cites this paper
• Faster Chinese remaindering

  2016cites this paper
• Generalized tellegen principle used for energy method for systems modeling

  2016cites this paper
• On the Bit Complexity of Solving Bilinear Polynomial Systems

  2016cites this paper
• A simple and fast online power series multiplication and its analysis

  2016influential citation
• Computing in Algebraic Closures of Finite Fields

  2015cites this paper
• Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices

  2015influential citation
• A Truncated Fourier Transform middle product

  2015cites this paper
• Algorithms for Finite Field Arithmetic

  2015cites this paper
• Algorithms in HElib

  2014cites this paper
• Fast arithmetic for the algebraic closure of finite fields

  2014cites this paper
• Modular Composition Modulo Triangular Sets and Applications

  2013cites this paper
• On the bit-complexity of sparse polynomial and series multiplication

  2013cites this paper
• Algoritmos de deformación para la resolución de sistemas polinomiales

  2013cites this paper
• The Karatsuba integer middle product

  2012cites this paper
• Fast Polynomial Factorization and Modular Composition

  2011cites this paper
• On the complexity of computing with zero-dimensional triangular sets

  2011cites this paper
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

  2010cites this paper
• On the Macaulay inverse system and its importance for the theory of linear differential equations with constant coefficients

  2010cites this paper
• Fast Algorithms for Towers of Finite Fields and Isogenies. (Algorithmes Rapides pour les Tours de Corps Finis et les Isogénies)

  2010cites this paper
• Modern Computer Arithmetic (version 0.5.1)

  2010cites this paper
• Faster algorithms for the square root and reciprocal of power series

  2009cites this paper
• On the bit-complexity of sparse polynomial multiplication

  2009cites this paper
• Fast arithmetics in artin-schreier towers over finite fields

  2009cites this paper
• Code Generation for Polynomial Multiplication

  2009influential citation
• Robust Algorithms For Generalized Pham Systems

  2009cites this paper
• Power series composition and change of basis

  2008influential citation
• On the Stability of Fast Polynomial Arithmetic

  2008cites this paper
• Solving structured linear systems with large displacement rank

  2008influential citation
• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation

  2008cites this paper
• Fast Conversion Algorithms for Orthogonal Polynomials

  2008cites this paper
• On the complexity of the gradient of a rational function

  2008cites this paper
• Fast Modular Composition in any Characteristic

  2008cites this paper
• A fast hermite transform with applications to protein structure determination

  2007cites this paper
• RECOMBINATION ALGORITHMS FOR BIVARIATE

  2007cites this paper
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator

  2007cites this paper