default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Aldridge
2020 – today
- 2024
[j9]Vivekanand Paligadu
, Oliver Johnson, Matthew Aldridge:
Small Error Algorithms for Tropical Group Testing. IEEE Trans. Inf. Theory 70(10): 7232-7250 (2024)- 2023
- [i18]Vivekanand Paligadu, Oliver Johnson, Matthew Aldridge:
Small error algorithms for tropical group testing. CoRR abs/2309.07264 (2023) - 2021
- [c9]Matthew Aldridge:
Pooled testing to isolate infected individuals. CISS 2021: 1-5 - [i17]Matthew Aldridge:
Pooled testing to isolate infected individuals. CoRR abs/2107.09633 (2021) - 2020
- [j8]Lan V. Truong, Matthew Aldridge, Jonathan Scarlett:
On the All-or-Nothing Behavior of Bernoulli Group Testing. IEEE J. Sel. Areas Inf. Theory 1(3): 669-680 (2020) - [i16]Matthew Aldridge:
Conservative two-stage group testing. CoRR abs/2005.06617 (2020)
2010 – 2019
- 2019
- [j7]Matthew Aldridge, Oliver Johnson, Jonathan Scarlett:
Group Testing: An Information Theory Perspective. Found. Trends Commun. Inf. Theory 15(3-4): 196-392 (2019) - [j6]Oliver Johnson, Matthew Aldridge, Jonathan Scarlett:
Performance of Group Testing Algorithms With Near-Constant Tests Per Item. IEEE Trans. Inf. Theory 65(2): 707-723 (2019) - [j5]Matthew Aldridge:
Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime. IEEE Trans. Inf. Theory 65(4): 2058-2061 (2019) - [c8]Matthew Aldridge:
Rates of Adaptive Group Testing in the Linear Regime. ISIT 2019: 236-240 - [i15]Matthew Aldridge:
Rates of adaptive group testing in the linear regime. CoRR abs/1901.09687 (2019) - [i14]Matthew Aldridge, Oliver Johnson, Jonathan Scarlett:
Group testing: an information theory perspective. CoRR abs/1902.06002 (2019) - 2018
- [i13]Matthew Aldridge:
Individual testing is optimal for nonadaptive group testing in the linear regime. CoRR abs/1801.08590 (2018) - 2017
- [j4]Matthew Aldridge, Leonardo Baldassini, Karen Gunderson:
Almost separable matrices. J. Comb. Optim. 33(1): 215-236 (2017) - [j3]Matthew Aldridge:
The Capacity of Bernoulli Nonadaptive Group Testing. IEEE Trans. Inf. Theory 63(11): 7142-7148 (2017) - [c7]Matthew Aldridge:
On the optimality of some group testing algorithms. ISIT 2017: 3085-3089 - [i12]Matthew Aldridge:
On the optimality of some group testing algorithms. CoRR abs/1705.02708 (2017) - 2016
- [c6]Matthew Aldridge, Oliver Johnson, Jonathan Scarlett:
Improved group testing rates with constant column weight designs. ISIT 2016: 1381-1385 - [i11]Matthew Aldridge, Oliver Johnson, Jonathan Scarlett:
Improved group testing rates with constant column weight designs. CoRR abs/1602.03471 (2016) - [i10]Oliver Johnson, Matthew Aldridge, Jonathan Scarlett:
Performance of group testing algorithms with constant tests-per-item. CoRR abs/1612.07122 (2016) - 2015
- [i9]Matthew Aldridge:
The capacity of Bernoulli nonadaptive group testing. CoRR abs/1511.05201 (2015) - 2014
- [j2]Matthew Aldridge, Leonardo Baldassini, Oliver Johnson:
Group Testing Algorithms: Bounds and Simulations. IEEE Trans. Inf. Theory 60(6): 3671-3687 (2014) - [i8]Matthew Aldridge, Leonardo Baldassini, Karen Gunderson:
Almost Separable Matrices. CoRR abs/1410.1826 (2014) - 2013
- [c5]Leonardo Baldassini, Oliver Johnson, Matthew Aldridge:
The capacity of adaptive group testing. ISIT 2013: 2676-2680 - [i7]Leonardo Baldassini, Oliver Johnson, Matthew Aldridge:
The Capacity of Adaptive Group Testing. CoRR abs/1301.7023 (2013) - [i6]Matthew Aldridge, Leonardo Baldassini, Oliver Johnson:
Group testing algorithms: bounds and simulations. CoRR abs/1306.6438 (2013) - 2012
- [c4]Matthew Aldridge:
Adaptive group testing as channel coding with feedback. ISIT 2012: 1832-1836 - [c3]Oliver Johnson, Matthew Aldridge, Robert J. Piechocki:
Delay-rate tradeoff in ergodic interference alignment. ISIT 2012: 2626-2630 - [i5]Matthew Aldridge:
Adaptive group testing as channel coding with feedback. CoRR abs/1203.5927 (2012) - 2011
- [j1]Oliver Johnson, Matthew Aldridge, Robert J. Piechocki:
Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks. IEEE Trans. Inf. Theory 57(1): 282-290 (2011) - [i4]Matthew Aldridge:
Interference Mitigation in Large Random Wireless Networks. CoRR abs/1109.1255 (2011) - 2010
- [c2]Matthew Aldridge, Oliver Johnson, Robert J. Piechocki:
Asymptotic sum-capacity of random Gaussian interference networks using interference alignment. ISIT 2010: 410-414 - [i3]Matthew Aldridge, Oliver Johnson, Robert J. Piechocki:
Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using Interference Alignment. CoRR abs/1002.0235 (2010) - [i2]Oliver Johnson, Matthew Aldridge, Robert J. Piechocki:
Delay-rate tradeoff in ergodic interference alignment. CoRR abs/1004.0208 (2010)
2000 – 2009
- 2009
- [i1]Oliver Johnson, Matthew Aldridge, Robert J. Piechocki:
Interference alignment-based sum capacity bounds for random dense Gaussian interference networks. CoRR abs/0907.5165 (2009) - 2007
- [c1]Matthew Aldridge:
A parallel finite state machine implementation of a nearest-eight Hoshen-Kopelman adaptation for landscape analysis. ACM Southeast Regional Conference 2007: 391-394
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.
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.
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.
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 2025-03-04 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
