Piotr Sankowski

45th Annual IEEE Symposium on Foundations of Computer Science · 2004

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

Whom Piotr Sankowski trusts overall

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

  1. Don Coppersmith
  2. Alfred V. Aho

Who trusts Piotr Sankowski overall

  1. Amir Abboud
  2. Virginia Vassilevska Williams

Papers from Piotr Sankowski's perspective

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

  1. The Design and Analysis of Computer Algorithms
  2. Matrix multiplication via arithmetic progressions
  3. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (JACM)
  4. Probabilistic algorithms for sparse polynomials
  5. Paths, Trees, and Flowers
  6. Fast Probabilistic Algorithms for Verification of Polynomial Identities
  7. Combinatorial optimization. Polyhedra and efficiency.
  8. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
  9. "PROOF"
  10. On Computable Numbers, with an Application to the Entscheidungsproblem.

Their papers