Morteza Monemizadeh 个人学术档案

引用次数

	总计	2019 年至今
引用	1316	778
h 指数	16	14
i10 指数	20	17

160

120

2007200820092010201120122013201420152016201720182019202020212022202320245 8 12 16 29 22 14 25 59 78 118 142 125 133 135 153 133 97

开放获取的出版物数量

查看全部

18 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park在 cs.umd.edu 的电子邮件经过验证
Christian SohlerProfessor for Algorithmic Data Analysis, University of Cologne在 uni-koeln.de 的电子邮件经过验证
Hossein EsfandiariSenior Research Scientist at Google在 seas.harvard.edu 的电子邮件经过验证
Graham CormodeMeta AI, University of Warwick在 warwick.ac.uk 的电子邮件经过验证
Rajesh ChitnisUniversity of Birmingham在 bham.ac.uk 的电子邮件经过验证
David WoodruffProfessor of Computer Science, Carnegie Mellon University在 cs.cmu.edu 的电子邮件经过验证
Dan FeldmanUniversity of Haifa在 csail.mit.edu 的电子邮件经过验证
Andrew McGregorUniversity of Massachusetts, Amherst在 cs.umass.edu 的电子邮件经过验证
Vahid LiaghatDepartment of Management Science & Engineering, Stanford University在 stanford.edu 的电子邮件经过验证
Vladimir BravermanVictor E. Cameron Professor of Computer Science, Rice University在 rice.edu 的电子邮件经过验证
Keith D. LevinAssistant Professor, University of Wisconsin-Madison在 wisc.edu 的电子邮件经过验证
Artur CzumajProfessor of Computer Science, University of Warwick, UK在 warwick.ac.uk 的电子邮件经过验证
S MuthukrishnanRutgers Univ在 cs.rutgers.edu 的电子邮件经过验证
Elena GrigorescuPurdue University在 purdue.edu 的电子邮件经过验证
Hossein JowhariAssistant Professor, K. N. Toosi University of Technology在 sfu.ca 的电子邮件经过验证
Pan Peng (彭攀)University of Science and Technology of China在 ustc.edu.cn 的电子邮件经过验证
Marc Bury (né Gillé)Universität Dortmund在 tu-dortmund.de 的电子邮件经过验证
Chris SchwiegelshohnAarhus University在 cs.au.dk 的电子邮件经过验证
Hamid Sarbazi-AzadProfessor of Computer Science and Engineering, Sharif University of Technology & IPM在 sharif.edu 的电子邮件经过验证
Priya GovindanAmazon在 cs.rutgers.edu 的电子邮件经过验证

关注

Morteza Monemizadeh

Assistant Professor at Eindhoven University of Technology, the Netherlands

在 tue.nl 的电子邮件经过验证 - 首页

Machine Learning and Massive Data


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
A PTAS for k-means clustering based on weak coresets D Feldman, M Monemizadeh, C Sohler Proceedings of the twenty-third annual symposium on Computational geometry …, 2007	226	2007
1-Pass Relative-Error L_p-Sampling with Applications M Monemizadeh, DP Woodruff Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	147	2010
Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, A McGregor, ... Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	144	2016
Prophet secretary H Esfandiari, MT Hajiaghayi, V Liaghat, M Monemizadeh SIAM Journal on Discrete Mathematics 31 (3), 1685-1701, 2017	122	2017
Coresets and sketches for high dimensional subspace approximation problems D Feldman, M Monemizadeh, C Sohler, DP Woodruff Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	118	2010
Streaming algorithms for estimating the matching size in planar graphs and beyond H Esfandiari, M Hajiaghayi, V Liaghat, M Monemizadeh, K Onak ACM Transactions on Algorithms (TALG) 14 (4), 1-23, 2018	109	2018
Parameterized streaming: Maximal matching and vertex cover R Chitnis, G Cormode, MT Hajiaghayi, M Monemizadeh Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014	79	2014
Clustering problems on sliding windows V Braverman, H Lang, K Levin, M Monemizadeh Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	48	2016
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
Finding large matchings in semi-streaming H Esfandiari, MT Hajiaghayi, M Monemizadeh 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW …, 2016	36	2016
Planar graphs: Random walks and bipartiteness testing A Czumaj, M Monemizadeh, K Onak, C Sohler 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 423-432, 2011	26	2011
Testable bounded degree graph properties are random order streamable M Monemizadeh, S Muthukrishnan, P Peng, C Sohler arXiv preprint arXiv:1707.07334, 2017	22	2017
Dynamic submodular maximization M Monemizadeh Advances in Neural Information Processing Systems 33, 9806-9817, 2020	20	2020
Structural results on matching estimation with applications to streaming M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ... Algorithmica 81, 367-392, 2019	20	2019
New Streaming Algorithms for Parameterized Maximal Matching & Beyond R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, M Monemizadeh Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015	19	2015
The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors M Monemizadeh, H Sarbazi-Azad Proceedings of the 2005 ACM symposium on Applied computing, 729-733, 2005	19	2005
Streaming weighted matchings: Optimal meets greedy E Grigorescu, M Monemizadeh, S Zhou arXiv preprint arXiv:1608.01487 4, 2016	16	2016
Clustering on sliding windows in polylogarithmic space V Braverman, H Lang, K Levin, M Monemizadeh 35th IARCS Annual Conference on Foundations of Software Technology and …, 2015	15	2015
Clique-based separators for geometric intersection graphs M de Berg, S Kisfaludi-Bak, M Monemizadeh, L Theocharous Algorithmica 85 (6), 1652-1678, 2023	14	2023
Planar graphs: Random walks and bipartiteness testing A Czumaj, M Monemizadeh, K Onak, C Sohler Random Structures & Algorithms 55 (1), 104-124, 2019	11	2019

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用