# Research Search Within Results Search Within Results search ## 19 results Show filters filter\_alt Sort by Year of PublicationAlphabetical A-Z sort ## 19 results Download 19 citations download- [BibTeX](/node/1668141/export?format=bibtex) - [EndNote X3 XML](/node/1668141/export?format=endnote8) - [EndNote 7 XML](/node/1668141/export?format=endnote7) - [Endnote tagged](/node/1668141/export?format=tagged) - [Marc](/node/1668141/export?format=marc) - [PubMedId](/node/1668141/export?format=pubmed_id) - [RIS](/node/1668141/export?format=ris) ### 2023 Surat Teerapittayanon, Marcus Comiter, Brad McDanel, and H. T. Kung. 2023. “[StitchNet: Composing Neural Networks from Pre-Trained Fragments ](/publications/stitchnet-composing-neural-networks-pre-trained-fragments)” Surat Teerapittayanon, Marcus Comiter, Brad McDanel, and H. T. Kung. 2023. “[StitchNet: Composing Neural Networks from Pre-Trained Fragments ](/publications/stitchnet-composing-neural-networks-pre-trained-fragments)” - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://arxiv.org/abs/2301.01947) We propose StitchNet, a novel neural network creation paradigm that stitches together fragments (one or more consecutive network layers) from multiple pre-trained neural networks. StitchNet allows the creation of high-performing neural networks without... - [ descriptionPublisher's Version](https://arxiv.org/abs/2301.01947) ### 2022 Matheus V. X. Ferreira and David C. Parkes. 2022. “[Credible Decentralized Exchange Design via Verifiable Sequencing Rules.](/publications/credible-decentralized-exchange-design-verifiable)” Matheus V. X. Ferreira and David C. Parkes. 2022. “[Credible Decentralized Exchange Design via Verifiable Sequencing Rules.](/publications/credible-decentralized-exchange-design-verifiable)” - add\_circle\_outline do\_not\_disturb\_on Abstract Trading on decentralized exchanges has been one of the primary use cases for permissionless blockchains with daily trading volume exceeding billions of U.S.~dollars. In the status quo, users broadcast transactions and miners are responsible for composing... Zhou Fan, Francisco J. Marmolejo Cossío, Ben Altschuler, He Sun, Xintong Wang, and David C. Parkes. 2022. “[Differential Liquidity Provision in Uniswap V3 and Implications for Contract Design](https://arxiv.org/abs/2204.00464)” Zhou Fan, Francisco J. Marmolejo Cossío, Ben Altschuler, He Sun, Xintong Wang, and David C. Parkes. 2022. “[Differential Liquidity Provision in Uniswap V3 and Implications for Contract Design](https://arxiv.org/abs/2204.00464)” - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://arxiv.org/abs/2204.00464) Decentralized exchanges (DEXs) provide a means for users to trade pairs of assets on-chain without the need for a trusted third party to effectuate a trade. Amongst these, constant function market maker DEXs such as Uniswap handle the most volume of... - [ descriptionPublisher's Version](https://arxiv.org/abs/2204.00464) Michael Sutton and Yonatan Sompolinsky. 2022. “[The DAG KNIGHT Protocol: A Parameterless Generalization of Nakamoto Consensus](/publications/he-dag-knight-protocol-parameterless-generalization)” Michael Sutton and Yonatan Sompolinsky. 2022. “[The DAG KNIGHT Protocol: A Parameterless Generalization of Nakamoto Consensus](/publications/he-dag-knight-protocol-parameterless-generalization)” - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://eprint.iacr.org/2022/1494.pdf) In 2008 Satoshi wrote the first permissionless consensus protocol, known as Nakamoto Consensus (NC), and implemented in Bitcoin. A large body of research was dedicated since to modify and extend NC, in various aspects: speed, throughput, energy... - [ descriptionPublisher's Version](https://eprint.iacr.org/2022/1494.pdf) Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen Zhang, Stratos Idreos, and Michael Mitzenmacher. 2022. “[Proteus: A Self-Designing Range Filter. Proc. Symposium on Principles of Database Systems](/publications/proteus-self-designing-range-filter-proc-symposium)”. Proceedings of the 2022 Symposium on Principles of Databse Systems Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen Zhang, Stratos Idreos, and Michael Mitzenmacher. 2022. “[Proteus: A Self-Designing Range Filter. Proc. Symposium on Principles of Database Systems](/publications/proteus-self-designing-range-filter-proc-symposium)”. Proceedings of the 2022 Symposium on Principles of Databse Systems - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](http://people.iiis.tsinghua.edu.cn/~huanchen/publications/proteus-sigmod22.pdf) We introduce Proteus, a novel self-designing approximate range filter, which configures itself based on sampled data in order to optimize its false positive rate (FPR) for a given space requirement. Proteus unifies the probabilistic and deterministic... - [ descriptionPublisher's Version](http://people.iiis.tsinghua.edu.cn/~huanchen/publications/proteus-sigmod22.pdf) Kapil Vaidya, Subarna Chatterjee, Eric Knorr, Stratos Idreos, Michael Mitzenmacher, and Tim Kraska. 2022. “[SNARF: A Learning-Enhanced Range Filter.](/publications/snarf-learning-enhanced-range-filter)”. Proceedings of the 48th International Conference on Very Large Databases (VLDB) 2022. Kapil Vaidya, Subarna Chatterjee, Eric Knorr, Stratos Idreos, Michael Mitzenmacher, and Tim Kraska. 2022. “[SNARF: A Learning-Enhanced Range Filter.](/publications/snarf-learning-enhanced-range-filter)”. Proceedings of the 48th International Conference on Very Large Databases (VLDB) 2022. - add\_circle\_outline do\_not\_disturb\_on Abstract We present Sparse Numerical Array-Based Range Filters (SNARF), a learned range filter that efficiently supports range queries for numerical data. SNARF creates a model of the data distribution to map the keys into a bit array which is stored in a... ### 2021 Michael Neuder, Daniel J. Moroz, Rithvik Rao, and David C. Parkes. 2021. “[Low-Cost Attacks on Ethereum 2.0 by Sub-1 3 Stakeholders](/publications/low-cost-attacks-ethereum-20-sub-13-stakeholders)”. Workshop on Game Theory in Blockchain at the 16th Conference on Web and Internet Economics (WINE)., Pp. 2102.02247 Michael Neuder, Daniel J. Moroz, Rithvik Rao, and David C. Parkes. 2021. “[Low-Cost Attacks on Ethereum 2.0 by Sub-1 3 Stakeholders](/publications/low-cost-attacks-ethereum-20-sub-13-stakeholders)”. Workshop on Game Theory in Blockchain at the 16th Conference on Web and Internet Economics (WINE)., Pp. 2102.02247 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://projects.iq.harvard.edu/files/applied-cryptography-society/files/gtib20_paper_8.pdf) We outline two dishonest strategies that can be cheaply executed on the Ethereum 2.0 beacon chain, even by validators holding less than one-third of the total stake: malicious chain reorganizations (“reorgs”) and finality delays. In a malicious reorg, an... - [ descriptionPublisher's Version](https://projects.iq.harvard.edu/files/applied-cryptography-society/files/gtib20_paper_8.pdf) Matheus V. X. Ferreira, Daniel J. Moroz, David C. Parkes, and Mitchell Stern. 2021. “[Dynamic Posted-Price Mechanisms for the Blockchain Transaction-Fee Market](https://arxiv.org/abs/2103.14144)”. AFT ’21: Proceedings of the 3rd ACM Conference on Advances in Financial Technologies, Pp. 86–99 Matheus V. X. Ferreira, Daniel J. Moroz, David C. Parkes, and Mitchell Stern. 2021. “[Dynamic Posted-Price Mechanisms for the Blockchain Transaction-Fee Market](https://arxiv.org/abs/2103.14144)”. AFT ’21: Proceedings of the 3rd ACM Conference on Advances in Financial Technologies, Pp. 86–99 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://projects.iq.harvard.edu/files/applied-cryptography-society/files/2103.14144.pdf) In recent years, prominent blockchain systems such as Bitcoin and Ethereum have experienced explosive growth in transaction volume, leading to frequent surges in demand for limited block space, causing transaction fees to fluctuate by orders of magnitude... - [ descriptionPublisher's Version](https://projects.iq.harvard.edu/files/applied-cryptography-society/files/2103.14144.pdf) Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, and Shay Vargaftik. 2021. “[SALSA: Self-Adjusting Lean Streaming Analytics ](/publications/salsa-self-adjusting-lean-streaming-analytics)”. 37th IEEE International Conference on Data Engineering (ICDE 2021) Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, and Shay Vargaftik. 2021. “[SALSA: Self-Adjusting Lean Streaming Analytics ](/publications/salsa-self-adjusting-lean-streaming-analytics)”. 37th IEEE International Conference on Data Engineering (ICDE 2021) - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://arxiv.org/abs/2102.12531) Counters are the fundamental building block of many data sketching schemes, which hash items to a small number of counters and account for collisions to provide good approximations for frequencies and other measures. Most exist- ing methods rely on fixed... - [ descriptionPublisher's Version](https://arxiv.org/abs/2102.12531) Ran Ben Basat, Michael Mitzenmacher, and Shay Vargaftik. 2021. “[How to Send a Real Number Using a Single Bit (and Some Shared Randomness)](/publications/how-send-real-number-using-single-bit-and-some-shared)”. International Colloquium on Automata, Languages, and Programming (ICALP 2021) Ran Ben Basat, Michael Mitzenmacher, and Shay Vargaftik. 2021. “[How to Send a Real Number Using a Single Bit (and Some Shared Randomness)](/publications/how-send-real-number-using-single-bit-and-some-shared)”. International Colloquium on Automata, Languages, and Programming (ICALP 2021) - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://arxiv.org/abs/2010.02331) We consider the fundamental problem of communicating an estimate of a real number x ∈ \[0, 1\] using a single bit. A sender that knows x chooses a value X ∈ {0, 1} to transmit. In turn, a receiver estimates x based on the value of X. The goal is to... - [ descriptionPublisher's Version](https://arxiv.org/abs/2010.02331) Owen Ardena, Anitha Gollamudib, Ethan Cecchettic, Stephen Chong, and Andrew C. Myers. 2021. [A Calculus for Flow-Limited Authorization](/publications/calculus-flow-limited-authorization) Owen Ardena, Anitha Gollamudib, Ethan Cecchettic, Stephen Chong, and Andrew C. Myers. 2021. [A Calculus for Flow-Limited Authorization](/publications/calculus-flow-limited-authorization) - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://arxiv.org/pdf/2104.10379.pdf) Real-world applications routinely make authorization decisions based on dynamic computation. Reasoning about dynamically computed authority is challenging. Integrity of the system might be compromised if attackers can improperly influence the authorizing... - [ descriptionPublisher's Version](https://arxiv.org/pdf/2104.10379.pdf) Anitha Gollamudi and Stephen Chong. 2021. “[Expressive Authorization Policies Using Computation Principles](/publications/expressive-authorization-policies-using-computation)”. Workshop on Foundations of Computer Security Anitha Gollamudi and Stephen Chong. 2021. “[Expressive Authorization Policies Using Computation Principles](/publications/expressive-authorization-policies-using-computation)”. Workshop on Foundations of Computer Security - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://scholar.harvard.edu/anithag/publications/expressive-authorization-policies-using-computation-principles) In authorization logics, it is natural to treat computations as principals, since systems need to decide how much authority to give computations when they execute. But unlike other kinds of principals, the authority that we want to give to computations... - [ descriptionPublisher's Version](https://scholar.harvard.edu/anithag/publications/expressive-authorization-policies-using-computation-principles) - Previous page chevron\_left - [1](?page=0 "Current page") - [2](?page=1 "Go to page 2") - [ Next page chevron\_right ](?page=1 "Go to next page")