Discrete Analysis

Papers
(The TQCC of Discrete Analysis is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-05-01 to 2026-05-01.)
ArticleCitations
1
1
isoperimetric-inequalities-made-simpler1
1
a-dimension-free-remez-type-inequality-on-the-polytorus0
discreteness-of-asymptotic-tensor-ranks0
-counting-integer-points-on-affine-surfaces-with-a-side-condition0
-sdps-and-robust-satisfiability-of-promise-csp0
blow-up-lemmas-for-sparse-graphs0
0
0
0
0
exceptional-set-estimate-in-prime-fields-dimension-two-implies-higher-dimensions0
0
strong-bounds-for-skew-corner-free-sets0
unique-continuation-on-planar-graphs0
bounds-for-the-local-properties-problem-for-difference-sets0
-magnitude-function-determines-generic-finite-metric-spaces0
https://discreteanalysisjournal.com/article/145176-a-polynomial-freiman-ruzsa-inverse-theorem-for-function-fields0
-quasirandom-and-quasisimple-groups0
egular-bipartite-multigraphs-have-many-but-not-too-many-symmetries0
-square-packings-and-rectifiable-doubling-measures0
0
-small-doubling-implies-small-tripling-for-balls-of-large-radius0
universally-optimal-periodic-configurations-in-the-plane0
irreducibility-and-periodicity-in-mathbb-z-2-symbolic-systems0
slice-rank-and-analytic-rank-for-trilinear-forms0
0
-power-saving-for-the-brown-erdos-sos-problem0
a-very-sharp-threshold-for-first-order-logic-distinguishability-of-random-graphs0
0
uniform-finite-presentation-for-groups-of-polynomial-growth0
-functional-tilings-and-the-coven-meyerowitz-tiling-conditions0
-bohr-sets-in-sumsets-i-compact-abelian-groups0
-color-avoidance-for-monotone-paths0
a-note-on-the-power-sums-of-the-number-of-fibonacci-partitions0
0.013741970062256