The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
Integer Arithmetic Algorithms for Polynomial Real Zero Determination
Journal of the ACM (JACM)
Determining the Equivalence of Algebraic Expressions by Hash Coding
Journal of the ACM (JACM)
Proof, Completeness, Transcendentals, and Sampling
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM (JACM)
Uniform closure properties of P-computable functions
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The two-processor scheduling problem is in R-NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Constructing a perfect matching is in random NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
Fast parallel algorithms for similarity of matrices
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
New results for random determination of equivalence of expressions
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
A system for manipulating polynomials given by straight-line programs
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
The design of LINETOOL, a geometric editor
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Factoring rational polynomials over the complexes
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Automatic parameterization of rational curves and surfaces IV: algebraic space curves
ACM Transactions on Graphics (TOG) - Special issue on computer-aided design
Functional decomposition ofpolynomials: the tame case
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Geometric computations with algebraic varieties of bounded degree
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Using types as search keys in function libraries
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
On the decidability of sparse univariate polynomial interpolation
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The complexity of equivalence for commutative rings
Journal of Symbolic Computation
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third 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
Learning arithmetic read-once formulas
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Type matching, type-graphs, and the Schanuel conjecture
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
On the complexity of functions for random access machines
Journal of the ACM (JACM)
Decomposition of *-closed algebras in polynomial time
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
A practical method for the sparse resultant
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
On learning arithmetic read-once formulas with exponentiation (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
O(log2 n) time efficient parallel factorization of dense, sparse separable, and banded matrices
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
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
Fast algorithms for rational forms of integer matrices
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
ACM SIGSAM Bulletin
A note on probabilistically verifying integer and polynomial products
Journal of the ACM (JACM)
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software (TOMS)
Fast computation of the Smith normal form of an integer matrix
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Preconditioning of rectangular polynomial matrices for efficient Hermite normal form computation
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
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
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Work efficient parallel solution of Toeplitz systems and polynomial GCD
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing shift-equivalence of polynomials using quantum machines
ISSAC '96 Proceedings of the 1996 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
Improved low-degree testing and its applications
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 symmetric powers of differential operators
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
Asymptotically fast computation of subresultants
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
IEEE Transactions on Computers
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A black box approach to the algebraic set decomposition problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Certifying inconsistency of sparse linear systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the complexity of diophantine geometry in low dimensions (extended abstract)
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
The complexity of resolvent resolved
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
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM (JACM)
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
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
An overview of computational complexity
Communications of the ACM
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On solutions of linear functional systems
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Lower bounds for dynamic algebraic problems
Information and Computation
Discovering affine equalities using random interpretation
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deterministic identity testing for multivariate polynomials
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Generic Algorithms and Key Agreement Protocols Based on Group Actions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
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
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Security of Signed ElGamal Encryption
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
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
Selected topics on assignment problems
Discrete Applied Mathematics
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
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
Determining equivalence of expressions in random polynomial time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Characteristic polynomial method for verification and test of combinational circuits
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
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)
Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems
Global value numbering using random interpretation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of tensor calculus
Computational Complexity
Efficient decomposition of separable algebras
Journal of Symbolic Computation
Cardinality constrained minimum cut problems: complexity and algorithms
Discrete Applied Mathematics
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
Numerical decomposition of geometric constraints
Proceedings of the 2005 ACM symposium on Solid and physical modeling
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
Computing the rank and a small nullspace basis of a polynomial matrix
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
Encyclopedia of Computer Science
Energy Aware Computing through Probabilistic Switching: A Study of Limits
IEEE Transactions on Computers
Efficient parallel factorization and solution of structured and unstructured linear systems
Journal of Computer and System Sciences
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
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
Simulation-Based Functional Test Generation for Embedded Processors
IEEE Transactions on Computers
Information Processing Letters
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Decoding interleaved Reed-Solomon codes over noisy channels
Theoretical Computer Science
Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
Designs, Codes and Cryptography
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
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
An overview of computational complexity
ACM Turing award lectures
Randomised algorithms for isomorphisms of simple types
Mathematical Structures in Computer Science
Foundations and Trends® in Networking
The complexity of two problems on arithmetic circuits
Theoretical Computer Science
Change of order for regular chains in positive dimension
Theoretical Computer Science
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
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
An algorithm for automatic checking of exercises in a dynamic geometry system: iGeom
Computers & Education
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
New Multiparty Signature Schemes for Network Routing Applications
ACM Transactions on Information and System Security (TISSEC)
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Reliable Implementation of Real Number Algorithms: Theory and Practice
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
Schur aggregation for linear systems and determinants
Theoretical Computer Science
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
A CCA Secure Hybrid Damgård's ElGamal Encryption
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
Small synopses for group-by query verification on outsourced data streams
ACM Transactions on Database Systems (TODS)
Automatic mining of functionally equivalent code fragments via random testing
Proceedings of the eighteenth international symposium on Software testing and analysis
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
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
Rigid realizations of graphs on small grids
Computational Geometry: Theory and Applications
Geometric constraint solving: The witness configuration method
Computer-Aided Design
An efficient solution for Cauchy-likesystems of linear equations
Computers & Mathematics with Applications
On the complexity of the resolvent representation of some prime differential ideals
Journal of Complexity
Fast computation of special resultants
Journal of Symbolic Computation
From an approximate to an exact absolute polynomial factorization
Journal of Symbolic Computation
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
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Decoding of interleaved Reed Solomon codes over noisy data
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Extracting a simplified view of design functionality based on vector simulation
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Cryptographic primitives enforcing communication and storage complexity
FC'02 Proceedings of the 6th international conference on Financial cryptography
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
Software integrity checking expressions (ICEs) for robust tamper detection
IH'07 Proceedings of the 9th international conference on Information hiding
Attribute-based broadcast encryption scheme made efficient
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Additive preconditioning for matrix computations
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Dimensions in program synthesis
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable
Proceedings of the 2010 International Symposium on Symbolic and Algebraic 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
Efficient fuzzy matching and intersection on private datasets
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Enumeration of the monomials of a polynomial and related complexity classes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
New progress in real and complex polynomial root-finding
Computers & Mathematics with Applications
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
Efficient message space extension for automorphic signatures
ISC'10 Proceedings of the 13th international conference on Information security
The complexity of acyclic subhypergraph problems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Synthesizing geometry constructions
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
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
A signature scheme with efficient proof of validity
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
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
Invitation to algorithmic uses of inclusion-exclusion
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
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
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
Detecting lacunary perfect powers and computing their roots
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
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On persistent homotopy, knotted complexes and the Alexander module
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Marginal hitting sets imply super-polynomial lower bounds for permanent
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Shortest cycle through specified elements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Shortest paths in matrix multiplication time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Hard instances of the constrained discrete logarithm problem
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A verifiable random function with short proofs and keys
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
On parity check (0, 1)-matrix over Zp
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Valiant's model: from exponential sums to exponential products
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Faster p-adic feasibility for certain multivariate sparse polynomials
Journal of Symbolic Computation
About the security of MTI/C0 and MQV
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
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
Abstract models of computation in cryptography
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
On error correction in the exponent
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Block-wise p-signatures and non-interactive anonymous credentials with efficient attributes
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
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
Interrogating witnesses for geometric constraint solving
Information and Computation
Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states
Quantum Information & Computation
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
Group to group commitments do not shrink
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Discrete Optimization
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
Zero-Knowledge proofs via polynomial representations
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Information Processing Letters
Improving the security of MACs via randomized message preprocessing
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Approximate verification and enumeration problems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
A polynomial-time algorithm for the jacobson form of a matrix of ore polynomials
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Algebraic independence and blackbox identity testing
Information and Computation
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Affine solution sets of sparse polynomial systems
Journal of Symbolic Computation
Weighted Reed---Muller codes revisited
Designs, Codes and Cryptography
On the (im)possibility of projecting property in prime-order setting
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Optimal reductions of some decisional problems to the rank problem
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Masque: access control for interactive sharing of encrypted data in social networks
NSS'12 Proceedings of the 6th international conference on Network and System Security
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
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
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
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 more efficient computationally sound non-interactive zero-knowledge shuffle argument
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.04 |