A deterministic O(log B)-competitive algorithm for online knapsack with positive and negative items, with asymptotically matching lower bound, for transaction admission in PCNs.
10 Marek Cygan, Lukasz Jez, and Jirí Sgall
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
ACE is a new voting protocol that achieves end-to-end verifiability, publicly tally-hiding results, and strong receipt-freeness without trusted clients via Audit-or-Cast and tallier-side re-randomization.
citing papers explorer
-
Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
A deterministic O(log B)-competitive algorithm for online knapsack with positive and negative items, with asymptotically matching lower bound, for transaction admission in PCNs.
-
Audit-or-Cast: Enforcing Honest Elections with Privacy-Preserving Public Verification
ACE is a new voting protocol that achieves end-to-end verifiability, publicly tally-hiding results, and strong receipt-freeness without trusted clients via Audit-or-Cast and tallier-side re-randomization.