Publication | Date of Publication | Type |
---|
Space efficient algorithm for solving reachability using tree decomposition and separators | 2024-02-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q6146251 | 2024-02-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q6187029 | 2024-02-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q6187831 | 2024-01-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q6054744 | 2023-10-25 | Paper |
A direct product theorem for one-way quantum communication | 2023-07-12 | Paper |
Space-efficient algorithms for reachability in directed geometric graphs | 2023-05-23 | Paper |
On the geometric thickness of 2-degenerate graphs | 2023-02-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5875572 | 2023-02-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5875649 | 2023-02-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5875652 | 2023-02-03 | Paper |
Randomized and Symmetric Catalytic Computation | 2022-10-19 | Paper |
New directions in learning and control of stochastic networks | 2022-04-11 | Paper |
Empirical Q-Value Iteration | 2021-03-29 | Paper |
Multiple Source Replacement Path Problem | 2021-03-15 | Paper |
Noisy Quantum State Redistribution With Promise and the Alpha-Bit | 2020-12-04 | Paper |
A Composition Theorem for Randomized Query Complexity | 2020-11-25 | Paper |
Posterior Sampling-Based Reinforcement Learning for Control of Unknown Linear Systems | 2020-10-07 | Paper |
One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information | 2020-09-29 | Paper |
Partially Smoothed Information Measures | 2020-09-29 | Paper |
Parallel Device-Independent Quantum Key Distribution | 2020-09-29 | Paper |
Non-indexability of the stochastic appointment scheduling problem | 2020-06-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5111154 | 2020-05-26 | Paper |
A minimax approach to one-shot entropy inequalities | 2020-03-05 | Paper |
Quadratically tight relations for randomized query complexity | 2020-02-27 | Paper |
A Universal Empirical Dynamic Programming Algorithm for Continuous State MDPs | 2020-01-28 | Paper |
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction | 2020-01-28 | Paper |
Relative Discrepancy Does Not Separate Information and Communication Complexity | 2019-12-06 | Paper |
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel | 2019-07-19 | Paper |
Efficient protocols for generating bipartite classical distributions and quantum states | 2019-05-15 | Paper |
On the near-optimality of one-shot classical communication over quantum channels | 2019-02-11 | Paper |
Building Blocks for Communication Over Noisy Quantum Networks | 2019-01-28 | Paper |
On Regret-Optimal Learning in Decentralized Multiplayer Multiarmed Bandits | 2018-12-19 | Paper |
Optimal Decentralized Control With Asymmetric One-Step Delayed Information Sharing | 2018-12-19 | Paper |
Quadratically tight relations for randomized query complexity | 2018-11-28 | Paper |
Coalitional Games for Transmitter Cooperation in MIMO Multiple Access Channels | 2018-08-22 | Paper |
A One-Shot Achievability Result for Quantum State Redistribution | 2018-06-27 | Paper |
A Generalized Quantum Slepian–Wolf | 2018-06-27 | Paper |
Approachability in Stackelberg stochastic games with vector costs | 2018-04-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4598278 | 2017-12-19 | Paper |
Conditioned Functional Limits and Applications to Queues | 2017-11-06 | Paper |
An Empirical Dynamic Programming Algorithm for Continuous MDPs | 2017-09-21 | Paper |
Transitory Queueing Networks | 2017-08-19 | Paper |
Information-theoretic approximations of the nonnegative rank | 2017-07-28 | Paper |
Multipartite quantum correlation and communication complexities | 2017-07-28 | Paper |
The Communication Complexity of Correlation | 2017-07-27 | Paper |
Short Proofs of the Quantum Substate Theorem | 2017-07-12 | Paper |
Scalar Estimation and Control With Noisy Binary Observations | 2017-07-12 | Paper |
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States | 2017-06-08 | Paper |
Risk-Constrained Markov Decision Processes | 2017-05-16 | Paper |
The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited | 2017-05-16 | Paper |
Decentralized Learning for Multiplayer Multiarmed Bandits | 2017-05-16 | Paper |
New One Shot Quantum Protocols With Application to Communication Complexity | 2017-04-28 | Paper |
Unidirectional Input/Output Streaming Complexity of Reversal and Sorting | 2017-03-22 | Paper |
Matching Multiplications in Bit-Vector Formulas | 2017-02-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q2963906 | 2017-02-21 | Paper |
A direct product theorem for two-party bounded-round public-coin communication complexity | 2016-11-29 | Paper |
Empirical Dynamic Programming | 2016-05-19 | Paper |
New Strong Direct Product Results in Communication Complexity | 2016-03-24 | Paper |
A property of quantum relative entropy with an application to privacy in quantum communication | 2015-11-11 | Paper |
Relative Discrepancy Does not Separate Information and Communication Complexity | 2015-10-27 | Paper |
Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game | 2015-10-22 | Paper |
A queueing model with independent arrivals, and its fluid and diffusion limits | 2015-07-07 | Paper |
A Convex Analytic Approach to Risk-Aware Markov Decision Processes | 2015-06-24 | Paper |
On Transitory Queueing | 2014-12-07 | Paper |
Bertrand equilibria and efficiency in markets for congestible network services | 2014-10-20 | Paper |
QIP = PSPACE | 2014-08-13 | Paper |
A Parallel Approximation Algorithm for Positive Semidefinite Programming | 2014-07-30 | Paper |
Two-Message Quantum Interactive Proofs Are in PSPACE | 2014-07-25 | Paper |
QIP = PSPACE | 2014-02-17 | Paper |
Optimal Decentralized Control with Asymmetric One-Step Delayed Information Sharing | 2013-09-24 | Paper |
Stochastic Dominance-Constrained Markov Decision Processes | 2013-05-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q2913796 | 2012-09-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q2913817 | 2012-09-27 | Paper |
Resource requirements of private quantum channels and consequences for oblivious remote state preparation | 2012-05-23 | Paper |
Optimal direct sum results for deterministic and randomized decision tree complexity | 2012-03-27 | Paper |
The concert queueing game: to wait or to be late | 2011-03-30 | Paper |
A separation between divergence and Holevo information for ensembles | 2010-12-01 | Paper |
An efficient Nash-implementation mechanism for network resource allocation | 2010-11-25 | Paper |
Simulation-based optimization of Markov decision processes: an empirical process theory approach | 2010-11-25 | Paper |
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas | 2010-07-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q3181590 | 2009-10-12 | Paper |
New bounds on classical and quantum one-way communication complexity | 2009-07-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3633953 | 2009-06-23 | Paper |
New binding-concealing trade-offs for quantum string commitment | 2009-06-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q5302084 | 2009-01-05 | Paper |
A Separation between Divergence and Holevo Information for Ensembles | 2008-05-27 | Paper |
Propagation and cancellation of singularities in a class of Fuchsian operators and their perturbations | 2008-02-01 | Paper |
\(C^{(1,1/3)}\)-regularity in the Dirichlet problem for \(\Delta _{\infty}\) | 2007-11-07 | Paper |
Simulation‐based Uniform Value Function Estimates of Markov Decision Processes | 2007-09-24 | Paper |
Combinatorial exchange mechanisms for efficient bandwidth allocation | 2006-03-16 | Paper |
Lower bounds for adaptive locally decodable codes | 2005-11-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4449184 | 2004-02-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4415257 | 2003-07-28 | Paper |