default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorteza Zadimoghaddam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c60]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. ICML 2024- [i27]Matthew Fahrbach, Srikumar Ramalingam, Morteza Zadimoghaddam, Sara Ahmadian, Gui Citovsky, Giulia DeSalvo:
GIST: Greedy Independent Set Thresholding for Diverse Data Summarization. CoRR abs/2405.18754 (2024) - [i26]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. CoRR abs/2405.19977 (2024) - 2023
- [c59]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. ICML 2023: 8821-8835 - [i25]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. CoRR abs/2305.19918 (2023) - 2022
- [j14]Matthew Fahrbach
, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam:
Edge-Weighted Online Bipartite Matching. J. ACM 69(6): 45:1-45:35 (2022) - [c58]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. ICML 2022: 5671-5693 - [i24]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. CoRR abs/2201.13128 (2022) - [i23]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Non-Monotone Submodular Maximization over Matroids. CoRR abs/2208.07582 (2022) - 2021
- [c57]Sara Ahmadian, Allen Liu, Binghui Peng, Morteza Zadimoghaddam:
Distributed Load Balancing: A New Framework and Improved Guarantees. ITCS 2021: 79:1-79:20 - 2020
- [c56]Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam:
Edge-Weighted Online Bipartite Matching. FOCS 2020: 412-423 - [c55]Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Residual Based Sampling for Online Low Rank Approximation. ITA 2020: 1-19 - [c54]Aditya Bhaskara, Amin Karbasi, Silvio Lattanzi, Morteza Zadimoghaddam:
Online MAP Inference of Determinantal Point Processes. NeurIPS 2020 - [c53]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Sliding Window Algorithms for k-Clustering Problems. NeurIPS 2020 - [c52]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. NeurIPS 2020 - [i22]Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam:
Edge-Weighted Online Bipartite Matching. CoRR abs/2005.01929 (2020) - [i21]Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam:
Fully Dynamic Algorithm for Constrained Submodular Optimization. CoRR abs/2006.04704 (2020) - [i20]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Sliding Window Algorithms for k-Clustering Problems. CoRR abs/2006.05850 (2020)
2010 – 2019
- 2019
- [j13]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) - [c51]Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Residual Based Sampling for Online Low Rank Approximation. FOCS 2019: 1596-1614 - [c50]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity. ICML 2019: 1833-1842 - [c49]Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi:
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. ICML 2019: 3311-3320 - [c48]Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. PODS 2019: 254-268 - [c47]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. SODA 2019: 255-273 - [c46]Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement). SPAA 2019: 41-42 - [i19]Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi:
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. CoRR abs/1905.00948 (2019) - 2018
- [j12]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) - [c45]Shipra Agrawal, Morteza Zadimoghaddam, Vahab S. Mirrokni:
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy. ICML 2018: 99-108 - [c44]Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi:
Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints. ICML 2018: 2549-2558 - [c43]Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi:
Data Summarization at Scale: A Two-Stage Submodular Approach. ICML 2018: 3593-3602 - [c42]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. SODA 2018: 587-604 - [i18]Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi:
Data Summarization at Scale: A Two-Stage Submodular Approach. CoRR abs/1806.02815 (2018) - [i17]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity. CoRR abs/1807.07889 (2018) - [i16]Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity. CoRR abs/1808.06932 (2018) - 2017
- [c41]Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Feature Selection via Distributed Diversity Maximization. AAAI 2017: 2876-2883 - [c40]Serban Stan, Morteza Zadimoghaddam, Andreas Krause, Amin Karbasi:
Probabilistic Submodular Maximization in Sub-Linear Time. ICML 2017: 3241-3250 - [c39]Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Overcommitment in Cloud Services Bin packing with Chance Constraints. SIGMETRICS (Abstracts) 2017: 7 - [c38]Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Distributed Submodular Maximization in a Few Rounds. SPAA 2017: 25-33 - [c37]Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Submodular Optimization Over Sliding Windows. WWW 2017: 421-430 - [i15]Morteza Zadimoghaddam:
Online Weighted Matching: Beating the 1/2 Barrier. CoRR abs/1704.05384 (2017) - [i14]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) - [i13]Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi:
Deletion-Robust Submodular Maximization at Scale. CoRR abs/1711.07112 (2017) - [i12]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. CoRR abs/1712.05450 (2017) - 2016
- [c36]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 - [c35]Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause:
Horizontally Scalable Submodular Maximization. ICML 2016: 2981-2989 - [c34]Baharan Mirzasoleiman, Morteza Zadimoghaddam, Amin Karbasi:
Fast Distributed Submodular Cover: Public-Private Data Summarization. NIPS 2016: 3594-3602 - [r1]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
Network Creation Games. Encyclopedia of Algorithms 2016: 1408-1412 - [i11]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) - [i10]Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause:
Horizontally Scalable Submodular Maximization. CoRR abs/1605.09619 (2016) - [i9]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. CoRR abs/1608.01350 (2016) - [i8]Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Submodular Optimization over Sliding Windows. CoRR abs/1610.09984 (2016) - 2015
- [j11]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. ACM Trans. Economics and Comput. 3(4): 18:1-18:16 (2015) - [c33]Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam:
Sparse Solutions to Nonnegative Linear Systems and Applications. AISTATS 2015 - [c32]Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam:
Online Stochastic Matching with Unequal Probabilities. SODA 2015: 1388-1404 - [c31]Vahab S. Mirrokni, Morteza Zadimoghaddam:
Randomized Composable Core-sets for Distributed Submodular Maximization. STOC 2015: 153-162 - [c30]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. STOC 2015: 889-898 - [i7]Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam:
Sparse Solutions to Nonnegative Linear Systems and Applications. CoRR abs/1501.01689 (2015) - [i6]Vahab S. Mirrokni, Morteza Zadimoghaddam:
Randomized Composable Core-sets for Distributed Submodular Maximization. CoRR abs/1506.06715 (2015) - 2014
- [b1]Morteza Zadimoghaddam:
Online allocation algorithms with applications in computational advertising. Massachusetts Institute of Technology, Cambridge, MA, USA, 2014 - [c29]Yoram Bachrach, Omer Lev, Shachar Lovett, Jeffrey S. Rosenschein, Morteza Zadimoghaddam:
Cooperative weakest link games. AAMAS 2014: 589-596 - [c28]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam:
How to influence people with partial incentives. WWW 2014: 937-948 - [i5]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam:
How to Influence People with Partial Incentives. CoRR abs/1401.7970 (2014) - 2013
- [j10]Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption. J. Sched. 16(2): 151-160 (2013) - [j9]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Morteza Zadimoghaddam:
Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4): 32:1-32:23 (2013) - [c27]Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam:
Optimal Coalition Structure Generation in Cooperative Graph Games. AAAI 2013: 81-87 - [c26]Erik D. Demaine, Morteza Zadimoghaddam:
Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". SODA 2013: 1369-1379 - [c25]Amin Karbasi, Morteza Zadimoghaddam:
Constrained Binary Identification Problem. STACS 2013: 550-561 - [c24]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. WINE 2013: 40-53 - [c23]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Online Matching: Maximizing Weight and Cardinality. WINE 2013: 305-318 - 2012
- [j8]Erik D. Demaine, Morteza Zadimoghaddam:
Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising. Internet Math. 8(1-2): 29-45 (2012) - [j7]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in network creation games. ACM Trans. Algorithms 8(2): 13:1-13:13 (2012) - [c22]Amin Karbasi, Morteza Zadimoghaddam:
Sequential group testing with graph constraints. ITW 2012: 292-296 - [c21]Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Simultaneous approximations for adversarial and stochastic online budgeted allocation. SODA 2012: 1690-1701 - [c20]Morteza Zadimoghaddam, Aaron Roth:
Efficiently Learning from Revealed Preference. WINE 2012: 114-127 - [i4]Morteza Zadimoghaddam, Aaron Roth:
Efficiently Learning from Revealed Preference. CoRR abs/1211.4150 (2012) - 2011
- [j6]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60(4): 853-876 (2011) - [j5]Ali Kakhbod, Morteza Zadimoghaddam:
On the construction of prefix-free and fix-free codes with specified codeword compositions. Discret. Appl. Math. 159(18): 2269-2275 (2011) - [j4]Yoram Bachrach, Morteza Zadimoghaddam, Peter B. Key:
A cooperative approach to collusion in auctions. SIGecom Exch. 10(1): 17-22 (2011) - [c19]Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam:
O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74 - [c18]Amin Karbasi, Morteza Zadimoghaddam:
Compression with graphical constraints: An interactive browser. ISIT 2011: 953-957 - [c17]Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam:
Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248 - [c16]Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Stochastic Weighted Matching: Improved Approximation Algorithms. WINE 2011: 170-181 - [i3]Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam:
Optimal Coalition Structures in Graph Games. CoRR abs/1108.5248 (2011) - 2010
- [c15]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam:
Submodular Secretary Problem and Extensions. APPROX-RANDOM 2010: 39-52 - [c14]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam:
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). ICALP (2) 2010: 115-126 - [c13]Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum:
Trading off Mistakes and Don't-Know Predictions. NIPS 2010: 2092-2100 - [c12]Erik D. Demaine, Morteza Zadimoghaddam:
Scheduling to minimize power consumption using submodular functions. SPAA 2010: 21-29 - [c11]Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam:
Collaborative scoring with dishonest participants. SPAA 2010: 41-49 - [c10]Erik D. Demaine, Morteza Zadimoghaddam:
Minimizing the Diameter of a Network Using Shortcut Edges. SWAT 2010: 420-431 - [c9]Erik D. Demaine, Morteza Zadimoghaddam:
Constant Price of Anarchy in Network Creation Games via Public Service Advertising. WAW 2010: 122-131 - [c8]Yoram Bachrach, Peter B. Key, Morteza Zadimoghaddam:
Collusion in VCG Path Procurement Auctions. WINE 2010: 38-49 - [i2]Ali Kakhbod, Morteza Zadimoghaddam:
On the Carter-Gill Conjecture. CoRR abs/1002.0097 (2010)
2000 – 2009
- 2009
- [j3]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in cooperative network creation games. SIGecom Exch. 8(2): 2 (2009) - [j2]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Minimizing movement. ACM Trans. Algorithms 5(3): 30:1-30:30 (2009) - [c7]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312 - [i1]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The Price of Anarchy in Cooperative Network Creation Games. CoRR abs/0902.1400 (2009) - 2008
- [c6]Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam:
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34 - [c5]Ali Kakhbod, Ali Nazari, Morteza Zadimoghaddam:
Some notes on fix-free codes. CISS 2008: 1015-1018 - [c4]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation betting markets: singleton betting with extra information. EC 2008: 180-189 - 2007
- [j1]Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
Spanning trees with minimum weighted degrees. Inf. Process. Lett. 104(3): 113-116 (2007) - [c3]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in network creation games. PODC 2007: 292-298 - [c2]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Minimizing movement. SODA 2007: 258-267 - [c1]Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54
Coauthor Index
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-10-24 21:32 CEST 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:
