default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul E. Dunne
Paul E. S. Dunne
Person information
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j58]Paul E. Dunne:
Decidability in argumentation semantics. Argument Comput. 15(2): 191-204 (2024)- 2022
- [c69]Paul E. Dunne
:
Well, to Be Honest, I Wouldnt Start from Here at All. COMMA 2022: 3-14 - 2021
- [j57]Samer Nofal, Katie Atkinson, Paul E. Dunne:
Computing Grounded Extensions Of Abstract Argumentation Frameworks. Comput. J. 64(1): 54-63 (2021) - 2020
- [j56]Paul E. Dunne:
Characterizing strongly admissible sets. Argument Comput. 11(3): 239-255 (2020) - [j55]Paul E. Dunne, Paul Harrenstein, Sarit Kraus, Michael J. Wooldridge:
Delegating Decisions in Strategic Settings. IEEE Trans. Artif. Intell. 1(1): 19-33 (2020) - [c68]Martin Caminada, Paul E. Dunne:
Minimal Strong Admissibility: A Complexity Analysis. COMMA 2020: 135-146
2010 – 2019
- 2019
- [j54]Martin Caminada, Paul E. Dunne:
Strong admissibility revisited: Theory and applications. Argument Comput. 10(3): 277-300 (2019) - [j53]Paul E. Dunne:
Computation Counts - An Introduction to Analytic Concepts in Computer Science. Bull. EATCS 128 (2019) - [j52]Samer Nofal, Katie Atkinson, Paul E. Dunne:
On checking skeptical and ideal admissibility in abstract argumentation frameworks. Inf. Process. Lett. 148: 7-12 (2019) - [c67]Samer Nofal, Katie Atkinson, Paul E. Dunne:
On Deciding Admissibility in Abstract Argumentation Frameworks. KEOD 2019: 67-75 - [c66]Samer Nofal, Katie Atkinson, Paul E. Dunne, Ismail Omar Hababeh:
A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks. ICEIS (1) 2019: 340-348 - 2018
- [c65]Paul E. Dunne:
Unconscious Patterns in Argument: Fractal Dimension in Oratory. COMMA 2018: 301-312 - [i3]Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin:
Automata for Infinite Argumentation Structures. CoRR abs/1810.04892 (2018) - 2017
- [j51]Wolfgang Dvorák, Paul E. Dunne:
Computational Problems in Formal Argumentation and their Complexity. FLAP 4(8) (2017) - 2016
- [j50]Samer Nofal, Katie Atkinson, Paul E. Dunne:
Looking-ahead in backtracking algorithms for abstract argumentation. Int. J. Approx. Reason. 78: 265-282 (2016) - [c64]Luke Riley, Katie Atkinson, Paul E. Dunne, Terry R. Payne:
A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation. AAMAS 2016: 588-596 - [c63]James Butterworth, Paul E. Dunne:
Spectral Techniques in Argumentation Framework Analysis. COMMA 2016: 167-178 - [c62]Paul E. Dunne:
Forbidden Sets in Argumentation Semantics. COMMA 2016: 275-286 - [c61]Paul E. Dunne:
I Heard You the First Time: Debate in Cacophonous Surroundings. COMMA 2016: 287-298 - [c60]Paul E. Dunne, Christof Spanring, Thomas Linsbichler, Stefan Woltran:
Investigating the Relationship between Argumentation Semantics via Signatures. IJCAI 2016: 1051-1057 - 2015
- [j49]Paul E. Dunne, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran:
Characteristics of multiple viewpoints in abstract argumentation. Artif. Intell. 228: 153-178 (2015) - [j48]Adam Z. Wyner, Trevor J. M. Bench-Capon, Paul E. Dunne, Federico Cerutti:
Senses of 'argument' in instantiated argumentation frameworks. Argument Comput. 6(1): 50-72 (2015) - [c59]Luke Riley, Katie Atkinson, Paul E. Dunne, Terry R. Payne:
Distributing Coalition Value Calculations to Coalition Members. AAAI 2015: 2117-2123 - 2014
- [j47]Samer Nofal, Katie Atkinson, Paul E. Dunne:
Algorithms for decision problems in argument systems under preferred semantics. Artif. Intell. 207: 23-51 (2014) - [j46]Samer Nofal, Katie Atkinson, Paul E. Dunne:
Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments. J. Artif. Intell. Res. 49: 635-668 (2014) - [c58]Richard Booth, Martin Caminada, Paul E. Dunne, Mikolaj Podlaszewski, Iyad Rahwan:
Complexity Properties of Critical Sets of Arguments. COMMA 2014: 173-184 - [c57]Paul E. Dunne, Katie Atkinson:
Properties of Random VAFs and Implications for Efficient Algorithms. COMMA 2014: 261-268 - [c56]Paul E. Dunne, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran:
Characteristics of Multiple Viewpoints in Abstract Argumentation. KR 2014 - 2013
- [j45]Paul E. Dunne, Wolfgang Dvorák, Stefan Woltran:
Parametric properties of ideal semantics. Artif. Intell. 202: 1-28 (2013) - [j44]Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin:
Automata for infinite argumentation structures. Artif. Intell. 203: 104-150 (2013) - [c55]Adam Z. Wyner, Trevor J. M. Bench-Capon, Paul E. Dunne:
On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks. CLIMA 2013: 34-50 - [c54]Samer Nofal, Paul E. Dunne, Katie Atkinson:
Algorithms for Acceptance in Argument Systems. ICAART (2) 2013: 34-43 - [c53]Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati:
Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. TAFA 2013: 176-193 - [i2]Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati:
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach. CoRR abs/1310.4986 (2013) - 2012
- [j43]Martin W. A. Caminada, Walter Alexandre Carnielli, Paul E. Dunne:
Semi-stable semantics. J. Log. Comput. 22(5): 1207-1254 (2012) - [c52]Paul E. Dunne, Michael J. Wooldridge:
Towards tractable Boolean games. AAMAS 2012: 939-946 - [c51]Paul E. Dunne:
Irrationality in Persuasive Argumentation. Logic Programs, Norms and Action 2012: 234-248 - [c50]Paul E. Dunne, Pierre Marquis, Michael J. Wooldridge:
Argument Aggregation: Basic Axioms and Complexity Results. COMMA 2012: 129-140 - [c49]Katie Atkinson, Trevor J. M. Bench-Capon, Paul E. Dunne:
Uniform Argumentation Frameworks. COMMA 2012: 165-176 - [c48]Samer Nofal, Paul E. Dunne, Katie Atkinson:
On Preferred Extension Enumeration in Abstract Argumentation. COMMA 2012: 205-216 - [c47]Samer Nofal, Paul E. Dunne, Katie Atkinson:
Towards Experimental Algorithms for Abstract Argumentation. COMMA 2012: 217-228 - [c46]Samer Nofal, Paul E. Dunne, Katie Atkinson:
Towards Average-case Algorithms for Abstract Argumentation. ICAART (1) 2012: 225-230 - 2011
- [j42]Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, Michael J. Wooldridge:
Weighted argument systems: Basic definitions, algorithms, and complexity results. Artif. Intell. 175(2): 457-486 (2011) - [j41]Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin:
On the resolution-based family of abstract argumentation semantics and its grounded instance. Artif. Intell. 175(3-4): 791-813 (2011) - [j40]Paul E. Dunne:
On Constructing Minimal Formulae. Comput. J. 54(7): 1067-1075 (2011) - [c45]Gerhard Brewka, Paul E. Dunne, Stefan Woltran:
Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. IJCAI 2011: 780-785 - [c44]Wolfgang Dvorák, Paul E. Dunne, Stefan Woltran:
Parametric Properties of Ideal Semantics. IJCAI 2011: 851-856 - [c43]Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin:
Computing with Infinite Argumentation Frameworks: The Case of AFRAs. TAFA 2011: 197-214 - 2010
- [j39]Paul E. Dunne, Sarit Kraus, Efrat Manisterski, Michael J. Wooldridge:
Solving coalitional resource games. Artif. Intell. 174(1): 20-50 (2010) - [c42]Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin:
On Extension Counting Problems in Argumentation Frameworks. COMMA 2010: 63-74 - [c41]Paul E. Dunne:
Tractability in Value-based Argumentation. COMMA 2010: 195-206 - [c40]Paul E. Dunne, Diego C. Martínez, Alejandro Javier García, Guillermo Ricardo Simari:
Computation with varied-strength attacks in abstract argumentation frameworks. COMMA 2010: 207-218 - [c39]Fahd Saud Nawwab, Paul E. Dunne, Trevor J. M. Bench-Capon:
Exploring the Role of Emotions in Rational Decision Making. COMMA 2010: 367-378 - [c38]Paul E. Dunne, Sanjay Modgil, Trevor J. M. Bench-Capon:
Computation in Extended Argumentation Frameworks. ECAI 2010: 119-124
2000 – 2009
- 2009
- [j38]Paul E. Dunne:
The computational complexity of ideal semantics. Artif. Intell. 173(18): 1559-1591 (2009) - [c37]Adam Zachary Wyner, Trevor J. M. Bench-Capon, Paul E. Dunne:
Instantiating Knowledge Bases in Abstract Argumentation Frameworks. AAAI Fall Symposium: The Uses of Computational Argumentation 2009 - [c36]Fahd Saud Nawwab, Trevor J. M. Bench-Capon, Paul E. Dunne:
Emotions in Rational Decision Making. ArgMAS 2009: 273-291 - [c35]Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, Michael J. Wooldridge:
Inconsistency tolerance in weighted argument systems. AAMAS (2) 2009: 851-858 - [c34]Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin:
Computational Properties of Resolution-based Grounded Semantics. IJCAI 2009: 683-689 - [p1]Paul E. Dunne, Michael J. Wooldridge:
Complexity of Abstract Argumentation. Argumentation in Artificial Intelligence 2009: 85-104 - 2008
- [j37]Paul E. Dunne, Yann Chevaleyre:
The complexity of deciding reachability properties of distributed negotiation schemes. Theor. Comput. Sci. 396(1-3): 113-144 (2008) - [c33]Paul E. Dunne, Wiebe van der Hoek, Sarit Kraus, Michael J. Wooldridge:
Cooperative Boolean games. AAMAS (2) 2008: 1015-1022 - [c32]Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne:
Asking the right question: forcing commitment in examination dialogues. COMMA 2008: 49-60 - [c31]Paul E. Dunne:
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks. COMMA 2008: 147-158 - [c30]Fahd Saud Nawwab, Trevor J. M. Bench-Capon, Paul E. Dunne:
A Methodology for Action-Selection using Value-Based Argumentation. COMMA 2008: 264-275 - [c29]Paul E. Dunne, Martin Caminada:
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. JELIA 2008: 153-165 - 2007
- [j36]Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne:
Audiences in argumentation frameworks. Artif. Intell. 171(1): 42-71 (2007) - [j35]Trevor J. M. Bench-Capon, Paul E. Dunne:
Argumentation in artificial intelligence. Artif. Intell. 171(10-15): 619-641 (2007) - [j34]Paul E. Dunne:
Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell. 171(10-15): 701-729 (2007) - [j33]Paul E. Dunne, Wiebe van der Hoek, Michael J. Wooldridge:
A logical characterisation of qualitative coalitional games. J. Appl. Non Class. Logics 17(4): 477-509 (2007) - [c28]Michael J. Wooldridge, Thomas Ågotnes, Paul E. Dunne, Wiebe van der Hoek:
Logic for Automated Mechanism Design - A Progress Report. AAAI 2007: 9-17 - 2006
- [j32]Michael J. Wooldridge, Paul E. Dunne:
On the computational complexity of coalitional resource games. Artif. Intell. 170(10): 835-871 (2006) - [j31]Yann Chevaleyre, Paul E. Dunne, Ulle Endriss, Jérôme Lang, Michel Lemaître, Nicolas Maudet, Julian A. Padget, Steve Phelps, Juan A. Rodríguez-Aguilar, Paulo Sousa:
Issues in Multiagent Resource Allocation. Informatica (Slovenia) 30(1): 3-31 (2006) - [c27]Michael J. Wooldridge, Paul E. Dunne, Simon Parsons:
On the Complexity of Linking Deductive and Abstract Argument Systems. AAAI 2006: 299-304 - [c26]Paul E. Dunne:
Complexity Properties of Restricted Abstract Argument Systems. COMMA 2006: 85-96 - [c25]Paul E. Dunne:
Suspicion of Hidden Agenda in Persuasive Argument. COMMA 2006: 329-340 - [e1]Paul E. Dunne, Trevor J. M. Bench-Capon:
Computational Models of Argument: Proceedings of COMMA 2006, September 11-12, 2006, Liverpool, UK. Frontiers in Artificial Intelligence and Applications 144, IOS Press 2006, ISBN 978-1-58603-652-2 [contents] - 2005
- [j30]Paul E. Dunne, Michael J. Wooldridge, Michael Laurence:
The complexity of contract negotiation. Artif. Intell. 164(1-2): 23-46 (2005) - [j29]Trevor J. M. Bench-Capon, Paul E. Dunne:
Argumentation in AI and Law: Editors' Introduction. Artif. Intell. Law 13(1): 1-8 (2005) - [j28]Paul E. Dunne:
A Value-based Argument Model of Convention Degradation. Artif. Intell. Law 13(1): 153-188 (2005) - [j27]Michael J. Wooldridge, Paul E. Dunne:
The complexity of agent design problems: Determinism and history dependence. Ann. Math. Artif. Intell. 45(3-4): 343-371 (2005) - [j26]Paul E. Dunne:
Extremal Behaviour in Multiagent Contract Negotiation. J. Artif. Intell. Res. 23: 41-78 (2005) - [j25]Yann Chevaleyre, Paul E. Dunne, Ulle Endriss, Jérôme Lang, Nicolas Maudet, Juan A. Rodríguez-Aguilar:
Multiagent resource allocation. Knowl. Eng. Rev. 20(2): 143-149 (2005) - [c24]Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne:
Determining Preferences Through Argumentation. AI*IA 2005: 98-109 - [c23]Paul E. Dunne:
Multiagent Resource Allocation in the Presence of Externalities. CEEMAS 2005: 408-417 - [c22]Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne:
Explaining preferences with argument positions. IJCAI 2005: 1560-1561 - [c21]Paul E. Dunne, Sylvie Doutre, Trevor J. M. Bench-Capon:
Discovering Inconsistency through Examination Dialogues. IJCAI 2005: 1680-1681 - 2004
- [j24]Michael J. Wooldridge, Paul E. Dunne:
On the computational complexity of qualitative coalitional games. Artif. Intell. 158(1): 27-73 (2004) - [c20]Paul E. Dunne, Trevor J. M. Bench-Capon:
Identifying Audience Preferences in Legal and Social Domains. DEXA 2004: 518-527 - [c19]Paul E. Dunne:
Context Dependence in Multiagent Resource Allocation. ECAI 2004: 1001-1002 - [c18]Paul E. Dunne, Michael Laurence, Michael J. Wooldridge:
Tractability Results for Automatic Contracting. ECAI 2004: 1003-1004 - [c17]Paul E. Dunne, Wiebe van der Hoek:
Representation and Complexity in Boolean Games. JELIA 2004: 347-359 - [c16]Paul E. Dunne, Trevor J. M. Bench-Capon:
Complexity in Value-Based Argument Systems. JELIA 2004: 360-371 - 2003
- [j23]Paul E. Dunne, Trevor J. M. Bench-Capon:
Two party immediate response disputes: Properties and efficiency. Artif. Intell. 149(2): 221-250 (2003) - [c15]Paul E. Dunne, Peter McBurney:
Concepts of Optimal Utterance in Dialogue: Selection and Complexity. Workshop on Agent Communication Languages 2003: 310-328 - [c14]Paul E. Dunne, Peter McBurney:
Optimal utterances in dialogue protocols. AAMAS 2003: 608-615 - [c13]Paul E. Dunne:
Prevarication in Dispute Protocols. ICAIL 2003: 12-21 - 2002
- [j22]Paul E. Dunne, Trevor J. M. Bench-Capon:
Coherence in finite argument systems. Artif. Intell. 141(1/2): 187-203 (2002) - [j21]Paul E. Dunne, Paul H. Leng, Gerald F. Nwana:
Demand-driven logic simulation using a network of loosely coupled processors. J. Syst. Archit. 47(14-15): 1117-1128 (2002) - [c12]Trevor J. M. Bench-Capon, Paul E. Dunne:
No agent is an island: a framework for the study of inter-agent behavior. AAMAS 2002: 690-691 - [c11]Paul E. Dunne, Michael J. Wooldridge, Michael Laurence:
The computational complexity of boolean and stochastic agent design problems. AAMAS 2002: 976-983 - [c10]Paul E. Dunne:
On concise encodings of preferred extensions. NMR 2002: 392-398 - [i1]Paul E. Dunne:
On Concise Encodings of Preferred Extensions. CoRR cs.AI/0207024 (2002) - 2001
- [j20]William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito:
Leafy spanning trees in hypercubes. Appl. Math. Lett. 14(7): 801-804 (2001) - [j19]Paul E. Dunne, Trevor J. M. Bench-Capon:
A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses. J. Log. Algebraic Methods Program. 47(1): 1-14 (2001) - [c9]Michael J. Wooldridge, Paul E. Dunne:
The Computational Complexity of Agent Verification. ATAL 2001: 115-127 - 2000
- [j18]Paul E. Dunne, Alan Gibbons:
J.UCS Special Issue on BCTCS. J. Univers. Comput. Sci. 6(4): 405-406 (2000) - [j17]Paul E. Dunne, Alan Gibbons, Michele Zito:
Complexity-theoretic models of phase transitions in search problems. Theor. Comput. Sci. 249(2): 243-263 (2000) - [c8]Michael J. Wooldridge, Paul E. Dunne:
Optimistic and Disjunctive Agent Design Problems. ATAL 2000: 1-14
1990 – 1999
- 1999
- [j16]Paul E. Dunne, Paul H. Leng:
The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae. J. Univers. Comput. Sci. 5(5): 288-306 (1999) - 1998
- [j15]Martyn Amos, Alan Gibbons, Paul E. Dunne:
Toward feasible and efficient DNA computation. Complex. 4(1): 20-24 (1998) - [j14]Paul E. Dunne, Michele Zito:
An Inproved Upper Bound on the Non-3-Colourability Threshold. Inf. Process. Lett. 65(1): 17-23 (1998) - 1997
- [j13]Paul E. Dunne, Trevor J. M. Bench-Capon:
The Maximum Length of Prime Implicates for Instances of 3-SAT. Artif. Intell. 92(1-2): 317-329 (1997) - [c7]Martyn Amos, Alan Gibbons, Paul E. Dunne:
The Complexity and Viability of DNA Computations. BCEC 1997: 165-173 - [c6]Frans Coenen, Paul E. Dunne:
The Verification and Validation of Rulebases Using a Binary Encoded Incidence Matrix Technique. EUROVAV 1997: 43-54 - 1996
- [j12]Paul E. Dunne:
Ceilings of Monotone Boolean Functions. J. Univers. Comput. Sci. 2(7): 533-546 (1996) - 1995
- [j11]Paul E. Dunne, Chris J. Gittings, Paul H. Leng:
Multiprocessor Simulation Strategies with Optimal Speed-up. Inf. Process. Lett. 54(1): 23-33 (1995) - [j10]Paul E. S. Dunne, Paul H. Leng, Gerald F. Nwana:
On the Complexity of Boolean Functions Computed by Lazy Oracles. IEEE Trans. Computers 44(4): 495-502 (1995) - 1994
- [j9]Colin C. Charlton, Paul E. Dunne, Paul H. Leng, Janet Little, Martin R. Woodward:
Distributing quality-controlled software via the internet. Microprocess. Microprogramming 40(10-12): 861-864 (1994) - 1993
- [j8]Colin C. Charlton, Paul E. Dunne, Keith Halewood, Paul H. Leng:
An Algorithm to Generate Random Large Combinational Circuits. Comput. J. 36(2): 200-206 (1993) - [j7]Paul E. Dunne, Chris J. J. Gittings, Paul H. Leng:
Sequential and parallel strategies for the demand-driven simulation of logic circuits. Microprocess. Microprogramming 38(1-5): 519-525 (1993) - [c5]Geof Staniford, Trevor J. M. Bench-Capon, Paul E. S. Dunne:
Cooperative Dialogues with the Support of Autonomous Agents. ICICIS 1993: 144-151 - [c4]Trevor J. M. Bench-Capon, Paul E. S. Dunne, Geof Staniford:
Linearisation Schemata for Hypertext. DEXA 1993: 697-708 - 1992
- [c3]Trevor J. M. Bench-Capon, Paul E. S. Dunne, Geof Staniford:
Linearising Hypertext through Target Graph Specifications. DEXA 1992: 173-178 - 1990
- [j6]Paul E. S. Dunne:
Comment on Kochol's Paper "Efficient Monotone Circuits for Threshold Functions". Inf. Process. Lett. 34(5): 221-222 (1990) - [c2]Trevor J. M. Bench-Capon, Paul E. S. Dunne:
An Approach to the Integration of Legal Support Systems. DEXA 1990: 105-111
1980 – 1989
- 1989
- [j5]Paul E. S. Dunne:
On Monotone Simulations of Nonmonotone Networks. Theor. Comput. Sci. 66(1): 15-25 (1989) - 1988
- [j4]Trevor J. M. Bench-Capon, Paul E. S. Dunne:
Some Computational Properties of a Model for Electronic Documents. Electron. Publ. 2(4): 231-256 (1988) - 1987
- [j3]Paul E. S. Dunne:
A Result on k -Valent Graphs and Its Application to a Graph Embedding Problem. Acta Informatica 24(4): 447-459 (1987) - 1986
- [j2]Paul E. S. Dunne:
The Complexity of Central Slice Functions. Theor. Comput. Sci. 44: 247-257 (1986) - 1985
- [j1]Paul E. S. Dunne:
A 2.5n Lower Bound on the Monotone Network Complexity of T_3^n. Acta Informatica 22(2): 229-240 (1985) - [c1]Paul E. Dunne:
Lower bounds on the complexity of 1-time only branching programs. FCT 1985: 90-99 - 1984
- [b1]Paul E. Dunne:
Techniques for the analysis of monotone Boolean networks. University of Warwick, Coventry, UK, 1984
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-01-21 00:22 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:
