Computing with a full memory

DOI10.1145/2591796.2591874zbMath1315.68125OpenAlexW2169633255MaRDI QIDQ5259622

Harry Buhrman, Florian Speelman, Michal Koucký, Richard Cleve, Bruno Loff

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2591796.2591874

zbMATH Keywords

straight-line programsarithmetic circuitsreversible computationspace complexitytransparent computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (13)

Optimal In-place Algorithms for Basic Graph Problems ⋮ Randomized and Symmetric Catalytic Computation ⋮ Unnamed Item ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Dual VP classes ⋮ Catalytic space: non-determinism and hierarchy ⋮ Power of uninitialized qubits in shallow quantum circuits ⋮ Frameworks for designing in-place graph algorithms ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ A Framework for In-place Graph Algorithms ⋮ On pure space vs catalytic space ⋮ Proofs of Catalytic Space ⋮ On pure space vs catalytic space

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography

This page was built for publication: Computing with a full memory