The following pages link to Peter W. Shor (Q701710):
Displaying 50 items.
- (Q582209) (redirect page) (← links)
- Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
- Equivalence of additivity questions in quantum information theory (Q701712) (← links)
- The quantum double model with boundary: condensations and symmetries (Q717110) (← links)
- A counterexample to the triangle conjecture (Q762613) (← links)
- (Q794667) (redirect page) (← links)
- Regressions and monotone chains: A Ramsey-type extremal problem for partial orders (Q794668) (← links)
- Chip-firing games on graphs (Q805639) (← links)
- Minimax grid matching and empirical measures (Q810990) (← links)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- Largest induced suborders satisfying the chain condition (Q1074604) (← links)
- A lower bound for 0,1,* tournament codes (Q1095111) (← links)
- The average-case analysis of some on-line algorithms for bin packing (Q1100912) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- Steiner tree problems (Q1187352) (← links)
- Finding stabbing lines in 3-space (Q1193706) (← links)
- Detecting and decomposing self-overlapping curves (Q1200911) (← links)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767) (← links)
- A group-theoretic framework for the construction of packings in Grassmannian spaces (Q1283451) (← links)
- A selection-replacement process on the circle (Q1308703) (← links)
- Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes (Q1329187) (← links)
- A family of optimal packings in Grassmannian manifolds (Q1383812) (← links)
- Capacities of quantum channels and how to find them (Q1403292) (← links)
- Unextendible product bases, uncompletable product bases and bound entanglement (Q1403373) (← links)
- Randomizing quantum states: constructions and applications (Q1766903) (← links)
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information (Q1781847) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- A new proof of Cayley's formula for counting labeled trees (Q1894017) (← links)
- Progress in quantum algorithms (Q2386407) (← links)
- (Q2739353) (← links)
- Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems (Q2757599) (← links)
- Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing (Q2780629) (← links)
- Quantum money from knots (Q2826064) (← links)
- Superactivation of Bound Entanglement (Q2837702) (← links)
- New Constructions of Codes for Asymmetric Channels via Concatenation (Q2978691) (← links)
- The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels (Q2986407) (← links)
- Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH (Q2989022) (← links)
- (Q3002799) (← links)
- (Q3002832) (← links)
- Quantum Computers, Factoring, and Decoherence (Q3101343) (← links)
- (Q3101856) (← links)
- Inequalities and Separations Among Assisted Capacities of Quantum Channels (Q3107893) (← links)
- Bin packing with discrete item sizes, part II: Tight bounds on First Fit (Q3122907) (← links)
- (Q3138899) (← links)
- (Q3138935) (← links)
- (Q3171707) (← links)
