default search action
Faruk Polat
Person information
- affiliation: Middle East Technical University (METU), Department of Computer Engineering, Ankara, Turkey
- affiliation (PhD 1993): Bilkent University, Ankara, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j58]Melis Ilayda Bal, Hüseyin Aydin, Cem Iyigün, Faruk Polat:
Potential-based reward shaping using state-space segmentation for efficiency in reinforcement learning. Future Gener. Comput. Syst. 157: 469-484 (2024) - [j57]Emre Ergüven, Faruk Polat:
Relative distances approach for multi-traveling salesmen problem. Knowl. Based Syst. 300: 112160 (2024) - [j56]Saim Sunel, Erkin Çilden, Faruk Polat:
Faster MIL-based Subgoal Identification for Reinforcement Learning by Tuning Fewer Hyperparameters. ACM Trans. Auton. Adapt. Syst. 19(2): 10 (2024) - 2023
- [j55]Fatih Semiz, Mücahit Alkan Yorganci, Faruk Polat:
Solving an industry-inspired generalization of lifelong MAPF problem including multiple delivery locations. Adv. Eng. Informatics 57: 102026 (2023) - [j54]Fatih Semiz, Mücahit Alkan Yorganci, Faruk Polat:
Corrigendum to "Solving an industry-inspired generalization of lifelong MAPF problem including multiple delivery locations" [Adv. Eng. Inf. 57 (2023) 102026]. Adv. Eng. Informatics 58: 102127 (2023) - [j53]Alper Demir, Erkin Çilden, Faruk Polat:
Landmark based guidance for reinforcement learning agents under partial observability. Int. J. Mach. Learn. Cybern. 14(4): 1543-1563 (2023) - [j52]Alper Demir, Erkin Çilden, Faruk Polat:
Correction: Landmark based guidance for reinforcement learning agents under partial observability. Int. J. Mach. Learn. Cybern. 14(4): 1565 (2023) - 2022
- [j51]Hüseyin Aydin, Erkin Çilden, Faruk Polat:
Using chains of bottleneck transitions to decompose and solve reinforcement learning tasks with hidden states. Future Gener. Comput. Syst. 133: 153-168 (2022) - [c60]Mücahit Alkan Yorganci, Fatih Semiz, Faruk Polat:
LIMP: Incremental Multi-agent Path Planning with LPA. ICAART (1) 2022: 208-215 - [c59]Evren Çilden, Faruk Polat:
Multiagent Pickup and Delivery for Capacitated Agents. PAAMS 2022: 76-87 - 2021
- [j50]Fatih Semiz, Faruk Polat:
Incremental multi-agent path finding. Future Gener. Comput. Syst. 116: 220-233 (2021) - 2020
- [j49]Fatih Semiz, Faruk Polat:
Solving the area coverage problem with UAVs: A vehicle routing with time windows variation. Robotics Auton. Syst. 126: 103435 (2020) - [i1]Fatih Semiz, Faruk Polat:
Solving Area Coverage Problem with UAVs: A Vehicle Routing with Time Windows Variation. CoRR abs/2003.07124 (2020)
2010 – 2019
- 2019
- [j48]Alper Demir, Erkin Çilden, Faruk Polat:
Generating Effective Initiation Sets for Subgoal-Driven options. Adv. Complex Syst. 22(2): 1950001:1-1950001:32 (2019) - [j47]Makbule Gulcin Ozsoy, Faruk Polat, Reda Alhajj:
Effective induction of gene regulatory networks using a novel recommendation method. Int. J. Data Min. Bioinform. 22(2): 91-112 (2019) - [j46]Ahmet Engin Bayrak, Faruk Polat:
Effective feature reduction for link prediction in location-based social networks. J. Inf. Sci. 45(5) (2019) - [j45]Alper Demir, Erkin Çilden, Faruk Polat:
Automatic landmark discovery for learning agents under partial observability. Knowl. Eng. Rev. 34: e11 (2019) - [j44]Omer Ekmekci, Faruk Polat:
A context aware model for autonomous agent stochastic planning. Robotics Auton. Syst. 112: 137-153 (2019) - [c58]Ahmet Engin Bayrak, Faruk Polat:
Reducing features to improve link prediction performance in location based social networks, non-monotonically selected subset from feature clusters. ASONAM 2019: 809-815 - [c57]Alper Demir, Erkin Çilden, Faruk Polat:
Landmark Based Reward Shaping in Reinforcement Learning with Hidden States. AAMAS 2019: 1922-1924 - [c56]Hüseyin Aydin, Erkin Çilden, Faruk Polat:
Compact Frequency Memory for Reinforcement Learning with Hidden States. PRIMA 2019: 425-433 - 2018
- [j43]Makbule Gulcin Ozsoy, Tansel Özyer, Faruk Polat, Reda Alhajj:
Realizing drug repositioning by adapting a recommendation system to handle the process. BMC Bioinform. 19(1): 136:1-136:14 (2018) - [j42]Makbule Gulcin Ozsoy, Tansel Özyer, Faruk Polat, Reda Alhajj:
Correction to: Realizing drug repositioning by adapting a recommendation system to handle the process. BMC Bioinform. 19(1): 250:1 (2018) - [c55]Ahmet Engin Bayrak, Faruk Polat:
Mining Individual Features to Enhance Link Prediction Efficiency in Location Based Social Networks. ASONAM 2018: 920-925 - 2017
- [j41]Utku Erdogdu, Faruk Polat, Reda Alhajj:
Employing decomposable partially observable Markov decision processes to control gene regulatory networks. Artif. Intell. Medicine 83: 14-34 (2017) - [j40]Utku Sirin, Faruk Polat, Reda Alhajj:
Batch Mode TD(λ) for Controlling Partially Observable Gene Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 14(6): 1214-1227 (2017) - [c54]Koray Ozturk, Faruk Polat, Tansel Özyer:
An Evolutionary Approach for Detecting Communities in Social Networks. ASONAM 2017: 966-973 - [c53]Alper Demir, Erkin Çilden, Faruk Polat:
A Concept Filtering Approach for Diverse Density to Discover Subgoals in Reinforcement Learning. ICTAI 2017: 1-5 - [c52]Hüseyin Aydin, Erkin Çilden, Faruk Polat:
Using Transitional Bottlenecks to Improve Learning in Nearest Sequence Memory Algorithm. ICTAI 2017: 147-152 - 2016
- [j39]Makbule Gulcin Ozsoy, Faruk Polat, Reda Alhajj:
Making recommendations by integrating information from multiple social networks. Appl. Intell. 45(4): 1047-1065 (2016) - [j38]Utku Sirin, Utku Erdogdu, Faruk Polat, Mehmet Tan, Reda Alhajj:
Effective gene expression data generation framework based on multi-model approach. Artif. Intell. Medicine 70: 41-61 (2016) - [j37]Tugcem Oral, Faruk Polat:
MOD* Lite: An Incremental Path Planning Algorithm Taking Care of Multiple Objectives. IEEE Trans. Cybern. 46(1): 245-257 (2016) - [c51]Makbule Gulcin Ozsoy, Faruk Polat, Reda Alhajj:
Time preference aware dynamic recommendation enhanced with location, social network and temporal information. ASONAM 2016: 909-916 - [c50]Ahmet Engin Bayrak, Faruk Polat:
Examining place categories for link prediction in Location Based Social Networks. ASONAM 2016: 976-979 - [c49]Alper Demir, Erkin Çilden, Faruk Polat:
A History Tree Heuristic to Generate Better Initiation Sets for Options in Reinforcement Learning. ECAI 2016: 1644-1645 - [c48]Alper Demir, Erkin Çilden, Faruk Polat:
Local Roots: A Tree-Based Subgoal Discovery Method to Accelerate Reinforcement Learning. ECML/PKDD (2) 2016: 361-376 - 2015
- [j36]Erkin Çilden, Faruk Polat:
Toward Generalization of Automated Temporal Abstraction to Partially Observable Reinforcement Learning. IEEE Trans. Cybern. 45(8): 1414-1425 (2015) - [c47]Makbule Gulcin Ozsoy, Faruk Polat, Reda Alhajj:
Modeling Individuals and Making Recommendations Using Multiple Social Networks. ASONAM 2015: 1184-1191 - [c46]Makbule Gulcin Ozsoy, Faruk Polat, Reda Alhajj:
Inference of gene regulatory networks via multiple data sources and a recommendation method. BIBM 2015: 661-664 - [c45]Coskun Sahin, Erkin Çilden, Faruk Polat:
Memory efficient factored abstraction for reinforcement learning. CYBCONF 2015: 18-23 - 2014
- [c44]Makbule Gulcin Ozsoy, Faruk Polat, Reda Alhajj:
Multi-objective optimization based location and social network aware recommendation. CollaborateCom 2014: 233-242 - [c43]Ahmet Engin Bayrak, Faruk Polat:
Contextual Feature Analysis to Improve Link Prediction for Location Based Social Networks. SNAKDD 2014: 7:1-7:5 - [c42]Erkin Çilden, Faruk Polat:
Employing Automatic Temporal Abstractions to Accelerate Utile Suffix Memory Algorithm. MATES 2014: 156-169 - 2013
- [j35]Utku Erdogdu, Mehmet Tan, Reda Alhajj, Faruk Polat, Jon G. Rokne, Douglas J. Demetrick:
Integrating machine learning techniques into robust data enrichment approach and its application to gene expression data. Int. J. Data Min. Bioinform. 8(3): 247-281 (2013) - [j34]Mehmet Tan, Faruk Polat, Reda Alhajj:
Subtree selection in kernels for graph classification. Int. J. Data Min. Bioinform. 8(3): 294-310 (2013) - [j33]Ahmet Engin Bayrak, Faruk Polat:
Employment of an evolutionary heuristic to solve the target allocation problem efficiently. Inf. Sci. 222: 675-695 (2013) - [c41]Makbule Gulcin Ozsoy, Faruk Polat:
Trust based recommendation systems. ASONAM 2013: 1267-1274 - [c40]Erkin Çilden, Faruk Polat:
Generating Memoryless Policies Faster Using Automatic Temporal Abstractions for Reinforcement Learning with Hidden State. ICTAI 2013: 719-726 - [c39]Utku Sirin, Faruk Polat, Reda Alhajj:
Employing Batch Reinforcement Learning to Control Gene Regulation Without Explicitly Constructing Gene Regulatory Networks. IJCAI 2013 - 2012
- [j32]Ali Galip Bayrak, Faruk Polat:
Formation preserving path finding in 3-D terrains. Appl. Intell. 36(2): 348-368 (2012) - [j31]Ömer Özgün Isikman, Tansel Özyer, Omar Zarour, Reda Alhajj, Faruk Polat:
TempoXML: Nested bitemporal relationship modeling and conversion tool for fuzzy XML. Inf. Sci. 193: 247-274 (2012) - [j30]Mohammed Al-Shalalfa, Mehmet Tan, Ghada Naji, Reda Alhajj, Faruk Polat, Jon G. Rokne:
Revealing miRNA Regulation and miRNA Target Prediction Using Constraint-Based Learning. IEEE Trans. Syst. Man Cybern. Part C 42(6): 1354-1364 (2012) - [c38]Erkin Çilden, Faruk Polat:
Abstraction in Model Based Partially Observable Reinforcement Learning Using Extended Sequence Trees. IAT 2012: 348-355 - [c37]Tugcem Oral, Faruk Polat:
A Multi-objective Incremental Path Planning Algorithm for Mobile Agents. IAT 2012: 401-408 - [c36]Utku Sirin, Utku Erdogdu, Mehmet Tan, Faruk Polat, Reda Alhajj:
Effective Enrichment of Gene Expression Data Sets. ICMLA (1) 2012: 76-81 - [c35]Utku Erdogdu, Faruk Polat, Reda Alhajj:
Partially Observable Gene Regulatory Network Control without a Boundary on Horizon. ICTAI 2012: 81-88 - 2011
- [j29]Serhat Bayili, Faruk Polat:
Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion. Knowl. Based Syst. 24(4): 501-512 (2011) - [j28]Mehmet Tan, Mohammed Al-Shalalfa, Reda Alhajj, Faruk Polat:
Influence of Prior Knowledge in Constraint-Based Learning of Gene Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 130-142 (2011) - [c34]Utku Erdogdu, Mehmet Tan, Reda Alhajj, Faruk Polat, Douglas J. Demetrick, Jon G. Rokne:
Employing Machine Learning Techniques for Data Enrichment: Increasing the Number of Samples for Effective Gene Expression Data Analysis. BIBM 2011: 238-242 - [c33]Utku Erdogdu, Reda Alhajj, Faruk Polat:
The Benefit of Decomposing POMDP for Control of Gene Regulatory Networks. IAT 2011: 381-385 - 2010
- [j27]Cagatay Undeger, Faruk Polat:
Multi-agent real-time pursuit. Auton. Agents Multi Agent Syst. 21(1): 69-107 (2010) - [j26]Mehmet Tan, Reda Alhajj, Faruk Polat:
Scalable approach for effective control of gene regulatory networks. Artif. Intell. Medicine 48(1): 51-59 (2010) - [j25]Sertan Girgin, Faruk Polat, Reda Alhajj:
Improving reinforcement learning by using sequence trees. Mach. Learn. 81(3): 283-331 (2010) - [j24]Mehmet Tan, Reda Alhajj, Faruk Polat:
Automated Large-Scale Control of Gene Regulatory Networks. IEEE Trans. Syst. Man Cybern. Part B 40(2): 286-297 (2010) - [c32]Mehmet Tan, Faruk Polat, Reda Alhajj:
Feature selection for graph kernels. BIBM 2010: 632-637 - [c31]Iyad Suleiman, Tamer Salman, Shang Gao, Faruk Polat, Maha Arslan, Reda Alhajj, Mick J. Ridley:
The power of genetic algorithm in automated assessment of school readiness. IRI 2010: 280-285
2000 – 2009
- 2009
- [j23]Cagatay Undeger, Faruk Polat:
Real-Time Moving Target Evaluation Search. IEEE Trans. Syst. Man Cybern. Part C 39(3): 366-372 (2009) - [c30]Mehmet Tan, Faruk Polat, Reda Alhajj:
Derivation of Transcriptional Regulatory Relationships by Partial Least Squares Regression. BIBM 2009: 88-91 - 2008
- [c29]Mehmet Tan, Reda Alhajj, Faruk Polat:
Large-scale approximate intervention strategies for Probabilistic Boolean Networks as models of gene regulation. BIBE 2008: 1-6 - [c28]Mehmet Tan, Mohammed Al-Shalalfa, Reda Alhajj, Faruk Polat:
Combining multiple types of biological data in constraint-based learning of gene regulatory networks. CIBCB 2008: 90-97 - 2007
- [j22]Cagatay Undeger, Faruk Polat:
RTTES: Real-time search in dynamic environments. Appl. Intell. 27(2): 113-129 (2007) - [j21]Güray Erus, Faruk Polat:
A layered approach to learning coordination knowledge in multiagent environments. Appl. Intell. 27(3): 249-267 (2007) - [j20]Cagatay Undeger, Faruk Polat:
Real-Time Edge Follow: A Real-Time Path Search Approach. IEEE Trans. Syst. Man Cybern. Part C 37(5): 860-872 (2007) - [j19]Sertan Girgin, Faruk Polat, Reda Alhajj:
Positive Impact of State Similarity on Reinforcement Learning Performance. IEEE Trans. Syst. Man Cybern. Part B 37(5): 1256-1270 (2007) - [c27]Cagatay Undeger, Faruk Polat:
Moving target search in grid worlds. AAMAS 2007: 258 - [c26]Mehmet Tan, Faruk Polat, Reda Alhajj:
Feature Reduction for Gene Regulatory Network Control. BIBE 2007: 1260-1264 - [c25]Sertan Girgin, Faruk Polat, Reda Alhajj:
State Similarity Based Approach for Improving Performance in RL. IJCAI 2007: 817-822 - [c24]Cagatay Undeger, Faruk Polat:
Real-Time Moving Target Search. PRIMA 2007: 110-121 - 2006
- [j18]Osman Abul, Reda Alhajj, Faruk Polat:
A Powerful Approach for Effective Finding of Significantly Differentially Expressed Genes. IEEE ACM Trans. Comput. Biol. Bioinform. 3(3): 220-231 (2006) - [c23]Utku Erdogdu, Faruk Polat:
Dynamic cooperation using resource based planning. AAMAS 2006: 329-331 - [c22]Cagatay Undeger, Faruk Polat:
Real time target evaluation search. AAMAS 2006: 332-334 - [c21]Osman Abul, Reda Alhajj, Faruk Polat:
Optimal Multi-Objective Control Method for Discrete Genetic Regulatory Networks. BIBE 2006: 281-284 - [c20]Sertan Girgin, Faruk Polat, Reda Alhajj:
Learning by Automatic Option Discovery from Conditionally Terminating Sequences. ECAI 2006: 494-498 - [c19]Sertan Girgin, Faruk Polat, Reda Alhajj:
Effectiveness of Considering State Similarity for Reinforcement Learning. IDEAL 2006: 163-171 - [c18]Osman Abul, Reda Alhajj, Faruk Polat:
Asymptotical Lower Limits on Required Number of Examples for Learning Boolean Networks. ISCIS 2006: 154-164 - 2005
- [j17]Osman Abul, Reda Alhajj, Faruk Polat, Ken Barker:
Finding differentially expressed genes for pattern generation. Bioinform. 21(4): 445-450 (2005) - [j16]M. Özgür Baykal, Reda Alhajj, Faruk Polat:
Co-operation framework of case-based reasoning agents for automated product recommendation. J. Exp. Theor. Artif. Intell. 17(3): 201-220 (2005) - [j15]S. Küçükpetek, Faruk Polat, Halit Oguztüzün:
Multilevel graph partitioning: an evolutionary approach. J. Oper. Res. Soc. 56(5): 549-562 (2005) - [j14]Nihan Kesim Cicekli, Ahmet Cosar, Asuman Dogac, Faruk Polat, Pinar Senkul, Ismail Hakki Toroslu, Adnan Yazici:
Data management research at the Middle East Technical University. SIGMOD Rec. 34(3): 81-84 (2005) - [j13]Reda Alhajj, Faruk Polat, Cem Yílmaz:
Views as first-class citizens in object-oriented databases. VLDB J. 14(2): 155-169 (2005) - [c17]Sertan Girgin, Faruk Polat:
Option Discovery in Reinforcement Learning using Frequent Common Subsequences of Actions. CIMCA/IAWTIC 2005: 371-376 - [r2]Reda Alhajj, Faruk Polat:
Converting a Legacy Database to Object-Oriented Database. Encyclopedia of Database Technologies and Applications 2005: 99-104 - [r1]Reda Alhajj, Faruk Polat:
Proper Placement of Derived Classes in the Class Hierarchy. Encyclopedia of Database Technologies and Applications 2005: 486-492 - 2004
- [c16]Osman Abul, Reda Alhajj, Faruk Polat:
Markov Decision Processes Based Optimal Control Policies for Probabilistic Boolean Network. BIBE 2004: 337-344 - [c15]M. Özgür Baykal, Reda Alhajj, Faruk Polat:
Automated Product Recommendation by Employing Case-Based Reasoning Agents. ICEIS (2) 2004: 515-518 - [c14]Osman Abul, Reda Alhajj, Faruk Polat, Ken Barker:
Finding differentially expressed genes: pattern generation using Q-values. SAC 2004: 138-142 - 2003
- [j12]Reda Alhajj, Faruk Polat:
Multiple-agents to identify and separate touching digits in unconstrained handwritten Hindi numerals. J. Exp. Theor. Artif. Intell. 15(4): 461-471 (2003) - [j11]Reda Alhajj, Faruk Polat:
Rule-based schema evolution in object-oriented databases. Knowl. Based Syst. 16(1): 47-57 (2003) - [c13]Erek Göktürk, Faruk Polat:
Implementing Agent Communication for a Multi-agent Simulation Infrastructure on HLA. ISCIS 2003: 619-626 - [c12]Osman Abul, Anthony Chiu Wa Lo, Reda Alhajj, Faruk Polat, Ken Barker:
Cluster validity analysis using subsampling. SMC 2003: 1435-1440 - 2002
- [j10]Faruk Polat, Osman Abul:
Learning Sequences of Compatible Actions Among Agents. Artif. Intell. Rev. 17(1): 21-37 (2002) - [j9]Selguk Senkul, Faruk Polat:
Learning Intelligent Behavior in a Non-stationary and Partially Observable Environment. Artif. Intell. Rev. 18(2): 97-115 (2002) - [j8]Armagan Cakir, Faruk Polat:
Coordination of intelligent agents in real-time search. Expert Syst. J. Knowl. Eng. 19(2): 80-87 (2002) - [c11]Mehmet Kaya, Reda Alhajj, Faruk Polat, Ahmet Arslan:
Efficient Automated Mining of Fuzzy Association Rules. DEXA 2002: 133-142 - 2001
- [j7]Faruk Polat, Ahmet Cosar, Reda Alhajj:
Semantic information-based alternative plan generation for multiple query optimization. Inf. Sci. 137(1-4): 103-133 (2001) - [c10]Cagatay Undeger, Faruk Polat, Ziya Ipekkan:
Real-Time Edge Follow: A New Paradigm to Real-Time Path Search. GAME-ON 2001: 63- - [c9]Reda Alhajj, Faruk Polat:
Transferring database contents from a conventional information systemto a corresponding existing object oriented information system. SAC 2001: 220-224 - [c8]Reda Alhajj, Faruk Polat:
Reengineering Relational Databases to Object-Oriented: Constructing the Class Hierarchy and Migrating the Data. WCRE 2001: 335-344 - 2000
- [j6]Osman Abul, Faruk Polat, Reda Alhajj:
Multiagent reinforcement learning using function approximation. IEEE Trans. Syst. Man Cybern. Part C 30(4): 485-497 (2000) - [c7]Osman Abul, Faruk Polat, Reda Alhajj:
Function approximation based multi-agent reinforcement learning. ICTAI 2000: 36-39 - [c6]Reda Alhajj, Faruk Polat:
Maximizing Reuseability: Seeking Appropriate Positions for Derived Classes Within the Class Hierarchy. SAC (1) 2000: 351-355 - [c5]Reda Alhajj, Faruk Polat, Ashraf Elnagar:
Employing multi-agents to identify touching of adjacent digits in handwritten Hindi numerals. SMC 2000: 2725-2730
1990 – 1999
- 1999
- [j5]Reda Alhajj, Faruk Polat:
Using Object-Oriented Materialized Views to Answer Selection-Based Complex Queries. Inf. Sci. 118(1-4): 75-99 (1999) - [j4]Faruk Polat, Reda Alhajj:
A multi-agent tuple-space based problem solving framework. J. Syst. Softw. 47(1): 11-17 (1999) - 1998
- [j3]Reda Alhajj, Faruk Polat:
Incrementalk View Maintenance in Object-Oriented Databases. Data Base 29(3): 52-64 (1998) - [j2]Reda Alhajj, Faruk Polat:
Proper Handling of Query Results towards Maximizing Reusability in Object_oriented Databases. Inf. Sci. 107(1-4): 247-272 (1998) - 1996
- [c4]Reda Alhajj, Faruk Polat:
View Maintenance in Object-Oriented Databases. DEXA 1996: 153-162 - 1994
- [c3]Reda Alhajj, Faruk Polat:
Closure Maintenance in An Object-Oriented Query Model. CIKM 1994: 72-79 - 1993
- [b1]Faruk Polat:
A Negatiation platform for cooperating multi-agents systems (Yardımlaşan akıllı sistemler için bir model). İhsan Doğramacı Bilkent University, Turkey, 1993 - [j1]Faruk Polat, H. Altay Güvenir:
UVT: A Unification-Based Tool for Knowledge Base Verification. IEEE Expert 8(3): 69-75 (1993) - 1992
- [c2]Faruk Polat, H. Altay Güvenir:
A Conflict Resolution-Based Decentralized Multi-Agent Problem Solving Model. MAAMAW 1992: 279-294 - 1991
- [c1]Faruk Polat, H. Altay Güvenir:
UVT: A Unification Based Tool for Knowledge Base Verification. EUROVAV 1991: 147-163
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-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint