80 citations · 174 across the 31 of their papers we have counts for
5 papers · 1 filter
Covering Codes using Insertions or Deletions
Andreas Lenz, Cyrus Rashtchian, Paul H. Siegel +1
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the…
Equivalence of Systematic Linear Data Structures and Matrix Rigidity
Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian
Recently, Dvir, Golovnev, and Weinstein have shown that sufficiently strong lower bounds for linear data structures would imply new bounds for rigid matrices. However, their result…
Edge Isoperimetric Inequalities for Powers of the Hypercube
Cyrus Rashtchian, William Raynaud
For positive integers and , we let denote the th power of the -dimensional discrete hypercube graph, i.e., the graph with vertex-set , where two 0-1…
Robustness for Non-Parametric Classification: A Generic Attack and Defense
Yao-Yuan Yang, Cyrus Rashtchian, Yizhen Wang +1
Adversarially robust machine learning has received much recent attention. However, prior attacks and defenses for non-parametric classifiers have been developed in an ad-hoc or cla…
Reconstructing Trees from Traces
Sami Davies, Miklos Z. Racz, Cyrus Rashtchian
We study the problem of learning a node-labeled tree given independent traces from an appropriately defined deletion channel. This problem, tree trace reconstruction, generalizes s…