Movement and Recovery Analysis of a Mouse-Replacement Interface for Users with Severe Disabilities. - Caitlin Connor; Emily Yu; John J. Magee; Esra Cansizoglu; Samuel Epstein 001; Margrit Betke (HCI (6), 2009)

Principles of Safe Policy Routing Dynamics. - Samuel Epstein 001; Karim Mattar; Ibrahim Matta (ICNP, 2009)

Adaptive mappings for mouse-replacement interfaces. - John J. Magee; Samuel Epstein 001; Eric S. Missimer; Margrit Betke (ASSETS, 2010)

Customizable keyboard. - Eric S. Missimer; Samuel Epstein 001; John J. Magee; Margrit Betke (ASSETS, 2010)

Towards a Multi-camera Mouse-replacement Interface. - John J. Magee; Zheng Wu 003; Harshith Chennamaneni; Samuel Epstein 001; Diane H. Theriault; Margrit Betke (PRIS, 2010)

An Information Theoretic Representation of Agent Dynamics as Set Intersections. - Samuel Epstein 001; Margrit Betke (AGI, 2011)

An Information Theoretic Mouse Trajectory Measure. - Samuel Epstein 001; Eric S. Missimer; Margrit Betke (HCI (6), 2011)

Adaptive Mouse-Replacement Interface Control Functions for Users with Disabilities. - John J. Magee; Samuel Epstein 001; Eric S. Missimer; Christopher Kwan; Margrit Betke (HCI (6), 2011)

Randomness Conservation over Algorithms. - Samuel Epstein 001 (CoRR, 2013)

The Kernel Semi-Least Squares Method for Sparse Distance Approximation. - Samuel Epstein 001; Margrit Betke (Neural Comput., 2013)

An online distributed algorithm for inferring policy routing configurations - Samuel Epstein 001 (2013)

Using kernels for a video-based mouse-replacement interface. - Samuel Epstein 001; Eric S. Missimer; Margrit Betke (Pers. Ubiquitous Comput., 2014)

On Quantum Noncompression. - Samuel Epstein 001 (CoRR, 2015)

Information Kernels. - Samuel Epstein 001 (CoRR, 2019)

On the Complexity of Completing Binary Predicates. - Samuel Epstein 001 (CoRR, 2019)

Algorithmic No-Cloning Theorem. - Samuel Epstein 001 (IEEE Trans. Inf. Theory, 2019)

Approximations of Kolmogorov Complexity. - Samuel Epstein 001 (CoRR, 2020)

An extended coding theorem with application to quantum complexities. - Samuel Epstein 001 (Inf. Comput., 2020)

Quantum Algorithmic Information Theory. - Samuel Epstein 001 (CoRR, 2021)

On the Algorithmic Content of Quantum Measurements. - Samuel Epstein 001 (Electron. Colloquium Comput. Complex., 2021)

All Sampling Methods Produce Outliers. - Samuel Epstein 001 (IEEE Trans. Inf. Theory, 2021)

On the Kolmogorov Complexity of Binary Classifiers. - Samuel Epstein 001 (CoRR, 2022)

A Note on the Outliers Theorem. - Samuel Epstein 001 (CoRR, 2022)

Outliers, Dynamics, and the Independence Postulate. - Samuel Epstein 001 (CoRR, 2022)

22 Examples of Solution Compression via Derandomization. - Samuel Epstein 001 (CoRR, 2022)

Derandomization Under Different Resource Constraints. - Samuel Epstein 001 (Electron. Colloquium Comput. Complex., 2022)

A Quantum EL Theorem. - Samuel Epstein 001 (CoRR, 2023)

On the Existence of Anomalies. - Samuel Epstein 001 (CoRR, 2023)

A Complication for the Many Worlds Theory. - Samuel Epstein 001 (CoRR, 2023)

On the Existence of Anomalies, The Reals Case. - Samuel Epstein 001 (CoRR, 2023)

How to Compress the Solution. - Samuel Epstein 001 (CoRR, 2023)

Uniform Tests and Algorithmic Thermodynamic Entropy. - Samuel Epstein 001 (CoRR, 2023)

A Quantum Outlier Theorem. - Samuel Epstein 001 (CoRR, 2023)

On the Algorithmic Information Between Probabilities. - Samuel Epstein 001 (CoRR, 2023)

Regression and Algorithmic Information Theory. - Samuel Epstein 001 (CoRR, 2023)

The Randomness Deficiency Function and the Shift Operator. - Samuel Epstein 001 (CoRR, 2023)

The Kolmogorov birthday paradox. - Samuel Epstein 001 (Theor. Comput. Sci., 2023)

Two Simple Proofs of Müller's Theorem. - Samuel Epstein 001 (CoRR, 2024)

Two Quantum Paradigms, but Still No Signal. - Samuel Epstein 001 (CoRR, 2024)

Game Derandomization. - Samuel Epstein 001 (CoRR, 2024)

On Kolmogorov Structure Functions. - Samuel Epstein 001 (CoRR, 2024)

Semi-Classical Subspaces, The No Synchronization Law, and More. - Samuel Epstein 001 (CoRR, 2024)