Text

SIAM Journal on Computing | Vol.43 No.5

---

Table of Contents:
- Impossibility of Differentially Private Universally Optimal Mechanisms (Hai Brenner and Kobbi Nissim)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, and Saket Saurabh)
- Protecting Circuits from Computationally Bounded and Noisy Leakage (Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, and Vinod Vaikuntanathan)
- Voting with Limited Information and Many Alternatives (Flavio Chierichetti and Jon Kleinberg)
- New Bounds for Matching Vector Families (Abhishek Bhowmick, Zeev Dvir, and Shachar Lovett)
- The Geometry of Scheduling (Nikhil Bansal and Kirk Pruhs)
- On the Correlation of Parity and Small-Depth Circuits (Johan Håstad)
- Time Hierarchies for Sampling Distributions (Thomas Watson)
- Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension (Martin Čadek, Marek Krčál, Jiří Matoušek, Lukáš Vokřínek, and Uli Wagner)
- Optimal Dynamic Sequence Representations (Gonzalo Navarro and Yakov Nekrich)
- Matroid Secretary for Regular and Decomposable Matroids (Michael Dinitz and Guy Kortsarz)

---

Availability

Detail Information

Series Title

-

Call Number

-

Publisher

Philadelphia USA : Society for Industrial and Applied Mathematics., 2014

Collation

-

Language

English

ISBN/ISSN

975397

Classification

Unclass

Content Type

-

Media Type

-

Carrier Type

-

Edition

Vol. 43 No. 5 (Dec 2014)

Subject(s)

Cryptography
Computer Science

Specific Detail Info

Articles originally published online September to October 2014

Statement of Responsibility

L.J. Schulman

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment