Bruno Salvy

Journal of Complexity · 2001–2004

A researcher in the Science corpus: 2 papers; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Whom Bruno Salvy trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Jean-Charles Faugère
  2. Jacob T. Schwartz

Papers from Bruno Salvy's perspective

Ordered by how strongly the researchers Bruno Salvy trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) (International Symposium on Symbolic and Algebraic Computation)
  2. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases (Annual International Cryptology Conference)
  3. The Design and Analysis of Computer Algorithms
  4. AND T
  5. Probabilistic algorithms for sparse polynomials
  6. The Magma Algebra System I: The User Language
  7. Fast Probabilistic Algorithms for Verification of Polynomial Identities
  8. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations (International Conference on the Theory and Application of Cryptographic Techniques)
  9. III. Contributions to the mathematical theory of evolution
  10. On the Alexander–Hirschowitz theorem

Their papers