Entity usage

Showing below up to 35 results in range #51 to #85.

51. A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies: Label: en
52. Instance optimal learning of discrete distributions: Label: en
53. The computational power of optimization in online learning: Label: en
54. A cost function for similarity-based hierarchical clustering: Label: en
55. Complexity theoretic limitations on learning halfspaces: Label: en
56. Matrix rigidity of random toeplitz matrices: Label: en
57. On the effect of randomness on planted 3-coloring models: Label: en
58. Candidate hard unique game: Label: en
59. Constant-round interactive proofs for delegating computation: Label: en
60. Bounded degree cosystolic expanders of every dimension: Label: en
61. Separating subadditive euclidean functionals: Label: en
62. Geometric median in nearly linear time: Label: en
63. Textbook non-malleable commitments: Label: en
64. Watermarking cryptographic capabilities: Label: en
65. Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations: Label: en
66. Algebraic attacks against random local functions and their countermeasures: Label: en
67. A size-free CLT for poisson multinomials and its applications: Label: en
68. The fourier transform of poisson multinomial distributions and its algorithmic applications: Label: en
69. Algorithmic stability for adaptive data analysis: Label: en
70. Relating two property testing models for bounded degree directed graphs: Label: en
71. A polynomial lower bound for testing monotonicity: Label: en
72. Communication lower bounds for statistical estimation problems via a distributed data processing inequality: Label: en
73. Constant-rate coding for multiparty interactive communication is impossible: Label: en
74. Interactive compression for product distributions: Label: en
75. Exponential separation of communication and external information: Label: en
76. The price of anarchy in large games: Label: en
77. Watch and learn: optimizing from revealed preferences feedback: Label: en
78. A duality based unified approach to Bayesian mechanism design: Label: en
79. Sample-optimal tomography of quantum states: Label: en
80. Efficient quantum tomography: Label: en
81. Classical verification of quantum proofs: Label: en
82. Entangled simultaneity versus classical interactivity in communication complexity: Label: en
83. Separations in query complexity using cheat sheets: Label: en
84. Parallel algorithms for select and partition with noisy comparisons: Label: en
85. Sparsified Cholesky and multigrid solvers for connection laplacians: Label: en