default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVahab S. Mirrokni
Vahab Mirrokni – Seyed Vahab Mirrokni
Person information
- affiliation: Google Research, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-Bidding and Auctions in Online Advertising: A Survey. SIGecom Exch. 22(1): 159-183 (2024)- [c232]Gene Li, Lin Chen, Adel Javanmard, Vahab Mirrokni:
Optimistic Rates for Learning from Label Proportions. COLT 2024: 3437-3474 - [c231]Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract). HOPC@SPAA 2024 - [c230]Insu Han, Rajesh Jayaram, Amin Karbasi, Vahab Mirrokni, David P. Woodruff, Amir Zandieh
:
HyperAttention: Long-context Attention in Near-Linear Time. ICLR 2024 - [c229]Adel Javanmard, Lin Chen, Vahab Mirrokni, Ashwinkumar Badanidiyuru, Gang Fu:
Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions. ICLR 2024 - [c228]Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder:
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. ICML 2024 - [c227]Santiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
A Field Guide for Pacing Budget and ROS Constraints. ICML 2024 - [c226]Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Vahab Mirrokni, Peilin Zhong:
Perturb-and-Project: Differentially Private Similarities and Marginals. ICML 2024 - [c225]Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong:
High-Dimensional Geometric Streaming for Nearly Low Rank Data. ICML 2024 - [c224]Adel Javanmard, Matthew Fahrbach, Vahab Mirrokni:
PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses. ICML 2024 - [c223]Praneeth Kacham, Vahab Mirrokni, Peilin Zhong:
PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels. ICML 2024 - [c222]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab Mirrokni, Song Zuo:
Optimal Mechanisms for a Value Maximizer: The Futility of Screening Targets. EC 2024: 1101 - [c221]Rajesh Jayaram, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong:
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree. SODA 2024: 3960-3996 - [c220]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 - [c219]Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Efficiency of the Generalized Second-Price Auction for Value Maximizers. WWW 2024: 46-56 - [c218]Paul Dütting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu, Song Zuo:
Mechanism Design for Large Language Models. WWW 2024: 144-155 - [c217]Yuan Deng, Jieming Mao, Vahab Mirrokni, Yifeng Teng, Song Zuo:
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. WWW 2024: 256-266 - [c216]Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab Mirrokni:
Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice. WWW 2024: 267-275 - [c215]Alessandro Epasto, Hossein Esfandiari, Vahab Mirrokni, Andrés Muñoz Medina:
Smooth Anonymity for Sparse Graphs. WWW (Companion Volume) 2024: 621-624 - [i132]Adel Javanmard, Lin Chen, Vahab Mirrokni, Ashwinkumar Badanidiyuru, Gang Fu:
Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions. CoRR abs/2401.11081 (2024) - [i131]Adel Javanmard, Matthew Fahrbach, Vahab Mirrokni:
PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses. CoRR abs/2402.04987 (2024) - [i130]Amir Zandieh, Insu Han, Vahab Mirrokni, Amin Karbasi:
SubGen: Token Generation in Sublinear Time and Memory. CoRR abs/2402.06082 (2024) - [i129]Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder:
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. CoRR abs/2402.17327 (2024) - [i128]Taisuke Yasuda, Kyriakos Axiotis, Gang Fu, MohammadHossein Bateni, Vahab Mirrokni:
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization. CoRR abs/2402.17902 (2024) - [i127]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) - [i126]Clayton Sanford, Bahare Fatemi, Ethan Hall, Anton Tsitsulin, Seyed Mehran Kazemi, Jonathan Halcrow, Bryan Perozzi, Vahab Mirrokni:
Understanding Transformer Reasoning Capabilities via Graph Algorithms. CoRR abs/2405.18512 (2024) - [i125]Laxman Dhulipala, Majid Hadian, Rajesh Jayaram, Jason Lee, Vahab Mirrokni:
MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings. CoRR abs/2405.19504 (2024) - [i124]Gene Li, Lin Chen, Adel Javanmard, Vahab Mirrokni:
Optimistic Rates for Learning from Label Proportions. CoRR abs/2406.00487 (2024) - [i123]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) - [i122]Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Vahab Mirrokni, Peilin Zhong:
Perturb-and-Project: Differentially Private Similarities and Marginals. CoRR abs/2406.04868 (2024) - [i121]Rudrajit Das, Inderjit S. Dhillon, Alessandro Epasto, Adel Javanmard, Jieming Mao, Vahab Mirrokni, Sujay Sanghavi, Peilin Zhong:
Retraining with Predicted Hard Labels Provably Increases Model Accuracy. CoRR abs/2406.11206 (2024) - [i120]Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong:
Massively Parallel Minimum Spanning Tree in General Metric Spaces. CoRR abs/2408.06455 (2024) - [i119]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - [i118]Xinwei Zhang, Zhiqi Bu, Borja Balle, Mingyi Hong, Meisam Razaviyayn, Vahab Mirrokni:
DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reduction. CoRR abs/2410.03883 (2024) - [i117]Zeman Li, Xinwei Zhang, Peilin Zhong, Yuan Deng, Meisam Razaviyayn, Vahab Mirrokni:
Addax: Utilizing Zeroth-Order Gradients to Improve Memory Efficiency and Performance of SGD for Fine-Tuning Language Models. CoRR abs/2410.06441 (2024) - 2023
- [j68]Santiago R. Balseiro, Haihao Lu, Vahab Mirrokni:
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems. Oper. Res. 71(1): 101-119 (2023) - [j67]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) - [j66]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. Math. Oper. Res. 48(3): 1607-1629 (2023) - [j65]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab Mirrokni:
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization. Math. Program. 201(1): 373-407 (2023) - [j64]CJ Carey, Travis Dick, Alessandro Epasto, Adel Javanmard, Josh Karlin, Shankar Kumar, Andres Muñoz Medina, Vahab Mirrokni, Gabriel Henrique Nunes, Sergei Vassilvitskii, Peilin Zhong:
Measuring Re-identification Risk. Proc. ACM Manag. Data 1(2): 149:1-149:26 (2023) - [j63]Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. Proc. ACM Manag. Data 1(3): 221:1-221:27 (2023) - [j62]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) - [c214]Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab Mirrokni:
Pricing against a Budget and ROI Constrained Buyer. AISTATS 2023: 9282-9307 - [c213]Taisuke Yasuda, Mohammad Hossein Bateni, Lin Chen, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Sequential Attention for Feature Selection. ICLR 2023 - [c212]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Replicable Bandits. ICLR 2023 - [c211]Santiago R. Balseiro, Rachitesh Kumar, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Robust Budget Pacing with a Single Sample. ICML 2023: 1636-1659 - [c210]Vasileios Charisopoulos, Hossein Esfandiari, Vahab Mirrokni:
Robust and private stochastic linear bandits. ICML 2023: 4096-4115 - [c209]Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab Mirrokni:
Multi-channel Autobidding with Budget and ROI Constraints. ICML 2023: 7617-7644 - [c208]Matthew Fahrbach, Adel Javanmard, Vahab Mirrokni, Pratik Worah:
Learning Rate Schedules in the Presence of Distribution Shift. ICML 2023: 9523-9546 - [c207]Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Approximately Optimal Core Shapes for Tensor Decompositions. ICML 2023: 11237-11254 - [c206]Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni:
Differentially Private Hierarchical Clustering with Provable Approximation Guarantees. ICML 2023: 14353-14375 - [c205]Alessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong:
Differentially Private Continual Releases of Streaming Frequency Moment Estimations. ITCS 2023: 48:1-48:24 - [c204]Alessandro Epasto, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong:
k-Means Clustering with Distance-Based Privacy. NeurIPS 2023 - [c203]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. NeurIPS 2023 - [c202]Adel Javanmard, Vahab Mirrokni:
Anonymous Learning via Look-Alike Clustering: A Precise Analysis of Model Generalization. NeurIPS 2023 - [c201]Evan Munro, David Jones, Jennifer Brennan, Roland Nelet, Vahab Mirrokni, Jean Pouget-Abadie:
Causal Estimation of User Learning in Personalized Systems. EC 2023: 992-1016 - [c200]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 - [c199]Hossein Esfandiari, Vahab Mirrokni, Peilin Zhong:
Brief Announcement: Streaming Balanced Clustering. SPAA 2023: 311-314 - [c198]Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Autobidding Auctions in the Presence of User Costs. WWW 2023: 3428-3435 - [i116]Alessandro Epasto, Jieming Mao, Andres Muñoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, Peilin Zhong:
Differentially Private Continual Releases of Streaming Frequency Moment Estimations. CoRR abs/2301.05605 (2023) - [i115]Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni:
Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees. CoRR abs/2302.00037 (2023) - [i114]Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Autobidding Auctions in the Presence of User Costs. CoRR abs/2302.00377 (2023) - [i113]Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab Mirrokni:
Multi-channel Autobidding with Budget and ROI Constraints. CoRR abs/2302.01523 (2023) - [i112]Santiago R. Balseiro, Rachitesh Kumar, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Robust Budget Pacing with a Single Sample. CoRR abs/2302.02006 (2023) - [i111]Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Approximately Optimal Core Shapes for Tensor Decompositions. CoRR abs/2302.03886 (2023) - [i110]Santiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Joint Feedback Loop for Spend and Return-On-Spend Constraints. CoRR abs/2302.08530 (2023) - [i109]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. CoRR abs/2302.10359 (2023) - [i108]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) - [i107]Matthew Fahrbach, Adel Javanmard, Vahab Mirrokni, Pratik Worah:
Learning Rate Schedules in the Presence of Distribution Shift. CoRR abs/2303.15634 (2023) - [i106]CJ Carey, Travis Dick, Alessandro Epasto, Adel Javanmard, Josh Karlin, Shankar Kumar, Andrés Muñoz Medina, Vahab Mirrokni, Gabriel Henrique Nunes, Sergei Vassilvitskii, Peilin Zhong:
Measuring Re-identification Risk. CoRR abs/2304.07210 (2023) - [i105]Vasileios Charisopoulos, Hossein Esfandiari, Vahab Mirrokni:
Robust and differentially private stochastic linear bandits. CoRR abs/2304.11741 (2023) - [i104]Lin Chen, Gang Fu, Amin Karbasi, Vahab Mirrokni:
Learning from Aggregated Data: Curated Bags versus Random Bags. CoRR abs/2305.09557 (2023) - [i103]Yangsibo Huang, Haotian Jiang, Daogao Liu, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni:
Learning across Data Owners with Joint Differential Privacy. CoRR abs/2305.15723 (2023) - [i102]Evan Munro, David Jones, Jennifer Brennan, Roland Nelet, Vahab Mirrokni, Jean Pouget-Abadie:
Causal Estimation of User Learning in Personalized Systems. CoRR abs/2306.00485 (2023) - [i101]Rajesh Jayaram, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong:
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree. CoRR abs/2308.00503 (2023) - [i100]Adel Javanmard, Vahab Mirrokni, Jean Pouget-Abadie:
Causal Inference with Differentially Private (Clustered) Outcomes. CoRR abs/2308.00957 (2023) - [i99]Laxman Dhulipala, Jason Lee, Jakub Lacki, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. CoRR abs/2308.03578 (2023) - [i98]Praneeth Kacham, Vahab Mirrokni, Peilin Zhong:
PolySketchFormer: Fast Transformers via Sketches for Polynomial Kernels. CoRR abs/2310.01655 (2023) - [i97]Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Efficiency of the Generalized Second-Price Auction for Value Maximizers. CoRR abs/2310.03105 (2023) - [i96]Adel Javanmard, Vahab Mirrokni:
Anonymous Learning via Look-Alike Clustering: A Precise Analysis of Model Generalization. CoRR abs/2310.04015 (2023) - [i95]Insu Han, Rajesh Jayaram, Amin Karbasi, Vahab Mirrokni, David P. Woodruff, Amir Zandieh:
HyperAttention: Long-context Attention in Near-Linear Time. CoRR abs/2310.05869 (2023) - [i94]Paul Duetting, Vahab Mirrokni, Renato Paes Leme, Haifeng Xu, Song Zuo:
Mechanism Design for Large Language Models. CoRR abs/2310.10826 (2023) - [i93]Yuan Deng, Jieming Mao, Vahab Mirrokni, Yifeng Teng, Song Zuo:
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. CoRR abs/2311.10679 (2023) - 2022
- [j61]MohammadHossein Bateni, Yiwei Chen, Dragos Florin Ciocan, Vahab S. Mirrokni:
Fair Resource Allocation in a Volatile Marketplace. Oper. Res. 70(1): 288-308 (2022) - [j60]Santiago R. Balseiro, Vahab Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Double Auctions: Toward First Best. Oper. Res. 70(4): 2299-2317 (2022) - [j59]Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab Mirrokni:
Product Ranking on Online Platforms. Manag. Sci. 68(6): 4024-4041 (2022) - [c197]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. AISTATS 2022: 7055-7075 - [c196]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. ALT 2022: 465-487 - [c195]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. COLT 2022: 4643-4702 - [c194]Vincent Cohen-Addad, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel k-Means Clustering for Perturbation Resilient Instances. ICML 2022: 4180-4201 - [c193]Shyam Narayanan, Vahab S. Mirrokni, Hossein Esfandiari:
Tight and Robust Private Mean Estimation with Few Users. ICML 2022: 16383-16412 - [c192]Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Andres Muñoz Medina, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii:
Scalable Differentially Private Clustering via Hierarchically Separated Trees. KDD 2022: 221-230 - [c191]Jennifer Brennan, Vahab Mirrokni, Jean Pouget-Abadie:
Cluster Randomized Designs for One-Sided Bipartite Experiments. NeurIPS 2022 - [c190]CJ Carey, Jonathan Halcrow, Rajesh Jayaram, Vahab Mirrokni, Warren Schudy, Peilin Zhong:
Stars: Tera-Scale Graph Building for Clustering and Learning. NeurIPS 2022 - [c189]Vincent Cohen-Addad, Alessandro Epasto, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong:
Near-Optimal Private and Scalable $k$-Clustering. NeurIPS 2022 - [c188]Yuan Deng, Vahab Mirrokni, Hanrui Zhang:
Posted Pricing and Dynamic Prior-independent Mechanisms with Value Maximizers. NeurIPS 2022 - [c187]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. NeurIPS 2022 - [c186]Alessandro Epasto, Vahab Mirrokni, Bryan Perozzi, Anton Tsitsulin, Peilin Zhong:
Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank. NeurIPS 2022 - [c185]Hossein Esfandiari, Vahab Mirrokni, Jon Schneider:
Anonymous Bandits for Multi-User Systems. NeurIPS 2022 - [c184]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Optimal Mechanisms for Value Maximizers with Budget Constraints via Target Clipping. EC 2022: 475 - [c183]Christopher Harshaw, Fredrik Sävje, David Eisenstat, Vahab Mirrokni, Jean Pouget-Abadie:
Design and Analysis of Bipartite Experiments Under a Linear Exposure-response Model. EC 2022: 606 - [c182]Sara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng:
Robust Load Balancing with Machine Learned Advice. SODA 2022: 20-34 - [c181]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. SODA 2022: 1613-1660 - [c180]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Almost Tight Approximation Algorithms for Explainable Clustering. SODA 2022: 2641-2663 - [c179]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. SODA 2022: 3005-3042 - [c178]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 - [i92]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni, Balasubramanian Sivan:
From Online Optimization to PID Controllers: Mirror Descent with Momentum. CoRR abs/2202.06152 (2022) - [i91]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) - [i90]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) - [i89]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. CoRR abs/2206.07554 (2022) - [i88]Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab S. Mirrokni, Andres Muñoz Medina, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii:
Scalable Differentially Private Clustering via Hierarchically Separated Trees. CoRR abs/2206.08646 (2022) - [i87]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. CoRR abs/2206.11654 (2022) - [i86]Oleksandr Ferludin, Arno Eigenwillig, Martin Blais, Dustin Zelle, Jan Pfeifer, Alvaro Sanchez-Gonzalez, Wai Lok Sibon Li, Sami Abu-El-Haija, Peter W. Battaglia, Neslihan Bulut, Jonathan Halcrow, Filipe Miguel Gonçalves de Almeida, Silvio Lattanzi, André Linhares, Brandon A. Mayer, Vahab S. Mirrokni, John Palowitch, Mihir Paradkar, Jennifer She, Anton Tsitsulin, Kevin Villela, Lisa Wang, David Wong, Bryan Perozzi:
TF-GNN: Graph Neural Networks in TensorFlow. CoRR abs/2207.03522 (2022) - [i85]Hossein Esfandiari, Alessandro Epasto, Vahab S. Mirrokni, Andres Muñoz Medina, Sergei Vassilvitskii:
Smooth Anonymity for Sparse Binary Matrices. CoRR abs/2207.06358 (2022) - [i84]Alessandro Epasto, Vahab Mirrokni, Bryan Perozzi, Anton Tsitsulin, Peilin Zhong:
Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank. CoRR abs/2207.06944 (2022) - [i83]Yuan Deng, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Efficiency of the First-Price Auction in the Autobidding World. CoRR abs/2208.10650 (2022) - [i82]Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab Mirrokni:
Fairness in the Autobidding World with Machine-learned Advice. CoRR abs/2209.04748 (2022) - [i81]MohammadHossein Bateni, Lin Chen, Matthew Fahrbach, Gang Fu, Vahab Mirrokni, Taisuke Yasuda:
Sequential Attention for Feature Selection. CoRR abs/2209.14881 (2022) - [i80]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Reproducible Bandits. CoRR abs/2210.01898 (2022) - [i79]Hossein Esfandiari, Vahab Mirrokni, Jon Schneider:
Anonymous Bandits for Multi-User Systems. CoRR abs/2210.12198 (2022) - [i78]CJ Carey, Jonathan Halcrow, Rajesh Jayaram, Vahab Mirrokni, Warren Schudy, Peilin Zhong:
Stars: Tera-Scale Graph Building for Clustering and Graph Learning. CoRR abs/2212.02635 (2022) - [i77]Jakub Lacki, Vahab Mirrokni, Christian Sohler:
Constant Approximation for Normalized Modularity and Associations Clustering. CoRR abs/2212.14334 (2022) - 2021
- [j58]Negin Golrezaei, Adel Javanmard, Vahab S. Mirrokni:
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions. Oper. Res. 69(1): 297-314 (2021) - [j57]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Management Strategies in Repeated Auctions. Oper. Res. 69(3): 859-876 (2021) - [j56]Anthony Kim, Vahab S. Mirrokni, Hamid Nazerzadeh:
Deals or No Deals: Contract Design for Online Advertising. Oper. Res. 69(5): 1450-1467 (2021) - [j55]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. 14(11): 2305-2313 (2021) - [j54]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) - [c177]MohammadHossein Bateni, Hossein Esfandiari, Manuela Fischer, Vahab S. Mirrokni:
Extreme k-Center Clustering. AAAI 2021: 3941-3949 - [c176]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Regret Bounds for Batched Bandits. AAAI 2021: 7340-7348 - [c175]Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong:
Almost Linear Time Density Level Set Estimation via DBSCAN. AAAI 2021: 7349-7357 - [c174]Hossein Esfandiari, Amin Karbasi, Vahab S. Mirrokni:
Adaptivity in Adaptive Submodularity. COLT 2021: 1823-1846 - [c173]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. ESA 2021: 31:1-31:16 - [c172]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Regularized Online Allocation Problems: Fairness and Beyond. ICML 2021: 630-639 - [c171]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni, Song Zuo:
Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing. ICML 2021: 2601-2610 - [c170]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML 2021: 2676-2686 - [c169]Negin Golrezaei, Max Lin, Vahab S. Mirrokni, Hamid Nazerzadeh:
Boosted Second Price Auctions: Revenue Optimization for Heterogeneous Bidders. KDD 2021: 447-457 - [c168]Alessandro Epasto, Andrés Muñoz Medina, Steven Avery, Yijian Bai, Róbert Busa-Fekete, CJ Carey, Ya Gao, David Guthrie, Subham Ghosh, James Ioannidis, Junyi Jiao, Jakub Lacki, Jason Lee, Arne Mauser, Brian Milch, Vahab S. Mirrokni, Deepak Ravichandran, Wei Shi, Max Spero, Yunting Sun, Umar Syed, Sergei Vassilvitskii, Shuo Wang:
Clustering for Private Interest-based Advertising. KDD 2021: 2802-2810 - [c167]Nick Doudchenko, Khashayar Khosravi, Jean Pouget-Abadie, Sébastien Lahaie, Miles Lubin, Vahab S. Mirrokni, Jann Spiess, Guido Imbens:
Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls. NeurIPS 2021: 8691-8701 - [c166]Amin Karbasi, Vahab S. Mirrokni, Mohammad Shadravan:
Parallelizing Thompson Sampling. NeurIPS 2021: 10535-10548 - [c165]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. NeurIPS 2021: 17777-17788 - [c164]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated First Price Auctions. EC 2021: 4 - [c163]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
The Landscape of Auto-bidding Auctions: Value versus Utility Maximization. EC 2021: 132-133 - [c162]Yuan Deng, Vahab S. Mirrokni, Song Zuo:
Non-Clairvoyant Dynamic Mechanism Design with Budget Constraints and Beyond. EC 2021: 369 - [c161]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Non-Excludable Dynamic Mechanism Design. SODA 2021: 1357-1373 - [c160]Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Towards Efficient Auctions in an Auto-bidding World. WWW 2021: 3965-3973 - [i76]Quanquan Gu, Amin Karbasi, Khashayar Khosravi, Vahab S. Mirrokni, Dongruo Zhou:
Batched Neural Bandits. CoRR abs/2102.13028 (2021) - [i75]Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Towards Efficient Auctions in an Auto-bidding World. CoRR abs/2103.13356 (2021) - [i74]Amin Karbasi, Vahab S. Mirrokni, Mohammad Shadravan:
Parallelizing Thompson Sampling. CoRR abs/2106.01420 (2021) - [i73]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. CoRR abs/2106.02685 (2021) - [i72]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR abs/2106.05610 (2021) - [i71]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Almost Tight Approximation Algorithms for Explainable Clustering. CoRR abs/2107.00774 (2021) - [i70]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. CoRR abs/2107.02139 (2021) - [i69]Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, Vahab S. Mirrokni:
Bidding and Pricing in Budget and ROI Constrained Markets. CoRR abs/2107.07725 (2021) - [i68]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. CoRR abs/2108.01731 (2021) - [i67]Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii:
Label differential privacy via clustering. CoRR abs/2110.02159 (2021) - [i66]Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan:
Tight and Robust Private Mean Estimation with Few Users. CoRR abs/2110.11876 (2021) - [i65]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. CoRR abs/2110.15533 (2021) - [i64]Santiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo:
Robust Auction Design in the Auto-bidding World. CoRR abs/2111.02468 (2021) - [i63]MohammadHossein Bateni, Hossein Esfandiari, Rajesh Jayaram, Vahab S. Mirrokni:
Optimal Fully Dynamic k-Centers Clustering. CoRR abs/2112.07050 (2021) - 2020
- [j53]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching auctions with online supply. Games Econ. Behav. 123: 342-358 (2020) - [j52]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) - [c159]Haihao Lu, Sai Praneeth Karimireddy, Natalia Ponomareva, Vahab S. Mirrokni:
Accelerating Gradient Boosting Machines. AISTATS 2020: 516-526 - [c158]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Dual Mirror Descent for Online Allocation Problems. ICML 2020: 613-628 - [c157]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni:
Robust Pricing in Dynamic Mechanism Design. ICML 2020: 2494-2503 - [c156]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with Adversarial Scaling. ICML 2020: 6511-6521 - [c155]Alessandro Epasto, Mohammad Mahdian, Jieming Mao, Vahab S. Mirrokni, Lijie Ren:
Smoothly Bounding User Contributions in Differential Privacy. NeurIPS 2020 - [c154]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Emmanouil Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. NeurIPS 2020 - [c153]Joey Huchette, Haihao Lu, Hossein Esfandiari, Vahab S. Mirrokni:
Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming. NeurIPS 2020 - [c152]Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab S. Mirrokni:
Product Ranking on Online Platforms. EC 2020: 459 - [c151]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Constrained Incentive Compatibility for Stationary Mechanisms. EC 2020: 607-608 - [c150]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time. SODA 2020: 2492-2508 - [c149]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni, Song Zuo:
A Data-Driven Metric of Incentive Compatibility. WWW 2020: 1796-1806 - [i62]Joey Huchette, Haihao Lu, Hossein Esfandiari, Vahab S. Mirrokni:
Contextual Reserve Price Optimization in Auctions. CoRR abs/2002.08841 (2020) - [i61]Negin Golrezaei, Adel Javanmard, Vahab S. Mirrokni:
Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions. CoRR abs/2002.11137 (2020) - [i60]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with adversarial scaling. CoRR abs/2003.02287 (2020) - [i59]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
The Landscape of Nonconvex-Nonconcave Minimax Optimization. CoRR abs/2006.08667 (2020) - [i58]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
Regularized Online Allocation Problems: Fairness and Beyond. CoRR abs/2007.00514 (2020) - [i57]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) - [i56]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. CoRR abs/2010.10628 (2020) - [i55]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Manolis Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. CoRR abs/2010.11450 (2020) - [i54]Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni:
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems. CoRR abs/2011.10124 (2020)
2010 – 2019
- 2019
- [j51]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. Algorithms 12(8): 162 (2019) - [j50]Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Overcommitment in Cloud Services: Bin Packing with Chance Constraints. Manag. Sci. 65(7): 3255-3271 (2019) - [j49]Arash Asadpour, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. Manag. Sci. 65(12): 5785-5812 (2019) - [j48]Aaron Archer, Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni, Aaron Schild, Ray Yang, Richard Zhuang:
Cache-aware load balancing of data center applications. Proc. VLDB Endow. 12(6): 709-723 (2019) - [c148]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Pareto Efficient Auctions with Interest Rates. AAAI 2019: 1989-1995 - [c147]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal Dynamic Auctions Are Virtual Welfare Maximizers. AAAI 2019: 2125-2132 - [c146]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - [c145]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. ICML 2019: 333-343 - [c144]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. ICML 2019: 515-523 - [c143]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity. ICML 2019: 1833-1842 - [c142]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni:
Preferred Deals in General Environments. IJCAI 2019: 231-237 - [c141]David Rolnick, Kevin Aydin, Jean Pouget-Abadie, Shahab Kamali, Vahab S. Mirrokni, Amir Najmi:
Randomized Experimental Design via Geographic Clustering. KDD 2019: 2745-2753 - [c140]Yuan Deng, Sébastien Lahaie, Vahab S. Mirrokni:
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions. NeurIPS 2019: 8654-8664 - [c139]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. NeurIPS 2019: 9676-9685 - [c138]Negin Golrezaei, Adel Javanmard, Vahab S. Mirrokni:
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions. NeurIPS 2019: 9756-9766 - [c137]Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni:
Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond. NeurIPS 2019: 10044-10054 - [c136]Jean Pouget-Abadie, Kevin Aydin, Warren Schudy, Kay Brodersen, Vahab S. Mirrokni:
Variance Reduction in Bipartite Experiments through Correlation Clustering. NeurIPS 2019: 13288-13298 - [c135]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Double Auctions: Towards First Best. SODA 2019: 157-172 - [c134]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. SODA 2019: 255-273 - [c133]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. SODA 2019: 1616-1635 - [c132]Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement). SPAA 2019: 41-42 - [c131]Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis:
Dynamic Algorithms for the Massively Parallel Computation Model. SPAA 2019: 49-58 - [c130]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [c129]Alessandro Epasto, Hossein Esfandiari, Vahab S. Mirrokni:
On-Device Algorithms for Public-Private Data with Absolute Privacy. WWW 2019: 405-416 - [e1]Ioannis Caragiannis, Vahab S. Mirrokni, Evdokia Nikolova:
Web and Internet Economics - 15th International Conference, WINE 2019, New York, NY, USA, December 10-12, 2019, Proceedings. Lecture Notes in Computer Science 11920, Springer 2019, ISBN 978-3-030-35388-9 [contents] - [i53]Haihao Lu, Sai Praneeth Karimireddy, Natalia Ponomareva, Vahab S. Mirrokni:
Accelerating Gradient Boosting Machine. CoRR abs/1903.08708 (2019) - [i52]MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh:
Categorical Feature Compression via Submodular Optimization. CoRR abs/1904.13389 (2019) - [i51]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) - [i50]Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis:
Dynamic Algorithms for the Massively Parallel Computation Model. CoRR abs/1905.09175 (2019) - [i49]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. CoRR abs/1906.01993 (2019) - [i48]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Dynamic First Price Auctions Robust to Heterogeneous Buyers. CoRR abs/1906.03286 (2019) - [i47]Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong:
Streaming Balanced Clustering. CoRR abs/1910.00788 (2019) - [i46]Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni:
Batched Multi-Armed Bandits with Optimal Regret. CoRR abs/1910.04959 (2019) - [i45]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. CoRR abs/1910.05385 (2019) - [i44]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) - [i43]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time. CoRR abs/1911.01839 (2019) - [i42]Hossein Esfandiari, Amin Karbasi, Vahab S. Mirrokni:
Adaptivity in Adaptive Submodularity. CoRR abs/1911.03620 (2019) - 2018
- [j47]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme:
Dynamic Mechanisms with Martingale Utilities. Manag. Sci. 64(11): 5062-5082 (2018) - [j46]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. SIAM J. Comput. 47(3): 1056-1086 (2018) - [j45]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) - [c128]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP 2018: 162:1-162:4 - [c127]Shipra Agrawal, Morteza Zadimoghaddam, Vahab S. Mirrokni:
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy. ICML 2018: 99-108 - [c126]Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni:
Parallel and Streaming Algorithms for K-Core Decomposition. ICML 2018: 1396-1405 - [c125]Haihao Lu, Robert M. Freund, Vahab S. Mirrokni:
Accelerating Greedy Coordinate Descent Methods. ICML 2018: 3263-3272 - [c124]Shuaiwen Wang, Wenda Zhou, Haihao Lu, Arian Maleki, Vahab S. Mirrokni:
Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions. ICML 2018: 5215-5224 - [c123]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Optimal Distributed Submodular Optimization via Sketching. KDD 2018: 1138-1147 - [c122]Jean Pouget-Abadie, Vahab S. Mirrokni, David C. Parkes, Edoardo M. Airoldi:
Optimizing Cluster-based Randomized Experiments under Monotonicity. KDD 2018: 2090-2099 - [c121]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Non-clairvoyant Dynamic Mechanism Design. EC 2018: 169 - [c120]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. EC 2018: 171 - [c119]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. SODA 2018: 587-604 - [c118]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Stochastic bandits robust to adversarial corruptions. STOC 2018: 114-122 - [c117]Vahab S. Mirrokni, Renato Paes Leme, Rita Ren, Song Zuo:
Dynamic Mechanism Design in the Field. WWW 2018: 1359-1368 - [c116]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Song Zuo:
Incentive-Aware Learning for Large Markets. WWW 2018: 1369-1378 - [i41]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. CoRR abs/1803.00494 (2018) - [i40]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Stochastic bandits robust to adversarial corruptions. CoRR abs/1803.09353 (2018) - [i39]Shuaiwen Wang, Wenda Zhou, Haihao Lu, Arian Maleki, Vahab S. Mirrokni:
Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions. CoRR abs/1807.02694 (2018) - [i38]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity. CoRR abs/1807.07889 (2018) - [i37]Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk:
Connected Components at Scale via Local Contractions. CoRR abs/1807.10727 (2018) - [i36]Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni:
Parallel and Streaming Algorithms for K-Core Decomposition. CoRR abs/1808.02546 (2018) - [i35]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity. CoRR abs/1808.06932 (2018) - [i34]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Massively Parallel Dynamic Programming on Trees. CoRR abs/1809.03685 (2018) - [i33]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-learning. CoRR abs/1809.09582 (2018) - [i32]Shuaiwen Wang, Wenda Zhou, Arian Maleki, Haihao Lu, Vahab S. Mirrokni:
Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems. CoRR abs/1810.02716 (2018) - [i31]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal Dynamic Auctions are Virtual Welfare Maximizers. CoRR abs/1812.02993 (2018) - 2017
- [c115]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin:
A Study of Compact Reserve Pricing Languages. AAAI 2017: 363-368 - [c114]Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Feature Selection via Distributed Diversity Maximization. AAAI 2017: 2876-2883 - [c113]Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong:
Tight Bounds for Approximate Carathéodory and Beyond. ICML 2017: 2440-2448 - [c112]Santiago R. Balseiro, Max Lin, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo:
Dynamic Revenue Sharing. NIPS 2017: 2681-2689 - [c111]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni:
Affinity Clustering: Hierarchical Clustering at Scale. NIPS 2017: 6864-6874 - [c110]Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme:
Dynamic Mechanisms with Martingale Utilities. EC 2017: 165 - [c109]Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Overcommitment in Cloud Services Bin packing with Chance Constraints. SIGMETRICS (Abstracts) 2017: 7 - [c108]Vahab S. Mirrokni:
Online Optimization for Markets and the Cloud: Theory and Practice. SIGMETRICS (Abstracts) 2017: 47-48 - [c107]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. SPAA 2017: 13-23 - [c106]Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Distributed Submodular Maximization in a Few Rounds. SPAA 2017: 25-33 - [c105]Vahab S. Mirrokni, Hamid Nazerzadeh:
Deals or No Deals: Contract Design for Online Advertising. WWW 2017: 7-14 - [c104]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget Management Strategies in Repeated Auctions. WWW 2017: 15-23 - [i30]Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Overcommitment in Cloud Services - Bin packing with Chance Constraints. CoRR abs/1705.09335 (2017) - [i29]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR abs/1711.03076 (2017) - [i28]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. CoRR abs/1711.05764 (2017) - [i27]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. CoRR abs/1712.05450 (2017) - [i26]Eduardo Fleury, Silvio Lattanzi, Vahab S. Mirrokni, Bryan Perozzi:
ASYMP: Fault-tolerant Mining of Massive Graphs. CoRR abs/1712.09731 (2017) - 2016
- [j44]Nitish Korula, Vahab S. Mirrokni, Hamid Nazerzadeh:
Optimizing Display Advertising Markets: Challenges and Directions. IEEE Internet Comput. 20(1): 28-35 (2016) - [j43]Nikhil R. Devanur, Zhiyi Huang, Nitish Korula, Vahab S. Mirrokni, Qiqi Yan:
Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders. ACM Trans. Economics and Comput. 4(3): 14:1-14:20 (2016) - [c103]Gagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme:
Reservation Exchange Markets for Internet Advertising. ICALP 2016: 142:1-142:13 - [c102]Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam:
Greedy Column Subset Selection: New Bounds and Distributed Algorithms. ICML 2016: 2539-2548 - [c101]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Dynamic Auctions with Bank Accounts. IJCAI 2016: 387-393 - [c100]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Bi-Objective Online Matching and Submodular Allocations. NIPS 2016: 2739-2747 - [c99]Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson:
Linear Relaxations for Finding Diverse Elements in Metric Spaces. NIPS 2016: 4098-4106 - [c98]MohammadHossein Bateni, Yiwei Chen, Dragos Florin Ciocan, Vahab S. Mirrokni:
Fair Resource Allocation in A Volatile Marketplace. EC 2016: 819 - [c97]Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia:
Expanders via Local Edge Flips. SODA 2016: 259-269 - [c96]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. WSDM 2016: 387-396 - [r2]Vahab S. Mirrokni:
Market Games and Content Distribution. Encyclopedia of Algorithms 2016: 1189-1195 - [i25]Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam:
Greedy Column Subset Selection: New Bounds and Distributed Algorithms. CoRR abs/1605.08795 (2016) - [i24]Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo:
Optimal dynamic mechanisms with ex-post IR via bank accounts. CoRR abs/1605.08840 (2016) - [i23]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. CoRR abs/1608.01350 (2016) - [i22]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. CoRR abs/1610.08096 (2016) - [i21]David Rolnick, Kevin Aydin, Shahab Kamali, Vahab S. Mirrokni, Amir Najmi:
GeoCUTS: Geographic Clustering Using Travel Statistics. CoRR abs/1611.03780 (2016) - [i20]MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Distributed Coverage Maximization via Sketching. CoRR abs/1612.02327 (2016) - 2015
- [j42]Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver:
Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92: 306-326 (2015) - [j41]Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab S. Mirrokni, Zoya Svitkina:
Optimal Coordination Mechanisms for Unrelated Machine Scheduling. Oper. Res. 63(3): 489-500 (2015) - [j40]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Polyhedral Clinching Auctions and the AdWords Polytope. J. ACM 62(3): 18:1-18:27 (2015) - [j39]Alessandro Epasto, Silvio Lattanzi, Vahab S. Mirrokni, Ismail Sebe, Ahmed Taei, Sunita Verma:
Ego-net Community Mining Applied to Friend Suggestion. Proc. VLDB Endow. 9(4): 324-335 (2015) - [j38]Janardhan Kulkarni, Vahab S. Mirrokni:
Dynamic Coordination Mechanisms: [Extended Abstract]. SIGMETRICS Perform. Evaluation Rev. 43(3): 77 (2015) - [c95]Mohsen Vakilian, Raluca Sauciuc, J. David Morgenthaler, Vahab S. Mirrokni:
Automated Decomposition of Build Targets. ICSE (1) 2015: 123-133 - [c94]Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni, Ilya P. Razenshteyn:
Robust Hierarchical k-Center Clustering. ITCS 2015: 211-218 - [c93]Flavio Chierichetti, Alessandro Epasto, Ravi Kumar, Silvio Lattanzi, Vahab S. Mirrokni:
Efficient Algorithms for Public-Private Social Networks. KDD 2015: 139-148 - [c92]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. EC 2015: 169-186 - [c91]Janardhan Kulkarni, Vahab S. Mirrokni:
Robust Price of Anarchy Bounds via LP and Fenchel Duality. SODA 2015: 1030-1049 - [c90]Vahab S. Mirrokni, Morteza Zadimoghaddam:
Randomized Composable Core-sets for Distributed Submodular Maximization. STOC 2015: 153-162 - [c89]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. STOC 2015: 889-898 - [c88]Silvio Lattanzi, Vahab S. Mirrokni:
Distributed Graph Algorithmics: Theory and Practice. WSDM 2015: 419-420 - [i19]Vahab S. Mirrokni, Morteza Zadimoghaddam:
Randomized Composable Core-sets for Distributed Submodular Maximization. CoRR abs/1506.06715 (2015) - [i18]Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia:
Expanders via Local Edge Flips. CoRR abs/1510.07768 (2015) - [i17]Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Balanced Partitioning via Linear Embedding. CoRR abs/1512.02727 (2015) - [i16]Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong:
Tight Bounds for Approximate Carathéodory and Beyond. CoRR abs/1512.08602 (2015) - 2014
- [j37]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
On the Advantage of Overlapping Clusters for Minimizing Conductance. Algorithmica 69(4): 844-863 (2014) - [j36]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. Manag. Sci. 60(12): 2886-2907 (2014) - [j35]MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad:
On non-progressive spread of influence through social networks. Theor. Comput. Sci. 550: 36-50 (2014) - [c87]Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni, Vibhor Rastogi, Sergei Vassilvitskii:
Connected Components in MapReduce and Beyond. SoCC 2014: 18:1-18:13 - [c86]Sayan Bhattacharya, Janardhan Kulkarni, Vahab S. Mirrokni:
Coordination Mechanisms for Selfish Routing over Time on a Tree. ICALP (1) 2014: 186-197 - [c85]MohammadHossein Bateni, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni:
Distributed Balanced Clustering via Mapping Coresets. NIPS 2014: 2591-2599 - [c84]Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni:
Composable core-sets for diversity and coverage maximization. PODS 2014: 100-108 - [c83]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching auctions beyond hard budget constraints. EC 2014: 167-184 - [c82]MohammadHossein Bateni, Jon Feldman, Vahab S. Mirrokni, Sam Chiu-wai Wong:
Multiplicative bidding in online advertising. EC 2014: 715-732 - [c81]Arash Asadpour, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. WINE 2014: 263-276 - [c80]Anand Bhalgat, Nitish Korula, Hennadiy Leontyev, Max Lin, Vahab S. Mirrokni:
Partner tiering in display advertising. WSDM 2014: 133-142 - [c79]Renato Gomes, Vahab S. Mirrokni:
Optimal revenue-sharing double auctions with applications to ad exchanges. WWW 2014: 19-28 - [c78]Alessandro Epasto, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni:
Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. WWW 2014: 349-360 - [i15]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching Auctions Beyond Hard Budget Constraints. CoRR abs/1404.5000 (2014) - [i14]MohammadHossein Bateni, Jon Feldman, Vahab S. Mirrokni, Sam Chiu-wai Wong:
Multiplicative Bidding in Online Advertising. CoRR abs/1404.6727 (2014) - 2013
- [j34]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65(2): 391-408 (2013) - [j33]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
PASS Approximation: A Framework for Analyzing and Designing Heuristics. Algorithmica 66(2): 450-478 (2013) - [j32]Nima AhmadiPourAnari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium pricing with positive externalities. Theor. Comput. Sci. 476: 1-15 (2013) - [j31]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala:
Optimal Auctions with Positive Network Externalities. ACM Trans. Economics and Comput. 1(2): 13:1-13:24 (2013) - [c77]Zeyuan Allen Zhu, Silvio Lattanzi, Vahab S. Mirrokni:
A Local Algorithm for Finding Well-Connected Clusters. ICML (3) 2013: 396-404 - [c76]Zeinab Abbassi, Vahab S. Mirrokni, Mayur Thakur:
Diversity maximization under matroid constraints. KDD 2013: 32-40 - [c75]Nikhil R. Devanur, Zhiyi Huang, Nitish Korula, Vahab S. Mirrokni, Qiqi Yan:
Whole-page optimization and submodular welfare maximization with online bidders. EC 2013: 305-322 - [c74]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching Auction with Online Supply. SODA 2013: 605-619 - [c73]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Online Matching: Maximizing Weight and Cardinality. WINE 2013: 305-318 - [i13]Zeyuan Allen Zhu, Silvio Lattanzi, Vahab S. Mirrokni:
A Local Algorithm for Finding Well-Connected Clusters. CoRR abs/1304.8132 (2013) - 2012
- [j30]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala:
How to approximate optimal auctions. SIGecom Exch. 11(1): 30-33 (2012) - [j29]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and approximation in potential games. Theor. Comput. Sci. 438: 13-27 (2012) - [c72]Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni:
Online allocation of display ads with smooth delivery. KDD 2012: 1213-1221 - [c71]MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad:
On the Non-progressive Spread of Influence through Social Networks. LATIN 2012: 315-326 - [c70]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
Advantage of Overlapping Clusters for Minimizing Conductance. LATIN 2012: 494-505 - [c69]Vahab S. Mirrokni, Nithum Thain, Adrian Vetta:
A Theoretical Examination of Practical Game Playing: Lookahead Search. SAGT 2012: 251-262 - [c68]Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Simultaneous approximations for adversarial and stochastic online budgeted allocation. SODA 2012: 1690-1701 - [c67]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Polyhedral clinching auctions and the adwords polytope. STOC 2012: 107-122 - [c66]Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan:
Budget Optimization for Online Campaigns with Positive Carryover Effects. WINE 2012: 86-99 - [c65]Vahab S. Mirrokni, Sebastien Roch, Mukund Sundararajan:
On Fixed-Price Marketing for Goods with Positive Network Externalities. WINE 2012: 532-538 - [c64]Reid Andersen, David F. Gleich, Vahab S. Mirrokni:
Overlapping clusters for distributed computation. WSDM 2012: 273-282 - [i12]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Polyhedral Clinching Auctions and the Adwords Polytope. CoRR abs/1201.0404 (2012) - [i11]Vahab S. Mirrokni, Nithum Thain, Adrian Vetta:
On the Implications of Lookahead Search in Game Playing. CoRR abs/1202.4134 (2012) - [i10]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme:
Clinching Auctions with Online Supply. CoRR abs/1210.1456 (2012) - 2011
- [j28]Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems. Algorithmica 60(4): 735-742 (2011) - [j27]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60(4): 853-876 (2011) - [j26]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36(3): 416-431 (2011) - [j25]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40(1): 92-106 (2011) - [j24]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák:
Maximizing Non-monotone Submodular Functions. SIAM J. Comput. 40(4): 1133-1153 (2011) - [j23]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng:
Competitive routing over time. Theor. Comput. Sci. 412(39): 5420-5432 (2011) - [c63]Ullas Gargi, Wenjun Lu, Vahab S. Mirrokni, Sangho Yoon:
Large-Scale Community Detection on YouTube for Topic Discovery and Exploration. ICWSM 2011 - [c62]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala:
Optimal auctions with positive network externalities. EC 2011: 11-20 - [c61]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield optimization of display advertising with ad exchange. EC 2011: 27-28 - [c60]Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver:
Inner product spaces for MinSum coordination mechanisms. STOC 2011: 539-548 - [c59]Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Stochastic Weighted Matching: Improved Approximation Algorithms. WINE 2011: 170-181 - [i9]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. CoRR abs/1102.2551 (2011) - 2010
- [j22]Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni:
Secure Overlay Network Design. Algorithmica 57(1): 82-96 (2010) - [j21]Magnús M. Halldórsson, Joseph Y. Halpern, Li Erran Li, Vahab S. Mirrokni:
On spectrum sharing games. Distributed Comput. 22(4): 235-248 (2010) - [j20]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou:
The myth of the Folk Theorem. Games Econ. Behav. 70(1): 34-43 (2010) - [j19]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discret. Math. 23(4): 2053-2078 (2010) - [c58]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194 - [c57]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. LATIN 2010: 565-576 - [c56]Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan, Mallesh M. Pai:
Auctions with intermediaries: extended abstract. EC 2010: 23-32 - [c55]Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni, Hamid Mahini, Afshin Nikzad:
Optimal Iterative Pricing over Social Networks (Extended Abstract). WINE 2010: 415-423 - [c54]Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium Pricing with Positive Externalities (Extended Abstract). WINE 2010: 424-431 - [c53]Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan:
Mining advertiser-specific user behavior using adfactors. WWW 2010: 31-40 - [c52]Nicole Immorlica, Vahab S. Mirrokni:
Optimal marketing and pricing over social networks. WWW 2010: 1349-1350 - [i8]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010) - [i7]Richard Cole, Vasilis Gkatzelis, Vahab S. Mirrokni:
Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling. CoRR abs/1010.1886 (2010)
2000 – 2009
- 2009
- [j18]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated two-sided matching markets. SIGecom Exch. 8(1) (2009) - [j17]Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz:
Coordination mechanisms for selfish scheduling. Theor. Comput. Sci. 410(17): 1589-1598 (2009) - [c51]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
PASS Approximation. APPROX-RANDOM 2009: 111-124 - [c50]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e. FOCS 2009: 117-126 - [c49]Eyal Even-Dar, Vahab S. Mirrokni:
Tutorial summary: Convergence of natural dynamics to equilibria. ICML 2009: 13 - [c48]Vahab S. Mirrokni, Alexander Skopalik:
On the complexity of nash dynamics and sink equilibria. EC 2009: 1-10 - [c47]Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni:
Approximating submodular functions everywhere. SODA 2009: 535-544 - [c46]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332 - [c45]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng:
Competitive Routing over Time. WINE 2009: 18-29 - [c44]Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál:
Online Ad Assignment with Free Disposal. WINE 2009: 374-385 - [c43]Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav:
Bid optimization for broad match ad auctions. WWW 2009: 231-240 - [i6]Eyal Even-Dar, Yishay Mansour, Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Bid Optimization in Broad-Match Ad Auctions. CoRR abs/0901.3754 (2009) - [i5]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints. CoRR abs/0902.0353 (2009) - [i4]Vahab S. Mirrokni, Alexander Skopalik:
On the complexity of Nash dynamics and Sink Equilibria. CoRR abs/0902.0382 (2009) - [i3]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e. CoRR abs/0905.4100 (2009) - [i2]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Quasi-Proportional Mechanisms: Prior-free Revenue Maximization. CoRR abs/0909.5365 (2009) - 2008
- [j16]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng:
Local Computation of PageRank Contributions. Internet Math. 5(1): 23-45 (2008) - [j15]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. 5(4): 439-457 (2008) - [j14]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber:
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. 42(1): 2-26 (2008) - [j13]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4(2): 24:1-24:25 (2008) - [c42]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Kamal Jain, Vahab S. Mirrokni, Shang-Hua Teng:
Robust PageRank and locally computable spam detection features. AIRWeb 2008: 69-76 - [c41]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600 - [c40]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng:
On the Stability of Web Crawling and Web Search. ISAAC 2008: 680-691 - [c39]Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems. LATIN 2008: 423-435 - [c38]Vahab S. Mirrokni, Michael Schapira, Jan Vondrák:
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. EC 2008: 70-77 - [c37]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation betting markets: singleton betting with extra information. EC 2008: 180-189 - [c36]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated two-sided matching markets. EC 2008: 256-263 - [c35]Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik:
Fast convergence to nearly optimal solutions in potential games. EC 2008: 264-273 - [c34]Yossi Azar, Kamal Jain, Vahab S. Mirrokni:
(Almost) optimal coordination mechanisms for unrelated machine scheduling. SODA 2008: 323-332 - [c33]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou:
The myth of the folk theorem. STOC 2008: 365-372 - [c32]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
A combinatorial allocation mechanism with penalties for banner advertising. WWW 2008: 169-178 - [c31]Jason D. Hartline, Vahab S. Mirrokni, Mukund Sundararajan:
Optimal marketing strategies over social networks. WWW 2008: 189-198 - [c30]Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz:
Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208 - [r1]Vahab S. Mirrokni:
Market Games and Content Distribution. Encyclopedia of Algorithms 2008 - 2007
- [j12]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power optimization for connectivity problems. Math. Program. 110(1): 195-208 (2007) - [j11]Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami:
Subjective-cost policy routing. Theor. Comput. Sci. 378(2): 175-189 (2007) - [j10]Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi:
Cell Breathing in Wireless LANs: Algorithms and Evaluation. IEEE Trans. Mob. Comput. 6(2): 164-178 (2007) - [j9]Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni:
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE/ACM Trans. Netw. 15(6): 1345-1358 (2007) - [c29]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák:
Maximizing Non-Monotone Submodular Functions. FOCS 2007: 461-471 - [c28]Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni:
Robust Combinatorial Optimization with Exponential Scenarios. IPCO 2007: 439-453 - [c27]Zeinab Abbassi, Vahab S. Mirrokni:
A Recommender System Based on Local Random Walks and Spectral Methods. WebKDD/SNA-KDD 2007: 139-153 - [c26]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng:
Local Computation of PageRank Contributions. WAW 2007: 150-165 - [c25]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41 - [i1]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou:
The Myth of the Folk Theorem. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j8]Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad:
A relation between choosability and uniquely list colorability. J. Comb. Theory B 96(4): 577-583 (2006) - [j7]Michel X. Goemans, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan:
Market sharing games applied to content distribution in ad hoc networks. IEEE J. Sel. Areas Commun. 24(5): 1020-1033 (2006) - [j6]Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni:
Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. Wirel. Networks 12(2): 179-188 (2006) - [c24]Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni:
Secure Overlay Network Design. AAIM 2006: 354-366 - [c23]Mohammad Taghi Hajiaghayi, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan:
Bandwidth Sharing Network Design for Multi-Class Traffic. INFOCOM 2006 - [c22]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620 - [c21]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and Approximation in Potential Games. STACS 2006: 349-360 - [c20]David Abraham, Ning Chen, Vijay Kumar, Vahab S. Mirrokni:
Assignment Problems in Rental Markets. WINE 2006: 198-213 - 2005
- [c19]Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta:
Sink Equilibria and Convergence. FOCS 2005: 142-154 - [c18]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power Optimization for Connectivity Problems. IPCO 2005: 349-361 - [c17]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
Limitations of cross-monotonic cost sharing schemes. SODA 2005: 602-611 - [c16]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber:
Traffic engineering of management flows by link augmentations on confluent trees. SPAA 2005: 289-298 - [c15]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
Cycle Cover with Short Cycles. STACS 2005: 641-653 - [c14]Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz:
Coordination Mechanisms for Selfish Scheduling. WINE 2005: 55-69 - [c13]Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami:
Subjective-Cost Policy Routing. WINE 2005: 174-183 - 2004
- [c12]Vahab S. Mirrokni, Adrian Vetta:
Convergence Issues in Competitive Games. APPROX-RANDOM 2004: 183-194 - [c11]Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni:
Locality-sensitive hashing scheme based on p-stable distributions. SCG 2004: 253-262 - [c10]Marina Thottan, Li (Erran) Li, Bin Yao, Vahab S. Mirrokni, Sanjoy Paul:
Distributed Network Monitoring for Evolving IP Networks. ICDCS 2004: 712-719 - [c9]Marina Thottan, Vahab S. Mirrokni, Hüseyin Uzunalioglu, Sanjoy Paul:
A Simple Polynomial Time Framework For Reduced Path Decomposition in Multi-Path Routing. INFOCOM 2004 - [c8]Michel X. Goemans, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan:
Market sharing games applied to content distribution in ad-hoc networks. MobiHoc 2004: 55-66 - [c7]Magnús M. Halldórsson, Joseph Y. Halpern, Li (Erran) Li, Vahab S. Mirrokni:
On spectrum sharing games. PODC 2004: 107-114 - [c6]Nicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni:
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. SODA 2004: 691-700 - 2003
- [j5]Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
The facility location problem with general cost functions. Networks 42(1): 42-47 (2003) - [c5]Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni:
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. MobiCom 2003: 300-312 - 2002
- [j4]Manuela M. Veloso, Tucker R. Balch, Peter Stone, Hiroaki Kitano, Fuminori Yamasaki, Ken Endo, Minoru Asada, Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan:
RoboCup-2001: The Fifth Robotic Soccer World Championships. AI Mag. 23(1): 55-68 (2002) - [j3]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002) - [c4]Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni:
Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. ICCCN 2002: 392-397 - 2001
- [j2]Saeed Akbari, Seyed Vahab Mirrokni, Sayyed Bashir Sadjad:
Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges. J. Comb. Theory B 82(2): 316-318 (2001) - [c3]Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan:
A Fast Vision System for Middle Size Robots in RoboCup. RoboCup 2001: 71-80 - [c2]Mansour Jamzad, Hamid Reza Chitsaz, Amirali Foroughnassiraei, Reza Ghorbani, Moslem Kazemi, Vahab S. Mirrokni, Sayyed Bashir Sadjad:
Basic Requirements for a Teamwork in Middle Size RoboCup. RoboCup 2001: 621-626 - 2000
- [j1]Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani:
On the simultaneous edge-coloring conjecture. Discret. Math. 216(1-3): 267-272 (2000) - [c1]Mansour Jamzad, Amirali Foroughnassiraei, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni, Reza Ghorbani, Abbas Heydarnoori, Moslem Kazemi, Hamid Reza Chitsaz, Farid Mobasser, Mohsen Ebrahimi Moghaddam, M. Gudarzi, N. Ghaffarzadegan:
A Goal Keeper for Middle Size RoboCup. RoboCup 2000: 583-586
Coauthor Index
Mohammad Hossein Bateni 0001
aka: MohammadHossein Bateni
aka: MohammadHossein Bateni
[c225] [c220] [c215] [i127] [i123] [j67] [j62] [c212] [c210] [c203] [c200] [c199] [i109] [i108] [i105] [c197] [c193] [c185] [c182] [c180] [c178] [i91] [i90] [i85] [i80] [i79] [j54] [c177] [c176] [c175] [c174] [c173] [i71] [i70] [i67] [i66] [i63] [j52] [c153] [i62] [i57] [c146] [c144] [c137] [c130] [c129] [i52] [i51] [i47] [i46] [i45] [i44] [i42] [j45] [c126] [c123] [i36] [c115] [c107] [i28] [c100] [i22] [i20] [c92]
Andrés Muñoz Medina
aka: Andres Muñoz Medina
aka: Andres Muñoz Medina
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 2024-12-19 23:12 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:
