STOC 2010 - PDF Preprint Papers

STOC 2010 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2010 Paper

click to vote

STOC
2010
ACM

618views Algorithms» more STOC 2010»

Differential Privacy Under Continual Observation

14 years 8 months ago

Download eprint.iacr.org

We ask the question ? how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user's privacy? We propose a differ...

Cynthia Dwork, Moni Naor, Toniann Pitassi and Guy ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	618	Differential Privacy Under Continual Observation	claim
2	378	On the Geometry of Differential Privacy	claim
3	295	Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth	claim
4	282	The Price of Privately Releasing Contingency Tables and the Spectra of Random Matrices with Correlated Rows	claim
5	274	Odd Cycle Packing	claim
6	269	Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters	claim
7	261	An Improved LP-based Approximation for Steiner Tree	claim
8	257	Local List-Decoding and Testing of Random Linear Codes from High-Error	claim
9	256	The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries	claim
10	245	Weighted Geometric Set Cover via Quasi-Uniform Sampling	claim
11	244	Improving Exhaustive Search Implies Superpolynomial Lower Bounds	claim
12	238	Almost tight bounds for rumour spreading with conductance	claim
13	228	On the Structure of Cubic and Quartic Polynomials	claim
14	228	On the searchability of small-world networks with arbitrary underlying structure	claim
15	227	On the Round Complexity of Covert Computation	claim
16	226	Public-Key Cryptography from Different Assumptions	claim
17	224	Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses	claim
18	220	Combinatorial approach to the interpolation method and scaling limits in sparse random graphs	claim
19	219	A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations	claim
20	219	Message passing algorithms: a success looking for theoreticians	claim
21	216	BQP and the Polynomial Hierarchy	claim
22	216	The HOM problem is decidable	claim
23	211	Extensions and Limits to Vertex Sparsification	claim
24	211	Maintaining a Large Matching or a Small Vertex Cover	claim
25	211	Distributed Computation in Dynamic Networks	claim
26	210	Recognizing well-parenthesized expressions in the streaming model	claim
27	207	Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in	claim
28	204	On the Hardness of the Noncommutative Determinant	claim
29	204	Interactive privacy via the median mechanism	claim
30	202	How to Compress Interactive Communication	claim
31	200	Hardness Amplification in Proof Complexity	claim
32	200	Changing Base without Losing Space	claim
33	199	Zero-One Frequency Laws	claim
34	195	Efficiently Learning Mixtures of Two Gaussians	claim
35	194	Multi-parameter mechanism design and sequential posted pricing	claim
36	193	Maintaining a large matching and a small vertex cover	claim
37	193	Privacy Amplification with Asymptotically Optimal Entropy Loss	claim
38	190	Subgraph Sparsification and Nearly Optimal Ultrasparsifiers	claim
39	189	Near-optimal extractors against quantum storage	claim
40	186	Tractable hypergraph properties for constraint satisfaction and conjunctive queries	claim
41	186	Matroid Matching: the Power of Local Search	claim
42	186	Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms	claim
43	186	Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph	claim
44	185	Optimal Homologous Cycles, Total Unimodularity, and Linear Programming	claim
45	185	On the Complexity of #CSP	claim
46	185	Measuring independence of datasets	claim
47	184	An Invariance Principle For Polytopes	claim
48	182	Saving Space by Algebraization	claim
49	181	Load balancing and orientability thresholds for random hypergraphs	claim
50	179	Tensor-Rank and Lower Bounds for Arithmetic Formulas	claim
51	178	On the List-Decodability of Random Linear Codes	claim
52	176	QIP = PSPACE	claim
53	176	Complexity Theory for Operators in Analysis	claim
54	176	Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions	claim
55	175	Conditional Hardness of Precedence Constrained Scheduling on Identical Machines	claim
56	174	Towards Polynomial Lower Bounds for Dynamic Problems	claim
57	174	Local list-decoding and testing of random linear codes from high error	claim
58	174	Are many small sets explicitly small?	claim
59	171	An Optimal Ancestry Scheme and Small Universal Posets	claim
60	170	Connectivity oracles for failure prone graphs	claim
61	168	Non-commutative circuits and the sum-of-squares problem	claim
62	161	A Full Characterization of Quantum Advice	claim
63	159	On the Complexity of Circuit Satisfiability	claim
64	154	Bayesian Algorithmic Mechanism Design	claim
65	153	Sorting under partial information (without the ellipsoid algorithm)	claim
66	152	Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem	claim
67	150	Augmenting undirected node-connectivity by one	claim
68	149	Graph Expansion and the Unique Games Conjecture	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers