| Tight bounds for lp samplers, finding duplicates in streams, and related problems H Jowhari, M Sağlam, G Tardos Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2011 | 217 | 2011 |
| New streaming algorithms for counting triangles in graphs H Jowhari, M Ghodsi Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005 | 191 | 2005 |
| The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs G Cormode, H Jowhari, M Monemizadeh, S Muthukrishnan arXiv preprint arXiv:1608.03118, 2016 | 46 | 2016 |
| On distance to monotonicity and longest increasing subsequence of a data stream F Ergun, H Jowhari Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 46 | 2008 |
| Periodicity in streams F Ergun, H Jowhari, M Sağlam International Workshop on Randomization and Approximation Techniques in …, 2010 | 45 | 2010 |
| A second look at counting triangles in graph streams (corrected) G Cormode, H Jowhari Theoretical Computer Science 683, 22-30, 2017 | 32 | 2017 |
| Efficient communication protocols for deciding edit distance H Jowhari European Symposium on Algorithms, 648-658, 2012 | 31 | 2012 |
| A second look at counting triangles in graph streams G Cormode, H Jowhari Theoretical Computer Science 552, 44-51, 2014 | 23 | 2014 |
| On completing latin squares I Hajirasouliha, H Jowhari, R Kumar, R Sundaram Annual Symposium on Theoretical Aspects of Computer Science, 524-535, 2007 | 23 | 2007 |
| Lp Samplers and Their Applications: A Survey G Cormode, H Jowhari ACM Computing Surveys (CSUR) 52 (1), 1-31, 2019 | 18 | 2019 |
| On the monotonicity of a data stream F Ergun, H Jowhari Combinatorica 35 (6), 641-653, 2015 | 8 | 2015 |
| An estimator for matching size in low arboricity graphs with two applications H Jowhari Journal of Combinatorial Optimization 45 (1), 21, 2023 | 2 | 2023 |
| Monochromatic partitioning of colored points by lines H Jowhari, M Rezapour Information Processing Letters 182, 106402, 2023 | | 2023 |
| Airports and Railways with Unsplittable Demand H Jowhari, S Nematollahi Available at SSRN 4603134, 2023 | | 2023 |
| A Hall-type theorem with algorithmic consequences in planar graphs H Jowhari arXiv preprint arXiv:2304.05859, 2023 | | 2023 |
| Corrigendum to “A second look at counting triangles in graph streams”[Theoret. Comput. Sci. 552 (2014) 44–51] G Cormode, H Jowhari Theoretical Computer Science 100 (683), 31-32, 2017 | | 2017 |
| Measuring trends and repetitions in data streams H Jowhari Simon Fraser University, 2012 | | 2012 |
| IMPROVED SMALL MOLECULE ACTIVITY DETERMINATION VIA CENTROID NEAREST NEIGHBORS CLASSIFICATION P Dao, F Hormozdiari, H Jowhari, SC Sahinalp, K Byler, A Cherkasov, ... | | |
Graham CormodeMeta AI, University of WarwickVerified email at warwick.ac.uk
