The following pages link to Seth Pettie (Q409346):
Displayed 50 items.
- (Q4737147) (← links)
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (Q4785625) (← links)
- (Q4828943) (← links)
- (Q4829006) (← links)
- A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs (Q4962628) (← links)
- Randomized minimum spanning tree algorithms using exponentially fewer random bits (Q4962697) (← links)
- Exponential Separations in the Energy Complexity of Leader Election (Q4973045) (← links)
- Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma (Q4973056) (← links)
- Exponential separations in the energy complexity of leader election (Q4978022) (← links)
- (Q5009566) (← links)
- (Q5009581) (← links)
- Near-optimal Distributed Triangle Enumeration via Expander Decompositions (Q5056410) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- (Q5116490) (← links)
- Contention resolution without collision detection (Q5144901) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5146885) (← links)
- Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts (Q5157382) (← links)
- Sharp bounds on Davenport-Schinzel sequences of every order (Q5174492) (← links)
- The Energy Complexity of Broadcast (Q5197671) (← links)
- An optimal distributed (Δ+1)-coloring algorithm? (Q5230309) (← links)
- Distributed Triangle Detection via Expander Decomposition (Q5236234) (← links)
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs (Q5317203) (← links)
- Fast Distributed Coloring Algorithms for Triangle-Free Graphs (Q5327475) (← links)
- Contention resolution with log-logstar channel accesses (Q5361855) (← links)
- Brief Announcement (Q5361934) (← links)
- (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting (Q5363083) (← links)
- Sharp Bounds on Formation-free Sequences (Q5363086) (← links)
- A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs (Q5363094) (← links)
- Algorithms and Data Structures (Q5394237) (← links)
- On the structure and composition of forbidden sequences, with geometric applications (Q5404451) (← links)
- (Q5417674) (← links)
- (Q5417722) (← links)
- Low Distortion Spanners (Q5428799) (← links)
- The Energy Complexity of BFS in Radio Networks (Q5855245) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5892001) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5892130) (← links)
- Algorithms and Computation (Q5897928) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- (Q6075898) (← links)
- (Q6083382) (← links)
- Optimal vertex connectivity oracles (Q6083472) (← links)
- Byzantine agreement in polynomial time with near-optimal resilience (Q6083503) (← links)
- Information theoretic limits of cardinality estimation: Fisher meets Shannon (Q6087026) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
- (Q6147406) (← links)
- Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks (Q6201942) (← links)
- Improved bounds for multipass pairing heaps and path-balanced binary search trees (Q6303370) (← links)
- The Structure of Minimum Vertex Cuts (Q6360498) (← links)