| Publication | Date of Publication | Type |
|---|
| Bounding the Forward Classical Capacity of Bipartite Quantum Channels | 2024-03-19 | Paper |
| Time independent universal computing with spin chains: quantum plinko machine | 2021-03-12 | Paper |
| Superadditivity in Trade-Off Capacities of Quantum Channels | 2019-07-19 | Paper |
| Supercritical entanglement in local systems: Counterexample to the area law for quantum matter | 2019-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365030 | 2017-09-29 | Paper |
| Time Reversal and Exchange Symmetries of Unitary Gate Capacities | 2017-07-27 | Paper |
| High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping | 2017-07-12 | Paper |
| Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH | 2017-05-19 | Paper |
| The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels | 2017-05-16 | Paper |
| New Constructions of Codes for Asymmetric Channels via Concatenation | 2017-04-28 | Paper |
| Quantum money from knots | 2016-10-07 | Paper |
| Why haven't more quantum algorithms been found? | 2015-12-07 | Paper |
| Graph concatenation for quantum codes | 2015-06-22 | Paper |
| Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions | 2015-05-07 | Paper |
| Markov chains, computer proofs, and average-case analysis of best fit bin packing | 2015-05-07 | Paper |
| Approximating the set of separable states using the positive partial transpose test | 2015-04-29 | Paper |
| On the sum-of-squares algorithm for bin packing | 2014-09-26 | Paper |
| Superactivation of Bound Entanglement | 2013-07-11 | Paper |
| Inequalities and Separations Among Assisted Capacities of Quantum Channels | 2011-12-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3101856 | 2011-12-01 | Paper |
| Quantum Computers, Factoring, and Decoherence | 2011-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3171707 | 2011-10-05 | Paper |
| The quantum double model with boundary: condensations and symmetries | 2011-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002799 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002832 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3400471 | 2010-02-05 | Paper |
| Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel | 2009-02-24 | Paper |
| Estimating Jones polynomials is a complete problem for one clean qubit | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3596954 | 2009-02-09 | Paper |
| On the Sum-of-Squares algorithm for bin packing | 2008-12-21 | Paper |
| Remote Preparation of Quantum States | 2008-12-21 | Paper |
| A lower bound for the length of a partial transversal in a Latin square | 2008-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3534621 | 2008-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522501 | 2008-09-03 | Paper |
| Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation | 2008-08-26 | Paper |
| Entanglement Breaking Channels | 2005-09-09 | Paper |
| Progress in quantum algorithms | 2005-08-22 | Paper |
| The capacity of a quantum channel for simultaneous transmission of classical and quantum information | 2005-06-08 | Paper |
| Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem | 2005-05-11 | Paper |
| Randomizing quantum states: constructions and applications | 2005-03-02 | Paper |
| Equivalence of additivity questions in quantum information theory | 2004-12-16 | Paper |
| Additivity of the classical capacity of entanglement-breaking quantum channels | 2004-12-14 | Paper |
| Capacities of quantum channels and how to find them | 2003-09-01 | Paper |
| Unextendible product bases, uncompletable product bases and bound entanglement | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2739353 | 2002-08-06 | Paper |
| Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing | 2002-04-15 | Paper |
| Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems | 2001-11-26 | Paper |
| A group-theoretic framework for the construction of packings in Grassmannian spaces | 2000-08-10 | Paper |
| Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings | 2000-07-20 | Paper |
| Quantum Error Correction and Orthogonal Geometry | 2000-07-16 | Paper |
| Quantum error correction via codes over GF(4) | 1999-11-21 | Paper |
| Quantum information theory | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259979 | 1999-09-07 | Paper |
| Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | 1999-06-27 | Paper |
| A family of optimal packings in Grassmannian manifolds | 1998-12-29 | Paper |
| Quantum computing | 1998-08-24 | Paper |
| Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer | 1998-02-10 | Paper |
| Tight Bounds for the Maximum Acyclic Subgraph Problem | 1997-11-25 | Paper |
| Random Debaters and the Hardness of Approximating Stochastic Functions | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3122907 | 1997-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847941 | 1995-10-25 | Paper |
| A new proof of Cayley's formula for counting labeled trees | 1995-08-21 | Paper |
| Local rule-based theory of virus shell assembly. | 1994-10-17 | Paper |
| Three results on interactive communication | 1994-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283452 | 1994-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138899 | 1994-09-19 | Paper |
| Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes | 1994-06-29 | Paper |
| A selection-replacement process on the circle | 1994-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138935 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035170 | 1993-05-18 | Paper |
| Packings in two dimensions: Asymptotic average-case analysis of algorithms | 1993-05-16 | Paper |
| Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028879 | 1993-03-28 | Paper |
| Detecting and decomposing self-overlapping curves | 1993-01-16 | Paper |
| Keller’s cube-tiling conjecture is false in high dimensions | 1993-01-16 | Paper |
| Finding stabbing lines in 3-space | 1992-09-27 | Paper |
| The rectilinear Steiner arborescence problem | 1992-06-28 | Paper |
| Steiner tree problems | 1992-06-28 | Paper |
| A Note on Finding a Strict Saddlepoint | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974991 | 1992-06-26 | Paper |
| Chip-firing games on graphs | 1991-01-01 | Paper |
| Minimax grid matching and empirical measures | 1991-01-01 | Paper |
| Multilayer grid embeddings for VLSI | 1991-01-01 | Paper |
| A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound | 1991-01-01 | Paper |
| Average-case analysis of cutting and packing in two dimensions | 1990-01-01 | Paper |
| Generalized planar matching | 1990-01-01 | Paper |
| A linear-time algorithm for computing the Voronoi diagram of a convex polygon | 1989-01-01 | Paper |
| Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences | 1989-01-01 | Paper |
| Tight bounds for minimax grid matching with applications to the average case analysis of algorithms | 1989-01-01 | Paper |
| Applications of random sampling in computational geometry. II | 1989-01-01 | Paper |
| A lower bound for 0,1,* tournament codes | 1987-01-01 | Paper |
| Geometric applications of a matrix-searching algorithm | 1987-01-01 | Paper |
| The average-case analysis of some on-line algorithms for bin packing | 1986-01-01 | Paper |
| A counterexample to the triangle conjecture | 1985-01-01 | Paper |
| Largest induced suborders satisfying the chain condition | 1985-01-01 | Paper |
| Regressions and monotone chains: A Ramsey-type extremal problem for partial orders | 1984-01-01 | Paper |
| A lower bound for the length of a partial transversal in a Latin square | 1982-01-01 | Paper |
