default search action
Brooke Shrader
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Jerrod Wigmore
, Brooke Shrader
Intervention-Assisted Online Deep Reinforcement Learning for Stochastic Queuing Network Optimization. MobiHoc 2024: 301-310 - [i7]Jerrod Wigmore, Brooke Shrader, Eytan H. Modiano:
Intervention-Assisted Policy Gradient Methods for Online Stochastic Queuing Network Optimization: Technical Report. CoRR abs/2404.04106 (2024) - 2023
- [c25]Jerrod Wigmore, Brooke Shrader, Eytan H. Modiano:
Hierarchical Thompson Sampling for Multi-band Radio Channel Selection. IFIP Networking 2023: 1-9 - 2022
- [c24]Allan Ko, Thomas Stahlbuhk, Brooke Shrader:
Rate Control with Autoregressive Forecasting for High Frequency Communication. MILCOM 2022: 775-780 - 2021
- [j12]Thomas Stahlbuhk
Learning Algorithms for Minimizing Queue Length Regret. IEEE Trans. Inf. Theory 67(3): 1759-1781 (2021) - 2020
- [j11]Thomas Stahlbuhk
Throughput Maximization in Uncooperative Spectrum Sharing Networks. IEEE/ACM Trans. Netw. 28(6): 2517-2530 (2020) - [i6]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Minimizing Queue Length Regret. CoRR abs/2005.05206 (2020) - [i5]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Throughput Maximization in Uncooperative Spectrum Sharing Networks. CoRR abs/2008.01528 (2020)
2010 – 2019
- 2019
- [j10]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
- [c23]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Minimizing Queue Length Regret. ISIT 2018: 1001-1005 - [c22]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Scheduling in Wireless Networks with Unknown Channel Statistics. MobiHoc 2018: 31-40 - 2017
- [j9]Nathaniel M. Jones
An Overlay Architecture for Throughput Optimal Multipath Routing. IEEE/ACM Trans. Netw. 25(5): 2615-2628 (2017) - 2016
- [c21]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Throughput maximization in uncooperative spectrum sharing networks. ISIT 2016: 1242-1246 - [c20]Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Topology control for wireless networks with highly-directional antennas. WiOpt 2016: 266-273 - 2015
- [j8]Randy Cogill, Brooke Shrader:
Delay Bounds for Random Linear Coding in Parallel Relay Networks. IEEE Trans. Mob. Comput. 14(5): 964-974 (2015) - [c19]Scott Pudlewski
MQCC: Maximum Queue Congestion Control for Multipath Networks with Blockage. MASS 2015: 91-99 - [c18]Brooke Shrader, Scott Pudlewski
A multipath routing overlay for networks with blockage. SECON 2015: 283-291 - 2014
- [c17]Nathaniel M. Jones, Georgios S. Paschos, Brooke Shrader, Eytan H. Modiano:
An overlay architecture for throughput optimal multipath routing. MobiHoc 2014: 73-82 - [c16]William C. Barto, Andrea L. Brennen, Laura Herrera, Nathaniel M. Jones, Scott Pudlewski
Demo: routing overlay for reliable communication in networks with blockage. MobiHoc 2014: 409-410 - 2013
- [c15]Nathaniel M. Jones, Brooke Shrader, Eytan H. Modiano:
Distributed CSMA with pairwise coding. INFOCOM 2013: 2094-2102 - 2012
- [j7]Brooke Shrader, Anthony Ephremides:
Queueing Delay Analysis for Multicast With Random Linear Coding. IEEE Trans. Inf. Theory 58(1): 421-429 (2012) - [c14]Thomas Stahlbuhk, Brooke Shrader:
Reliability guarantees for lossy network coding subgraph construction. Allerton Conference 2012: 541-548 - [c13]Nathaniel M. Jones, Brooke Shrader, Eytan H. Modiano:
Optimal routing and scheduling for a simple network coding scheme. INFOCOM 2012: 352-360 - 2011
- [j6]Randy Cogill, Brooke Shrader:
Multicast Queueing Delay: Performance Limits and Order-Optimality of Random Linear Coding. IEEE J. Sel. Areas Commun. 29(5): 1075-1083 (2011) - [j5]Brooke Shrader, Armen Babikyan, Nathaniel M. Jones, Thomas H. Shake, Andrew P. Worthen:
Rate Control for Network-Coded Multipath Relaying with Time-Varying Connectivity. IEEE J. Sel. Areas Commun. 29(5): 1106-1117 (2011) - [j4]Randy Cogill, Brooke Shrader, Anthony Ephremides:
Stable Throughput for Multicast With Random Linear Coding. IEEE Trans. Inf. Theory 57(1): 267-281 (2011) - [c12]Randy Cogill, Brooke Shrader:
Delay bounds for random linear coding in multihop relay networks. CISS 2011: 1-6 - [c11]Brooke Shrader, Thomas C. Royster IV:
Cooperative Multicast Strategies under Heterogeneous Link Loss Rates. GLOBECOM 2011: 1-5 - [c10]Brooke Shrader, Thomas H. Shake, Joshua Funk, Armen Babikyan, Andrew P. Worthen:
Routing and rate control for coded cooperation in a satellite-terrestrial network. MILCOM 2011: 735-740
2000 – 2009
- 2009
- [j3]Brooke Shrader, Haim H. Permuter
Feedback capacity of the compound channel. IEEE Trans. Inf. Theory 55(8): 3629-3644 (2009) - [c9]Randy Cogill, Brooke Shrader:
Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding. Allerton 2009: 462-468 - 2008
- [b1]Brooke Shrader:
Distributed Wireless Multicast: Throughput and Delay. University of Maryland, College Park, MD, USA, 2008 - [j2]Anthony Ephremides, Sidharth Jaggi, Tracey Ho, Brooke Shrader, Sae-Young Chung:
Network coding. J. Commun. Networks 10(4): 367-370 (2008) - [c8]Randy Cogill, Brooke Shrader, Anthony Ephremides:
Random linear coding for multicast over a time-varying channel. Allerton 2008: 332-338 - [c7]Matthew Andrews, Brooke Shrader:
Medium access control for multicast traffic in ad-hoc networks. Allerton 2008: 784-790 - [c6]Randy Cogill, Brooke Shrader, Anthony Ephremides:
Stability analysis of random linear coding across multicast sessions. ISIT 2008: 31-35 - [c5]Brooke Shrader, Matthew Andrews:
Optimal multicast throughput in random access networks of general topology. WiOpt 2008: 162-170 - 2007
- [j1]Brooke Shrader, Anthony Ephremides:
Random Access Broadcast: Stability and Throughput Analysis. IEEE Trans. Inf. Theory 53(8): 2915-2921 (2007) - [c4]Brooke Shrader, Haim H. Permuter
On the Compound Finite State Channel with Feedback. ISIT 2007: 396-400 - [c3]Brooke Shrader, Anthony Ephremides:
On packet lengths and overhead for random linear coding over the erasure channel. IWCMC 2007: 314-318 - [i4]Brooke Shrader, Anthony Ephremides:
On packet lengths and overhead for random linear coding over the erasure channel. CoRR abs/0704.0831 (2007) - [i3]Brooke Shrader, Anthony Ephremides:
Random Access Broadcast: Stability and Throughput Analysis. CoRR abs/0704.2778 (2007) - [i2]Brooke Shrader, Anthony Ephremides:
On the Shannon capacity and queueing stability of random access multicast. CoRR abs/0705.3058 (2007) - [i1]Brooke Shrader, Haim H. Permuter:
Feedback Capacity of the Compound Channel. CoRR abs/0711.0705 (2007) - 2006
- [c2]Brooke Shrader, Anthony Ephremides:
The Capacity of the Asynchronous Compound Multiple Access Channel and Results for Random Access Systems. ISIT 2006: 2119-2123 - 2005
- [c1]Brooke Shrader, Anthony Ephremides:
Broadcast stability in random access. ISIT 2005: 2251-2255
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-10-23 20:31 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: