ROLE
Author only
BOOKMARK & SHARE


1
July 2017
CCC '17: Proceedings of the 32nd Computational Complexity Conference
Publisher: Schloss DagstuhlLeibnizZentrum fuer Informatik
Let D be a b wise independent distribution over {0, 1} m . Let E be the "noise" distribution over {0, 1} m where the bits are independent and each bit is 1 with probability η /2. We study which tests f : {0, 1} m → [−1, 1] are ...
Keywords:
product tests, bounded independence, noise, pseudorandomness, errorcorrecting codes
2
November 2016
Algorithmica: Volume 76 Issue 3, November 2016
Publisher: SpringerVerlag New York, Inc.
Communication in "natural" settings, e.g., between humans, is distinctly different from that in classical designed settings, in that the former is invariably characterized by the sender and receiver not being in perfect agreement with each other. Solutions to classical communication problems thus have to overcome an extra layer of uncertainty ...
Keywords:
Source coding, Communication complexity, Graph coloring
3
July 2016
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5, Downloads (12 Months): 73, Downloads (Overall): 119
Full text available:
PDF
Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed computing. The local nature of an MIS allows for fast solutions in a static distributed setting, which are logarithmic in the number of nodes or in their degrees. The result trivially applies for the dynamic ...
Keywords:
maximal independent set, randomized algorithms, dynamic distributed algorithms, history independence
4
April 2016
ACM Transactions on Algorithms (TALG): Volume 12 Issue 3, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6, Downloads (12 Months): 49, Downloads (Overall): 108
Full text available:
PDF
We study a variant of the generalized assignment problem ( gap ), which we label allornothing gap ( agap ). We are given a set of items, partitioned into n groups, and a set of m bins. Each item ℓ has size s ℓ > 0, and utility a ℓ ...
Keywords:
group packing, ad placement, Generalized assignment problem, approximation algorithms
5
October 2015
FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)
Publisher: IEEE Computer Society
A local tester for a code probabilistically views a small set of coordinates of a given word and based on this local view accepts code words with probability one while rejecting words far from the code with constant probability. A local tester for a code is said to be "robust" ...
6
January 2014
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 0, Downloads (12 Months): 5, Downloads (Overall): 50
Full text available:
PDF
Communication in "natural" settings, e.g., between humans, is distinctly different than that in classical designed settings, in that the former is characterized by the sender and receiver not being in perfect agreement with each other. Solutions to classical communication problems thus have to overcome an extra layer of uncertainty introduced ...
Keywords:
communication complexity, source coding, graph coloring
7
March 2013
IPCO'13: Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Publisher: SpringerVerlag
We study a variant of the generalized assignment problem (gap) which we label allornothing GAP ( AGAP ) . We are given a set of items, partitioned into n groups, and a set of m bins. Each item ℓ has size s ℓ >0, and utility a ℓ j ≥0 ...
8
October 2011
FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
We consider the problem of testing if a given function $f : \F_q^n \right arrow \F_q$ is close to a $n$variate degree $d$ polynomial over the finite field $\F_q$ of $q$elements. The natural, lowquery, test for this property would be to pick the smallest dimension $t = t_{q,d}\approx d/q$ such ...
Keywords:
Lowdegree testing, Property Testing, ReedMuller codes
9
June 2010
STOC '10: Proceedings of the fortysecond ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3, Downloads (12 Months): 8, Downloads (Overall): 146
Full text available:
PDF
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for degree three or four polynomials that have a significant bias ...
Keywords:
cubic polynomials, Gowers norm, quartic polynomials

