Copertina

LOCO: A Low-Cost SNU-Self-Resilient Latch Using an Output-Split C-Element

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ma, Ruijun, Chen, Xin, Wen, Xiaoqing, Xu, Hui, Ye, Shengnan, Zhang, Chuanjian, Wang, Senling
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computer Science and Game Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Low‐Power Triple‐Node‐Upset Recovery Hardened Latch Based on Triple Modular Redundancy
di: Hui Xu, et al.
Pubblicazione: (2025)

Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design
di: Ma, Mengfan, et al.
Pubblicazione: (2024)

Low Cost, Fair, and Representative Committees in a Metric Space
di: Jerrett, Christopher, et al.
Pubblicazione: (2025)

The Cost of Permissionless Liquidity Provision in Automated Market Makers
di: Ma, Julian, et al.
Pubblicazione: (2024)

Efficient and Cost-effective Vehicle Recruitment for HD Map Crowdsourcing
di: Ye, Wentao, et al.
Pubblicazione: (2026)

Opportunity-Cost-Driven Reward Mechanisms for Crowd-Sourced Computing Platforms
di: Zheng, Shuhao, et al.
Pubblicazione: (2025)

Adjusted Winner: from Splitting to Selling
di: Bredereck, Robert, et al.
Pubblicazione: (2026)

The Keychain Problem: On Minimizing the Opportunity Cost of Uncertainty
di: Vuong, Ramiro N. Deo-Campo, et al.
Pubblicazione: (2025)

Constrained Distributed Heterogeneous Two-Facility Location Problems with Max-Variant Cost
di: Xu, Xinru, et al.
Pubblicazione: (2025)

Split-Merge Dynamics for Shapley-Fair Coalition Formation
di: Zhu, Quanyan, et al.
Pubblicazione: (2026)

Optimized Cost Per Click in Online Advertising: A Theoretical Analysis
di: Zhang, Kaichen, et al.
Pubblicazione: (2024)

Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy
di: Wu, Xiaowei, et al.
Pubblicazione: (2024)

Incentives for Early Arrival in Cost Sharing
di: Zhang, Junyu, et al.
Pubblicazione: (2024)

Equilibria of the Colonel Blotto Games with Costs
di: Kaźmierowski, Stanisław
Pubblicazione: (2024)

Stochastic Knapsack with Costs: On Adaptivity and Return-on-Investment
di: Barak, Zohar, et al.
Pubblicazione: (2025)

The Cost and Complexity of Minimizing Envy in House Allocation
di: Madathil, Jayakrishnan, et al.
Pubblicazione: (2024)

Epistemic Selection of Costly Alternatives: The Case of Participatory Budgeting
di: Rey, Simon, et al.
Pubblicazione: (2023)

The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts
di: Chavrimootoo, Michael C., et al.
Pubblicazione: (2026)

Strategyproof Facility Location with Prediction: Minimizing the Maximum Cost
di: Chan, Hau, et al.
Pubblicazione: (2025)

Vector Cost Bimatrix Games with Applications to Autonomous Racing
di: Toaz, Benjamin R., et al.
Pubblicazione: (2025)

Resilient and Efficient Allocation for Large-Scale Autonomous Fleets via Decentralized Coordination
di: Perukari, Ashish Kumar, et al.
Pubblicazione: (2025)

Networked Digital Public Goods Games with Heterogeneous Players and Convex Costs
di: Cheng, Yukun, et al.
Pubblicazione: (2025)

Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship
di: Caragiannis, Ioannis, et al.
Pubblicazione: (2024)

Measuring the Hidden Cost of Data Valuation through Collective Disclosure
di: Mesana, Patrick, et al.
Pubblicazione: (2025)

The Cost of Balanced Training-Data Production in an Online Data Market
di: Chaintreau, Augustin, et al.
Pubblicazione: (2025)

Maximin Fair Allocation of Indivisible Items under Cost Utilities
di: Botan, Sirin, et al.
Pubblicazione: (2024)

Game-Theoretic Foundations for Cyber Resilience Against Deceptive Information Attacks in Intelligent Transportation Systems
di: Yang, Ya-Ting, et al.
Pubblicazione: (2024)

Toward Resilient Airdrop Mechanisms: Empirical Measurement of Hunter Profits and Airdrop Game Theory Modeling
di: Luo, Junliang, et al.
Pubblicazione: (2025)

Why Instant-Runoff Voting Is So Resilient to Coalitional Manipulation: Phase Transitions in the Perturbed Culture
di: Durand, François
Pubblicazione: (2025)

Using "Failure Costs" to Guarantee Execution Quality in Competitive and Permissionless Order Flow Auctions
di: Watts, Alex, et al.
Pubblicazione: (2025)

Incentive Mechanism for Mobile Crowd Sensing with Assumed Bid Cost Reverse Auction
di: Yangchin, Jowa, et al.
Pubblicazione: (2025)

Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
di: Lin, Zehan, et al.
Pubblicazione: (2026)

Equilibria of Data Marketplaces with Privacy-Aware Sellers under Endogenous Privacy Costs
di: Sen, Diptangshu, et al.
Pubblicazione: (2024)

Conflux-PSRO: Effectively Leveraging Collective Advantages in Policy Space Response Oracles
di: Huang, Yucong, et al.
Pubblicazione: (2024)

Combining Counterfactual Regret Minimization with Information Gain to Solve Extensive Games with Unknown Environments
di: Qiu, Chen, et al.
Pubblicazione: (2021)

Optimal Reward Allocation via Proportional Splitting
di: Aumayr, Lukas, et al.
Pubblicazione: (2025)

Determining Blockchain Transaction Timing and Fee with Observable Mempools
di: Bai, Qianlan, et al.
Pubblicazione: (2025)

Cost Allocation for Set Covering: the Happy Nucleolus
di: Blauth, Jannis, et al.
Pubblicazione: (2024)

Obnoxious Facility Location Problems: Strategyproof Mechanisms Optimizing $L_p$-Aggregated Utilities and Costs
di: Chan, Hau, et al.
Pubblicazione: (2025)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
di: Kulkarni, Pooja, et al.
Pubblicazione: (2025)