Paper: arXiv 2401.04289

Abstract

An automated market maker (AMM) is a state machine that manages pools of assets, allowing parties to buy and sell those assets according to a fixed mathematical formula. AMMs are typically implemented as smart contracts on blockchains, and its prices are kept in line with the overall market price by arbitrage: if the AMM undervalues an asset with respect to the market, an “arbitrageur” can make a risk-free profit by buying just enough of that asset to bring the AMM’s price back in line with the market. AMMs, however, are not designed for assets that expire: that is, assets that cannot be produced or resold after a specified date. As assets approach expiration, arbitrage may not be able to reconcile supply and demand, and the liquidity providers that funded the AMM may have excessive exposure to risk due to rapid price variations. This paper formally describes the design of a decentralized exchange (DEX) for assets that expire, combining aspects of AMMs and limit-order books. We ensure liveness and market clearance, providing mechanisms for liquidity providers to control their exposure to risk and adjust prices dynamically in response to situations where arbitrage may fail.

Complexity vs Empirical Score

  • Math Complexity: 7.5/10
  • Empirical Rigor: 2.0/10
  • Quadrant: Lab Rats — theoretically deep, empirically untested

Why this score: The paper presents advanced formal models, proofs of liveness and market clearing, and novel mechanism designs involving LP interventions and hybrid AMM/order-book systems, indicating high mathematical density. However, it lacks empirical backtesting, real-world data analysis, or implementation details like code or datasets, focusing instead on theoretical design and proof, resulting in low empirical rigor.

Research Flowchart

  flowchart TD
  A["<b>Research Goal</b><br>Design a DEX for expiring assets<br>addressing AMM limitations"] --> B["<b>Methodology</b><br>Formal Model Design<br>AMM + Limit Order Book Synthesis"]
  B --> C["<b>Key Inputs</b><br>Asset Expiration Parameters<br>Liquidity Pool State<br>Market Price Data"]
  C --> D["<b>Computational Processes</b><br>Dynamic Pricing Logic<br>Risk Exposure Adjustment<br>Liveness & Clearance Checks"]
  D --> E["<b>Key Findings</b><br>Ensured Market Clearance<br>Controlled LP Risk<br>Validated Decentralized Protocol"]

Cited References (561)

  1. Uniswap v2 core, 2020 (2020)
  2. Sok: Decentralized exchanges (dex) with automated market maker (amm) protocols (2023)
  3. Constant function market makers: Multi-asset trades via convex optimization (2022)
  4. The adoption of blockchain-based decentralized exchanges (2021) — link
  5. Uniswap v3 core (2021)
  6. Formal specification of constant product (xy= k) market maker model and implementation (2018)
  7. Inequalities: theorems, techniques and selected problems (2012)
  8. Improved price oracles: Constant function market makers (2020)
