The following pages link to C. Seshadhri (Q472462):
Displaying 50 items.
- Is submodularity testable? (Q472463) (← links)
- Avoiding the global sort: a faster contour tree algorithm (Q1688860) (← links)
- Correction to: ``Avoiding the global sort: a faster contour tree algorithm'' (Q2679593) (← links)
- Decompositions of Triangle-Dense Graphs (Q2796209) (← links)
- An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube (Q2805510) (← links)
- Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling (Q2830613) (← links)
- Noise Tolerance of Expanders and Sublinear Expansion Reconstruction (Q2839180) (← links)
- An Optimal Lower Bound for Monotonicity Testing over Hypergrids (Q2851875) (← links)
- Self-improving algorithms for coordinate-wise maxima (Q2874589) (← links)
- Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs (Q2900593) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- A Scalable Generative Graph Model with Community Structure (Q2940027) (← links)
- Counting Triangles in Massive Graphs with MapReduce (Q2940042) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- An Almost Optimal Rank Bound for Depth-3 Identities (Q2999861) (← links)
- Self-Improving Algorithms (Q3020010) (← links)
- Avoiding the Global Sort: A Faster Contour Tree Algorithm (Q3132893) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
- (Q3579388) (← links)
- (Q3601563) (← links)
- Self-improving algorithms for delaunay triangulations (Q3602908) (← links)
- Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance (Q4575879) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- (Q4608033) (← links)
- A stopping criterion for Markov chains when generating independent random graphs (Q4689355) (← links)
- Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter (Q4907583) (← links)
- Local Property Reconstruction and Monotonicity (Q4933387) (← links)
- Property Testing on Product Distributions (Q4962661) (← links)
- Wedge sampling for computing clustering coefficients and triangle counts on large graphs<sup>†</sup> (Q4969952) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? (Q4985805) (← links)
- (Q5002730) (← links)
- Self-Improving Algorithms (Q5027278) (← links)
- Distribution-Free Models of Social Networks (Q5027294) (← links)
- Adaptive Boolean Monotonicity Testing in Total Influence Time (Q5090393) (← links)
- Optimal unateness testers for real-valued functions: Adaptivity helps (Q5111334) (← links)
- (Q5111336) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- (Q5140837) (← links)
- Faster sublinear approximation of the number of <i>k</i>-cliques in low-arboricity graphs (Q5146866) (← links)
- Domain Reduction for Monotonicity Testing: A <i>o</i>(<i>d</i>) Tester for Boolean Functions in <i>d</i>-Dimensions (Q5146908) (← links)
- Random walks and forbidden minors II (Q5212798) (← links)
- On approximating the number of k-cliques in sublinear time (Q5230333) (← links)
- (Q5294162) (← links)
- Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties (Q5363109) (← links)
- Local Monotonicity Reconstruction (Q5390580) (← links)
- Online geometric reconstruction (Q5395660) (← links)
- An in-depth analysis of stochastic Kronecker graphs (Q5395712) (← links)
- From sylvester-gallai configurations to rank bounds (Q5395729) (← links)
