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

393views Algorithms» more STOC 2010»

Differential Privacy Under Continual Observation

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers