default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyszard Janicki
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
[c84]Ryszard Janicki
, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Relational Structures for Interval Order Semantics of Concurrent Systems. Petri Nets 2024: 153-174- [c83]Jirí Mazurek, Ryszard Janicki:
A Hybrid Stochastic-Full Enumeration Approach to a Ranking Problem with Insufficient Information. CISS 2024: 1-6 - [c82]Ryszard Janicki, Ni Yang:
On Efficacy of Approximating Arbitrary Relations by Partial Orders. IPMU (1) 2024: 310-320 - 2023
- [j47]Ryszard Janicki:
On some generalization of rough sets. Int. J. Approx. Reason. 163: 109046 (2023) - [c81]Ryszard Janicki, Maciej Koutny, Lukasz Mikulski:
Interval Traces with Mutex Relation. Petri Nets 2023: 145-166 - [c80]Mahdee Jodayree, Wenbo He, Ryszard Janicki:
Preventing Image Data Poisoning Attacks in Federated Machine Learning by an Encrypted Verification Key. KES 2023: 2723-2732 - [c79]Mahdee Jodayree, Wenbo He, Ryszard Janicki:
Preventing Text Data Poisoning Attacks in Federated Machine Learning by an Encrypted Verification Key. IJCRS 2023: 612-626 - 2022
- [b2]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Paradigms of Concurrency - Observations, Behaviours, and Systems - a Petri Net View. Studies in Computational Intelligence 1020, Springer 2022, ISBN 978-3-662-64819-3, pp. 1-317 - [j46]Samir Al-janabi, Ryszard Janicki:
Data repair of density-based data cleaning approach using conditional functional dependencies. Data Technol. Appl. 56(3): 429-446 (2022) - [c78]Ryszard Janicki, Mahmoud Mahmoud:
On Multiplicative, Additive and Qualitative Pairwise Comparisons. FedCSIS 2022: 247-251 - [c77]Ryszard Janicki:
Similarity for Multisets and Heterogeneous Sets. IPMU (1) 2022: 332-344 - 2021
- [j45]Ryszard Janicki, Slawomir Lasota, Natalia Sidorova:
Preface. Fundam. Informaticae 183(3-4) (2021) - [j44]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Relational structures for concurrent behaviours. Theor. Comput. Sci. 862: 174-192 (2021) - [c76]Mohammed Assiri, Ryszard Janicki:
Towards Modeling of Cardiac Pacemakers With Timed Coloured Petri Nets And Related Tools. PNSE@Petri Nets 2021: 1-20 - 2020
- [j43]Ryszard Janicki, Lukasz Mikulski:
Algebraic Structure of Step Traces and Interval Traces. Fundam. Informaticae 175(1-4): 253-280 (2020) - [c75]Mohammed Assiri, Ryszard Janicki:
Modelling and Analyzing Electrocardiogram Events using Timed Coloured Petri Nets. PNSE@Petri Nets 2020: 222-223 - [c74]Waleed Almutairi, Ryszard Janicki:
On relationships between imbalance and overlapping of datasets. CATA 2020: 141-150 - [e2]Ryszard Janicki, Natalia Sidorova, Thomas Chatain:
Application and Theory of Petri Nets and Concurrency - 41st International Conference, PETRI NETS 2020, Paris, France, June 24-25, 2020, Proceedings. Lecture Notes in Computer Science 12152, Springer 2020, ISBN 978-3-030-51830-1 [contents]
2010 – 2019
- 2019
- [j42]Ryszard Janicki, Maciej Koutny:
Operational Semantics, Interval Orders and Sequences of Antichains. Fundam. Informaticae 169(1-2): 31-55 (2019) - [j41]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Classifying invariant structures of step traces. J. Comput. Syst. Sci. 104: 297-322 (2019) - [j40]Xiaojun Xie, Xiaolin Qin, Qian Zhou, Yanghao Zhou, Tong Zhang, Ryszard Janicki, Wei Zhao:
A novel test-cost-sensitive attribute reduction approach using the binary bat algorithm. Knowl. Based Syst. 186 (2019) - [c73]Ryszard Janicki:
On Interval Semantics of Inhibitor and Activator Nets. Petri Nets 2019: 192-212 - [c72]Xiaojun Xie, Ryszard Janicki, Xiaolin Qin, Wei Zhao, Guangmei Huang:
Local Search for Attribute Reduction. IJCRS 2019: 102-117 - [p4]Ryszard Janicki:
Petri Nets: A Simple Language and Tool for Modeling Complex Ideas. Carl Adam Petri: Ideas, Personality, Impact 2019: 73-77 - 2018
- [j39]Ryszard Janicki, Jetty Kleijn, Lukasz Mikulski:
A Precise Characterisation of Step Traces and Their Concurrent Histories. Sci. Ann. Comput. Sci. 28(2): 237-267 (2018) - [j38]Ryszard Janicki:
Approximations of arbitrary relations by partial orders. Int. J. Approx. Reason. 98: 177-195 (2018) - [j37]Mohammed A. Alqarni, Ryszard Janicki:
Interval semantics for Petri nets with inhibitor arcs. Theor. Comput. Sci. 727: 1-23 (2018) - [c71]Ryszard Janicki:
Modeling Operational Semantics with Interval Orders Represented by Sequences of Antichains. Petri Nets 2018: 251-271 - 2017
- [j36]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Alphabets of Acyclic Invariant Structures. Fundam. Informaticae 154(1-4): 207-224 (2017) - [j35]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Invariant Structures and Dependence Relations. Fundam. Informaticae 155(1-2): 1-29 (2017) - [j34]Ryszard Janicki, Xiang Yin:
Modeling concurrency with interval traces. Inf. Comput. 253: 78-108 (2017) - [c70]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
On Synthesising Step Alphabets for Acyclic Invariant Structures. ATAED@Petri Nets/ACSD 2017: 76-88 - [c69]Samir Al-janabi, Abubaker Hamid, Ryszard Janicki:
datumPIPE: Data Generator and Corrupter for Multiple Data Quality Aspects. ASONAM 2017: 589-592 - [c68]Ryszard Janicki:
Yet Another Kind of Rough Sets Induced by Coverings. IJCRS (1) 2017: 140-153 - 2016
- [j33]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Step traces. Acta Informatica 53(1): 35-65 (2016) - [j32]Ryszard Janicki, Konrad Kulakowski:
Preface. Fundam. Informaticae 144(3-4) (2016) - [j31]Ryszard Janicki, Adam Lenarcic:
Optimal approximations with Rough Sets and similarities in measure spaces. Int. J. Approx. Reason. 71: 1-14 (2016) - [c67]Samir Al-janabi, Ryszard Janicki:
Corroborating Quality of Data Through Density Information. IntelliSys (1) 2016: 1128-1146 - [c66]Ryszard Janicki:
On Optimal Approximations of Arbitrary Relations by Partial Orders. IJCRS 2016: 107-119 - [c65]Agnieszka D. Bogobowicz, Ryszard Janicki:
On Approximation of Relations by Generalized Closures and Generalized Kernels. IJCRS 2016: 120-130 - 2015
- [j30]Ryszard Janicki, Mohammad Hadi Soudkhah:
On Classification with Pairwise Comparisons, Support Vector Machines and Feature Domain Overlapping. Comput. J. 58(3): 416-431 (2015) - [j29]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Characterising Concurrent Histories. Fundam. Informaticae 139(1): 21-42 (2015) - [c64]Mohammed A. Alqarni, Ryszard Janicki:
On Interval Process Semantics of Petri Nets with Inhibitor Arcs. Petri Nets 2015: 77-97 - [c63]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Order Structures for Subclasses of Generalised Traces. LATA 2015: 689-700 - 2013
- [c62]Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski:
Causal Structures for General Concurrent Behaviours. CS&P 2013: 193-205 - [c61]Ryszard Janicki, Adam Lenarcic:
Optimal Approximations with Rough Sets. RSKT 2013: 87-98 - [c60]Mohammad Hadi Soudkhah, Ryszard Janicki:
Weighted Features Classification with Pairwise Comparisons, Support Vector Machines and Feature Domain Overlapping. WETICE 2013: 172-177 - [c59]Agnieszka D. Bogobowicz, Ryszard Janicki:
On Pairwise Comparisons Based Internal and External Measures for Software Evaluation. WETICE 2013: 371-376 - [p3]Ryszard Janicki:
Property-Driven Rough Sets Approximations of Relations. Rough Sets and Intelligent Systems (1) 2013: 333-357 - 2012
- [j28]Ryszard Janicki, Yun Zhai:
On a pairwise comparison-based consistent non-numerical ranking. Log. J. IGPL 20(4): 667-676 (2012) - [c58]Ryszard Janicki, Xiang Yin, Nadezhda Zubkova:
Modeling Interval Order Structures with Partially Commutative Monoids. CONCUR 2012: 425-439 - [c57]Xiang Yin, Ryszard Janicki:
Optimization of Quadtree Representation and Compression. RSCTC 2012: 198-205 - [e1]Tianrui Li, Hung Son Nguyen, Guoyin Wang, Jerzy W. Grzymala-Busse, Ryszard Janicki, Aboul Ella Hassanien, Hong Yu:
Rough Sets and Knowledge Technology - 7th International Conference, RSKT 2012, Chengdu, China, August 17-20, 2012. Proceedings. Lecture Notes in Computer Science 7414, Springer 2012, ISBN 978-3-642-31899-3 [contents] - 2011
- [j27]Stephen A. Edwards, Ryszard Janicki, Walter Vogler:
Preface. Fundam. Informaticae 108(1-2) (2011) - [j26]Ryszard Janicki, Dai Tri Man Le:
Modelling concurrency with comtraces and generalized comtraces. Inf. Comput. 209(11): 1355-1389 (2011) - [j25]Ryszard Janicki:
Approximations of Arbitrary Binary Relations by Partial Orders: Classical and Rough Set Models. Trans. Rough Sets 13: 17-38 (2011) - [c56]Ryszard Janicki, Yun Zhai:
Remarks on Pairwise Comparison Numerical and Non-numerical Rankings. RSKT 2011: 290-300 - 2010
- [c55]Yun Zhai, Ryszard Janicki:
On Consistency in Pairwise Comparisons Based Numerical and Non-Numerical Ranking. FCS 2010: 183-186 - [c54]Waldemar W. Koczkodaj, Vova Babiy, Agnieszka D. Bogobowicz, Ryszard Janicki, Alan Wassyng:
Selecting the best strategy in a software certification process. IMCSIT 2010: 53-58 - [c53]Yun Zhai, Ryszard Janicki:
Preserving Consistency and Properties in Pairwise Comparisons Based Non-Numerical Ranking. Software Engineering Research and Practice 2010: 589-592 - [p2]Ryszard Janicki, Jetty Kleijn, Maciej Koutny:
Quotient Monoids and Concurrent Behaviours. Scientific Applications of Language Methods 2010: 313-385
2000 – 2009
- 2009
- [j24]Ryszard Janicki:
Pairwise Comparisons Based Non-Numerical Ranking. Fundam. Informaticae 94(2): 197-217 (2009) - [c52]Ryszard Janicki, Nadezhda Zubkova:
On Closure Operator for Interval Order Structures. FCS 2009: 108-114 - [c51]Ryszard Janicki, Dai Tri Man Le, Nadezhda Zubkova:
Closure Operators for Order Structures. FCT 2009: 217-229 - [c50]Ryszard Janicki:
On Rough Sets with Structures and Properties. RSFDGrC 2009: 109-116 - [c49]Ryszard Janicki, Ewa Romanowicz:
Proving Properties of Programs with Theorem Provers - Experiments with Z3 and Simplify. Software Engineering Research and Practice 2009: 10-16 - [c48]Volodymyr Babiy, Ryszard Janicki, Tiffany Jingco, Tamar Kakiashvili, Waldemar W. Koczkodaj, Marc Woodbury-Smith:
Benefits of Using Tabular Expressions in Planning Health Services. Software Engineering Research and Practice 2009: 99-102 - [c47]Imen Bourguiba, Ryszard Janicki:
Tabular Expressions vs Software Cost Reduction. Software Engineering Research and Practice 2009: 403-407 - [i1]Ryszard Janicki, Dai Tri Man Le:
Modelling Concurrency with Comtraces and Generalized Comtraces. CoRR abs/0907.1722 (2009) - 2008
- [j23]Ryszard Janicki:
Relational structures model of concurrency. Acta Informatica 45(4): 279-320 (2008) - [j22]Dai Tri Man Le, Ryszard Janicki:
A Categorical Approach to Mereology and Its Application to Modelling Software Components. Trans. Rough Sets 8: 146-174 (2008) - [c46]Ryszard Janicki, Dai Tri Man Le:
Modelling Concurrency with Quotient Monoids. Petri Nets 2008: 251-269 - [c45]Ryszard Janicki:
Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders. RSCTC 2008: 81-91 - [c44]Ryszard Janicki:
Ranking with Partial Orders and Pairwise Comparisons. RSKT 2008: 442-451 - 2007
- [j21]Ryszard Janicki, Dai Tri Man Le:
Towards a Pragmatic Mereology. Fundam. Informaticae 75(1-4): 295-314 (2007) - [j20]Jacques Carette, Ryszard Janicki:
Computing Properties of Numerical Imperative Programs by Symbolic Computation. Fundam. Informaticae 80(1-3): 125-146 (2007) - [c43]Ratvinder Singh Grewal, Ryszard Janicki, Tamar Kakiashvili, K. Kielan, Waldemar W. Koczkodaj, Kalpdrum Passi, Ryszard Tadeusiewicz:
Attacking the Web Cancer with the Automatic Understanding Approach. AWIC 2007: 136-141 - [c42]Ryszard Janicki:
Pairwise Comparisons, Incomparability and Partial Orders. ICEIS (2) 2007: 297-302 - 2006
- [j19]Ryszard Janicki:
Special Issueon Application of Concurrency to System Design. Fundam. Informaticae 70(1-2) (2006) - [c41]Dai Tri Man Le, Ryszard Janicki:
On a Parthood Specification Method for Component Software. RSCTC 2006: 537-546 - 2005
- [j18]Ryszard Janicki, Alan Wassyng:
Tabular Expressions and Their Relational Semantics. Fundam. Informaticae 67(4): 343-370 (2005) - [c40]Ryszard Janicki:
Basic Mereology with Equivalence Relations. MFCS 2005: 507-519 - 2004
- [j17]Ryszard Janicki:
Preface. Fundam. Informaticae 62(2) (2004) - [c39]Yu-Tong He, Ryszard Janicki:
Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN. CASCON 2004: 174-188 - [c38]Ryszard Janicki:
A Generalisation of a Relational Structures Model of Concurrency. ICTAC 2004: 84-98 - [c37]Yu-Tong He, Ryszard Janicki:
Verification of the WAP Transaction Layer. SEFM 2004: 366-375 - [c36]Ryszard Janicki, Yun Zhai:
On Properties of 'Part of' Relations. Software Engineering Research and Practice 2004: 393-399 - [c35]Yuwen Yang, Ryszard Janicki:
Modelling Concurrency with Tabular Expressions. Software Engineering Research and Practice 2004: 455-461 - 2003
- [c34]Ryszard Janicki, Alan Wassyng:
On tabular expressions. CASCON 2003: 92-106 - 2002
- [c33]Guangyuan Guo, Ryszard Janicki:
Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations. AMAST 2002: 178-191 - [c32]Ryszard Janicki, Yuanyuan Zhang:
A simplistic Mereological System for Relations. IC-AI 2002: 1206-1212 - [c31]Ryszard Janicki:
On a Mereological System for Relational Software Specifications. MFCS 2002: 375-386 - [c30]Daniela Rosu, Ryszard Janicki:
On Concurrency Control in Object-oriented Databases. PDPTA 2002: 956-962 - [c29]Ryszard Janicki:
Towards a Mereological System for Direct Products and Relations. Rough Sets and Current Trends in Computing 2002: 113-122 - 2001
- [j16]Ryszard Janicki, Ridha Khédri:
On a formal semantics of tabular expressions. Sci. Comput. Program. 39(2-3): 189-213 (2001) - [j15]Ryszard Janicki, Emil Sekerinski:
Foundations of the Trace Assertion Method of Module Interface Specification. IEEE Trans. Software Eng. 27(7): 577-598 (2001) - 2000
- [c28]Ryszard Janicki, Ridha Khédri:
Remarks on Mereology of Relations. RelMiCS 2000: 133-140 - [c27]Ryszard Janicki, Yan Liu:
On Trace Assertion Method of Module Interface Specification with Concurrency. Rough Sets and Current Trends in Computing 2000: 632-641
1990 – 1999
- 1999
- [j14]Ryszard Janicki, Maciej Koutny:
On Causality Semantics of Nets with Priorities. Fundam. Informaticae 38(3): 223-255 (1999) - 1998
- [j13]Ryszard Janicki, Waldemar W. Koczkodaj:
A weak order solution to a group ranking and consistency-driven pairwise comparisons. Appl. Math. Comput. 94(2-3): 227-241 (1998) - 1997
- [j12]Ryszard Janicki, Maciej Koutny:
Fundamentals of Modelling Concurrency Using Discrete Relational Structures. Acta Informatica 34(5): 367-388 (1997) - [p1]Ryszard Janicki, David Lorge Parnas, Jeffery I. Zucker:
Tabular Representations in Relational Documents. Relational Methods in Computer Science 1997: 184-196 - 1995
- [j11]Ryszard Janicki, Maciej Koutny:
Semantics of Inhibitor Nets. Inf. Comput. 123(1): 1-16 (1995) - [c26]Ryszard Janicki:
Towards a Formal Semantics of Parnas Tables. ICSE 1995: 231-240 - 1994
- [j10]Ryszard Janicki, Maciej Koutny:
Representations of Discrete Interval Orders and Semi-Orders. J. Inf. Process. Cybern. 30(3): 161-168 (1994) - [c25]Ryszard Janicki, Maciej Koutny:
Deriving Histories of Nets with Priority Relation. PARLE 1994: 623-634 - 1993
- [j9]Ryszard Janicki, Maciej Koutny:
Structure of Concurrency. Theor. Comput. Sci. 112(1): 5-52 (1993) - [c24]Ryszard Janicki, Maciej Koutny:
Order Structures and Generalisations of Szpilrajn's Theorem. FSTTCS 1993: 348-357 - 1992
- [b1]Ryszard Janicki, Peter E. Lauer:
Specification and Analysis of Concurrent Systems - The COSY Approach. EATCS Monographs on Theoretical Computer Science, Springer 1992, ISBN 978-3-642-77339-6, pp. i-xii, 1-482 - [j8]Ryszard Janicki, Maciej Koutny:
Invariants and paradigms of concurrency theory. Future Gener. Comput. Syst. 8(4): 423-435 (1992) - 1991
- [c23]Ryszard Janicki, Maciej Koutny:
Structure of Concurrency. AMAST 1991: 98-107 - [c22]Ryszard Janicki, Maciej Koutny:
Invariant Semantics of Nets with Inhibitor Arcs. CONCUR 1991: 317-331 - [c21]Ryszard Janicki, Maciej Koutny:
Invariants and Paradigms of Concurrency Theory. PARLE (2) 1991: 59-74 - 1990
- [j7]Ryszard Janicki, Tomasz Müldner:
Transformations of Sequential Specifications into Concurrent Specifications by Synchronization Guards. Theor. Comput. Sci. 77(1&2): 97-129 (1990) - [c20]Ryszard Janicki, Tomasz Müldner:
A Simple Realization of a Parallel Device Recognizing Regular Trace Languages. ACM Conference on Computer Science 1990: 147-153 - [c19]Ryszard Janicki, Maciej Koutny:
Optimal simulations, nets and reachability graphs. Applications and Theory of Petri Nets 1990: 205-226 - [c18]Ryszard Janicki, Maciej Koutny:
Using Optimal Simulations to Reduce Reachability Graphs. CAV 1990: 166-175 - [c17]Ryszard Janicki, Maciej Koutny:
On Some Implementation of Optimal Simulations. CAV (DIMACS/AMS volume) 1990: 231-250
1980 – 1989
- 1989
- [c16]Ryszard Janicki, Tomasz Müldner:
Complete Sequential Specification Allows for Concurrent Execution. ACM Conference on Computer Science 1989: 221-231 - [c15]Ryszard Janicki, Maciej Koutny:
Towards A Theory Of Simulation For Verification Of Concurrent Systems. PARLE (2) 1989: 73-88 - 1988
- [c14]Ryszard Janicki:
How to relieve a programmer from synchronization details. ACM Conference on Computer Science 1988: 438-446 - [c13]Ryszard Janicki, Peter E. Lauer:
On the Semantics Of Priority Systems. ICPP (2) 1988: 150-156 - 1987
- [j6]Ryszard Janicki:
A Formal Semantics for Concurrent Systems with a Priority Relation. Acta Informatica 24(1): 33-55 (1987) - 1986
- [j5]Ryszard Janicki, Peter E. Lauer, Maciej Koutny, Raymond R. Devillers:
Concurrent and Maximally Concurrent Evolution of Nonsequential Systems. Theor. Comput. Sci. 43: 213-238 (1986) - [c12]Ryszard Janicki, Maciej Koutny:
On equivalent execution semantics of concurrent systems. European Workshop on Applications and Theory of Petri Nets 1986: 89-103 - 1985
- [j4]Ryszard Janicki:
An Equivalence Notion for Path Expressions Systems. J. Inf. Process. Cybern. 21(6): 283-295 (1985) - [j3]Ryszard Janicki:
Transforming Sequential Systems into Concurrent Systems. Theor. Comput. Sci. 36: 27-58 (1985) - 1984
- [j2]Ryszard Janicki:
Nets, Sequential Components and Concurrency Relations. Theor. Comput. Sci. 29: 87-121 (1984) - [c11]Ryszard Janicki, Peter E. Lauer, Raymond R. Devillers:
Maximally Concurrent Evolution of Non-sequential Systems. Seminar on Concurrency 1984: 268-280 - [c10]Ryszard Janicki:
A Method for Developing Concurrent Systems. Symposium on Programming 1984: 155-166 - 1981
- [c9]Ryszard Janicki:
On the Design of Concurrent Systems. ICDCS 1981: 455-466 - [c8]Ryszard Janicki:
A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency Relations. ICFPC 1981: 327-334 - 1980
- [j1]Ryszard Janicki:
Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them. Fundam. Informaticae 3(1): 65-76 (1980) - [c7]Ryszard Janicki:
On Atomic Nets and Concurrency Relations. MFCS 1980: 320-333 - [c6]Ryszard Janicki:
An Algebraic Structure of Petri Nets. Symposium on Programming 1980: 177-192
1970 – 1979
- 1979
- [c5]Ryszard Janicki:
Analysis of vectors of coroutines by means of components. FCT 1979: 207-213 - [c4]Ryszard Janicki:
A Characterization of Concurrency-Like Relations. Semantics of Concurrent Computation 1979: 109-122 - 1978
- [c3]Ryszard Janicki:
Synthesis of Concurrent Schemes. MFCS 1978: 298-307 - 1977
- [c2]Ryszard Janicki:
Vectors of Coroutines over Blikle Nets. FCT 1977: 113-119 - 1976
- [c1]Ryszard Janicki:
Vectors of Coroutines. MFCS 1976: 377-384
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 2025-03-04 21:18 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:
