Sepehr Assadi Free People Check 

( I'm Sepehr Assadi)

Loading...

Images of Sepehr Assadi

(0 from 0 )

News

[Theory Seminar] Sepehr Assadi | Johns Hopkins Algorithms and...

www.cs.jhu.edu
How well a sub-linear space algorithm can estimate the size of a largest matching in a graph or the rank of a given matrix, if the input is ...

On the Single-Pass Streaming Complexity of the Set Cover Problem -...

memento.epfl.ch
This is based on a joint work with Sepehr Assadi (Penn) and Yang Li (Penn). Bio: Sanjeev Khanna is a Henry Salvatori Professor of Computer ...

Sanjeev Khanna | Johns Hopkins Algorithms and Complexity

www.cs.jhu.edu
... $n^{2-3\eps -o(1)}$ bits. This is based on joint work with Sepehr Assadi, Yang Li, and Grigory Yaroslavtsev. This entry was posted on June 2, by mdinitz.
Save as document
+1