Kevin P. Costello

Orcid: 0000-0001-6697-0497

According to our database1, Kevin P. Costello authored at least 11 papers between 2008 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Information gathering in ad-hoc radio networks.
Inf. Comput., 2021

2019
An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs.
CoRR, 2019

2018
Information gathering in ad-hoc radio networks with tree topology.
Inf. Comput., 2018

Faster Information Gathering in Ad-Hoc Radio Tree Networks.
Algorithmica, 2018

2012
Matching with Commitments
CoRR, 2012

Stochastic Matching with Commitment.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Randomized greedy: new variants of some classic approximation algorithms.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Finding Patterns Avoiding Many Monochromatic Constellations.
Exp. Math., 2010

On the Rank of Random Sparse Matrices.
Comb. Probab. Comput., 2010

2009
Concentration of Random Determinants and Permanent Estimators.
SIAM J. Discret. Math., 2009

2008
The rank of random graphs.
Random Struct. Algorithms, 2008


  Loading...