Anti-persistence
From MaRDI portal
Publication:5176007
DOI10.1145/380752.380844zbMath1323.68244MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68W05: Nonnumerical algorithms
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68P05: Data structures
Related Items
Lower and upper bounds on obtaining history independence, Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees, A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
Cites Work