default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHossein Esfandiari
Hossein Efsandiari
Person information
- affiliation: Google Research, New York City, USA
- affiliation (former): Harvard University, Cambridge, USA
- affiliation (former): University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong:
High-Dimensional Geometric Streaming for Nearly Low Rank Data. ICML 2024- [c53]Sara Ahmadian
, MohammadHossein Bateni, Hossein Esfandiari, Silvio Lattanzi, Morteza Monemizadeh, Ashkan Norouzi-Fard:
Resilient k-Clustering. KDD 2024: 29-38 - [c52]MohammadHossein Bateni, Hossein Esfandiari, Samira Hossein Ghorban, Alipasha Montaseri:
Improved Active Covering via Density-Based Space Transformation. KDD 2024: 107-118 - [c51]Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong:
Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond. STOC 2024: 1911-1922 - [c50]Alessandro Epasto, Hossein Esfandiari, Vahab Mirrokni, Andrés Muñoz Medina:
Smooth Anonymity for Sparse Graphs. WWW (Companion Volume) 2024: 621-624 - [i40]Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong:
Optimal Communication for Classic Functions in the Coordinator Model and Beyond. CoRR abs/2403.20307 (2024) - [i39]Hossein Esfandiari, Vahab Mirrokni, Praneeth Kacham, David P. Woodruff, Peilin Zhong:
High-Dimensional Geometric Streaming for Nearly Low Rank Data. CoRR abs/2406.02910 (2024) - 2023
- [j12]Sara Ahmadian, Hossein Esfandiari, Vahab Mirrokni, Binghui Peng:
Robust Load Balancing with Machine Learned Advice. J. Mach. Learn. Res. 24: 44:1-44:46 (2023) - [j11]Mehran Kazemi, Anton Tsitsulin, Hossein Esfandiari, MohammadHossein Bateni, Deepak Ramachandran, Bryan Perozzi, Vahab Mirrokni:
Tackling Provably Hard Representative Selection via Graph Neural Networks. Trans. Mach. Learn. Res. 2023 (2023) - [c49]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Replicable Bandits. ICLR 2023 - [c48]Vasileios Charisopoulos, Hossein Esfandiari, Vahab Mirrokni:
Robust and private stochastic linear bandits. ICML 2023: 4096-4115 - [c47]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. NeurIPS 2023 - [c46]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. SODA 2023: 2677-2727 - [c45]Hossein Esfandiari, Vahab Mirrokni, Peilin Zhong:
Brief Announcement: Streaming Balanced Clustering. SPAA 2023: 311-314 - [i38]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. CoRR abs/2302.10359 (2023) - [i37]MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese:
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. CoRR abs/2303.11843 (2023) - [i36]Vasileios Charisopoulos, Hossein Esfandiari, Vahab Mirrokni:
Robust and differentially private stochastic linear bandits. CoRR abs/2304.11741 (2023) - 2022
- [j10]Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian:
Seeding with Costly Network Information. Oper. Res. 70(4): 2318-2348 (2022) - [c44]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. AISTATS 2022: 7055-7075 - [c43]Shyam Narayanan, Vahab S. Mirrokni, Hossein Esfandiari:
Tight and Robust Private Mean Estimation with Few Users. ICML 2022: 16383-16412 - [c42]Hossein Esfandiari, Vahab Mirrokni, Jon Schneider:
Anonymous Bandits for Multi-User Systems. NeurIPS 2022 - [c41]Sara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng:
Robust Load Balancing with Machine Learned Advice. SODA 2022: 20-34 - [c40]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Almost Tight Approximation Algorithms for Explainable Clustering. SODA 2022: 2641-2663 - [c39]Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets. STOC 2022: 1621-1628 - [c38]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas:
Online Allocation and Display Ads Optimization with Surplus Supply. WINE 2022: 41-59 - [i35]Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Improved Approximations for Euclidean k-means and k-median, via Nested Quasi-Independent Sets. CoRR abs/2204.04828 (2022) - [i34]Seyed Mehran Kazemi, Anton Tsitsulin, Hossein Esfandiari, MohammadHossein Bateni, Deepak Ramachandran, Bryan Perozzi, Vahab S. Mirrokni:
Tackling Provably Hard Representative Selection via Graph Neural Networks. CoRR abs/2205.10403 (2022) - [i33]Hossein Esfandiari, Alessandro Epasto, Vahab S. Mirrokni, Andres Muñoz Medina, Sergei Vassilvitskii:
Smooth Anonymity for Sparse Binary Matrices. CoRR abs/2207.06358 (2022) - [i32]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Reproducible Bandits. CoRR abs/2210.01898 (2022) - [i31]Hossein Esfandiari, Vahab Mirrokni, Jon Schneider:
Anonymous Bandits for Multi-User Systems. CoRR abs/2210.12198 (2022) - 2021
- [j9]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8(3): 13:1-13:25 (2021) - [c37]MohammadHossein Bateni, Hossein Esfandiari, Manuela Fischer, Vahab S. Mirrokni:
Extreme k-Center Clustering. AAAI 2021: 3941-3949 - [c36]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Regret Bounds for Batched Bandits. AAAI 2021: 7340-7348 - [c35]Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong:
Almost Linear Time Density Level Set Estimation via DBSCAN. AAAI 2021: 7349-7357 - [c34]Hossein Esfandiari, Amin Karbasi, Vahab S. Mirrokni:
Adaptivity in Adaptive Submodularity. COLT 2021: 1823-1846 - [c33]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. ESA 2021: 31:1-31:16 - [i30]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Almost Tight Approximation Algorithms for Explainable Clustering. CoRR abs/2107.00774 (2021) - [i29]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. CoRR abs/2107.02139 (2021) - [i28]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas:
Online Allocation and Display Ads Optimization with Surplus Supply. CoRR abs/2107.06980 (2021) - [i27]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. CoRR abs/2110.02159 (2021) - [i26]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Tight and Robust Private Mean Estimation with Few Users. CoRR abs/2110.11876 (2021) - [i25]MohammadHossein Bateni, Hossein Esfandiari, Rajesh Jayaram, Vahab S. Mirrokni:
Optimal Fully Dynamic k-Centers Clustering. CoRR abs/2112.07050 (2021) - 2020
- [j8]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. Proc. VLDB Endow. 13(13): 3588-3602 (2020) - [c32]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. AISTATS 2020: 3717-3727 - [c31]Joey Huchette, Haihao Lu, Hossein Esfandiari, Vahab S. Mirrokni:
Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming. NeurIPS 2020 - [i24]Joey Huchette, Haihao Lu, Hossein Esfandiari, Vahab S. Mirrokni:
Contextual Reserve Price Optimization in Auctions. CoRR abs/2002.08841 (2020) - [i23]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR abs/2009.11552 (2020)
2010 – 2019
- 2019
- [c30]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Online Pandora's Boxes and Bandits. AAAI 2019: 1885-1892 - [c29]Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian:
Seeding with Costly Network Information. EC 2019: 421-422 - [c28]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - [c27]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. ICML 2019: 515-523 - [c26]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni:
Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond. NeurIPS 2019: 10044-10054 - [c25]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [c24]Alessandro Epasto, Hossein Esfandiari, Vahab S. Mirrokni:
On-Device Algorithms for Public-Private Data with Absolute Privacy. WWW 2019: 405-416 - [i22]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Online Pandora's Boxes and Bandits. CoRR abs/1901.10698 (2019) - [i21]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. CoRR abs/1904.13389 (2019) - [i20]Dean Eckles, Hossein Esfandiari, Elchanan Mossel, M. Amin Rahimian:
Seeding with Costly Network Information. CoRR abs/1905.04325 (2019) - [i19]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni:
Massively Parallel Computation via Remote Memory Access. CoRR abs/1905.07533 (2019) - [i18]Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong:
Streaming Balanced Clustering. CoRR abs/1910.00788 (2019) - [i17]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. CoRR abs/1910.03798 (2019) - [i16]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Batched Multi-Armed Bandits with Optimal Regret. CoRR abs/1910.04959 (2019) - [i15]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. CoRR abs/1910.05385 (2019) - [i14]Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni:
Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond. CoRR abs/1910.12414 (2019) - [i13]Hossein Esfandiari, Amin Karbasi, Vahab S. Mirrokni:
Adaptivity in Adaptive Submodularity. CoRR abs/1911.03620 (2019) - 2018
- [j7]Hossein Esfandiari, Guy Kortsarz:
A bounded-risk mechanism for the kidney exchange game. Discret. Appl. Math. 243: 46-53 (2018) - [j6]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Trans. Algorithms 14(4): 48:1-48:23 (2018) - [j5]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. ACM Trans. Economics and Comput. 6(3-4): 14:1-14:23 (2018) - [c23]Hossein Esfandiari, Michael Mitzenmacher:
Metric Sublinear Algorithms via Linear Sampling. FOCS 2018: 11-22 - [c22]Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni:
Parallel and Streaming Algorithms for K-Core Decomposition. ICML 2018: 1396-1405 - [c21]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Optimal Distributed Submodular Optimization via Sketching. KDD 2018: 1138-1147 - [i12]Hossein Esfandiari, Michael Mitzenmacher:
Metric Sublinear Algorithms via Linear Sampling. CoRR abs/1807.09302 (2018) - [i11]Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni:
Parallel and Streaming Algorithms for K-Core Decomposition. CoRR abs/1808.02546 (2018) - 2017
- [b1]Hossein Esfandiari:
Allocations in Large Markets. University of Maryland, College Park, MD, USA, 2017 - [j4]Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica 77(4): 1216-1239 (2017) - [j3]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. SIAM J. Discret. Math. 31(3): 1685-1701 (2017) - [c20]Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Hadi Yami:
Market Pricing for Data Streams. AAAI 2017: 291-297 - [c19]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin:
A Study of Compact Reserve Pricing Languages. AAAI 2017: 363-368 - [c18]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. SPAA 2017: 13-23 - [c17]Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami:
Brief Announcement: Graph Matching in Massive Datasets. SPAA 2017: 133-136 - [c16]Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert D. Kleinberg, Brendan Lucier:
Beating 1-1/e for ordered prophets. STOC 2017: 61-71 - [i10]Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert Kleinberg, Brendan Lucier:
Beating 1-1/e for Ordered Prophets. CoRR abs/1704.05836 (2017) - [i9]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. CoRR abs/1711.05764 (2017) - 2016
- [c15]Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu:
Beating Ratio 0.5 for Weighted Oblivious Matching Problems. ESA 2016: 3:1-3:18 - [c14]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh:
Finding Large Matchings in Semi-Streaming. ICDM Workshops 2016: 608-614 - [c13]Hossein Esfandiari, Guy Kortsarz:
A Bounded-Risk Mechanism for the Kidney Exchange Game. LATIN 2016: 416-428 - [c12]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Bi-Objective Online Matching and Submodular Allocations. NIPS 2016: 2739-2747 - [c11]Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. SODA 2016: 1326-1344 - [c10]Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff:
Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond. SPAA 2016: 397-399 - [i8]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. CoRR abs/1610.08096 (2016) - [i7]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Distributed Coverage Maximization via Sketching. CoRR abs/1612.02327 (2016) - 2015
- [c9]Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, Aravind Srinivasan:
Selling Tomorrow's Bargains Today. AAMAS 2015: 337-345 - [c8]Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. ESA 2015: 483-495 - [c7]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. ESA 2015: 496-508 - [c6]Hossein Efsandiari, Guy Kortsarz:
Brief Announcement: New Mechanisms for Pairwise Kidney Exchange. SAGT 2015: 303-304 - [c5]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. EC 2015: 169-186 - [c4]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. SODA 2015: 1217-1233 - [c3]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh:
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond. SPAA 2015: 56-58 - [i6]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Dynamic Graph Streams. CoRR abs/1505.01731 (2015) - [i5]Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands. CoRR abs/1506.03760 (2015) - [i4]Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff:
Applications of Uniform Sampling: Densest Subgraph and Beyond. CoRR abs/1506.04505 (2015) - [i3]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. CoRR abs/1507.00748 (2015) - [i2]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. CoRR abs/1507.01155 (2015) - [i1]Hossein Esfandiari, Guy Kortsarz:
Low-Risk Mechanisms for the Kidney Exchange Game. CoRR abs/1507.02746 (2015) - 2014
- [j2]Saieed Akbari, Hossein Esfandiari, E. Barzegary, Saeed Seddighin:
Some bounds for the signed edge domination number of a graph. Australas. J Comb. 58: 60-66 (2014) - [j1]Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi:
On the Erdös-Gyárfás conjecture in claw-free graphs. Discuss. Math. Graph Theory 34(3): 635-640 (2014) - [c2]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke:
Online Stochastic Reordering Buffer Scheduling. ICALP (1) 2014: 465-476 - [c1]Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). IPEC 2014: 159-171
Coauthor Index
Mohammad Hossein Bateni 0001
aka: MohammadHossein Bateni
aka: MohammadHossein Bateni
Vahab S. Mirrokni
aka: Vahab Mirrokni
aka: Vahab Mirrokni
[c54] [c51] [c50] [i40] [i39] [j12] [j11] [c49] [c48] [c47] [c46] [c45] [i38] [i37] [i36] [c44] [c43] [c42] [c41] [c40] [c39] [i35] [i34] [i33] [i32] [i31] [j9] [c37] [c36] [c35] [c34] [c33] [i30] [i29] [i27] [i26] [i25] [j8] [c31] [i24] [i23] [c28] [c27] [c26] [c25] [c24] [i21] [i19] [i18] [i16] [i15] [i14] [i13] [j5] [c22] [c21] [i11] [c19] [c18] [i9] [c12] [i8] [i7] [c5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
