default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiguel A. Mosteiro
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
[j27]Lu Dong, Miguel A. Mosteiro, Shikha Singh:
Verifiable Crowd Computing: Coping with bounded rationality. Theor. Comput. Sci. 1004: 114631 (2024)- [c47]Dariusz R. Kowalski, Miguel A. Mosteiro, Austin Powlette:
Algebraic Computations in Anonymous VANET. NETYS 2024: 142-156 - [c46]Lu Dong, Miguel A. Mosteiro, Michelle Wang:
Distributed Station Assignment Through Learning. NETYS 2024: 188-203 - 2023
- [j26]Dariusz R. Kowalski, Miguel A. Mosteiro
, Kevin Zaki:
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model. Theory Comput. Syst. 67(4): 825-854 (2023) - [j25]Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki:
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model. Theory Comput. Syst. 67(5): 1131 (2023) - [j24]Aleksandar Kamenev, Dariusz R. Kowalski, Miguel A. Mosteiro:
Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks. ACM Trans. Parallel Comput. 10(2): 13:1-13:35 (2023) - [c45]Dariusz R. Kowalski, Miguel A. Mosteiro:
The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference. ISIT 2023: 2685-2690 - [c44]Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro:
Graph Ranking and the Cost of Sybil Defense. EC 2023: 586-625 - 2022
- [j23]Dariusz R. Kowalski, Miguel A. Mosteiro:
Polynomial anonymous dynamic distributed computing without a unique leader. J. Comput. Syst. Sci. 123: 37-63 (2022) - [j22]Lu Dong, Dariusz R. Kowalski, Harshita Kudaravalli, Miguel A. Mosteiro:
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework. Theor. Comput. Sci. 901: 19-34 (2022) - [c43]Lu Dong, Miguel A. Mosteiro, Shikha Singh:
Verifiable Crowd Computing: Coping with Bounded Rationality. FAW 2022: 59-78 - [i21]Dariusz R. Kowalski, Miguel A. Mosteiro:
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity. CoRR abs/2202.07167 (2022) - 2021
- [j21]Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves Caro:
Dynamic Windows Scheduling with Reallocation. ACM J. Exp. Algorithmics 26: 1.11:1-1.11:19 (2021) - [c42]Dariusz R. Kowalski, Miguel A. Mosteiro:
Time and Communication Complexity of Leader Election in Anonymous Networks. ICDCS 2021: 449-460 - [c41]Dariusz R. Kowalski, Miguel A. Mosteiro:
Supervised Average Consensus in Anonymous Dynamic Networks. SPAA 2021: 307-317 - [i20]Dariusz R. Kowalski, Miguel A. Mosteiro:
Time and Communication Complexity of Leader Election in Anonymous Networks. CoRR abs/2101.04400 (2021) - [i19]Dariusz R. Kowalski, Miguel A. Mosteiro:
Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader. CoRR abs/2104.02937 (2021) - 2020
- [j20]Dariusz R. Kowalski, Miguel A. Mosteiro:
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. J. ACM 67(2): 11:1-11:17 (2020) - [j19]Edgar Arribas, Antonio Fernández Anta, Dariusz R. Kowalski, Vincenzo Mancuso, Miguel A. Mosteiro, Joerg Widmer, Prudence W. H. Wong:
Optimizing mmWave Wireless Backhaul Scheduling. IEEE Trans. Mob. Comput. 19(10): 2409-2428 (2020) - [c40]Austin Halper, Dariusz R. Kowalski, Miguel A. Mosteiro:
Heuristically Speeding up Anonymous Dynamic Network Computations. ISPA/BDCloud/SocialCom/SustainCom 2020: 1257-1263 - [c39]Dariusz R. Kowalski, Miguel A. Mosteiro, Krutika Wadhwa:
Generic Framework for Optimization of Local Dissemination in Wireless Networks. NETYS 2020: 244-260
2010 – 2019
- 2019
- [j18]Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong:
Station Assignment with Reallocation. Algorithmica 81(3): 1096-1125 (2019) - [c38]Dariusz R. Kowalski, Miguel A. Mosteiro:
Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader. ICALP 2019: 147:1-147:15 - [c37]Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Miguel A. Mosteiro:
mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals. IPDPS 2019: 708-717 - 2018
- [j17]Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro:
A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Algorithmica 80(11): 3023-3049 (2018) - [j16]Antonio Fernández Anta, Dariusz R. Kowalski, Miguel A. Mosteiro, Prudence W. H. Wong:
Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees. ACM Trans. Parallel Comput. 5(2): 10:1-10:19 (2018) - [c36]Dariusz R. Kowalski, Miguel A. Mosteiro:
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. ICALP 2018: 156:1-156:14 - [e2]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Lecture Notes in Computer Science 10807, Springer 2018, ISBN 978-3-319-77403-9 [contents] - [i18]Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong:
Station Assignment with Reallocation. CoRR abs/1803.01276 (2018) - [i17]Lucas Farach-Colton, Martin Farach-Colton, Reut Levi, Moti Medina, Miguel A. Mosteiro:
Closure Operators and Spam Resistance for PageRank. CoRR abs/1803.05001 (2018) - 2017
- [j15]Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution. Distributed Comput. 30(4): 281-291 (2017) - [c35]Dariusz R. Kowalski, Harshita Kudaravalli, Miguel A. Mosteiro:
Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets: Poster Abstract. IoTDI 2017: 313-314 - [c34]Mohammad Harun Rashid, Miguel A. Mosteiro:
A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem. ISPA/IUCC 2017: 868-872 - [c33]Harshita Kudaravalli, Miguel A. Mosteiro:
Ad-Hoc Affectance-Selective Families for Layer Dissemination. SEA 2017: 33:1-33:16 - [e1]Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, Yanyong Zhang:
Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10718, Springer 2017, ISBN 978-3-319-72750-9 [contents] - [i16]Dariusz R. Kowalski, Harshita Kudaravalli, Miguel A. Mosteiro:
Ad-hoc Affectance-selective Families for Layer Dissemination. CoRR abs/1703.01704 (2017) - [i15]Dariusz R. Kowalski, Miguel A. Mosteiro:
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. CoRR abs/1707.04282 (2017) - 2016
- [j14]Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves, Lin Wang:
Power-efficient assignment of virtual machines to physical machines. Future Gener. Comput. Syst. 54: 82-94 (2016) - [c32]Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro:
Counting in Practical Anonymous Dynamic Networks is Polynomial. NETYS 2016: 131-136 - [c31]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Internet Computing: Using Reputation to Select Workers from a Pool. NETYS 2016: 137-153 - [c30]Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Daniel Pareja:
Multi-round Master-Worker Computing: A Repeated Game Approach. SRDS 2016: 31-40 - [i14]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Internet Computing: Using Reputation to Select Workers from a Pool. CoRR abs/1603.04394 (2016) - [i13]Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro:
Counting in Practical Anonymous Dynamic Networks is Polynomial. CoRR abs/1603.05459 (2016) - 2015
- [j13]Martin Farach-Colton, Miguel A. Mosteiro:
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. Algorithmica 73(1): 87-114 (2015) - [j12]Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro:
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions. Comput. Geom. 48(2): 134-146 (2015) - [c29]Alessia Milani, Miguel A. Mosteiro:
A Faster Counting Protocol for Anonymous Dynamic Networks. OPODIS 2015: 28:1-28:13 - [c28]Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong:
Station Assignment with Reallocation. SEA 2015: 151-164 - [i12]Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Daniel Pareja:
Multi-round Master-Worker Computing: a Repeated Game Approach. CoRR abs/1508.05769 (2015) - [i11]Alessia Milani, Miguel A. Mosteiro:
A Faster Counting Protocol for Anonymous Dynamic Networks. CoRR abs/1509.02140 (2015) - [i10]Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki:
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model. CoRR abs/1512.00540 (2015) - 2014
- [j11]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing. IEEE Trans. Computers 63(1): 179-195 (2014) - [c27]Dariusz R. Kowalski, Miguel A. Mosteiro, Tevin Rouse:
Dynamic multiple-message broadcast: bounding throughput in the affectance model. FOMC 2014: 39-46 - [c26]Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves, Lin Wang:
Power-Efficient Assignment of Virtual Machines to Physical Machines. ARMS-CC@PODC 2014: 71-88 - [c25]Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves:
Dynamic Windows Scheduling with Reallocation. SEA 2014: 99-110 - [i9]Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves:
Dynamic Windows Scheduling with Reallocation. CoRR abs/1404.1087 (2014) - 2013
- [j10]Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz:
Unbounded Contention Resolution in Multiple-Access Channels. Algorithmica 67(3): 295-314 (2013) - [j9]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez:
Applying the dynamics of evolution to achieve reliability in master-worker computing. Concurr. Comput. Pract. Exp. 25(17): 2363-2380 (2013) - [j8]Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
An early-stopping protocol for computing aggregate functions in Sensor Networks. J. Parallel Distributed Comput. 73(2): 111-121 (2013) - [j7]Martin Farach-Colton, Antonio Fernández Anta, Miguel A. Mosteiro:
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). Theor. Comput. Sci. 472: 60-80 (2013) - [c24]Antonio Fernández Anta, Dariusz R. Kowalski, Miguel A. Mosteiro, Prudence W. H. Wong:
Station Assignment with Applications to Sensing. ALGOSENSORS 2013: 155-169 - [c23]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez:
Reputation-Based Mechanisms for Evolutionary Master-Worker Computing. OPODIS 2013: 98-113 - [i8]Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Power-efficient Assignment of Virtual Machines to Physical Machines. CoRR abs/1304.7121 (2013) - [i7]Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion. CoRR abs/1307.1650 (2013) - [i6]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez:
Reputation-based Mechanisms for Evolutionary Master-Worker Computing. CoRR abs/1307.2783 (2013) - 2012
- [j6]Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Comput. 25(4): 279-296 (2012) - [j5]Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Deterministic recurrent communication in restricted Sensor Networks. Theor. Comput. Sci. 418: 37-47 (2012) - [c22]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez:
Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics. Euro-Par 2012: 451-463 - [c21]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN 2012: 303-314 - [c20]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez:
Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics. PODC 2012: 225-226 - 2011
- [j4]Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. Discret. Math. Theor. Comput. Sci. 13(1): 95-112 (2011) - [c19]Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro:
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. CCCG 2011 - [c18]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication. NCA 2011: 275-280 - [c17]Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. OPODIS 2011: 513-527 - [c16]Miguel A. Mosteiro, Antonio Fernández Anta, Jorge Ramón Muñoz:
Unbounded contention resolution in multiple-access channels. PODC 2011: 211-212 - [c15]Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication. DISC 2011: 147-149 - [c14]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. DISC 2011: 202-204 - [c13]Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz:
Unbounded Contention Resolution in Multiple-Access Channels. DISC 2011: 225-236 - [i5]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. CoRR abs/1105.6151 (2011) - [i4]Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro:
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. CoRR abs/1106.4927 (2011) - [i3]Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz:
Unbounded Contention Resolution in Multiple-Access Channels. CoRR abs/1107.0234 (2011) - [i2]Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. CoRR abs/1109.4373 (2011) - 2010
- [j3]Antonio Fernández Anta, Miguel A. Mosteiro:
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. Discret. Math. Algorithms Appl. 2(4): 445-456 (2010) - [c12]Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. ALGOSENSORS 2010: 62-73 - [c11]Antonio Fernández Anta, Miguel A. Mosteiro:
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. COCOON 2010: 378-388 - [c10]Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers. IPDPS 2010: 1-11 - [c9]Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. DISC 2010: 374-388
2000 – 2009
- 2009
- [j2]Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Bootstrapping a hop-optimal network in the weak sensor model. ACM Trans. Algorithms 5(4): 37:1-37:30 (2009) - [c8]Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. PRDC 2009: 357-364 - 2008
- [c7]Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Designing Mechanisms for Reliable Internet-based Computing. NCA 2008: 315-324 - [c6]Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. DISC 2008: 504-506 - 2007
- [c5]Martin Farach-Colton, Miguel A. Mosteiro:
Sensor Network Gossiping or How to Break the Broadcast Lower Bound. ISAAC 2007: 232-243 - [c4]Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Deterministic Communication in the Weak Sensor Model. OPODIS 2007: 119-131 - [c3]Martin Farach-Colton, Miguel A. Mosteiro:
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. WADS 2007: 565-576 - 2006
- [j1]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006) - [c2]Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Lower Bounds for Clear Transmissions in Radio Networks. LATIN 2006: 447-454 - 2005
- [c1]Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. ESA 2005: 827-838 - 2004
- [i1]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). CoRR cs.DS/0407003 (2004)
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-09-11 00:33 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:
