default search action
Paraschos Koutris
Paris Koutris
Person information
- affiliation: University of Wisconsin, Madison, WI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j29]Hangdong Zhao
, Austen Z. Fan
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. Proc. ACM Manag. Data 2(2): 75 (2024) - [j28]Paraschos Koutris
Consistent Query Answering for Primary Keys on Rooted Tree Queries. Proc. ACM Manag. Data 2(2): 76 (2024) - [j27]Austen Z. Fan
Tight Bounds of Circuits for Sum-Product Queries. Proc. ACM Manag. Data 2(2): 87 (2024) - [j26]Hangdong Zhao
Evaluating Datalog over Semirings: A Grounding-based Approach. Proc. ACM Manag. Data 2(2): 90 (2024) - [j25]Xiao Hu
Topology-aware Parallel Joins. Proc. ACM Manag. Data 2(2): 97 (2024) - [c54]Yifei Yang, Hangdong Zhao, Xiangyao Yu, Paraschos Koutris:
Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries. CIDR 2024 - [c53]Hangdong Zhao, Paraschos Koutris, Shaleen Deep:
Evaluating Datalog via Structure-Aware Rewriting. Datalog 2024: 48-53 - [c52]Song Bian, Xiating Ouyang, Zhiwei Fan, Paraschos Koutris:
Naive Bayes Classifiers over Missing Data: Decision and Poisoning. ICML 2024 - [i38]Hangdong Zhao, Shaleen Deep, Paraschos Koutris, Sudeepa Roy, Val Tannen:
Evaluating Datalog over Semirings: A Grounding-based Approach. CoRR abs/2403.12436 (2024) - [i37]Shaleen Deep, Hangdong Zhao, Austen Z. Fan, Paraschos Koutris:
Output-sensitive Conjunctive Query Evaluation. CoRR abs/2406.07847 (2024) - 2023
- [j24]Zhiwei Fan
LinCQA: Faster Consistent Query Answering with Linear Time Guarantees. Proc. ACM Manag. Data 1(1): 38:1-38:25 (2023) - [j23]Paraschos Koutris
The Fine-Grained Complexity of CFL Reachability. Proc. ACM Program. Lang. 7(POPL): 1713-1739 (2023) - [c51]Austen Z. Fan, Paraschos Koutris, Hangdong Zhao:
The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. ICALP 2023: 127:1-127:20 - [c50]Hangdong Zhao
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. PODS 2023: 59-68 - [c49]Shaleen Deep, Xiao Hu, Paraschos Koutris:
General Space-Time Tradeoffs via Relational Queries. WADS 2023: 309-325 - [i36]Song Bian, Xiating Ouyang, Zhiwei Fan, Paraschos Koutris:
Certifiable Robustness for Naive Bayes Classifiers. CoRR abs/2303.04811 (2023) - [i35]Hangdong Zhao, Shaleen Deep, Paraschos Koutris:
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. CoRR abs/2304.06221 (2023) - [i34]Austen Z. Fan, Paraschos Koutris, Hangdong Zhao:
The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. CoRR abs/2304.14557 (2023) - [i33]Yifei Yang, Hangdong Zhao, Xiangyao Yu, Paraschos Koutris:
Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries. CoRR abs/2307.15255 (2023) - [i32]Paraschos Koutris, Shaleen Deep:
The Fine-Grained Complexity of CFL Reachability. CoRR abs/2308.09284 (2023) - [i31]Paraschos Koutris, Xiating Ouyang, Jef Wijsen:
Consistent Query Answering for Primary Keys on Path Queries. CoRR abs/2309.15270 (2023) - [i30]Hangdong Zhao, Austen Z. Fan, Xiating Ouyang, Paraschos Koutris:
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. CoRR abs/2310.05385 (2023) - [i29]Paraschos Koutris, Xiating Ouyang, Jef Wijsen:
Consistent Query Answering for Primary Keys on Rooted Tree Queries. CoRR abs/2310.19642 (2023) - 2022
- [j22]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Stratis Viglas, Jeffrey F. Naughton:
Comprehensive and Efficient Workload Summarization. Datenbank-Spektrum 22(3): 249-256 (2022) - [j21]Bas Ketsman
Modern Datalog Engines. Found. Trends Databases 12(1): 1-68 (2022) - [j20]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Ranked Enumeration of Join Queries with Projections. Proc. VLDB Endow. 15(5): 1024-1037 (2022) - [c48]Zhiwei Fan, Sunil Mallireddy, Paraschos Koutris:
Towards Better Understanding of the Performance and Design of Datalog Systems. Datalog 2022: 166-180 - [c47]Bruhathi Sundarmurthy, Harshad Deshmukh, Paris Koutris, Jeffrey F. Naughton:
Salvaging failing and straggling queries. ICDE 2022: 1382-1395 - [c46]Austen Z. Fan, Paraschos Koutris:
Certifiable Robustness for Nearest Neighbor Classifiers. ICDT 2022: 6:1-6:20 - [c45]Youmin Chen, Xiangyao Yu, Paraschos Koutris, Andrea C. Arpaci-Dusseau
Plor: General Transactions with Predictable, Low Tail Latency. SIGMOD Conference 2022: 19-33 - [i28]Austen Z. Fan, Paraschos Koutris:
Certifiable Robustness for Nearest Neighbor Classifiers. CoRR abs/2201.04770 (2022) - [i27]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Ranked Enumeration of Join Queries with Projections. CoRR abs/2201.05566 (2022) - [i26]Zhiwei Fan, Paraschos Koutris, Xiating Ouyang, Jef Wijsen:
LinCQA: Faster Consistent Query Answering with Linear Time Guarantees. CoRR abs/2208.12339 (2022) - 2021
- [j19]Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys in Datalog. Theory Comput. Syst. 65(1): 122-178 (2021) - [c44]Shaleen Deep, Paraschos Koutris:
Ranked Enumeration of Conjunctive Query Results. ICDT 2021: 5:1-5:19 - [c43]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Enumeration Algorithms for Conjunctive Queries with Projection. ICDT 2021: 14:1-14:17 - [c42]Bruhathi Sundarmurthy, Paraschos Koutris, Jeffrey F. Naughton:
Locality-Aware Distribution Schemes. ICDT 2021: 22:1-22:25 - [c41]Xiao Hu, Paraschos Koutris, Spyros Blanas:
Algorithms for a Topology-aware Massively Parallel Computation Model. PODS 2021: 199-214 - [c40]Paraschos Koutris, Xiating Ouyang
Consistent Query Answering for Primary Keys on Path Queries. PODS 2021: 215-232 - [i25]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Enumeration Algorithms for Conjunctive Queries with Projection. CoRR abs/2101.03712 (2021) - [i24]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Space-Time Tradeoffs for Answering Boolean Conjunctive Queries. CoRR abs/2109.10889 (2021) - 2020
- [j18]Bas Ketsman
Distribution Policies for Datalog. Theory Comput. Syst. 64(5): 965-998 (2020) - [j17]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Jeffrey F. Naughton, Stratis Viglas:
Comprehensive and Efficient Workload Compression. Proc. VLDB Endow. 14(3): 418-430 (2020) - [c39]Spyros Blanas, Paraschos Koutris, Anastasios Sidiropoulos:
Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale. CIDR 2020 - [c38]Haojun Zhang, Chengliang Chai, AnHai Doan, Paris Koutris, Esteban Arcaute:
Manually Detecting Errors for Data Cleaning Using Adaptive Crowdsourcing Strategies. EDBT 2020: 311-322 - [c37]Paraschos Koutris, Jef Wijsen:
First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys. PODS 2020: 113-129 - [c36]Zhiwei Fan, Rathijit Sen, Paraschos Koutris, Aws Albarghouthi:
Automated tuning of query degree of parallelism via machine learning. aiDM@SIGMOD 2020: 2:1-2:4 - [c35]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Fast Join Project Query Evaluation using Matrix Multiplication. SIGMOD Conference 2020: 1213-1223 - [i23]Bruhathi Sundarmurthy, Harshad Deshmukh, Paris Koutris, Jeffrey F. Naughton:
Providing Insights for Queries affected by Failures and Stragglers. CoRR abs/2002.01531 (2020) - [i22]Shaleen Deep, Xiao Hu, Paraschos Koutris:
Fast Join Project Query Evaluation using Matrix Multiplication. CoRR abs/2002.12459 (2020) - [i21]Zhiwei Fan, Rathijit Sen, Paraschos Koutris, Aws Albarghouthi:
A Comparative Exploration of ML Techniques for Tuning Query Degree of Parallelism. CoRR abs/2005.08439 (2020) - [i20]Xiao Hu, Paraschos Koutris, Spyros Blanas:
Algorithms for a Topology-aware Massively Parallel Computation Model. CoRR abs/2009.11463 (2020) - [i19]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Jeffrey F. Naughton, Stratis Viglas:
Comprehensive and Efficient Workload Compression. CoRR abs/2011.05549 (2020)
2010 – 2019
- 2019
- [j16]Zhiwei Fan, Jianqiao Zhu, Zuyu Zhang, Aws Albarghouthi, Paraschos Koutris, Jignesh M. Patel:
Scaling-Up In-Memory Datalog Processing: Observations and Techniques. Proc. VLDB Endow. 12(6): 695-708 (2019) - [j15]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. Proc. VLDB Endow. 13(1): 1-14 (2019) - [c34]Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys in Logspace. ICDT 2019: 23:1-23:19 - [c33]Mikhail Yurochkin, Zhiwei Fan, Aritra Guha, Paraschos Koutris, XuanLong Nguyen:
Scalable inference of topic evolution via models for latent geometric structures. NeurIPS 2019: 5949-5959 - [c32]Lingjiao Chen, Paraschos Koutris, Arun Kumar:
Towards Model-based Pricing for Machine Learning in a Data Marketplace. SIGMOD Conference 2019: 1535-1552 - [c31]Lingjiao Chen, Hongyi Wang, Leshang Chen, Paraschos Koutris, Arun Kumar:
Demonstration of Nimbus: Model-based Pricing for Machine Learning in a Data Marketplace. SIGMOD Conference 2019: 1885-1888 - [i18]Shaleen Deep, Paraschos Koutris:
Ranked Enumeration of Conjunctive Query Results. CoRR abs/1902.02698 (2019) - [i17]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. CoRR abs/1909.00845 (2019) - 2018
- [j14]Paraschos Koutris, Semih Salihoglu, Dan Suciu
Algorithmic Aspects of Parallel Data Processing. Found. Trends Databases 8(4): 239-370 (2018) - [c30]Bas Ketsman
Distribution Policies for Datalog. ICDT 2018: 17:1-17:22 - [c29]Lingjiao Chen, Hongyi Wang, Jinman Zhao, Dimitris S. Papailiopoulos, Paraschos Koutris:
The Effect of Network Width on the Performance of Large-batch Training. NeurIPS 2018: 9322-9332 - [c28]Paraschos Koutris, Jef Wijsen
Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms. PODS 2018: 209-224 - [c27]Shaleen Deep, Paraschos Koutris:
Compressed Representations of Conjunctive Query Results. PODS 2018: 307-322 - [c26]Bruhathi Sundarmurthy, Paraschos Koutris, Jeffrey F. Naughton:
Exploiting Data Partitioning To Provide Approximate Results. BeyondMR@SIGMOD 2018: 5:1-5:5 - [c25]Paris Koutris, Semih Salihoglu, Dan Suciu
Algorithmic Aspects of Parallel Query Processing. SIGMOD Conference 2018: 1659-1664 - [c24]Xujie Si, Woosuk Lee, Richard Zhang, Aws Albarghouthi, Paraschos Koutris, Mayur Naik:
Syntax-guided synthesis of Datalog programs. ESEC/SIGSOFT FSE 2018: 515-527 - [i16]Lingjiao Chen, Paraschos Koutris, Arun Kumar:
Model-based Pricing for Machine Learning in a Data Marketplace. CoRR abs/1805.11450 (2018) - [i15]Lingjiao Chen, Hongyi Wang, Jinman Zhao, Dimitris S. Papailiopoulos, Paraschos Koutris:
The Effect of Network Width on the Performance of Large-batch Training. CoRR abs/1806.03791 (2018) - [i14]Mikhail Yurochkin, Zhiwei Fan, Aritra Guha, Paraschos Koutris, XuanLong Nguyen:
Streaming dynamic and distributed inference of latent geometric structures. CoRR abs/1809.08738 (2018) - [i13]Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys in Logspace. CoRR abs/1810.03386 (2018) - [i12]Zhiwei Fan, Jianqiao Zhu, Zuyu Zhang, Aws Albarghouthi, Paraschos Koutris, Jignesh M. Patel:
Scaling-Up In-Memory Datalog Processing: Observations and Techniques. CoRR abs/1812.03975 (2018) - 2017
- [j13]Paul Beame
Communication Steps for Parallel Query Processing. J. ACM 64(6): 40:1-40:58 (2017) - [j12]Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis
Energy-efficient broadcasting in ad hoc wireless networks. J. Discrete Algorithms 42: 2-13 (2017) - [j11]Paraschos Koutris, Tova Milo, Sudeepa Roy, Dan Suciu
Answering Conjunctive Queries with Inequalities. Theory Comput. Syst. 61(1): 2-30 (2017) - [j10]Shaleen Deep, Paris Koutris, Yash Bidasaria:
QIRANA Demonstration: Real time Scalable Query Pricing. Proc. VLDB Endow. 10(12): 1949-1952 (2017) - [j9]Foto N. Afrati, Jan Hidders, Paraschos Koutris, Jacek Sroka, Jeffrey D. Ullman:
Report from the Fourth Workshop on Algorithms andSystems for MapReduce and Beyond (BeyondMR '17). SIGMOD Rec. 46(4): 44-48 (2017) - [j8]Paraschos Koutris, Jef Wijsen
Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. ACM Trans. Database Syst. 42(2): 9:1-9:45 (2017) - [c23]Aws Albarghouthi, Paraschos Koutris, Mayur Naik, Calvin Smith:
Constraint-Based Synthesis of Datalog Programs. CP 2017: 689-706 - [c22]Shaleen Deep, Paraschos Koutris:
The Design of Arbitrage-Free Data Pricing Schemes. ICDT 2017: 12:1-12:18 - [c21]Bruhathi Sundarmurthy, Paraschos Koutris, Willis Lang, Jeffrey F. Naughton, Val Tannen:
m-tables: Representing Missing Data. ICDT 2017: 21:1-21:20 - [c20]Lingjiao Chen, Paraschos Koutris, Arun Kumar:
Model-based Pricing: Do Not Pay for More than What You Learn! DEEM@SIGMOD 2017: 1:1-1:4 - [c19]Shaleen Deep, Paraschos Koutris:
QIRANA: A Framework for Scalable Query Pricing. SIGMOD Conference 2017: 699-713 - [i11]Shaleen Deep, Paraschos Koutris:
Compressed Representations of Conjunctive Query Results. CoRR abs/1709.06186 (2017) - 2016
- [j7]Xu Chu, Ihab F. Ilyas, Paraschos Koutris:
Distributed Data Deduplication. Proc. VLDB Endow. 9(11): 864-875 (2016) - [j6]Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys. SIGMOD Rec. 45(1): 15-22 (2016) - [j5]Paraschos Koutris, Dan Suciu
A Guide to Formal Analysis of Join Processing in Massively Parallel Systems. SIGMOD Rec. 45(4): 18-27 (2016) - [c18]Paraschos Koutris, Paul Beame, Dan Suciu
Worst-Case Optimal Algorithms for Parallel Query Processing. ICDT 2016: 8:1-8:18 - [c17]Paraschos Koutris, Nivetha Singara Vadivelu:
Deterministic load balancing for parallel joins. BeyondMR@SIGMOD 2016: 10 - [i10]Paul Beame, Paraschos Koutris, Dan Suciu:
Communication Cost in Parallel Query Processing. CoRR abs/1602.06236 (2016) - [i9]Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris Sakavalas:
k-shot Broadcasting in Ad Hoc Radio Networks. CoRR abs/1603.08393 (2016) - [i8]Paul Beame, Paraschos Koutris, Dan Suciu:
Worst-Case Optimal Algorithms for Parallel Query Processing. CoRR abs/1604.01848 (2016) - [i7]Shaleen Deep, Paraschos Koutris:
The Design of Arbitrage-Free Data Pricing Schemes. CoRR abs/1606.09376 (2016) - 2015
- [b1]Paraschos Koutris:
Query Processing for Massively Parallel Systems. University of Washington, USA, 2015 - [j4]Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe
Query-Based Data Pricing. J. ACM 62(5): 43:1-43:44 (2015) - [j3]Foto N. Afrati, Paraschos Koutris, Dan Suciu
Parallel Skyline Queries. Theory Comput. Syst. 57(4): 1008-1037 (2015) - [c16]Paraschos Koutris, Tova Milo, Sudeepa Roy, Dan Suciu
Answering Conjunctive Queries with Inequalities. ICDT 2015: 76-93 - [c15]Paraschos Koutris, Jef Wijsen
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. PODS 2015: 17-29 - [i6]Paraschos Koutris, Jef Wijsen:
A Trichotomy in the Data Complexity of Certain Query Answering for Conjunctive Queries. CoRR abs/1501.07864 (2015) - 2014
- [j2]Dimitris Fotakis
Online Sum-Radii Clustering. Theor. Comput. Sci. 540: 27-39 (2014) - [c14]Paraschos Koutris, Dan Suciu:
A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys. ICDT 2014: 165-176 - [c13]Paul Beame
Skew in parallel query processing. PODS 2014: 212-223 - [c12]Daniel Halperin
Demonstration of the Myria big data management service. SIGMOD Conference 2014: 881-884 - [i5]Paul Beame, Paraschos Koutris, Dan Suciu:
Skew in Parallel Query Processing. CoRR abs/1401.1872 (2014) - [i4]Paraschos Koutris, Tova Milo, Sudeepa Roy, Dan Suciu:
Answering Conjunctive Queries with Inequalities. CoRR abs/1412.3869 (2014) - 2013
- [c11]Magdalena Balazinska, Bill Howe, Paraschos Koutris, Dan Suciu
A Discussion on Pricing Relational Data. In Search of Elegance in the Theory and Practice of Computation 2013: 167-173 - [c10]Paul Beame
Communication steps for parallel query processing. PODS 2013: 273-284 - [c9]Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe
Toward practical query pricing with QueryMarket. SIGMOD Conference 2013: 613-624 - [i3]Paul Beame, Paraschos Koutris, Dan Suciu:
Communication Steps for Parallel Query Processing. CoRR abs/1306.5972 (2013) - 2012
- [j1]Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe
QueryMarket Demonstration: Pricing for Online Data Markets. Proc. VLDB Endow. 5(12): 1962-1965 (2012) - [c8]Marianne Shaw, Paraschos Koutris, Bill Howe
Optimizing Large-Scale Semi-Naïve Datalog Evaluation in Hadoop. Datalog 2012: 165-176 - [c7]Foto N. Afrati, Paraschos Koutris, Dan Suciu
Parallel skyline queries. ICDT 2012: 274-284 - [c6]Dimitris Fotakis
Online Sum-Radii Clustering. MFCS 2012: 395-406 - [c5]Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe
Query-based data pricing. PODS 2012: 167-178 - [i2]Paraschos Koutris, Dan Suciu:
A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys. CoRR abs/1212.6636 (2012) - 2011
- [c4]Paraschos Koutris, Aris Pagourtzis:
Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. CATS 2011: 161-168 - [c3]Paraschos Koutris, Dan Suciu
Parallel evaluation of conjunctive queries. PODS 2011: 223-234 - [c2]Bill Howe
Database-as-a-Service for Long-Tail Science. SSDBM 2011: 480-489 - [i1]Dimitris Fotakis, Paraschos Koutris:
Online Sum-Radii Clustering. CoRR abs/1109.5325 (2011) - 2010
- [c1]Paraschos Koutris, Aris Pagourtzis
Brief announcement: k-shot distributed broadcasting in radio networks. PODC 2010: 77-78
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-11-11 21:30 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: