default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Pavlogiannis
Person information
SPARQL queries 
🛈 Please note that only 70% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j24]Shankaranarayanan Krishna
, Aniket Lal, Andreas Pavlogiannis, Omkar Tuppe:
On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability. Proc. ACM Program. Lang. 8(POPL): 1239-1268 (2024)- [j23]Soham Chakraborty, Shankara Narayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
How Hard Is Weak-Memory Testing? Proc. ACM Program. Lang. 8(POPL): 1978-2009 (2024) - [c32]Wenyue Ma, Maximilian K. Egger, Andreas Pavlogiannis, Yuchen Li, Panagiotis Karras:
Reachability-Aware Fair Influence Maximization. APWeb/WAIM (3) 2024: 342-359 - [c31]Hünkar Can Tunç, Ameya Prashant Deshmukh, Berk Çirisci, Constantin Enea, Andreas Pavlogiannis:
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. ASPLOS (3) 2024: 223-238 - [c30]Zheng Shi, Umang Mathur, Andreas Pavlogiannis:
Optimistic Prediction of Synchronization-Reversal Data Races. ICSE 2024: 134:1-134:13 - [c29]Petros Petsinis, Andreas Pavlogiannis, Josef Tkadlec, Panagiotis Karras:
Seed Selection in the Heterogeneous Moran Process. IJCAI 2024: 2297-2305 - [c28]Petros Petsinis, Kaichen Zhang, Andreas Pavlogiannis, Jingbo Zhou, Panagiotis Karras:
Robust Reward Placement under Uncertainty. IJCAI 2024: 6770-6778 - [c27]Giovanna Kobus Conrado, Andreas Pavlogiannis:
A Better Approximation for Interleaved Dyck Reachability. SOAP@PLDI 2024: 18-25 - [c26]Anna Blume Jakobsen, Rasmus Skibdahl Melanchton Jørgensen, Jaco van de Pol, Andreas Pavlogiannis:
Fast Symbolic Computation of Bottom SCCs. TACAS (3) 2024: 110-128 - [i36]Zheng Shi, Umang Mathur, Andreas Pavlogiannis:
Optimistic Prediction of Synchronization-Reversal Data Races. CoRR abs/2401.05642 (2024) - [i35]Hünkar Can Tunç, Ameya Prashant Deshmukh, Berk Çirisci, Constantin Enea, Andreas Pavlogiannis:
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. CoRR abs/2403.17818 (2024) - [i34]Petros Petsinis, Andreas Pavlogiannis, Josef Tkadlec, Panagiotis Karras:
Seed Selection in the Heterogeneous Moran Process. CoRR abs/2404.15986 (2024) - [i33]Petros Petsinis, Kaichen Zhang, Andreas Pavlogiannis, Jingbo Zhou, Panagiotis Karras:
Robust Reward Placement under Uncertainty. CoRR abs/2405.05433 (2024) - 2023
- [j22]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proc. ACM Program. Lang. 7(PLDI): 761-785 (2023) - [j21]Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. Proc. ACM Program. Lang. 7(PLDI): 1733-1758 (2023) - [c25]Petros Petsinis, Andreas Pavlogiannis, Panagiotis Karras:
Maximizing the Probability of Fixation in the Positional Voter Model. AAAI 2023: 12269-12277 - [c24]Casper Abild Larsen, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol, Andreas Pavlogiannis:
A Truly Symbolic Linear-Time Algorithm for SCC Decomposition. TACAS (2) 2023: 353-371 - [d3]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Zenodo, 2023
- [d2]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Zenodo, 2023 - [d1]Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. Zenodo, 2023 - [i32]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. CoRR abs/2304.03692 (2023) - [i31]Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. CoRR abs/2304.03714 (2023) - [i30]Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
How Hard is Weak-Memory Testing? CoRR abs/2311.04302 (2023) - [i29]Shankaranarayanan Krishna, Aniket Lal, Andreas Pavlogiannis, Omkar Tuppe:
On-The-Fly Static Analysis via Dynamic Bidirected Dyck Reachability. CoRR abs/2311.04319 (2023) - 2022
- [j20]Adam Husted Kjelstrøm, Andreas Pavlogiannis:
The decidability and complexity of interleaved bidirected Dyck reachability. Proc. ACM Program. Lang. 6(POPL): 1-26 (2022) - [j19]Andreas Pavlogiannis:
CFL/Dyck Reachability: An Algorithmic Perspective. ACM SIGLOG News 9(4): 5-25 (2022) - [c23]Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis, Asger Ullersted Rasmussen, Josef Tkadlec:
Fixation Maximization in the Positional Moran Process. AAAI 2022: 9304-9312 - [c22]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
A tree clock data structure for causal orderings in concurrent executions. ASPLOS 2022: 710-725 - [c21]Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche:
Reachability in Bidirected Pushdown VASS. ICALP 2022: 124:1-124:20 - [c20]Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec:
Invasion Dynamics in the Biased Voter Process. IJCAI 2022: 265-271 - [c19]Ali Ahmadi, Majid Daliri, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Efficient approximations for cache-conscious data placement. PLDI 2022: 857-871 - [c18]Umang Mathur, Andreas Pavlogiannis:
Dynamic data race prediction: fundamentals, theory, and practice (tutorial). ESEC/SIGSOFT FSE 2022: 1820 - [i28]Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis, Asger Ullersted Rasmussen, Josef Tkadlec:
Fixation Maximization in the Positional Moran Process. CoRR abs/2201.02248 (2022) - [i27]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions. CoRR abs/2201.06325 (2022) - [i26]Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec:
Invasion Dynamics in the Biased Voter Process. CoRR abs/2201.08207 (2022) - [i25]Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche:
Reachability in Bidirected Pushdown VASS. CoRR abs/2204.11799 (2022) - [i24]Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec:
Social Balance on Networks: Local Minima and Best Edge Dynamics. CoRR abs/2210.02394 (2022) - [i23]Petros Petsinis, Andreas Pavlogiannis, Panagiotis Karras:
Maximizing the Probability of Fixation in the Positional Voter Model. CoRR abs/2211.14676 (2022) - 2021
- [j18]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods Syst. Des. 57(3): 401-428 (2021) - [j17]Jakob Cetti Hansen, Adam Husted Kjelstrøm, Andreas Pavlogiannis:
Tight bounds for reachability problems on one-counter and pushdown systems. Inf. Process. Lett. 171: 106135 (2021) - [j16]Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The reads-from equivalence for the TSO and PSO memory models. Proc. ACM Program. Lang. 5(OOPSLA): 1-30 (2021) - [j15]Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Optimal prediction of synchronization-preserving races. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [j14]Anders Alnor Mathiasen, Andreas Pavlogiannis:
The fine-grained and parallel complexity of andersen's pointer analysis. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [c17]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking Under a Reads-Value-From Equivalence. CAV (1) 2021: 341-366 - [c16]Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis:
Dynamic Data-Race Detection Through the Fine-Grained Lens. CONCUR 2021: 16:1-16:23 - [c15]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Quantitative Verification on Product Graphs of Small Treewidth. FSTTCS 2021: 42:1-42:23 - [i22]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking under a Reads-Value-From Equivalence. CoRR abs/2105.06424 (2021) - [i21]Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis:
Dynamic Data-Race Detection through the Fine-Grained Lens. CoRR abs/2107.03569 (2021) - [i20]Adam Husted Kjelstrøm, Andreas Pavlogiannis:
The Decidability and Complexity of Interleaved Bidirected Dyck Reachability. CoRR abs/2111.05923 (2021) - 2020
- [j13]Andreas Pavlogiannis:
Fast, sound, and effectively complete dynamic race prediction. Proc. ACM Program. Lang. 4(POPL): 17:1-17:29 (2020) - [j12]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Limits on amplifiers of natural selection under death-Birth updating. PLoS Comput. Biol. 16(1) (2020) - [j11]Andreas Pavlogiannis, Nico Schaumberger, Ulrich Schmid, Krishnendu Chatterjee:
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3981-3992 (2020) - [c14]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. ATVA 2020: 253-270 - [c13]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. ESOP 2020: 112-140 - [c12]Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
The Complexity of Dynamic Data Race Prediction. LICS 2020: 713-727 - [i19]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. CoRR abs/2001.11070 (2020) - [i18]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. CoRR abs/2004.08828 (2020) - [i17]Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
The Complexity of Dynamic Data Race Prediction. CoRR abs/2004.14931 (2020) - [i16]Andreas Pavlogiannis:
The Fine-Grained Complexity of Andersen's Pointer Analysis. CoRR abs/2006.01491 (2020) - [i15]Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Optimal Prediction of Synchronization-Preserving Races. CoRR abs/2010.16385 (2020) - [i14]Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The Reads-From Equivalence for the TSO and PSO Memory Models. CoRR abs/2011.11763 (2020)
2010 – 2019
- 2019
- [j10]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric dynamic partial order reduction. Proc. ACM Program. Lang. 3(OOPSLA): 124:1-124:29 (2019) - [j9]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Nastaran Okati, Andreas Pavlogiannis:
Efficient parameterized algorithms for data packing. Proc. ACM Program. Lang. 3(POPL): 53:1-53:28 (2019) - [j8]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Trans. Program. Lang. Syst. 41(4): 23:1-23:46 (2019) - [i13]Andreas Pavlogiannis:
Fast, Sound and Effectively Complete Dynamic Race Detection. CoRR abs/1901.08857 (2019) - [i12]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric Dynamic Partial Order Reduction. CoRR abs/1909.00989 (2019) - [i11]Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis:
Optimal Dyck Reachability for Data-Dependence and Alias Analysis. CoRR abs/1910.00241 (2019) - 2018
- [j7]Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis:
Optimal Dyck reachability for data-dependence and alias analysis. Proc. ACM Program. Lang. 2(POPL): 30:1-30:30 (2018) - [j6]Marek Chalupa, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya:
Data-centric dynamic partial order reduction. Proc. ACM Program. Lang. 2(POPL): 31:1-31:30 (2018) - [j5]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
Automated competitive analysis of real-time scheduling with graph games. Real Time Syst. 54(1): 166-207 (2018) - [j4]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Trans. Program. Lang. Syst. 40(3): 9:1-9:43 (2018) - [i10]Andreas Pavlogiannis, Josef Tkadlec, Krishnendu Chatterjee, Martin A. Nowak:
Strong Amplifiers of Natural Selection: Proofs. CoRR abs/1802.02509 (2018) - [i9]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Fixation probability and fixation time in structured populations. CoRR abs/1810.02687 (2018) - 2017
- [c11]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
JTDec: A Tool for Tree Decompositions in Soot. ATVA 2017: 59-66 - [c10]Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis:
Faster Algorithms for Weighted Recursive State Machines. ESOP 2017: 287-313 - [i8]Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis:
Faster Algorithms for Weighted Recursive State Machines. CoRR abs/1701.04914 (2017) - 2016
- [c9]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. ESA 2016: 28:1-28:17 - [c8]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL 2016: 733-747 - [i7]Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya:
Data-centric Dynamic Partial Order Reduction. CoRR abs/1610.01188 (2016) - 2015
- [c7]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CAV (1) 2015: 140-157 - [c6]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. POPL 2015: 97-109 - [c5]Krishnendu Chatterjee, Andreas Pavlogiannis, Yaron Velner:
Quantitative Interprocedural Analysis. POPL 2015: 539-551 - [i6]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CoRR abs/1504.07384 (2015) - [i5]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. CoRR abs/1510.07565 (2015) - 2014
- [j3]Krishnendu Chatterjee, Andreas Pavlogiannis, Ben Adlam, Martin A. Nowak:
The Time Scale of Evolutionary Innovation. PLoS Comput. Biol. 10(9) (2014) - [c4]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. RTSS 2014: 118-127 - [i4]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. CoRR abs/1409.2291 (2014) - [i3]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. CoRR abs/1410.7724 (2014) - 2013
- [j2]Andreas Pavlogiannis, Vadim Mozhayskiy, Ilias Tagkopoulos:
A flood-based information flow analysis and network minimization method for gene regulatory networks. BMC Bioinform. 14: 137 (2013) - [c3]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Andreas Pavlogiannis:
Distributed synthesis for LTL fragments. FMCAD 2013: 18-25 - 2011
- [j1]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46): 6469-6483 (2011) - [c2]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively mobile communicating machines that use restricted space. FOMC 2011: 6-15 - 2010
- [c1]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. MFCS 2010: 270-281 - [i2]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively Mobile Communicating Logarithmic Space Machines. CoRR abs/1004.3395 (2010) - [i1]Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis:
Passively Mobile Communicating Machines that Use Restricted Space. CoRR abs/1012.2440 (2010)
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-12-10 20:39 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:
