Search Results - "Apon, Daniel"

The Complexity of Grid Coloring by Apon, Daniel, Gasarch, William, Lawler, Kevin

“…A c -coloring of the grid G N , M = [ N ] × [ M ] is a mapping of G N , M into [ c ] such that no four corners forming a rectangle have the same color. In 2009…”
Get full text

One-round multi-party communication complexity of distinguishing sums by Apon, Daniel, Katz, Jonathan, Malozemoff, Alex J.

“…We consider an instance of the following problem: Parties P1,…,Pk each receive an input xi, and a coordinator (distinct from each of these parties) wishes to…”
Get full text

Frontiers in Lattice Cryptography and Program Obfuscation by Apon, Daniel

“…In this dissertation, we explore the frontiers of theory of cryptography along two lines. In the first direction, we explore Lattice Cryptography, which is the…”
Get full text

On Lower Bound Methods for Tree-like Cutting Plane Proofs by Apon, Daniel

“…In the book Boolean Function Complexity by Stasys Jukna, two lower bound techniques for Tree-like Cutting Plane proofs (henceforth, "Tree-CP proofs") using…”
Get full text

On the Complexity of Grid Coloring by Apon, Daniel Christopher

“…This thesis studies problems at the intersection of Ramsey-theoretic mathematics, computational complexity, and communication complexity. The prototypical…”
Get full text

POPE: Partial Order Preserving Encoding by Roche, Daniel S, Apon, Daniel, Choi, Seung Geol, Yerukhimovich, Arkady

“…Recently there has been much interest in performing search queries over encrypted data to enable functionality while protecting sensitive data. One…”
Get full text

One-Round Multi-Party Communication Complexity of Distinguishing Sums by Apon, Daniel, Katz, Jonathan, Malozemoff, Alex J

“…We consider an instance of the following problem: Parties P_1,..., P_k each receive an input x_i, and a coordinator (distinct from each of these parties)…”
Get full text

An NP-Complete Problem in Grid Coloring by Apon, Daniel, Gasarch, William, Lawler, Kevin

“…A c-coloring of G(n,m)=n x m is a mapping of G(n,m) into {1,...,c} such that no four corners forming a rectangle have the same color. In 2009 a challenge was…”
Get full text