and 553 more
  1. Axioms for Automated Market Makers: A Mathematical Framework in FinTech and Decentralized Finance (2023) — link
  2. Bancor Protocol (2017)
  3. Proposing Bancor v2.1: Single-Sided AMM with Elastic BNT Supply (2020)
  4. StableSwap - efficient mechanism for Stablecoin liquidity (2019)
  5. Uniswap v2 Core (2020)
  6. Formal Specification of Constant Product (x . y = k) Market Maker Model and Implementation (2018)
  7. Balancer: A non-custodial portfolio man- ager, liquidity provider, and price sensor (2109)
  8. Optimal Resilience Asynchronous Approximate Agreement (2005)
  9. Asymptotically optimal algorithms for approximate agreement (1986) — link
  10. Augmenting Batch Exchanges with Constant Function Market Makers (2023) — link
  11. ABC : Proof -of- Stake without Consensus (2020) — link
  12. Distributed Computing Through Combinatorial Topology (2014) — link
  13. Algorand Standard Assets ( ASAs ) - Algorand Developer Portal — link
  14. Pax Gold - The Safest Way to Own Gold — link
  15. tZERO — link
  16. Chainlink 2.0 and the future of Decentralized Oracle Networks \textbar Chainlink — link
  17. Introduction \textbar SushiSwap (2022) — link
  18. Beta distribution (2023) — link
  19. Automated Market Making and Loss - Versus - Rebalancing (2022) — link
  20. Presentation and Publication : Loss and Slippage in Networks of Automated Market Makers (2021) — link
  21. Composing Networks of Automated Market Makers (2021) — link
  22. An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts (2019) — link
  23. Block- STM : Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing (2022) — link
  24. Protocol Architecture Risk - Crosschain Risk Framework — link
  25. Solana’s Wormhole Hack Post - Mortem Analysis (2022) — link
  26. Zerocoin Project — link
  27. U. S . Treasury Sanctions Widely Used Crypto Mixer Tornado Cash \textbar TRM Insights — link
  28. SEC .gov \textbar SEC Emergency Action Halts ICO Scam — link
  29. Cryptocurrency platform Wormhole loses $ 320M after attack \textbar TechTarget — link
  30. Tornado Cash — link
  31. U. S . Treasury Sanctions Notorious Virtual Currency Mixer Tornado Cash (2023) — link
  32. CoinJoin - Bitcoin Wiki — link
  33. SoK : Blockchain Light Clients (2022) — link
  34. On the privacy provisions of Bloom filters in lightweight bitcoin clients (2014) — link
  35. Simplified Payment Verification - Bitcoin Wiki — link
  36. Cross- Chain Bridge Hacks Emerge as Top Security Risk (2022) — link
  37. Binance Blockchain Hit by $570 Million Hack , Exposing Crypto Vulnerabilities (2022) — link
  38. Zotero Blog » Blog Archive » A Better “ Save to Zotero ” Button in Chrome — link
  39. Zero- Knowledge for Sudoku Puzzles — link
  40. A fistful of Bitcoins : characterizing payments among men with no names (2016) — link
  41. Bitcoin and cryptocurrency technologies: a comprehensive introduction (2016)
  42. Etherscan’s New Tool Lets Users Identify Tainted Ether Addresses (2020) — link
  43. Tornado cash explained (2022) — link
  44. OptSmart : A Space Efficient Optimistic Concurrent Execution of Smart Contracts (2021) — link
  45. Hyperledger fabric: A distributed operating system for permissioned blockchains (2018) — link
  46. ParBlockchain : Leveraging Transaction Parallelism in Permissioned Blockchain Systems (2019) — link
  47. Adding Concurrency to Smart Contracts (2017) — link
  48. The arwen trading protocols (2019) — link
  49. Bolt: Anonymous payment channels for decentralized currencies (2017) — link
  50. The bitcoin lightning network: Scalable off-chain instant payments (2016) — link
  51. Correctness and fairness of tendermint-core blockchains (2018) — link
  52. The Byzantine Generals Problem (1982) — link
  53. Certificate revocation and certificate update (2000) — link
  54. Randomized search trees (1996) — link
  55. Efficient Sparse Merkle Trees (2016) — link
  56. A First Look at the Crypto - Mining Malware Ecosystem : A Decade of Unrestricted Wealth (2019) — link
  57. MineSweeper : An In -depth Look into Drive -by Cryptocurrency Mining and Its Defense (2018) — link
  58. Selfish Mining Re - Examined (2020) — link
  59. An Empirical Analysis of Pool Hopping Behavior in the Bitcoin Blockchain (2021) — link
  60. Bitcoin Mining Pools : A Cooperative Game Theoretic Analysis (2015)
  61. Bitcoin Blockchain Dynamics : the Selfish - Mine Strategy in the Presence of Propagation Delay (2015) — link
  62. ZeroBlock : Timestamp - Free Prevention of Block - Withholding Attack in Bitcoin (2016) — link
  63. Optimal Selfish Mining Strategies in Bitcoin (2017) — link
  64. One Weird Trick to Stop Selfish Miners : Fresh Bitcoins , A Solution for the Honest Miner ( Poster Abstract ) (2014) — link
  65. Stubborn Mining : Generalizing Selfish Mining and Combining with an Eclipse Attack (2016) — link
  66. Be Selfish and Avoid Dilemmas : Fork After Withholding ( FAW ) Attacks on Bitcoin (2017) — link
  67. On the detection of selfish mining and stalker attacks in blockchain networks (2020) — link
  68. ForkDec : Accurate Detection for Selfish Mining Attacks (2021) — link
  69. Majority is not enough: Bitcoin mining is vulnerable (2014) — link
  70. The economics of Bitcoin mining, or Bitcoin in the presence of adversaries (2013) — link
  71. The Miner ’s Dilemma (2014) — link
  72. Decentralization in Bitcoin and Ethereum Networks (2018) — link
  73. An empirical study of DeFi liquidations: incentives, risks, and instabilities (2021) — link
  74. How to time-stamp a digital document (1991) — link
  75. The Interblockchain Communication Protocol : An Overview (2020) — link
  76. Consensus- Free Ledgers When Operations of Distinct Processes are Commutative (2021) — link
  77. A survey and taxonomy of consensus protocols for blockchains (2022) — link
  78. Blockchain Consensus Protocols in the Wild (2017) — link
  79. The Consensus Number of a Cryptocurrency ( Extended Version ) (2019) — link
  80. Wait- Free Synchronization . (1991) — link
  81. Cross- Chain State Machine Replication (2022) — link
  82. SoK : Communication Across Distributed Ledgers (2021) — link
  83. Survey of crosschain communications protocols (2021) — link
  84. Authenticated data structures (2003)
  85. MTFS : Merkle - Tree - Based File System (2019) — link
  86. Byzantine fault isolation in the Farsite distributed file system (2006) — link
  87. Building secure file systems out of byzantine storage (2002) — link
  88. https://dl.acm.org/doi/pdf/10.1145/571825.571840
  89. The Bitcoin Backbone Protocol : Analysis and Applications (2015) — link
  90. A simple proof of the uniform consensus synchronous lower bound (2003) — link
  91. Blockchain Without Waste : Proof -of- Stake (2018) — link
  92. Evolution of Shares in a Proof -of- Stake Cryptocurrency (2019) — link
  93. Incentives in Ethereum ’s hybrid Casper protocol (2020) — link
  94. On Fairness in Committee -based Blockchains (2019) — link
  95. When selfish meets evil: byzantine players in a virus inoculation game (2006) — link
  96. Achieving State Machine Replication without Honest Players (2021) — link
  97. FairLedger : A Fair Blockchain Protocol for Financial Institutions (2019) — link
  98. Ouroboros: A Provably Secure Proof -of- Stake Blockchain Protocol (2017) — link
  99. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus (2017) — link
  100. Flash Boys 2.0: Frontrunning , Transaction Reordering , and Consensus Instability in Decentralized Exchanges (2019) — link
  101. SmartCast : An Incentive Compatible Consensus Protocol Using Smart Contracts (2017) — link
  102. Snow White : Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake (2019) — link
  103. Consensus in the Age of Blockchains (2017) — link
  104. Rationals vs Byzantines in Consensus -based Blockchains (2019) — link
  105. Transaction Fee Mechanism Design for the Ethereum Blockchain : An Economic Analysis of EIP -1559 (2020) — link
  106. FruitChains : A Fair Blockchain (2017) — link
  107. Blockchains Cannot Rely on Honesty (2019) — link
  108. Blockchain Bridges , Explained (2020) — link
  109. Arbitrum: scalable, private smart contracts (2018)
  110. An Incomplete Guide to Rollups (2021) — link
  111. Byzantine Fault -tolerant State -machine Replication from a Systems Perspective (2021) — link
  112. In Search of an Understandable Consensus Algorithm (2014) — link
  113. The part-time parliament (1998) — link
  114. When Blockchain Meets Auction Models : A Survey , Some Applications , and Challenges (2021) — link
  115. Scalable Byzantine Reliable Broadcast ( Extended Version ) (2020) — link
  116. Distributed Computability in Byzantine Asynchronous Systems (2014) — link
  117. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms (1987) — link
  118. Asynchronous Byzantine agreement protocols (1987) — link
  119. SoK : Decentralized Exchanges ( DEX ) with Automated Market Maker ( AMM ) Protocols (2021) — link
  120. A Game - Theoretic Analysis of Cross - Chain Atomic Swaps with HTLCs (2021) — link
  121. On the optionality and fairness of Atomic Swaps (2019) — link
  122. An introduction to financial option valuation: mathematics, stochastics and computation (2009)
  123. Atomic Swaptions : Cryptocurrency Derivatives (2020) — link
  124. Cross-chain Deals and Adversarial Commerce (2019) — link
  125. On the optionality and fairness of Atomic Swaps (2019) — link
  126. Ethereum: A secure decentralised generalised transaction ledger (2021) — link
  127. Uniswap v3 Core (2021) — link
  128. A General Implicit / Inverse Function Theorem (2015) — link
  129. Improved Price Oracles : Constant Function Market Makers (2020) — link
  130. An analysis of Uniswap markets (2021) — link
  131. An optimization-based framework for automated market-making (2011) — link
  132. Dynamic Curves for Decentralized Autonomous Cryptocurrency Exchanges (2021) — link
  133. Lazy Liquidity in Automated Market Making (2020) — link
  134. A theory of Automated Market Makers in DeFi (2021) — link
  135. When does the tail wag the dog? Curvature and market making (2020) — link
  136. Kyber: An On - Chain Liquidity Protocol — link
  137. Hedging Against Sore Loser Attacks in Cross - Chain Transactions (2021)
  138. Algorithmic game theory (2007)
  139. Auction theory (2010)
  140. Improvements to Auction Theory and Inventions of New Auction Formats (2020) — link
  141. Principles of transaction-oriented database recovery (1983) — link
  142. Teechain: Scalable blockchain payments using trusted execution environments (2017) — link
  143. Algorand: Scaling byzantine agreements for cryptocurrencies (2017) — link
  144. Consensus in the presence of partial synchrony (1988) — link
  145. Chainspace: A sharded smart contracts platform (2017) — link
  146. BAR fault tolerance for cooperative services (2005) — link
  147. Hot-stuff the linear, optimal-resilience, one-message BFT devil (2018) — link
  148. Tether (cryptocurrency) (2020) — link
  149. Bitcoin: A peer-to-peer electronic cash system (2009) — link
  150. Tether stablecoin launches on its seventh blockchain (2020) — link
  151. The IETF PPSP peer protocol reference implementation — link
  152. One way hash functions and DES (1989) — link
  153. Method of providing digital signatures (1982)
  154. A digital signature based on a conventional encryption function (1988) — link
  155. TMSP : The Tendermint Socket Protocol (2015) — link
  156. What are flash loans in DeFi ? (2020) — link
  157. What is an automated market maker ( AMM )? (2020) — link
  158. Non-interactive Proofs of Proof -of- Work (2020) — link
  159. JSR166 : Concurrency utilities
  160. Hawk: The Blockchain Model of Cryptography and Privacy - Preserving Smart Contracts (2016) — link
  161. What is the raiden network? — link
  162. UTXO (2019) — link
  163. ERC20 token standard (2019) — link
  164. Augur: a decentralized oracle and prediction market platform (2018) — link
  165. Mt. Gox (2019) — link
  166. Enigma Catalyst : a machine-based investing platform and infrastructure for crypto-assets — link
  167. The BarterDEX whitepaper: A decentralized, open-source cryptocurrency exchange, powered by atomic-swap technology — link
  168. Quadriga fintech solutions (2019) — link
  169. Atomic swaps using cut and choose (2016) — link
  170. Mining cartel attack (2010) — link
  171. An introduction to libra (2019) — link
  172. Rationality is Self - Defeating in Permissionless Systems (2019) — link
  173. A crash course in mechanism design for cryptoeconomic applications (2017) — link
  174. Decred cross-chain atomic swapping — link
  175. Counterfactual: Generalized state channels (2018) — link
  176. Your guide on bitcoin’s lightning network: The opportunities and the issues (2018) — link
  177. Hashed time-locked contract transactions — link
  178. Hashed timelock contracts — link
  179. Atomic cross-chain trading — link
  180. Atomic cross-chain trading — link
  181. Vault: Fast bootstrapping for the algorand cryptocurrency (2019)
  182. BAR primer (2008)
  183. Proofs of proofs of work with sublinear complexity (2016)
  184. Atomic commitment across blockchains (2019) — link
  185. Ethereum: A secure decentralised generalised transaction ledger (2014)
  186. BigchainDB 2.0 the blockchain database (2018) — link
  187. Decentralizing authorities into scalable strongest-link cothorities (2015) — link
  188. The swirlds hashgraph consensus algorithm: Fair , fast, byzantine fault tolerance (2016) — link
  189. Channels: Horizontal scaling and confidentiality on permissioned blockchains (2018)
  190. The honey badger of BFT protocols (2016) — link
  191. Impossibility of distributed consensus with one faulty process (1985) — link
  192. Atomic cross-chain swaps (2018) — link
  193. Revive: Rebalancing off-blockchain payment networks (2017) — link
  194. A fast and scalable payment network with bitcoin duplex micropayment channels (2015)
  195. OmniLedger : A secure, scale-out, decentralized ledger via sharding (2018) — link
  196. Scheduling multithreaded computations by work stealing (1999) — link
  197. Concurrency control and recovery in database systems (1986)
  198. Transactional information systems: Theory , algorithms, and the practice of concurrency control and recovery (2001)
  199. Two-phase commit protocol — link
  200. Efficient signature generation by smart cards (1991) — link
  201. Sprites: Payment channels that go faster than lightning (2017) — link
  202. Position-indexed formulations for kidney exchange (2016) — link
  203. Reducibility among combinatorial problems (1972) — link
  204. On cores and indivisibility (1974) — link
  205. Efficient near-optimal algorithms for barter exchange (2017) — link
  206. Secure group barter: Multi -party fair exchange with semi-trusted neutral parties (1998)
  207. Simple and fast optimistic protocols for fair electronic exchange (2003) — link
  208. Optimization of Pearl ’s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem (1996) — link
  209. Hawk: The blockchain model of cryptography and privacy-preserving smart contracts (2015)
  210. On sharding blockchains — link
  211. Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges (2007) — link
  212. An improved algorithm for multi-way trading for exchange and barter (2011) — link
  213. Non-determinism in byzantine fault-tolerant replication (2017) — link
  214. On the correctness of transactional memory (2008)
  215. Digraphs: Theory , algorithms, and applications (2001) — link
  216. Hyperledger white paper — link
  217. Dreadlocks: Efficient deadlock detection (2008) — link
  218. ScalaSTM . Web .
  219. Transactional predication: High -performance concurrent sets and maps for STM (2010) — link
  220. Ethereum: A secure decentralised generalised transaction ledger — link
  221. TheDAO smart contract
  222. Type-aware transactions for faster concurrent code (2016) — link
  223. Demystifying incentives in the consensus computer (2015) — link
  224. Step by step towards creating a safe smart contract: Lessons and insights from a cryptocurrency lab (2016) — link
  225. Space and step complexity efficient adaptive collect (2005)
  226. Early experience with a commercial hardware transactional memory implementation (2009)
  227. Efficient adaptive collect using randomization (2006)
  228. Overview of emerging nonvolatile memory technologies (2014) — link
  229. Toward high performance nonblocking software transactional memory (2008) — link
  230. Transactional memory: architectural support for lock-free data structures (1993)
  231. An efficient software transactional memory using commit-time invalidation (2010)
  232. Capabilities and limitations of library-based software transactional memory in C ++ (2007)
  233. Hazard pointers: Safe memory reclamation for lock-free objects (2004)
  234. Wait-free made fast (1995)
  235. Wait-free algorithms for fast, long-lived renaming (1995)
  236. Business processes secured by immutable audit trails on the blockchain
  237. Time and space lower bounds for implementations using k- CAS (2010)
  238. The resolution of the Bitcoin experiment
  239. Atomic snapshots of shared memory (1993)
  240. Unlocking concurrency (2006) — link
  241. Long-lived renaming made adaptive (1999)
  242. Optimal time randomized consensus ­ making resilient algorithms fast in practice (1991)
  243. Formalizing and securing relationships on public networks (1997) — link
  244. Simplifying concurrent algorithms by exploiting hardware transactional memory (2010)
  245. Early experience with a commercial hardware transactional memory implementation (2009)
  246. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms (1996)
  247. Time-based transactional memory with scalable time bases (2007) — link
  248. Nonblocking memory management support for dynamic-sized data structures (2005)
  249. Practical byzantine fault tolerance (1999) — link
  250. Xorshift RNGs (2003) — link
  251. Coarse-grained transactions (2010)
  252. The Push / Pull model of transactions (2015)
  253. Linearizability: A correctness condition for concurrent objects (1990) — link
  254. Obstruction-free synchronization: Double -ended queues as an example (2003)
  255. Transactional boosting: A methodology for highly-concurrent transactional objects (2008) — link
  256. Enigma: Decentralized computation platform with guaranteed privacy — link
  257. Algorithm 235: Random permutation (1964) — link
  258. Software transactional memory for dynamic-sized data structures (2003) — link
  259. Making smart contracts smarter (2016)
  260. On subversive miner strategies and block withholding attack in bitcoin digital currency (2014) — link
  261. Space and time adaptive non-blocking algorithms (2003)
  262. Parallel programming must be deterministic by default (2009) — link
  263. Advanced synchronization facility proposed architectural specification (2009) — link
  264. An adaptive collect algorithm with applications (2002)
  265. Federated database systems for managing distributed, heterogeneous, and autonomous databases (1990)
  266. Minimum disclosure proofs of knowledge (1988) — link
  267. Cilk: An efficient multithreaded runtime system (1995) — link
  268. Understanding and effectively preventing the ABA problem in descriptor-based lock-free designs (2010)
  269. Fast and Robust Memory Reclamation for Concurrent Data Structures . (2016) — link
  270. Thrifty-malloc: A HW / SW codesign for the dynamic management of hardware transactional memory in embedded multicore systems. (2016) — link
  271. Adding Concurrency to Smart Contracts . (2017) — link
  272. Well- Structured Futures and Cache Locality . (2016) — link
  273. A Value Transmission Method for Abstract Data Types . (1982) — link
  274. Issues Process and Communication Structure for Distributed Programs . (1983)
  275. Optimistic Concurrency Control for Abstract Data Types . (1986) — link
  276. A Quorum - Consensus Replication Method for Abstract Data Types . (1986) — link
  277. Comparing How Atomicity Mechanisms Support Replication . (1986) — link
  278. Axioms for Concurrent Objects . (1987) — link
  279. Comparing How Atomicity Mechanisms Support Replication . (1985) — link
  280. Time- Driven Orphan Elimination . (1986)
  281. Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing . (1986) — link
  282. Specifying Graceful Degradation in Distributed Systems . (1987) — link
  283. Concurrency versus Availability : Atomic Mechanisms for Replicated Data . (1987) — link
  284. How to Make Replicated Data Secure . (1987) — link
  285. Avalon/ C . (1987)
  286. Dynamic Quorum Adjustment for Partitioned Data . (1987) — link
  287. Extending Multiversion Time - Stamping Protocols to Exploit Type Information . (1987) — link
  288. Optimistic Concurrency Control for Abstract Data Types . (1987) — link
  289. Hybrid Concurrency Control for Abstract Data Types . (1988) — link
  290. Impossibility and Universality Results for Wait - Free Synchronization . (1988) — link
  291. Reasoning about Atomic Objects . (1988) — link
  292. Inheritance of Synchronization and Recovery Properties in Avalon / C . (1988) — link
  293. Timestamp- Based Orphan Elimination . (1989) — link
  294. Linearizable concurrent objects. (1989) — link
  295. Taking concurrency seriously (position paper). (1989) — link
  296. Lower Bounds for Wait - Free Computation in Message - Passing Systems . (1990) — link
  297. Linearizability: A Correctness Condition for Concurrent Objects . (1990) — link
  298. Specifying Security Constraints with Relaxation Lattices . (1989) — link
  299. Position Statement : Type Specific Replication for Multiprocessors . (1990)
  300. Wait- Free Data Structures in the Asynchronous PRAM Model . (1990) — link
  301. Apologizing Versus Asking Permission : Optimistic Concurrency Control for Abstract Data Types . (1990) — link
  302. Concurrency and Availability as Dual Properties of Replicated Atomic Data (1990) — link
  303. Impossibility Results for Asynchronous PRAM ( Extended Abstract ). (1991) — link
  304. Randomized Wait - Free Concurrent Objects ( Extended Abstract ). (1991) — link
  305. Low Contention Linearizable Counting (1991) — link
  306. Specifying Graceful Degradation . (1991) — link
  307. Fast Randomized Consensus Using Shared Memory . (1990) — link
  308. Counting Networks and Multi - Processor Coordination (1991) — link
  309. Lock- Free garbage Collection for Multiprocessors . (1991) — link
  310. Hybrid Concurrency Control for Abstract Data Types . (1991) — link
  311. Efficient Atomic Snapshots Using Lattice Agreement ( Extended Abstract ). (1992) — link
  312. Low Contention Load Balancing on Large - Scale Multiprocessors . (1992) — link
  313. Time- Lapse Snapshots . (1992) — link
  314. On the Correctness of Orphan Management Algorithms . (1992) — link
  315. Contention in shared memory algorithms. (1993) — link
  316. The asynchronous computability theorem for t-resilient tasks. (1993) — link
  317. On the Space Complexity of Randomized Synchronization . (1993) — link
  318. Lock- Free Garbage Collection for Multiprocessors . (1992) — link
  319. Bounded Round Numbers . (1993) — link
  320. A Methodology for Implementing Highly Concurrent Objects . (1993) — link
  321. Set Consensus Using Arbitrary Objects ( Preliminary Version ). (1994) — link
  322. Counting Networks . (1994) — link
  323. Algebraic Topology and Distributed Computing : A Primer . (1995) — link
  324. Algebraic Spans ( Preliminary Version ). (1995) — link
  325. Transactional Memory : Architectural Support for Lock - Free Data Structures . (1993) — link
  326. A Tight Lower Bound for k- Set Agreement (1993) — link
  327. A simple constructive computability theorem for wait-free computation. (1994) — link
  328. A Tight Lower Bound for Processor Coordination . (1995) — link
  329. Scalable Concurrent Counting . (1995) — link
  330. On the Decidability of Distributed Decision Tasks ( Brief Announcement ). (1996) — link
  331. The Decidability of Distributed Decision Tasks ( Extended Abstract ). (1997) — link
  332. Contention in shared memory algorithms. (1997) — link
  333. The Arrow Distributed Directory Protocol . (1998) — link
  334. Atomic Snapshots Using Lattice Agreement . (1995) — link
  335. Applications of Algebraic Topology to Concurrent Computation . (1996) — link
  336. Linearizable Counting Networks . (1996) — link
  337. A Survey on Counting Networks . (1998)
  338. A Wait - Free Classification of Loop Agreement Tasks . (1998) — link
  339. Unifying Synchronous and Asynchronous Message - Passing Models . (1998) — link
  340. On the Space Complexity of Randomized Synchronization . (1998) — link
  341. Supporting Increment and Decrement Operations in Balancing Networks . (1999) — link
  342. Sorting and Counting Networks of Small Depth and Arbitrary Width . (1999) — link
  343. New Perspectives in Distributed Computing . (1999) — link
  344. The Aleph Toolkit : Support for Scalable Distributed Shared Objects . (1999) — link
  345. Time- Lapse Snapshots . (1999) — link
  346. Threshold Counters with Increments and Decrements . (1999)
  347. A Tale of Two Directories : Implementing Distributed Shared Objects in Java . (1999) — link
  348. Wait- Free Implementations in Message - Passing Systems . (1999) — link
  349. Hard- Potato routing. (2000) — link
  350. Randomized greedy hot-potato routing. (2000) — link
  351. On the Existence of Booster Types . (2000) — link
  352. A Combinatorial Characterization of Properties Preserved by Antitokens . (2000) — link
  353. Review of Distributed Computing by Attiya and Welch . (2000) — link
  354. Algebraic spans. (2000) — link
  355. A Combinatorial Characterization of Properties Preserved by Antitokens . (2000)
  356. The topological structure of asynchronous computability. (1999) — link
  357. DISC (2000) — link
  358. Tight bounds for k-set agreement. (2000) — link
  359. A tale of two directories: implementing distributed shared objects in Java . (2000) — link
  360. Adding Networks . (2001) — link
  361. A New Synchronous Lower Bound for Set Agreement . (2001) — link
  362. Routing without flow control. (2001) — link
  363. Adding networks. (2001) — link
  364. Self Stabilizing Distributed Queuing . (2001) — link
  365. Competitive concurrent distributed queuing. (2001) — link
  366. On beyond registers: wait-free readable objects. (2001) — link
  367. Ordered Multicast and Distributed Swap . (2001) — link
  368. The Repeat Offender Problem : A Mechanism for Supporting Dynamic - Sized , Lock - Free Data Structures . (2002) — link
  369. Tight Bounds for k- Set Agreement with Limited - Scope Failure Detectors . (2003) — link
  370. Software transactional memory for dynamic-sized data structures. (2003) — link
  371. Obstruction- Free Synchronization : Double - Ended Queues as an Example . (2003) — link
  372. An Overview of Synchronous Message - Passing and Topology . (2001) — link
  373. Dynamic-sized lock-free data structures. (2002) — link
  374. Threshold counters with increments and decrements. (2002) — link
  375. Sorting and Counting Networks of Arbitrary Width and Small Depth . (2002) — link
  376. tight bounds for k-set agreement with limited-scope failure detectors. (2003) — link
  377. Self- Stabilizing Smoothing and Counting Maurice Herlihy , Srikanta Tirthapura . (2003) — link
  378. A classification of wait-free loop agreement tasks. (2003) — link
  379. Randomized Smoothing Networks . (2004) — link
  380. Polymorphic Contention Management . (2005) — link
  381. Toward a theory of transactional contention managers. (2005) — link
  382. The transactional manifesto: software engineering and non-blocking synchronization. (2005) — link
  383. Space and Time Adaptive Non -blocking Algorithms . (2003) — link
  384. Bringing practical lock-free synchronization to 64-bit applications. (2004) — link
  385. Read-modify-write networks. (2004) — link
  386. Composable memory transactions. (2005) — link
  387. Energy implications of multiprocessor synchronization. (2006) — link
  388. Optimal Randomized Fair Exchange with Secret Shared Coins . (2005) — link
  389. A Lazy Concurrent List - Based Set Algorithm . (2005) — link
  390. Energy reduction in multiprocessor systems using transactional memory. (2005) — link
  391. Virtualizing Transactional Memory . (2005) — link
  392. Virtual Leashing : Internet - Based Software Piracy Protection . (2005) — link
  393. Nonblocking memory management support for dynamic-sized data structures. (2005) — link
  394. Snapshots and software transactional memory. (2005) — link
  395. Tight bounds for k-set agreement with limited-scope failure detectors. (2005) — link
  396. Subconsensus Tasks : Renaming Is Weaker Than Set Agreement . (2006) — link
  397. A Topological Treatment of Early - Deciding Set - Agreement . (2006) — link
  398. Self- Stabilizing Distributed Queuing . (2006) — link
  399. Dynamic Analysis of the Arrow Distributed Protocol . (2006) — link
  400. Virtual Leashing : Creating a computational foundation for software protection. (2006) — link
  401. Randomized smoothing networks. (2006) — link
  402. Proving correctness of highly-concurrent linearisable objects. (2006) — link
  403. Towards a theory of transactional contention managers. (2006) — link
  404. The art of multiprocessor programming. (2006) — link
  405. A flexible framework for implementing software transactional memory. (2006) — link
  406. Self-stabilizing smoothing and balancing networks. (2006) — link
  407. Potential show-stoppers for transactional synchronization. (2007) — link
  408. A Lazy Concurrent List - Based Set Algorithm . (2007) — link
  409. Distributed transactional memory for metric-space networks. (2007) — link
  410. 08241 Summary - Transactional Memory : From Implementation to Application . (2008) — link
  411. A Simple Optimistic Skiplist Algorithm . (2007) — link
  412. On the weakest failure detector ever. (2007) — link
  413. Taking Concurrency Seriously : the Multicore Challenge . (2007) — link
  414. Language Support and Compiler Optimizations for STM and Transactional Boosting . (2007) — link
  415. The Multicore Revolution . (2007) — link
  416. A hardware/software framework for supporting transactional memory in a MPSoC environment. (2007) — link
  417. Renaming. (2008) — link
  418. Linearizability. (2008) — link
  419. Asynchronous Consensus Impossibility . (2008) — link
  420. Transactional Memory : From Implementation to Application (2008) — link
  421. Hopscotch Hashing . (2008) — link
  422. Optimizing Threshold Protocols in Adversarial Structures . (2008) — link
  423. Checkpoints and continuations instead of nested transactions. (2008) — link
  424. 08241 Abstracts Collection - Transactional Memory : From Implementation to Application . (2008) — link
  425. Topology Approach in Distributed Computing . (2008) — link
  426. Dreadlocks: efficient deadlock detection. (2008) — link
  427. Transactional boosting: a methodology for highly-concurrent transactional objects. (2008) — link
  428. The future of distributed computing: renaissance or reformation? (2008) — link
  429. Distributed computing and the multicore revolution. (2008) — link
  430. Composable memory transactions. (2008) — link
  431. Brief announcement: concurrent non-commutative boosted transactions. (2009) — link
  432. Enhanced Fault - Tolerance through Byzantine Failure Detection . (2009) — link
  433. Energy efficient synchronization techniques for embedded architectures. (2008) — link
  434. The art of multiprocessor programming. (2008)
  435. Committing conflicting transactions in an STM . (2009) — link
  436. Transactional Memory Today : A Status Report . (2009) — link
  437. Technical perspective - Highly concurrent data structures. (2009) — link
  438. The topology of shared-memory adversaries. (2010) — link
  439. Distributed Computing and the Multicore Revolution . (2009) — link
  440. tm_db: A Generic Debugging Library for Transactional Programs . (2009) — link
  441. A topological treatment of early-deciding set-agreement. (2009) — link
  442. An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems . (2009) — link
  443. Transactional Memory : A Primer for Theorists . (2009)
  444. On the weakest failure detector ever. (2009) — link
  445. Concurrent Computing and Shellable Complexes . (2010) — link
  446. Coarse-grained transactions. (2010) — link
  447. Applications of Shellable Complexes to Distributed Computing - ( Invited Talk ). (2010) — link
  448. Embedded- TM : Energy and complexity-effective hardware transactional memory for embedded multicore systems. (2010) — link
  449. Teaching parallel programming: a roundtable discussion. (2010) — link
  450. An Equivariance Theorem with Applications to Renaming ( Preliminary Version ) (2011) — link
  451. Transactional Memory Today . (2010) — link
  452. Energy and Throughput Efficient Transactional Memory for Embedded Multicore Systems . (2010) — link
  453. Threshold protocols in survivor set systems. (2010) — link
  454. Transactional Memories . (2011) — link
  455. Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions. (2011) — link
  456. On the power of hardware transactional memory to simplify memory management. (2011) — link
  457. On the Nature of Progress . (2011) — link
  458. SoC - TM : integrated HW / SW support for transactional memory programming on embedded MPSoCs . (2011) — link
  459. Applications of Combinatorial Topology to Computer Science ( Dagstuhl Seminar 12121). (2012) — link
  460. SPAA (2012) — link
  461. Simulations and reductions for colorless tasks. (2012) — link
  462. An Equivariance Theorem with Applications to Renaming . (2012) — link
  463. Computability in distributed computing: a Tutorial . (2012) — link
  464. Scout: High - Performance Heterogeneous Computing Made Simple . (2011) — link
  465. Visualizing transactional memory. (2012) — link
  466. Transactional memory: beyond the first two decades. (2012) — link
  467. The Topology of Asynchronous Byzantine Colorless Tasks (2013) — link
  468. Message Passing or Shared Memory : Evaluating the Delegation Abstraction for Multicores . (2013) — link
  469. Using Elimination and Delegation to Implement a Scalable NUMA - Friendly Stack . (2013) — link
  470. Power and limits of distributed computing shared memory models. (2013) — link
  471. Well- Structured Futures and Cache Locality . (2013) — link
  472. Multidimensional approximate agreement in Byzantine asynchronous systems. (2013) — link
  473. Upper bound on the complexity of solving hard renaming. (2013) — link
  474. Transparent and energy-efficient speculation on NUMA architectures for embedded MPSoCs . (2013) — link
  475. The topology of distributed adversaries. (2013) — link
  476. A Practical Transactional Memory Interface . (2014) — link
  477. Approximate Local Sums and Their Applications in Radio Networks . (2014) — link
  478. Well-structured futures and cache locality. (2014) — link
  479. The future(s) of shared data structures. (2014) — link
  480. The Adaptive Priority Queue with Elimination and Combining . (2014) — link
  481. Scheduling Multiple Objects in Distributed Transactional Memory . (2014) — link
  482. The Adaptive Priority Queue with Elimination and Combining . (2014) — link
  483. Fun with hardware transactional memory. (2014) — link
  484. Speculative synchronization for coherence-free embedded NUMA architectures. (2014) — link
  485. Computing in the Presence of Concurrent Solo Executions . (2014) — link
  486. Composable Transactional Objects : A Position Paper . (2014) — link
  487. Warp-aware trace scheduling for GPUs . (2014) — link
  488. The Future of Synchronization on Multicores : The multicore transformation ( Ubiquity symposium). (2014) — link
  489. The Relative Power of Composite Loop Agreement Tasks . (2015) — link
  490. Sporadic Solutions to Zero - One Exclusion Tasks . (2014) — link
  491. StackTrack : an automated transactional approach to concurrent memory reclamation. (2014) — link
  492. Invyswell: a hybrid transactional memory for haswell’s restricted transactional memory. (2014) — link
  493. An Equivariance Theorem with Applications to Renaming . (2014) — link
  494. Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems . (2015) — link
  495. EuroSys (2015) — link
  496. Guest Editor Introduction . (2015) — link
  497. Energy- Efficient and High - Performance Lock Speculation Hardware for Embedded Multicore Systems . (2015) — link
  498. Impossibility Results for Distributed Transactional Memory . (2015) — link
  499. The Relative Power of Composite Loop Agreement Tasks . (2015) — link
  500. Playing with Fire : Transactional Memory Revisited for Error - Resilient and Energy - Efficient MPSoC Execution . (2015) — link
  501. Multidimensional agreement in Byzantine systems. (2015) — link
  502. Enhancing Accountability and Trust in Distributed Ledgers . (2016) — link
  503. Topology Approach in Distributed Computing . (2016) — link
  504. Asynchronous Consensus Impossibility . (2016) — link
  505. Asynchronous Computability Theorems for t- Resilient Systems . (2016) — link
  506. New Challenges in Parallelism ( Dagstuhl Seminar 17451). (2017) — link
  507. Renaming. (2016) — link
  508. Linearizability. (2016) — link
  509. Blockchains and the Logic of Accountability : Keynote Address . (2016) — link
  510. Fast non-intrusive memory reclamation for highly-concurrent data structures. (2016) — link
  511. Brief Announcement : A Persistent Lock - Free Queue for Non - Volatile Memory . (2017) — link
  512. Concurrent Data Structures for Near - Memory Computing . (2017) — link
  513. Fast Scheduling in Distributed Transactional Memory . (2017) — link
  514. POSTER : State Teleportation via Hardware Transactional Memory . (2017) — link
  515. Brief Announcement : Proust : A Design Space for Highly - Concurrent Transactional Data Structures . (2017) — link
  516. An Algorithmic Approach to the Asynchronous Computability Theorem . (2017) — link
  517. Proust: A Design Space for Highly - Concurrent Transactional Data Structures . (2017) — link
  518. Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems . (2017) — link
  519. Blockchains and the Future of Distributed Computing . (2017) — link
  520. The Teleportation Design Pattern for Hardware Transactional Memory . (2017) — link
  521. Edge- TM : Exploiting Transactional Memory for Error Tolerance and Energy Efficiency . (2017) — link
  522. From wait-free to arbitrary concurrent solo executions in colorless distributed computing. (2017) — link
  523. SuperNeurons : FFT -based Gradient Sparsification in the Distributed Training of Deep Neural Networks . (2018) — link
  524. Clairvoyant State Machine Replications . (2018) — link
  525. Load Balanced Distributed Directories . (2018) — link
  526. A persistent lock-free queue for non-volatile memory. (2018) — link
  527. Authenticated modular maps in Haskell . (2018) — link
  528. Proof- Carrying Smart Contracts . (2018) — link
  529. An algorithmic approach to the asynchronous computability theorem. (2018) — link
  530. Hardware Transactional Memory Exploration in Coherence - Free Many - Core Architectures . (2018) — link
  531. Time-communication impossibility results for distributed transactional memory. (2018) — link
  532. Clairvoyant State Machine Replication . (2019) — link
  533. Improving Parallelism in Hardware Transactional Memory . (2018) — link
  534. Adding Concurrency to Smart Contracts . (2018) — link
  535. ASPLOS (2019) — link
  536. An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts . (2019) — link
  537. Concurrent Data Structures with Near - Data - Processing : an Architecture - Aware Implementation . (2019) — link
  538. Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects . (2019) — link
  539. Bounds on the Step and Namespace Complexity of Renaming . (2019) — link
  540. Encrypted Databases for Differential Privacy . (2019) — link
  541. An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts . (2019) — link
  542. CUDA - DTM : Distributed Transactional Memory for GPU Clusters . (2019) — link
  543. Attacking memory-hard scrypt with near-data-processing. (2019) — link
  544. Tokenomics (2020) — link
  545. Dynamic Scheduling in Distributed Transactional Memory . (2020) — link
  546. Privacy- Preserving Cross - Chain Atomic Swaps . (2020) — link
  547. Cryptoasset Competition and Market Concentration in the Presence of Network Effects . (2021) — link
  548. Blockchains from a distributed computing perspective. (2019) — link
  549. FFT -based Gradient Sparsification for the Distributed Training of Deep Neural Networks . (2020) — link
  550. Adding concurrency to smart contracts. (2020) — link
  551. Blockchain: From Technology to Marketplaces . (2020) — link
  552. Fast Scheduling in Distributed Transactional Memory . (2021) — link
  553. Cryptoasset Competition and Market Concentration in the Presence of Network Effects (2021) — link

0 of 561 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2518 linked papers.