Rahul Jain

From MaRDI portal
Revision as of 02:56, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:343849

Available identifiers

zbMath Open jain.rahulMaRDI QIDQ343849

List of research outcomes

PublicationDate of PublicationType
Space efficient algorithm for solving reachability using tree decomposition and separators2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61462512024-02-05Paper
https://portal.mardi4nfdi.de/entity/Q61870292024-02-05Paper
https://portal.mardi4nfdi.de/entity/Q61878312024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60547442023-10-25Paper
A direct product theorem for one-way quantum communication2023-07-12Paper
Space-efficient algorithms for reachability in directed geometric graphs2023-05-23Paper
On the geometric thickness of 2-degenerate graphs2023-02-28Paper
https://portal.mardi4nfdi.de/entity/Q58755722023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58756492023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58756522023-02-03Paper
Randomized and Symmetric Catalytic Computation2022-10-19Paper
New directions in learning and control of stochastic networks2022-04-11Paper
Empirical Q-Value Iteration2021-03-29Paper
Multiple Source Replacement Path Problem2021-03-15Paper
Noisy Quantum State Redistribution With Promise and the Alpha-Bit2020-12-04Paper
A Composition Theorem for Randomized Query Complexity2020-11-25Paper
Posterior Sampling-Based Reinforcement Learning for Control of Unknown Linear Systems2020-10-07Paper
One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information2020-09-29Paper
Partially Smoothed Information Measures2020-09-29Paper
Parallel Device-Independent Quantum Key Distribution2020-09-29Paper
Non-indexability of the stochastic appointment scheduling problem2020-06-10Paper
https://portal.mardi4nfdi.de/entity/Q51111542020-05-26Paper
A minimax approach to one-shot entropy inequalities2020-03-05Paper
Quadratically tight relations for randomized query complexity2020-02-27Paper
A Universal Empirical Dynamic Programming Algorithm for Continuous State MDPs2020-01-28Paper
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction2020-01-28Paper
Relative Discrepancy Does Not Separate Information and Communication Complexity2019-12-06Paper
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel2019-07-19Paper
Efficient protocols for generating bipartite classical distributions and quantum states2019-05-15Paper
On the near-optimality of one-shot classical communication over quantum channels2019-02-11Paper
Building Blocks for Communication Over Noisy Quantum Networks2019-01-28Paper
On Regret-Optimal Learning in Decentralized Multiplayer Multiarmed Bandits2018-12-19Paper
Optimal Decentralized Control With Asymmetric One-Step Delayed Information Sharing2018-12-19Paper
Quadratically tight relations for randomized query complexity2018-11-28Paper
Coalitional Games for Transmitter Cooperation in MIMO Multiple Access Channels2018-08-22Paper
A One-Shot Achievability Result for Quantum State Redistribution2018-06-27Paper
A Generalized Quantum Slepian–Wolf2018-06-27Paper
Approachability in Stackelberg stochastic games with vector costs2018-04-03Paper
https://portal.mardi4nfdi.de/entity/Q45982782017-12-19Paper
Conditioned Functional Limits and Applications to Queues2017-11-06Paper
An Empirical Dynamic Programming Algorithm for Continuous MDPs2017-09-21Paper
Transitory Queueing Networks2017-08-19Paper
Information-theoretic approximations of the nonnegative rank2017-07-28Paper
Multipartite quantum correlation and communication complexities2017-07-28Paper
The Communication Complexity of Correlation2017-07-27Paper
Short Proofs of the Quantum Substate Theorem2017-07-12Paper
Scalar Estimation and Control With Noisy Binary Observations2017-07-12Paper
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States2017-06-08Paper
Risk-Constrained Markov Decision Processes2017-05-16Paper
The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited2017-05-16Paper
Decentralized Learning for Multiplayer Multiarmed Bandits2017-05-16Paper
New One Shot Quantum Protocols With Application to Communication Complexity2017-04-28Paper
Unidirectional Input/Output Streaming Complexity of Reversal and Sorting2017-03-22Paper
Matching Multiplications in Bit-Vector Formulas2017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29639062017-02-21Paper
A direct product theorem for two-party bounded-round public-coin communication complexity2016-11-29Paper
Empirical Dynamic Programming2016-05-19Paper
New Strong Direct Product Results in Communication Complexity2016-03-24Paper
A property of quantum relative entropy with an application to privacy in quantum communication2015-11-11Paper
Relative Discrepancy Does not Separate Information and Communication Complexity2015-10-27Paper
Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game2015-10-22Paper
A queueing model with independent arrivals, and its fluid and diffusion limits2015-07-07Paper
A Convex Analytic Approach to Risk-Aware Markov Decision Processes2015-06-24Paper
On Transitory Queueing2014-12-07Paper
Bertrand equilibria and efficiency in markets for congestible network services2014-10-20Paper
QIP = PSPACE2014-08-13Paper
A Parallel Approximation Algorithm for Positive Semidefinite Programming2014-07-30Paper
Two-Message Quantum Interactive Proofs Are in PSPACE2014-07-25Paper
QIP = PSPACE2014-02-17Paper
Optimal Decentralized Control with Asymmetric One-Step Delayed Information Sharing2013-09-24Paper
Stochastic Dominance-Constrained Markov Decision Processes2013-05-16Paper
https://portal.mardi4nfdi.de/entity/Q29137962012-09-27Paper
https://portal.mardi4nfdi.de/entity/Q29138172012-09-27Paper
Resource requirements of private quantum channels and consequences for oblivious remote state preparation2012-05-23Paper
Optimal direct sum results for deterministic and randomized decision tree complexity2012-03-27Paper
The concert queueing game: to wait or to be late2011-03-30Paper
A separation between divergence and Holevo information for ensembles2010-12-01Paper
An efficient Nash-implementation mechanism for network resource allocation2010-11-25Paper
Simulation-based optimization of Markov decision processes: an empirical process theory approach2010-11-25Paper
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas2010-07-20Paper
https://portal.mardi4nfdi.de/entity/Q31815902009-10-12Paper
New bounds on classical and quantum one-way communication complexity2009-07-10Paper
https://portal.mardi4nfdi.de/entity/Q36339532009-06-23Paper
New binding-concealing trade-offs for quantum string commitment2009-06-08Paper
https://portal.mardi4nfdi.de/entity/Q53020842009-01-05Paper
A Separation between Divergence and Holevo Information for Ensembles2008-05-27Paper
Propagation and cancellation of singularities in a class of Fuchsian operators and their perturbations2008-02-01Paper
\(C^{(1,1/3)}\)-regularity in the Dirichlet problem for \(\Delta _{\infty}\)2007-11-07Paper
Simulation‐based Uniform Value Function Estimates of Markov Decision Processes2007-09-24Paper
Combinatorial exchange mechanisms for efficient bandwidth allocation2006-03-16Paper
Lower bounds for adaptive locally decodable codes2005-11-15Paper
https://portal.mardi4nfdi.de/entity/Q44491842004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44152572003-07-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Rahul Jain