The following pages link to Kevin P. Costello (Q547861):
Displaying 16 items.
- On randomizing two derandomized greedy algorithms (Q547862) (← links)
- Balancing Gaussian vectors (Q731362) (← links)
- Random symmetric matrices are almost surely nonsingular. (Q854582) (← links)
- On the number of integral graphs (Q905735) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Faster information gathering in ad-hoc radio tree networks (Q1742375) (← links)
- Bilinear and quadratic variants on the Littlewood-Offord problem (Q1955745) (← links)
- Information gathering in ad-hoc radio networks (Q2051793) (← links)
- Avoiding monochromatic solutions to 3-term equations (Q2112746) (← links)
- Stochastic Matching with Commitment (Q2843305) (← links)
- Finding Patterns Avoiding Many Monochromatic Constellations (Q2911514) (← links)
- Information Gathering in Ad-Hoc Radio Networks with Tree Topology (Q2942388) (← links)
- On the Rank of Random Sparse Matrices (Q3058294) (← links)
- Concentration of Random Determinants and Permanent Estimators (Q3583307) (← links)
- The rank of random graphs (Q3608296) (← links)
- (Q5365069) (← links)
