The following pages link to Adam Sheffer (Q312144):
Displaying 38 items.
- Bisector energy and few distinct distances (Q312146) (← links)
- Fast domino tileability (Q312152) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Counting triangulations of planar point sets (Q540059) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- Point-curve incidences in the complex plane (Q722326) (← links)
- Incidences with curves in \(\mathbb{R}^d\) (Q727188) (← links)
- A note on distinct distances in rectangular lattices (Q740655) (← links)
- Few distinct distances implies no heavy lines or circles (Q1701352) (← links)
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- A reduction for the distinct distances problem in \(\mathbb{R}^d\) (Q2000647) (← links)
- A general incidence bound in \(\mathbb{R}^d\) (Q2033938) (← links)
- Sum-product phenomena for planar hypercomplex numbers (Q2198990) (← links)
- Local properties in colored graphs, distinct distances, and difference sets (Q2322550) (← links)
- Distinct distances on two lines (Q2349200) (← links)
- A construction for difference sets with local properties (Q2422243) (← links)
- A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
- Distinct distances on non-ruled surfaces and between circles (Q2690125) (← links)
- Lower bounds for incidences with hypersurfaces (Q2826220) (← links)
- Bounds on the Maximum Multiplicity of Some Common Geometric Graphs (Q2848539) (← links)
- Counting plane graphs (Q2874581) (← links)
- Incidences with $k$-non-degenerate sets and their applications (Q2968122) (← links)
- (Q3113726) (← links)
- Incidences with Curves in ℝ d (Q3452856) (← links)
- Counting Plane Graphs: Cross-Graph Charging Schemes (Q4912187) (← links)
- Distinct distances in the complex plane (Q5009321) (← links)
- On the number of discrete chains (Q5157810) (← links)
- Improved bounds for incidences between points and circles (Q5174467) (← links)
- Local Properties via Color Energy Graphs and Forbidden Configurations (Q5208745) (← links)
- Improved Bounds for Incidences Between Points and Circles (Q5364239) (← links)
- Bisector energy and few distinct distances (Q5368711) (← links)
- Counting Plane Graphs: Cross-Graph Charging Schemes (Q5397740) (← links)
- On degrees in random triangulations of point sets (Q5405894) (← links)
- Polynomial Methods and Incidence Theory (Q5862006) (← links)
- The constant of point-line incidence constructions (Q6110067) (← links)
- A structural Szemerédi-Trotter theorem for Cartesian products (Q6151032) (← links)
- Distinct distances in \(\mathbf{R}^3\) between quadratic and orthogonal curves (Q6568861) (← links)
