default search action
Thomas Stahlbuhk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Benjamin D. Kim, Vipindev Adat Vasudevan, Jongchan Woo, Alejandro Cohen, Rafael G. L. D'Oliveira, Thomas Stahlbuhk, Muriel Médard:
Crypto-Mine: Cryptanalysis Via Mutual Information Neural Estimation. ICASSP 2024: 4820-4824 - [i6]Jongchan Woo, Vipindev Adat Vasudevan, Benjamin D. Kim, Rafael G. L. D'Oliveira, Alejandro Cohen, Thomas Stahlbuhk, Ken R. Duffy, Muriel Médard:
Leveraging AES Padding: dBs for Nothing and FEC for Free in IoT Systems. CoRR abs/2405.05107 (2024) - 2023
- [c8]Maya E. Flores, Thomas Stahlbuhk, Alexander M. Wyglinski:
Persistent Throughput-Optimal Scheduling for Smart Jamming Resiliency. MILCOM 2023: 907-912 - [i5]Jongchan Woo, Vipindev Adat Vasudevan, Benjamin D. Kim, Alejandro Cohen, Rafael G. L. D'Oliveira, Thomas Stahlbuhk, Muriel Médard:
CERMET: Coding for Energy Reduction with Multiple Encryption Techniques - It's easy being green. CoRR abs/2308.05063 (2023) - [i4]Benjamin D. Kim, Vipindev Adat Vasudevan, Jongchan Woo, Alejandro Cohen, Rafael G. L. D'Oliveira, Thomas Stahlbuhk, Muriel Médard:
CRYPTO-MINE: Cryptanalysis via Mutual Information Neural Estimation. CoRR abs/2309.08019 (2023) - 2022
- [c7]Allan Ko, Thomas Stahlbuhk, Brooke Shrader:
Rate Control with Autoregressive Forecasting for High Frequency Communication. MILCOM 2022: 775-780 - 2021
- [j3]Thomas Stahlbuhk
, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Minimizing Queue Length Regret. IEEE Trans. Inf. Theory 67(3): 1759-1781 (2021) - [c6]Rafael G. L. D'Oliveira, Alejandro Cohen, John Robinson, Thomas Stahlbuhk, Muriel Médard:
Post-Quantum Security for Ultra-Reliable Low-Latency Heterogeneous Networks. MILCOM 2021: 933-938 - [i3]Rafael G. L. D'Oliveira, Alejandro Cohen, John Robinson, Thomas Stahlbuhk, Muriel Médard:
Post-Quantum Security for Ultra-Reliable Low-Latency Heterogeneous Networks. CoRR abs/2108.06409 (2021) - 2020
- [j2]Thomas Stahlbuhk
Throughput Maximization in Uncooperative Spectrum Sharing Networks. IEEE/ACM Trans. Netw. 28(6): 2517-2530 (2020) - [i2]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Minimizing Queue Length Regret. CoRR abs/2005.05206 (2020) - [i1]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Throughput Maximization in Uncooperative Spectrum Sharing Networks. CoRR abs/2008.01528 (2020)
2010 – 2019
- 2019
- [j1]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning algorithms for scheduling in wireless networks with unknown channel statistics. Ad Hoc Networks 85: 131-144 (2019) - 2018
- [c5]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Minimizing Queue Length Regret. ISIT 2018: 1001-1005 - [c4]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Scheduling in Wireless Networks with Unknown Channel Statistics. MobiHoc 2018: 31-40 - 2016
- [c3]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Throughput maximization in uncooperative spectrum sharing networks. ISIT 2016: 1242-1246 - [c2]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Topology control for wireless networks with highly-directional antennas. WiOpt 2016: 266-273 - 2012
- [c1]Thomas Stahlbuhk, Brooke Shrader:
Reliability guarantees for lossy network coding subgraph construction. Allerton Conference 2012: 541-548
Coauthor Index
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-08-06 21:04 CEST 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: