Rajeev Agrawal
Computer Networks and Communications · 1995–2015
A researcher in the Science corpus: 4 papers; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 11 citations into it
- Electrical and Electronic Engineering — 11 citations into it
Whom Rajeev Agrawal trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Rajeev Agrawal overall
- Robert D. Kleinberg
- Aurélien Garivier
- Peter Auer
- Aleksandrs Slivkins
- Tor Lattimore
- Sébastien Bubeck
- R´emi Munos
- Olivier Capp'e
- Paat Rusmevichientong
- Keqin Liu
Papers from Rajeev Agrawal's perspective
Ordered by how strongly the researchers Rajeev Agrawal trusts endorse each paper. Same corpus, a different order for every researcher.
- Adaptive treatment allocation and the multi-armed bandit problem
- Asymptotically Efficient Adaptive Allocation Rules
- Fundamentals of statistical exponential families: with applications in statistical decision theory
- Providing quality of service over a shared wireless link (IEEE Communications Magazine)
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Transmit power adaptation for multiuser OFDM systems (IEEE J. Sel. Areas Commun.)
- An efficient multiuser loading algorithm for OFDM-based broadband wireless systems (Global Communications Conference)
- Fair end-to-end window-based congestion control
- Optimal Resource Allocation for OFDMA Downlink Systems (2006 IEEE International Symposium on Information Theory)
- Multiuser adaptive subcarrier-and-bit allocation with adaptive cell selection for OFDM systems (IEEE Transactions on Wireless Communications)
Their papers
- Discover trending domains using fusion of supervised machine learning with natural language processing (2015) — 14 citations
- Downlink scheduling and resource allocation for OFDM systems (2009) — 323 citations
- The Continuum-Armed Bandit Problem (1995)
- Sample mean based index policies by O(log n) regret for the multi-armed bandit problem (1995)