Computing with polynomials given by straight-line programs I: greatest common divisors
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A system for manipulating polynomials given by straight-line programs
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
A fast implementation of polynomial factorization
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
Journal of Symbolic Computation
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Progress report on a system for general-purpose parallel symbolic algebraic computation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
On the decidability of sparse univariate polynomial interpolation
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
On the multi-threaded computation of integral polynomial greatest common divisors
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Three new algorithms for multivariate polynomial GCD
Journal of Symbolic Computation
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Learning sparse multivariate polynomials over a field with queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Signature functions for algebraic numbers
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Asymptotically fast solution of Toeplitz-like singular linear systems
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software (TOMS)
On computing greatest common divisors with polynomials given by black boxes for their evaluations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Reducing randomness via irrational numbers
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial time algorithms for modules over finite dimensional algebras
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On randomized Lanczos algorithms
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Certifying inconsistency of sparse linear systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Random Weighted Laplacians, Lovász minimum digraphs and finding minimum separators
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Multiplicative equations over commuting matrices
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimum parallel computations with banded matrices
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Nearly optimal computations with structured matrices
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
On the design and implementation of Brown's algorithm over the integers and number fields
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On Testing for Zero Polynomials by a Set of Points with Bounded Precision
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
On testing for zero polynomials by a set of points with bounded precision
Theoretical Computer Science - Computing and combinatorics
Functional programming concepts and straight-line programs in computer algebra
Mathematics and Computers in Simulation
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A modular GCD algorithm over number fields presented with multiple extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primality and identity testing via Chinese remaindering
Journal of the ACM (JACM)
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Testing polynomials which are easy to compute (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Implementing a polynomial factorization and GCD package
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A case study in interlanguage communication: Fast LISP polynomial operations written in 'C'
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Factorization over finitely generated fields
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Determining equivalence of expressions in random polynomial time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Early termination over small fields
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Fast computation of discrete invariants associated to a differential rational mapping
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Complexity results for triangular sets
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
The complexity of tensor calculus
Computational Complexity
Efficient decomposition of separable algebras
Journal of Symbolic Computation
Algorithms for polynomial GCD computation over algebraic function fields
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Polynomial equation solving by lifting procedures for ramified fibers
Theoretical Computer Science - Algebraic and numerical algorithm
Deformation techniques to solve generalised Pham systems
Theoretical Computer Science - Algebraic and numerical algorithm
Pseudorandom generators for low degree polynomials
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Computing the rank and a small nullspace basis of a polynomial matrix
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Preconditioners for singular black box matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
ACM SIGSAM Bulletin
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A block Wiedemann rank algorithm
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
Information Processing Letters
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Lifting and recombination techniques for absolute factorization
Journal of Complexity
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Faster inversion and other black box matrix computations using efficient block projections
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A sparse modular GCD algorithm for polynomials over algebraic function fields
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Faster algorithms for the characteristic polynomial
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Faster dynamic matchings and vertex connectivity
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Change of order for regular chains in positive dimension
Theoretical Computer Science
Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Solving structured linear systems with large displacement rank
Theoretical Computer Science
A new algorithm for sparse interpolation of multivariate polynomials
Theoretical Computer Science
Schur aggregation for linear systems and determinants
Theoretical Computer Science
An improved EZ-GCD algorithm for multivariate polynomials
Journal of Symbolic Computation
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
On factorization of multivariate polynomials over algebraic number and function fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A parametric representation of totally mixed Nash equilibria
Computers & Mathematics with Applications
Improved Polynomial Identity Testing for Read-Once Formulas
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A parameterized view on matroid optimization problems
Theoretical Computer Science
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Approximate string matching with address bit errors
Theoretical Computer Science
Guest column: from randomness extraction to rotating needles
ACM SIGACT News
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
The ideal membership problem and polynomial identity testing
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The monomial ideal membership problem and polynomial identity testing
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
Additive preconditioning for matrix computations
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
On sparse interpolation over finite fields
ACM Communications in Computer Algebra
New progress in real and complex polynomial root-finding
Computers & Mathematics with Applications
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
Proceedings of the forty-third annual ACM symposium on Theory of computing
Randomized preconditioning of the MBA algorithm
Proceedings of the 36th international symposium on Symbolic and algebraic computation
On solving systems of random linear disequations
Quantum Information & Computation
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algebraic independence and blackbox identity testing
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Language equivalence for probabilistic automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation
Editorial: Macsyma: A personal history
Journal of Symbolic Computation
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
SIAM Journal on Computing
An Almost Optimal Rank Bound for Depth-3 Identities
SIAM Journal on Computing
Marginal hitting sets imply super-polynomial lower bounds for permanent
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Shortest paths in matrix multiplication time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Ways to implement computer algebra compactly
ACM Communications in Computer Algebra
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A parameterized view on matroid optimization problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hierarchical representations with signatures for large expression management
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
String rearrangement metrics: a survey
Algorithms and Applications
Short proofs for the determinant identities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Reconstruction of depth-4 multilinear circuits with top fan-in 2
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Security and Communication Networks
New Techniques for the Computation of Linear Recurrence Coefficients
Finite Fields and Their Applications
DDH-Like assumptions based on extension rings
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Information Processing Letters
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
Approximate verification and enumeration problems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Algebraic independence and blackbox identity testing
Information and Computation
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Weighted Reed---Muller codes revisited
Designs, Codes and Cryptography
Quasi-polynomial hitting-set for set-depth-Δ formulas
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Matrix sparsification and nested dissection over arbitrary fields
Journal of the ACM (JACM)
Counting matchings of size k is # W[1]-hard
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials
ACM Communications in Computer Algebra
| Hi-index | 0.01 |