default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPanagiota Fatourou
Person information
- affiliation: University of Crete, Greece
- affiliation (former): University of Ioannina, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c54]Panagiota Fatourou, Nikos Giachoudis, George Mallis:
Highly-Efficient Persistent FIFO Queues. SIROCCO 2024: 238-261- [c53]Panagiota Fatourou, Eric Ruppert:
Lock-Free Augmented Trees. DISC 2024: 23:1-23:24 - [i21]Panagiota Fatourou, Nikos Giachoudis, George Mallis:
Highly-Efficient Persistent FIFO Queues. CoRR abs/2402.17674 (2024) - [i20]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou, Odysseas Makridakis, Christi Symeonidou:
Efficient Distributed Data Structures for Future Many-core Architectures. CoRR abs/2404.05515 (2024) - [i19]Panagiota Fatourou, Eric Ruppert:
Lock-Free Augmented Trees. CoRR abs/2405.10506 (2024) - 2023
- [j28]Manos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, Botao Peng:
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search. Proc. VLDB Endow. 16(5): 1140-1153 (2023) - [c52]Panagiota Fatourou
:
Parallel and Distributed Data Series Processing on Modern and Emerging Hardware. MEDES 2023: 399-407 - [c51]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP 2023: 66-78 - [c50]Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, George Paterakis:
FreSh: A Lock-Free Data Series Index. SRDS 2023: 209-220 - [i18]Manos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, Botao Peng:
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search. CoRR abs/2301.11049 (2023) - [i17]Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, George Paterakis:
FreSh: A Lock-Free Data Series Index. CoRR abs/2310.11602 (2023) - [i16]Panagiota Fatourou:
Parallel and Distributed Data Series Processing on Modern and Emerging Hardware. CoRR abs/2310.14101 (2023) - 2022
- [j27]Tommaso Di Noia, Nava Tintarev, Panagiota Fatourou, Markus Schedl:
Recommender systems under European AI regulations. Commun. ACM 65(4): 69-73 (2022) - [j26]Karima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos, Themis Palpanas, Houda Benbrahim:
Hercules Against Data Series Similarity Search. Proc. VLDB Endow. 15(10): 2005-2018 (2022) - [c49]Panagiota Fatourou:
Recoverable Computing (Invited Talk). OPODIS 2022: 2:1-2:2 - [c48]Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When is Recoverable Consensus Harder Than Consensus? PODC 2022: 198-208 - [c47]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Detectable recovery of lock-free data structures. PPoPP 2022: 262-277 - [c46]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas:
The performance power of software combining in persistence. PPoPP 2022: 337-352 - [d3]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking: PPoPP 22 - Detectable Recovery of Lock-Free Data Structures. Zenodo, 2022
- [d2]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact). Zenodo, 2022 - [i15]Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars:
An Efficient Wait-free Resizable Hash Table. CoRR abs/2204.09624 (2022) - [i14]Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When Is Recoverable Consensus Harder Than Consensus? CoRR abs/2205.14213 (2022) - [i13]Karima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos, Themis Palpanas, Houda Benbrahim:
Hercules Against Data Series Similarity Search. CoRR abs/2212.13297 (2022) - [i12]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR abs/2212.13557 (2022) - 2021
- [j25]Botao Peng, Panagiota Fatourou, Themis Palpanas:
ParIS+: Data Series Indexing on Multi-Core Architectures. IEEE Trans. Knowl. Data Eng. 33(5): 2151-2164 (2021) - [j24]Botao Peng, Panagiota Fatourou, Themis Palpanas:
Fast data series indexing for in-memory data. VLDB J. 30(6): 1041-1067 (2021) - [c45]Vasilis Gavrielatos, Vijay Nagarajan, Panagiota Fatourou:
Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings. PaPoC@EuroSys 2021: 5:1-5:10 - [c44]Botao Peng, Panagiota Fatourou, Themis Palpanas:
SING: Sequence Indexing Using GPUs. ICDE 2021: 1883-1888 - [c43]Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun:
Constant-time snapshots with applications to concurrent data structures. PPoPP 2021: 31-46 - [c42]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. DISC 2021: 12:1-12:20 - [c41]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas:
Brief Announcement: Persistent Software Combining. DISC 2021: 56:1-56:4 - [d1]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
PPoPP 22 - Detectable Recovery of Lock-Free Data Structures. Zenodo, 2021 - [i11]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas:
Persistent Software Combining. CoRR abs/2107.03492 (2021) - [i10]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. CoRR abs/2108.02775 (2021) - [i9]Botao Peng, Panagiota Fatourou, Themis Palpanas:
Fast Data Series Indexing for In-Memory Data. CoRR abs/2110.07519 (2021) - 2020
- [j23]Panagiota Fatourou, Nikolaos D. Kallimanis:
The RedBlue family of universal constructions. Distributed Comput. 33(6): 485-513 (2020) - [j22]Panagiota Fatourou, Fernando Pedone:
Preface. Theor. Comput. Sci. 826-827: 1 (2020) - [c40]Botao Peng, Panagiota Fatourou, Themis Palpanas:
MESSI: In-Memory Data Series Indexing. ICDE 2020: 337-348 - [c39]Hagit Attiya, Panagiota Fatourou, Sandeep Hans, Eleni Kanellou:
Staleness and Local Progress in Transactional Memory. NETYS 2020: 227-243 - [c38]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures. SPAA 2020: 503-505 - [i8]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou:
An Efficient Universal Construction for Large Objects. CoRR abs/2001.03457 (2020) - [i7]Nikos Batsaras, Giorgos Saloustros, Anastasios Papagiannis, Panagiota Fatourou, Angelos Bilas:
VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores. CoRR abs/2003.00103 (2020) - [i6]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. CoRR abs/2007.02372 (2020) - [i5]Botao Peng, Panagiota Fatourou, Themis Palpanas:
ParIS+: Data Series Indexing on Multi-Core Architectures. CoRR abs/2009.00166 (2020) - [i4]Botao Peng, Panagiota Fatourou, Themis Palpanas:
MESSI: In-Memory Data Series Indexing. CoRR abs/2009.00786 (2020)
2010 – 2019
- 2019
- [j21]Panagiota Fatourou, Chris Hankin:
Welcome to the Europe region special section. Commun. ACM 62(4): 28 (2019) - [j20]Panagiota Fatourou, Yota Papageorgiou, Vasiliki Petousi:
Women are needed in STEM: European policies and incentives. Commun. ACM 62(4): 52 (2019) - [j19]Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui:
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live. J. ACM 66(1): 2:1-2:66 (2019) - [c37]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou:
An Efficient Universal Construction for Large Objects. OPODIS 2019: 18:1-18:15 - [c36]Panagiota Fatourou, Elias Papavasileiou, Eric Ruppert:
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. SPAA 2019: 275-286 - [c35]Diego Didona, Panagiota Fatourou, Rachid Guerraoui, Jingjing Wang, Willy Zwaenepoel:
Distributed Transactional Systems Cannot Be Fast. SPAA 2019: 369-380 - [i3]Diego Didona, Panagiota Fatourou, Rachid Guerraoui, Jingjing Wang, Willy Zwaenepoel:
Distributed Transactional Systems Cannot Be Fast. CoRR abs/1903.09106 (2019) - [i2]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR abs/1905.13600 (2019) - 2018
- [c34]Botao Peng, Panagiota Fatourou, Themis Palpanas:
ParIS: The Next Destination for Fast Data Series Indexing and Query Answering. IEEE BigData 2018: 791-800 - [c33]Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars:
An Efficient Wait-free Resizable Hash Table. SPAA 2018: 111-120 - [i1]Panagiota Fatourou, Eric Ruppert:
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. CoRR abs/1805.04779 (2018) - 2017
- [j18]Panagiota Fatourou, Nikolaos D. Kallimanis:
Lower and upper bounds for single-scanner snapshot implementations. Distributed Comput. 30(4): 231-260 (2017) - [j17]Panagiota Fatourou, Yiannis Nikolakopoulos, Marina Papatriantafilou:
Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues. Parallel Process. Lett. 27(2): 1750001:1-1750001:17 (2017) - [c32]Panagiota Fatourou, Nikolaos D. Kallimanis:
Lock Oscillation: Boosting the Performance of Concurrent Data Structures. OPODIS 2017: 8:1-8:17 - [c31]Panagiota Fatourou:
Concurrency for the Masses: The Paradigm of Software Transactional Memory. SYNASC 2017: 17-22 - [e2]Panagiota Fatourou, Ernesto Jiménez, Fernando Pedone:
20th International Conference on Principles of Distributed Systems, OPODIS 2016, December 13-16, 2016, Madrid, Spain. LIPIcs 70, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-031-6 [contents] - 2016
- [j16]Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. 29(4): 251-277 (2016) - [j15]Panagiota Fatourou, Eleni Kanellou, Eleftherios Kosmas, Md Forhad Rabbi:
WFR-TM: Wait-free readers without sacrificing speculation of writers. J. Parallel Distributed Comput. 96: 134-151 (2016) - [c30]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou, Odysseas Makridakis, Christi Symeonidou:
Efficient Distributed Data Structures for Future Many-Core Architectures. ICPADS 2016: 835-842 - [r2]Panagiota Fatourou:
Schedulers for Optimistic Rate Based Flow Control. Encyclopedia of Algorithms 2016: 1893-1897 - 2015
- [j14]Panagiota Fatourou, Stefan Schmid:
Distributed Computing. Bull. EATCS 115 (2015) - [j13]Panagiota Fatourou:
Maurice Herlihy's 60th Birthday Celebration. Bull. EATCS 116 (2015) - [p3]Dmytro Dziuma, Panagiota Fatourou, Eleni Kanellou:
Consistency for Transactional Memory Computing. Transactional Memory 2015: 3-31 - [p2]Hagit Attiya, Panagiota Fatourou:
Disjoint-Access Parallelism in Software Transactional Memory. Transactional Memory 2015: 72-97 - [p1]Panagiota Fatourou, Mykhailo Iaremko, Eleni Kanellou, Eleftherios Kosmas:
Algorithmic Techniques in STM Design. Transactional Memory 2015: 101-126 - 2014
- [j12]Dmytro Dziuma, Panagiota Fatourou, Eleni Kanellou:
Consistency for Transactional Memory Computing. Bull. EATCS 113 (2014) - [j11]Panagiota Fatourou, Nikolaos D. Kallimanis:
Highly-Efficient Wait-Free Synchronization. Theory Comput. Syst. 55(3): 475-520 (2014) - [c29]Hillel Avni, Shlomi Dolev, Panagiota Fatourou, Eleftherios Kosmas:
Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions. NETYS 2014: 25-40 - [c28]Panagiota Fatourou, Eleni Kanellou, Eleftherios Kosmas, Md Forhad Rabbi:
WFR-TM: Wait-Free Readers without Sacrificing Speculation of Writers. OPODIS 2014: 420-436 - [c27]Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert:
The amortized complexity of non-blocking binary search trees. PODC 2014: 332-340 - [c26]Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui:
The PCL theorem: transactions cannot be parallel, consistent and live. SPAA 2014: 178-187 - [c25]Panagiota Fatourou, Nikolaos D. Kallimanis:
The Power of Scheduling-Aware Synchronization. DISC 2014: 533-534 - 2013
- [j10]Sergio Rajsbaum, Michel Raynal, Panagiota Fatourou:
An Introductory Tutorial to Concurrency-Related Distributed Recursion. Bull. EATCS 111 (2013) - [e1]Panagiota Fatourou, Gadi Taubenfeld:
ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013. ACM 2013, ISBN 978-1-4503-2065-8 [contents] - 2012
- [c24]Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom. PODC 2012: 115-124 - [c23]Panagiota Fatourou, Nikolaos D. Kallimanis:
Revisiting the combining synchronization technique. PPoPP 2012: 257-266 - 2011
- [j9]Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The complexity of updating snapshot objects. J. Parallel Distributed Comput. 71(12): 1570-1577 (2011) - [c22]Kunal Agarwal, Panagiota Fatourou, Arnold L. Rosenberg, Frédéric Vivien:
Introduction. Euro-Par (2) 2011: 224-225 - [c21]Panagiota Fatourou, Nikolaos D. Kallimanis:
A highly-efficient wait-free universal construction. SPAA 2011: 325-334 - 2010
- [j8]Panagiota Fatourou:
The Distributed Computing Column. Bull. EATCS 102: 83 (2010) - [c20]Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel:
Non-blocking binary search trees. PODC 2010: 131-140
2000 – 2009
- 2009
- [c19]Panagiota Fatourou, Nikolaos D. Kallimanis:
The RedBlue Adaptive Universal Constructions. DISC 2009: 127-141 - 2008
- [j7]Faith Ellen, Panagiota Fatourou, Eric Ruppert:
The space complexity of unbounded timestamps. Distributed Comput. 21(2): 103-115 (2008) - [r1]Panagiota Fatourou:
Schedulers for Optimistic Rate Based Flow Control. Encyclopedia of Algorithms 2008 - 2007
- [j6]Faith Ellen, Panagiota Fatourou, Eric Ruppert:
Time lower bounds for implementations of multi-writer snapshots. J. ACM 54(6): 30 (2007) - [c18]Panagiota Fatourou, Nikolaos D. Kallimanis:
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. PODC 2007: 33-42 - [c17]Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319 - [c16]Faith Ellen, Panagiota Fatourou, Eric Ruppert:
The Space Complexity of Unbounded Timestamps. DISC 2007: 223-237 - 2006
- [j5]James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer:
Eight Open Problems in Distributed Computing. Bull. EATCS 90: 109-126 (2006) - [c15]Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The Complexity of Updating Multi-writer Snapshot Objects. ICDCN 2006: 319-330 - [c14]Panagiota Fatourou, Nikolaos D. Kallimanis:
Single-scanner multi-writer snapshot implementations are fast! PODC 2006: 228-237 - [c13]Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert:
Time-space tradeoffs for implementations of snapshots. STOC 2006: 169-178 - 2005
- [j4]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Max-min Fair Flow Control Sensitive to Priorities. J. Interconnect. Networks 6(2): 85-114 (2005) - [j3]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. SIAM J. Comput. 34(5): 1216-1252 (2005) - 2004
- [j2]Panagiota Fatourou, Maurice Herlihy:
Read-modify-write networks. Distributed Comput. 17(1): 33-46 (2004) - 2003
- [c12]Panagiota Fatourou, Faith E. Fich, Eric Ruppert:
A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC 2003: 259-268 - 2002
- [c11]Panagiota Fatourou, Faith E. Fich, Eric Ruppert:
Space-optimal multi-writer snapshot objects are slow. PODC 2002: 13-20 - 2001
- [c10]Panagiota Fatourou, Maurice Herlihy:
Adding networks. PODC 2001: 308-310 - [c9]Panagiota Fatourou:
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. SPAA 2001: 189-198 - [c8]Panagiota Fatourou, Maurice Herlihy:
Adding Networks. DISC 2001: 330-342 - 2000
- [j1]Panagiota Fatourou, Paul G. Spirakis:
Efficient Scheduling of Strict Multithreaded Computations. Theory Comput. Syst. 33(3): 173-232 (2000)
1990 – 1999
- 1999
- [b1]Panagiota Fatourou:
Αλγοριθμικές θεμελιώσεις ελέγχου ροής διά προσαρμογής του ρυθμού μετάδοσης. University of Patras, Greece, 1999 - [c7]Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura:
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. WAE 1999: 124-138 - [c6]Panagiota Fatourou, Paul G. Spirakis:
A New Scheduling Algorithm for General Strict Multithreaded Computations. DISC 1999: 297-311 - 1998
- [c5]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. PODC 1998: 311 - [c4]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. SIROCCO 1998: 244-258 - 1997
- [c3]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). PODC 1997: 139-148 - [c2]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Advances in Rate-Based Flow Control. SIROCCO 1997: 266-281 - 1996
- [c1]Panagiota Fatourou, Paul G. Spirakis:
Scheduling Algorithms for Strict Multithreaded Computations. ISAAC 1996: 407-416
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-31 20:17 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:
