On learning through competition. - David Heath 001; Carl Diegert (Neural Networks, 1988)

The Historical Development of Computer Chess and its Impact on Artificial Intelligence. - David Heath 001; Derek Allum (Deep Blue Versus Kasparov: The Significance for Artificial Intelligence, 1997)

Heavy Tails and Long Range Dependence in On/Off Processes and Associated Fluid Models. - David Heath 001; Sidney Resnick; Gennady Samorodnitsky (Math. Oper. Res., 1998)

Consistency among trading desks. - David Heath 001; Hyejin Ku (Finance Stochastics, 2006)

Coherent multiperiod risk adjusted values and Bellman's principle. - Philippe Artzner; Freddy Delbaen; Jean-Marc Eber; David Heath 001; Hyejin Ku (Ann. Oper. Res., 2007)

Completely Automated Equivalence Proofs. - Qi Zhou 010; David Heath 001; William Harris (CoRR, 2017)

Proofs as Relational Invariants of Synthesized Execution Grammars. - Caleb Voss; David Heath 001; William Harris (CoRR, 2017)

Relational Verification via Invariant-Guided Synchronization. - Qi Zhou 010; David Heath 001; William Harris (HCVS/PERR@ETAPS, 2019)

MOTIF: (Almost) Free Branching in GMW - Via Vector-Scalar Multiplication. - David Heath 001; Vladimir Kolesnikov; Stanislav Peceny (ASIACRYPT (3), 2020)

A 2.1 KHz Zero-Knowledge Processor with BubbleRAM. - David Heath 001; Vladimir Kolesnikov (CCS, 2020)

Stacked Garbling - Garbled Circuit Proportional to Longest Execution Path. - David Heath 001; Vladimir Kolesnikov (CRYPTO (2), 2020)

Stacked Garbling for Disjunctive Zero-Knowledge Proofs. - David Heath 001; Vladimir Kolesnikov (EUROCRYPT (3), 2020)

PrORAM - Fast P(logn) Authenticated Shares ZK ORAM. - David Heath 001; Vladimir Kolesnikov (ASIACRYPT (4), 2021)

Garbling, Stacked and Staggered - Faster k-out-of-n Garbled Function Evaluation. - David Heath 001; Vladimir Kolesnikov; Stanislav Peceny (ASIACRYPT (2), 2021)

One Hot Garbling. - David Heath 001; Vladimir Kolesnikov (CCS, 2021)

Efficient Generic Arithmetic for KKW - Practical Linear MPC-in-the-Head NIZK on Commodity Hardware Without Trusted Setup. - David Heath 001; Vladimir Kolesnikov; Jiahui Lu (CSCML, 2021)

sf LogStack: Stacked Garbling with O(b log b) Computation. - David Heath 001; Vladimir Kolesnikov (EUROCRYPT (3), 2021)

Masked Triples - Amortizing Multiplication Triples Across Conditionals. - David Heath 001; Vladimir Kolesnikov; Stanislav Peceny (Public Key Cryptography (2), 2021)

Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached ORAM for ANSI C Programs. - David Heath 001; Yibin Yang 001; David Devecsery; Vladimir Kolesnikov (SP, 2021)

LogStack: Stacked Garbling with O(b log b) Computation. - David Heath 001; Vladimir Kolesnikov (IACR Cryptol. ePrint Arch., 2021)

PrORAM: Fast O(log n) Private Coin ZK ORAM. - David Heath 001; Vladimir Kolesnikov (IACR Cryptol. ePrint Arch., 2021)

Practical Garbled RAM: GRAM with O(log2 n) Overhead. - David Heath 001; Vladimir Kolesnikov; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2021)

Garbled Circuits with Sublinear Evaluator. - Abida Haque; David Heath 001; Vladimir Kolesnikov; Steve Lu 001; Rafail Ostrovsky; Akash Shah (EUROCRYPT (1), 2022)

EpiGRAM: Practical Garbled RAM. - David Heath 001; Vladimir Kolesnikov; Rafail Ostrovsky (EUROCRYPT (1), 2022)

EZEE: Epoch Parallel Zero Knowledge for ANSI C. - Yibin Yang 001; David Heath 001; Vladimir Kolesnikov; David Devecsery (EuroS&P, 2022)

Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached RAM for ANSI C Programs. - David Heath 001; Yibin Yang 001; David Devecsery; Vladimir Kolesnikov (IACR Cryptol. ePrint Arch., 2022)

New Directions in Garbled Circuits. - David Heath 001 (2022)

Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. - Yibin Yang 001; David Heath 001; Carmit Hazay; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam (CCS, 2023)

Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs). - Yibin Yang 001; Stanislav Peceny; David Heath 001; Vladimir Kolesnikov (CCS, 2023)

Tri-State Circuits - A Circuit Model that Captures RAM. - David Heath 001; Vladimir Kolesnikov; Rafail Ostrovsky (CRYPTO (4), 2023)

Parallel RAM from Cyclic Circuits. - David Heath 001 (CoRR, 2023)

Adaptive Garbled Circuits and Garbled RAM from Non-Programmable Random Oracles. - Cruz Barnum; David Heath 001; Vladimir Kolesnikov; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2023)

Tri-State Circuits: A Better Model of Computation for Garbling. - David Heath 001; Vladimir Kolesnikov; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2023)

Symphony: Expressive Secure Multiparty Computation with Coordination. - Ian Sweet; David Darais; David Heath 001; William Harris; Ryan Estes; Michael Hicks 001 (Art Sci. Eng. Program., 2023)

sfLogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. - Carmit Hazay; David Heath 001; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam; Yibin Yang 001 (ASIACRYPT (5), 2024)

Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction. - Yibin Yang 001; David Heath 001; Carmit Hazay; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam (CCS, 2024)

Oblivious Single Access Machines - A New Model for Oblivious Computation. - Ananya Appan; David Heath 001; Ling Ren 001 (CCS, 2024)

Efficient Arithmetic in Garbled Circuits. - David Heath 001 (EUROCRYPT (5), 2024)

Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts. - David Heath 001; Vladimir Kolesnikov; Lucien K. L. Ng (EUROCRYPT (5), 2024)

Two Shuffles Make a RAM: Improved Constant Overhead Zero Knowledge RAM. - Yibin Yang 001; David Heath 001 (USENIX Security Symposium, 2024)

LogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. - Carmit Hazay; David Heath 001; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam; Yibin Yang 001 (IACR Cryptol. ePrint Arch., 2024)

Scalable Metadata-Hiding for Privacy-Preserving IoT Systems. - Yunang Chen; David Heath 001; Rahul Chatterjee 001; Earlence Fernandes (Proc. Priv. Enhancing Technol., 2024)

Randomized Agreement, Verifiable Secret Sharing and Multi-party Computation in Granular Synchrony. - Ananya Appan; David Heath 001; Ling Ren 001 (ASIACRYPT (5), 2025)

Multiparty Garbling from OT with Linear Scaling and RAM Support. - David Heath 001; Vladimir Kolesnikov; Varun Narayanan; Rafail Ostrovsky; Akash Shah (CRYPTO (4), 2025)

Oblivious Immutable Memory. - Ananya Appan; David Heath 001 (IACR Cryptol. ePrint Arch., 2025)

Adaptive Distributional Security: A Framework for Input-Adaptive Cryptography. - Cruz Barnum; David Heath 001 (IACR Cryptol. ePrint Arch., 2025)

Minicrypt PRFs Do Not Admit Black-Box Oblivious Evaluations. - Cruz Barnum; Mohammad Hajiabadi; David Heath 001; Jake Januzelli; Namar Kumar; Mike Rosulek (IACR Cryptol. ePrint Arch., 2025)

Linear-time and Logarithmically-sound Permutation and Multiset SNARKs. - Bing-Jyue Chen; Lilia Tang; David Heath 001; Daniel Kang 001 (IACR Cryptol. ePrint Arch., 2025)

Authenticated Garbling with Tensor Gates. - David Heath 001; Nakul Khambhati; Rafail Ostrovsky; Turan Vural (IACR Cryptol. ePrint Arch., 2025)

Asynchronous MPC with Abort. - Ananya Appan; David Heath 001; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2026)

Efficient Private Range Queries on Public Data. - Pranav Shriram Arunachalaramanan; Ananya Appan; David Heath 001; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2026)

How to Steal Oblivious Transfer from Minicrypt. - Cruz Barnum; David Heath 001 (IACR Cryptol. ePrint Arch., 2026)

2PC Memory-Manipulating Programs with Constant Overhead. - David Heath 001 (IACR Cryptol. ePrint Arch., 2026)

Duty-Free Bits: Projectivizing Garbling Schemes. - Nakul Khambhati; Anwesh Bhattacharya; David Heath 001 (IACR Cryptol. ePrint Arch., 2026)

Oblivious Single Access Machines are Concretely Efficient. - Sage Pia; Ananya Appan; Maryam Rezapour; Amey Shukla; Nikhil Date; Benjamin Fuller 001; Ling Ren 001; David Heath 001 (IACR Cryptol. ePrint Arch., 2026)