F. Gall

International Symposium on Symbolic and Algebraic Computation · 2001–2014

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

Whom F. Gall trusts overall

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

  1. Arkadi Nemirovski
  2. Virginia Vassilevska Williams
  3. A. Davie
  4. Aharon Ben-Tal
  5. Don Coppersmith

Who trusts F. Gall overall

  1. Michael B. Cohen
  2. Yin Tat Lee
  3. Andrew Lavin
  4. Zhao Song
  5. Frank Nielsen

Papers from F. Gall's perspective

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

  1. Lectures on modern convex optimization
  2. Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
  3. Improved bound for complexity of matrix multiplication (Proceedings of the Royal Society of Edinburgh. Section A Mathematics)
  4. An algorithm for quadratic programming
  5. Regression Shrinkage and Selection via the Lasso
  6. The concept of comonotonicity in actuarial science and finance: theory (Insurance, Mathematics & Economics)
  7. Some NP-complete problems in quadratic and nonlinear programming
  8. Some optimal inapproximability results
  9. A method for solving the convex programming problem with convergence rate O(1/k^2)
  10. On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming

Their papers