The following pages link to Seth Pettie (Q409346):
Displayed 50 items.
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Item:Q409346 (redirect page) (← links)
- Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts (Q543917) (← links)
- An inverse-Ackermann type lower bound for online minimum spanning tree verification (Q858114) (← links)
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices (Q1752672) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325) (← links)
- Mind the gap! (Q2414857) (← links)
- (Q2754133) (← links)
- Connectivity oracles for failure prone graphs (Q2875174) (← links)
- Connectivity Oracles for Planar Graphs (Q2904567) (← links)
- (Q2921727) (← links)
- Low distortion spanners (Q2930280) (← links)
- (Q3046491) (← links)
- Origins of Nonlinearity in Davenport–Schinzel Sequences (Q3094908) (← links)
- Sharp Bounds on Davenport-Schinzel Sequences of Every Order (Q3177745) (← links)
- Improved Distributed Approximate Matching (Q3177747) (← links)
- Additive spanners and (α, β)-spanners (Q3188987) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time (Q3196316) (← links)
- An optimal minimum spanning tree algorithm (Q3196633) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Dynamic Set Intersection (Q3449844) (← links)
- Three Generalizations of Davenport--Schinzel Sequences (Q3452162) (← links)
- (Q3579402) (← links)
- (Q3579431) (← links)
- (Q4425938) (← links)
- Scaling Algorithms for Weighted Matching in General Graphs (Q4554953) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- Threesomes, Degenerates, and Love Triangles (Q4561510) (← links)
- Higher Lower Bounds from the 3SUM Conjecture (Q4575670) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q4575768) (← links)
- Fully Dynamic Connectivity in <i>O</i>(log <i>n</i>(log log <i>n</i>)<sup>2</sup>) Amortized Expected Time (Q4575769) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4575773) (← links)
- Scaling Algorithms for Weighted Matching in General Graphs (Q4575788) (← links)
- (Q4606324) (← links)
- (Q4608064) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- (Q4633847) (← links)
- (Q4633861) (← links)
- (Q4636494) (← links)
- (Q4638106) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses (Q4687247) (← links)
- (Q4707795) (← links)