Satoru Iwata
Symposium on the Theory of Computing · 2000
A researcher in the Science corpus: 1 paper; trusts 0 researchers and is trusted by 13 researchers here, as inferred from the citation graph.
Whom Satoru Iwata trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Satoru Iwata overall
- Zuo-Jun Max Shen
- James B. Orlin
- Paul D. Seymour
- Vladimir Kolmogorov
- Dieter Fox
- Yin Tat Lee
- Sang-il Oum
- Jan Vondr'ak
- Ramin Zabih
- Tomáš Werner
Papers from Satoru Iwata's perspective
Ordered by how strongly the researchers Satoru Iwata trusts endorse each paper. Same corpus, a different order for every researcher.
- Submodular Functions, Matroids, and Certain Polyhedra (Combinatorial Optimization)
- Submodular functions and convexity
- Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions
- Hit-and-run from a corner
- Efficient Testing of Large Graphs (40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039))
- Geometry of cuts and metrics (Algorithms and Combinatorics)
- THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING
- Introduction to Circle Packing: The Theory of Discrete Analytic Functions
- Directed scale-free graphs (ACM-SIAM Symposium on Discrete Algorithms)
- An Approximate Version of Sidorenko’s Conjecture
Their papers
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (2000) — 697 citations