Vahab S. Mirrokni
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
131
Venues
34
Active years
2000–2022
Best venue rank
A*
Where they publish
- A*ICML19 papers
- A*SODA19 papers
- A*WWW15 papers
- A*KDD9 papers
- A*STOC8 papers
- A*AAAI7 papers
- BSPAA6 papers
- A*FOCS4 papers
- AWSDM4 papers
- BLATIN4 papers
- AESA3 papers
- A*ICALP3 papers
- CRoboCup3 papers
- AAISTATS2 papers
- A*IJCAI2 papers
- A*SIGMETRICS2 papers
- BIPCO2 papers
- A*INFOCOM2 papers
- ASTACS2 papers
- BALT1 paper
- A*COLT1 paper
- A*ICSE1 paper
- BCLOUD1 paper
- A*PODS1 paper
- BSAGT1 paper
- AICWSM1 paper
- BISAAC1 paper
- CWAW1 paper
- CAAIM1 paper
- AICDCS1 paper
- BMOBIHOC1 paper
- A*PODC1 paper
- A*MOBICOM1 paper
- BICCCN1 paper
Papers
131 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | AISTATS | Label differential privacy via clustering. | Hossein Esfandiari, Vahab S. Mirrokni, Umar Syed, Sergei Vassilvitskii |
| 2022 | ALT | Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. | Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni |
| 2022 | ICML | Massively Parallel k-Means Clustering for Perturbation Resilient Instances. | Vincent Cohen-Addad, Vahab S. Mirrokni, Peilin Zhong |
| 2022 | ICML | Tight and Robust Private Mean Estimation with Few Users. | Shyam Narayanan, Vahab S. Mirrokni, Hossein Esfandiari |
| 2022 | SODA | Robust Load Balancing with Machine Learned Advice. | Sara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng |
| 2022 | SODA | Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
| 2022 | SODA | Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong |
| 2022 | SODA | Almost Tight Approximation Algorithms for Explainable Clustering. | Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan |
| 2022 | STOC | Improved approximations for Euclidean | Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan |
| 2021 | AAAI | Extreme k-Center Clustering. | MohammadHossein Bateni, Hossein Esfandiari, Manuela Fischer, Vahab S. Mirrokni |
| 2021 | AAAI | Regret Bounds for Batched Bandits. | Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni |
| 2021 | AAAI | Almost Linear Time Density Level Set Estimation via DBSCAN. | Hossein Esfandiari, Vahab S. Mirrokni, Peilin Zhong |
| 2021 | COLT | Adaptivity in Adaptive Submodularity. | Hossein Esfandiari, Amin Karbasi, Vahab S. Mirrokni |
| 2021 | ESA | Feature Cross Search via Submodular Optimization. | Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu |
| 2021 | ICML | Regularized Online Allocation Problems: Fairness and Beyond. | Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni |
| 2021 | ICML | Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing. | Yuan Deng, Sbastien Lahaie, Vahab S. Mirrokni, Song Zuo |
| 2021 | ICML | Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. | Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi |
| 2021 | KDD | Clustering for Private Interest-based Advertising. | Alessandro Epasto, Andrs Muoz Medina, Steven Avery, Yijian Bai, Rbert 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 |
| 2021 | KDD | Boosted Second Price Auctions: Revenue Optimization for Heterogeneous Bidders. | Negin Golrezaei, Max Lin, Vahab S. Mirrokni, Hamid Nazerzadeh |
| 2021 | WWW | Towards Efficient Auctions in an Auto-bidding World. | Yuan Deng, Jieming Mao, Vahab S. Mirrokni, Song Zuo |
| 2021 | SODA | Non-Excludable Dynamic Mechanism Design. | Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo |
| 2020 | AISTATS | Accelerating Gradient Boosting Machines. | Haihao Lu, Sai Praneeth Karimireddy, Natalia Ponomareva, Vahab S. Mirrokni |
| 2020 | ICML | Dual Mirror Descent for Online Allocation Problems. | Santiago R. Balseiro, Haihao Lu, Vahab S. Mirrokni |
| 2020 | ICML | Robust Pricing in Dynamic Mechanism Design. | Yuan Deng, Sbastien Lahaie, Vahab S. Mirrokni |
| 2020 | ICML | Bandits with Adversarial Scaling. | Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme |
| 2020 | WWW | A Data-Driven Metric of Incentive Compatibility. | Yuan Deng, Sbastien Lahaie, Vahab S. Mirrokni, Song Zuo |
| 2020 | SODA | Fully Dynamic Matching: Beating 2-Approximation in Δ | Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni |
| 2019 | AAAI | Pareto Efficient Auctions with Interest Rates. | Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme |
| 2019 | AAAI | Optimal Dynamic Auctions Are Virtual Welfare Maximizers. | Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo |
| 2019 | FOCS | Near-Optimal Massively Parallel Graph Connectivity. | Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni |
| 2019 | ICML | Distributed Weighted Matching via Randomized Composable Coresets. | Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni |
| 2019 | ICML | Categorical Feature Compression via Submodular Optimization. | MohammadHossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab S. Mirrokni, Afshin Rostamizadeh |
| 2019 | ICML | Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity. | Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2019 | IJCAI | Preferred Deals in General Environments. | Yuan Deng, Sbastien Lahaie, Vahab S. Mirrokni |
| 2019 | KDD | Randomized Experimental Design via Geographic Clustering. | David Rolnick, Kevin Aydin, Jean Pouget-Abadie, Shahab Kamali, Vahab S. Mirrokni, Amir Najmi |
| 2019 | WWW | On-Device Algorithms for Public-Private Data with Absolute Privacy. | Alessandro Epasto, Hossein Esfandiari, Vahab S. Mirrokni |
| 2019 | SODA | Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. | Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein |
| 2019 | SODA | Dynamic Double Auctions: Towards First Best. | Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo |
| 2019 | SODA | Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. | Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2019 | SPAA | Massively Parallel Computation via Remote Memory Access. | Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy |
| 2019 | SPAA | Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement). | Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2019 | SPAA | Dynamic Algorithms for the Massively Parallel Computation Model. | Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis |
| 2018 | ICALP | Brief Announcement: MapReduce Algorithms for Massive Trees. | MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni |
| 2018 | ICML | Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy. | Shipra Agrawal, Morteza Zadimoghaddam, Vahab S. Mirrokni |
| 2018 | ICML | Parallel and Streaming Algorithms for K-Core Decomposition. | Hossein Esfandiari, Silvio Lattanzi, Vahab S. Mirrokni |
| 2018 | ICML | Accelerating Greedy Coordinate Descent Methods. | Haihao Lu, Robert M. Freund, Vahab S. Mirrokni |
| 2018 | ICML | Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions. | Shuaiwen Wang, Wenda Zhou, Haihao Lu, Arian Maleki, Vahab S. Mirrokni |
| 2018 | KDD | Optimal Distributed Submodular Optimization via Sketching. | MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni |
| 2018 | KDD | Optimizing Cluster-based Randomized Experiments under Monotonicity. | Jean Pouget-Abadie, Vahab S. Mirrokni, David C. Parkes, Edoardo M. Airoldi |
| 2018 | WWW | Incentive-Aware Learning for Large Markets. | Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Song Zuo |
| 2018 | WWW | Dynamic Mechanism Design in the Field. | Vahab S. Mirrokni, Renato Paes Leme, Rita Ren, Song Zuo |
| 2018 | SODA | Consistent Hashing with Bounded Loads. | Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam |
| 2018 | STOC | Stochastic bandits robust to adversarial corruptions. | Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme |
| 2017 | AAAI | A Study of Compact Reserve Pricing Languages. | MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin |
| 2017 | AAAI | Scalable Feature Selection via Distributed Diversity Maximization. | Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2017 | ICML | Tight Bounds for Approximate Carathodory and Beyond. | Vahab S. Mirrokni, Renato Paes Leme, Adrian Vladu, Sam Chiu-wai Wong |
| 2017 | WWW | Budget Management Strategies in Repeated Auctions. | Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni |
| 2017 | WWW | Deals or No Deals: Contract Design for Online Advertising. | Vahab S. Mirrokni, Hamid Nazerzadeh |
| 2017 | SIGMETRICS | Overcommitment in Cloud Services Bin packing with Chance Constraints. | Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2017 | SIGMETRICS | Online Optimization for Markets and the Cloud: Theory and Practice. | Vahab S. Mirrokni |
| 2017 | SPAA | Almost Optimal Streaming Algorithms for Coverage Problems. | MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni |
| 2017 | SPAA | Bicriteria Distributed Submodular Maximization in a Few Rounds. | Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2016 | ICALP | Reservation Exchange Markets for Internet Advertising. | Gagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme |
| 2016 | ICML | Greedy Column Subset Selection: New Bounds and Distributed Algorithms. | Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam |
| 2016 | IJCAI | Dynamic Auctions with Bank Accounts. | Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, Song Zuo |
| 2016 | SODA | Expanders via Local Edge Flips. | Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia |
| 2016 | WSDM | Distributed Balanced Partitioning via Linear Embedding. | Kevin Aydin, MohammadHossein Bateni, Vahab S. Mirrokni |
| 2015 | ICSE | Automated Decomposition of Build Targets. | Mohsen Vakilian, Raluca Sauciuc, J. David Morgenthaler, Vahab S. Mirrokni |
| 2015 | KDD | Efficient Algorithms for Public-Private Social Networks. | Flavio Chierichetti, Alessandro Epasto, Ravi Kumar, Silvio Lattanzi, Vahab S. Mirrokni |
| 2015 | SODA | Robust Price of Anarchy Bounds via LP and Fenchel Duality. | Janardhan Kulkarni, Vahab S. Mirrokni |
| 2015 | STOC | Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. | Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2015 | STOC | Randomized Composable Core-sets for Distributed Submodular Maximization. | Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2015 | WSDM | Distributed Graph Algorithmics: Theory and Practice. | Silvio Lattanzi, Vahab S. Mirrokni |
| 2014 | CLOUD | Connected Components in MapReduce and Beyond. | Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni, Vibhor Rastogi, Sergei Vassilvitskii |
| 2014 | ICALP | Coordination Mechanisms for Selfish Routing over Time on a Tree. | Sayan Bhattacharya, Janardhan Kulkarni, Vahab S. Mirrokni |
| 2014 | PODS | Composable core-sets for diversity and coverage maximization. | Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni |
| 2014 | WWW | Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. | Alessandro Epasto, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni |
| 2014 | WWW | Optimal revenue-sharing double auctions with applications to ad exchanges. | Renato Gomes, Vahab S. Mirrokni |
| 2014 | WSDM | Partner tiering in display advertising. | Anand Bhalgat, Nitish Korula, Hennadiy Leontyev, Max Lin, Vahab S. Mirrokni |
| 2013 | ICML | A Local Algorithm for Finding Well-Connected Clusters. | Zeyuan Allen Zhu, Silvio Lattanzi, Vahab S. Mirrokni |
| 2013 | KDD | Diversity maximization under matroid constraints. | Zeinab Abbassi, Vahab S. Mirrokni, Mayur Thakur |
| 2013 | SODA | Clinching Auction with Online Supply. | Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme |
| 2012 | KDD | Online allocation of display ads with smooth delivery. | Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni |
| 2012 | LATIN | On the Non-progressive Spread of Influence through Social Networks. | MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad |
| 2012 | LATIN | Advantage of Overlapping Clusters for Minimizing Conductance. | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni |
| 2012 | SODA | Simultaneous approximations for adversarial and stochastic online budgeted allocation. | Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam |
| 2012 | STOC | Polyhedral clinching auctions and the adwords polytope. | Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme |
| 2012 | WSDM | Overlapping clusters for distributed computation. | Reid Andersen, David F. Gleich, Vahab S. Mirrokni |
| 2012 | SAGT | A Theoretical Examination of Practical Game Playing: Lookahead Search. | Vahab S. Mirrokni, Nithum Thain, Adrian Vetta |
| 2011 | ICWSM | Large-Scale Community Detection on YouTube for Topic Discovery and Exploration. | Ullas Gargi, Wenjun Lu, Vahab S. Mirrokni, Sangho Yoon |
| 2011 | STOC | Inner product spaces for MinSum coordination mechanisms. | Richard Cole, Jos R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver |
| 2010 | ESA | Online Stochastic Packing Applied to Display Ad Allocation. | Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein |
| 2010 | LATIN | Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. | Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav |
| 2010 | WWW | Mining advertiser-specific user behavior using adfactors. | Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan |
| 2010 | WWW | Optimal marketing and pricing over social networks. | Nicole Immorlica, Vahab S. Mirrokni |
| 2009 | FOCS | Online Stochastic Matching: Beating 1-1/e. | Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan |
| 2009 | ICML | Tutorial summary: Convergence of natural dynamics to equilibria. | Eyal Even-Dar, Vahab S. Mirrokni |
| 2009 | WWW | Bid optimization for broad match ad auctions. | Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav |
| 2009 | SODA | Approximating submodular functions everywhere. | Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni |
| 2009 | STOC | Non-monotone submodular maximization under matroid and knapsack constraints. | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko |
| 2008 | ESA | Two-Stage Robust Network Design with Exponential Scenarios. | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour |
| 2008 | ISAAC | On the Stability of Web Crawling and Web Search. | Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng |
| 2008 | LATIN | Approximating Minimum-Power Degree and Connectivity Problems. | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
| 2008 | WWW | Trust-based recommendation systems: an axiomatic approach. | Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz |
| 2008 | WWW | A combinatorial allocation mechanism with penalties for banner advertising. | Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh |
| 2008 | WWW | Optimal marketing strategies over social networks. | Jason D. Hartline, Vahab S. Mirrokni, Mukund Sundararajan |
| 2008 | SODA | (Almost) optimal coordination mechanisms for unrelated machine scheduling. | Yossi Azar, Kamal Jain, Vahab S. Mirrokni |
| 2008 | STOC | The myth of the folk theorem. | Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou |
| 2007 | FOCS | Maximizing Non-Monotone Submodular Functions. | Uriel Feige, Vahab S. Mirrokni, Jan Vondrk |
| 2007 | IPCO | Robust Combinatorial Optimization with Exponential Scenarios. | Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni |
| 2007 | KDD | A Recommender System Based on Local Random Walks and Spectral Methods. | Zeinab Abbassi, Vahab S. Mirrokni |
| 2007 | WAW | Local Computation of PageRank Contributions. | Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng |
| 2006 | AAIM | Secure Overlay Network Design. | Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni |
| 2006 | INFOCOM | Bandwidth Sharing Network Design for Multi-Class Traffic. | Mohammad Taghi Hajiaghayi, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan |
| 2006 | SODA | Tight approximation algorithms for maximum general assignment problems. | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko |
| 2006 | STACS | Convergence and Approximation in Potential Games. | George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos |
| 2005 | FOCS | Sink Equilibria and Convergence. | Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta |
| 2005 | IPCO | Power Optimization for Connectivity Problems. | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov |
| 2005 | SODA | Limitations of cross-monotonic cost sharing schemes. | Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni |
| 2005 | STACS | Cycle Cover with Short Cycles. | Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni |
| 2005 | SPAA | Traffic engineering of management flows by link augmentations on confluent trees. | Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber |
| 2004 | ICDCS | Distributed Network Monitoring for Evolving IP Networks. | Marina Thottan, Li (Erran) Li, Bin Yao, Vahab S. Mirrokni, Sanjoy Paul |
| 2004 | INFOCOM | A Simple Polynomial Time Framework For Reduced Path Decomposition in Multi-Path Routing. | Marina Thottan, Vahab S. Mirrokni, Hseyin Uzunalioglu, Sanjoy Paul |
| 2004 | MOBIHOC | Market sharing games applied to content distribution in ad-hoc networks. | Michel X. Goemans, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan |
| 2004 | PODC | On spectrum sharing games. | Magns M. Halldrsson, Joseph Y. Halpern, Li (Erran) Li, Vahab S. Mirrokni |
| 2004 | SODA | On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. | Nicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni |
| 2003 | MOBICOM | Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. | Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni |
| 2002 | ICCCN | Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. | Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni |
| 2001 | RoboCup | Basic Requirements for a Teamwork in Middle Size RoboCup. | Mansour Jamzad, Hamid Reza Chitsaz, Amirali Foroughnassiraei, Reza Ghorbani, Moslem Kazemi, Vahab S. Mirrokni, Sayyed Bashir Sadjad |
| 2001 | RoboCup | A Fast Vision System for Middle Size Robots in RoboCup. | Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan |
| 2000 | RoboCup | A Goal Keeper for Middle Size RoboCup. | 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 |