Anti-persistence
From MaRDI portal
Publication:5176007
DOI10.1145/380752.380844zbMath1323.68244OpenAlexW1967569591MaRDI QIDQ5176007
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380844
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items
A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Lower and upper bounds on obtaining history independence ⋮ Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees ⋮ Formalizing data deletion in the context of the right to be forgotten
Cites Work