![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kevin P. Costello
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j7]Marek Chrobak, Kevin P. Costello, Leszek Gasieniec:
Information gathering in ad-hoc radio networks. Inf. Comput. 281: 104769 (2021)
2010 – 2019
- 2019
- [i5]Alexander Choi, Marek Chrobak, Kevin P. Costello:
An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs. CoRR abs/1908.07097 (2019) - [i4]Marek Chrobak, Kevin P. Costello, Leszek Gasieniec:
Information Gathering in Ad-Hoc Radio Networks. CoRR abs/1909.03636 (2019) - 2018
- [j6]Marek Chrobak, Kevin P. Costello
:
Faster Information Gathering in Ad-Hoc Radio Tree Networks. Algorithmica 80(3): 1013-1040 (2018) - [j5]Marek Chrobak, Kevin P. Costello
, Leszek Gasieniec, Dariusz R. Kowalski:
Information gathering in ad-hoc radio networks with tree topology. Inf. Comput. 258: 1-27 (2018) - 2016
- [c4]Marek Chrobak, Kevin P. Costello
:
Faster Information Gathering in Ad-Hoc Radio Tree Networks. LATIN 2016: 275-289 - 2015
- [i3]Marek Chrobak, Kevin P. Costello:
Faster Information Gathering in Ad-Hoc Radio Tree Networks. CoRR abs/1512.02179 (2015) - 2014
- [c3]Marek Chrobak, Kevin P. Costello
, Leszek Gasieniec, Darek Kowalski:
Information Gathering in Ad-Hoc Radio Networks with Tree Topology. COCOA 2014: 129-145 - [i2]Marek Chrobak, Kevin P. Costello, Leszek Gasieniec, Dariusz R. Kowalski:
Information Gathering in Ad-Hoc Radio Networks with Tree Topology. CoRR abs/1407.1521 (2014) - 2012
- [c2]Kevin P. Costello
, Prasad Tetali, Pushkar Tripathi:
Stochastic Matching with Commitment. ICALP (1) 2012: 822-833 - [i1]Kevin P. Costello, Prasad Tetali, Pushkar Tripathi:
Matching with Commitments. CoRR abs/1205.1721 (2012) - 2011
- [c1]Kevin P. Costello
, Asaf Shapira, Prasad Tetali:
Randomized greedy: new variants of some classic approximation algorithms. SODA 2011: 647-655 - 2010
- [j4]Kevin P. Costello
, Van H. Vu:
On the Rank of Random Sparse Matrices. Comb. Probab. Comput. 19(3): 321-342 (2010) - [j3]Steve Butler, Kevin P. Costello
, Ronald L. Graham:
Finding Patterns Avoiding Many Monochromatic Constellations. Exp. Math. 19(4): 399-411 (2010)
2000 – 2009
- 2009
- [j2]Kevin P. Costello
, Van H. Vu:
Concentration of Random Determinants and Permanent Estimators. SIAM J. Discret. Math. 23(3): 1356-1371 (2009) - 2008
- [j1]Kevin P. Costello
, Van H. Vu:
The rank of random graphs. Random Struct. Algorithms 33(3): 269-285 (2008)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint