default search action
Carole Delporte-Gallet
Carole Delporte
Person information
- affiliation: IRIF, University Paris Cité, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j25]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie:
Distributed computing in the asynchronous LOCAL model. Theor. Comput. Sci. 1025: 114952 (2025) - 2024
- [c77]Carole Delporte-Gallet
, Hugues Fauconnier
Some New Results With k-Set Agreement. NETYS 2024: 83-99 - [c76]Carole Delporte-Gallet
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. PODC 2024: 310-320 - [c75]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Non-negotiating Distributed Computing. SIROCCO 2024: 208-225 - 2023
- [j24]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal
Optimal algorithms for synchronous Byzantine k-set agreement. Theor. Comput. Sci. 973: 114098 (2023) - [i12]Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. CoRR abs/2309.13977 (2023) - [i11]Carole Delporte-Gallet, Hugues Fauconnier, Mouna Safir:
Some New Results With k-set agreement. CoRR abs/2310.01976 (2023) - 2022
- [j23]Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
Distributed computability: Relating k-immediate snapshot and x-set agreement. Inf. Comput. 285(Part): 104815 (2022) - [c74]Zeinab Nehaï, François Bobot, Sara Tucci Piergiovanni, Carole Delporte-Gallet, Hugues Fauconnier:
A TLA+ Formal Proof of a Cross-Chain Swap. ICDCN 2022: 148-159 - [c73]Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When is Recoverable Consensus Harder Than Consensus? PODC 2022: 198-208 - [c72]Carole Delporte-Gallet
Optimal Algorithms for Synchronous Byzantine k-Set Agreement. SSS 2022: 178-192 - [i10]Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When Is Recoverable Consensus Harder Than Consensus? CoRR abs/2205.14213 (2022) - 2021
- [j22]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal
On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems. J. Parallel Distributed Comput. 153: 110-118 (2021) - [j21]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa:
The assignment problem. Theor. Comput. Sci. 886: 13-26 (2021) - 2020
- [c71]Carole Delporte-Gallet, Hugues Fauconnier, Mouna Safir:
Byzantine k-Set Agreement. NETYS 2020: 183-191 - [c70]Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum:
Communication Complexity of Wait-Free Computability in Dynamic Networks. SIROCCO 2020: 291-309 - [c69]Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
k-Immediate Snapshot and x-Set Agreement: How Are They Related? SSS 2020: 97-112 - [i9]Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems. CoRR abs/2010.00096 (2020)
2010 – 2019
- 2019
- [j20]Parosh Aziz Abdulla, Carole Delporte:
Special Issue on NETYS'2016. Computing 101(1): 1-2 (2019) - [j19]Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum
Making Local Algorithms Wait-Free: the Case of Ring Coloring. Theory Comput. Syst. 63(2): 344-365 (2019) - [c68]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal:
On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion. AINA 2019: 272-285 - [c67]Carole Delporte-Gallet, Hugues Fauconnier, Yan Jurski, François Laroussinie, Arnaud Sangnier
Towards Synthesis of Distributed Algorithms with SMT Solvers. NETYS 2019: 200-216 - [c66]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal:
Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector. PaCT 2019: 419-430 - [c65]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie:
Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model. SSS 2019: 105-110 - [i8]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie:
Distributed Computing in the Asynchronous LOCAL model. CoRR abs/1904.07664 (2019) - 2018
- [j18]Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems. IEEE Trans. Parallel Distributed Syst. 29(9): 2033-2045 (2018) - [c64]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa:
The Assignment Problem. ICDCN 2018: 14:1-14:9 - [c63]Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa:
An Anonymous Wait-Free Weak-Set Object Implementation. NETYS 2018: 141-156 - [c62]Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa:
A Characterization of t-Resilient Colorless Task Anonymous Solvability. SIROCCO 2018: 178-192 - 2017
- [i7]Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa:
A characterization of colorless anonymous t-resilient task computability. CoRR abs/1712.04393 (2017) - 2016
- [c61]Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems. ICA3PP 2016: 341-355 - [c60]Carole Delporte-Gallet, Hugues Fauconnier:
Asynchronous Consensus with Bounded Memory. NETYS 2016: 154-168 - [c59]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Set-Consensus Collections are Decidable. OPODIS 2016: 7:1-7:15 - [c58]Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum
t-Resilient Immediate Snapshot Is Impossible. SIROCCO 2016: 177-191 - [c57]Armando Castañeda, Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum
Making Local Algorithms Wait-Free: The Case of Ring Coloring. SSS 2016: 109-125 - [e1]Parosh Aziz Abdulla, Carole Delporte-Gallet:
Networked Systems - 4th International Conference, NETYS 2016, Marrakech, Morocco, May 18-20, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9944, Springer 2016, ISBN 978-3-319-46139-7 [contents] - [i6]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Set-Consensus Collections are Decidable. CoRR abs/1607.05635 (2016) - 2015
- [j17]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice. Distributed Comput. 28(1): 3-19 (2015) - [j16]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum:
Linear space bootstrap communication schemes. Theor. Comput. Sci. 561: 122-133 (2015) - [c56]Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert:
On the Space Complexity of Set Agreement. PODC 2015: 271-280 - [c55]Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling. SIROCCO 2015: 385-398 - [i5]Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert:
On the Space Complexity of Set Agreement. CoRR abs/1505.02690 (2015) - [i4]Cheng Wang, Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec:
Beyond One Third Byzantine Failures. CoRR abs/1511.08232 (2015) - 2014
- [c54]Carole Delporte, Hugues Fauconnier, Michel Raynal:
An Exercise in Concurrency: From Non-blocking Objects to Fair Objects. NBiS 2014: 1-7 - [c53]Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The:
Leader Election in Rings with Homonyms. NETYS 2014: 9-24 - [c52]Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal:
Fair Synchronization in the Presence of Process Crashes and its Weakest Failure Detector. SRDS 2014: 161-170 - 2013
- [j15]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Byzantine agreement with homonyms. Distributed Comput. 26(5-6): 321-340 (2013) - [j14]Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The:
Byzantine agreement with homonyms in synchronous systems. Theor. Comput. Sci. 496: 34-49 (2013) - [c51]Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The:
Uniform Consensus with Homonyms and Omission Failures. ICDCN 2013: 161-175 - [c50]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum:
Linear Space Bootstrap Communication Schemes. ICDCN 2013: 363-377 - [c49]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum:
Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|. NETYS 2013: 28-41 - [c48]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Leslie Lamport:
Adaptive Register Allocation with a Linear Number of Registers. DISC 2013: 269-283 - 2012
- [j13]Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Partial synchrony based on set timeliness. Distributed Comput. 25(3): 249-260 (2012) - [c47]Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The:
Byzantine Agreement with Homonyms in Synchronous Systems. ICDCN 2012: 76-90 - [c46]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Wait-freedom with advice. PODC 2012: 105-114 - [c45]Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The:
Homonyms with Forgeable Identifiers. SIROCCO 2012: 171-182 - 2011
- [j12]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
The disagreement power of an adversary. Distributed Comput. 24(3-4): 137-147 (2011) - [j11]Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
The minimum information about failures for solving non-local tasks in message-passing systems. Distributed Comput. 24(5): 255-269 (2011) - [j10]Carole Delporte-Gallet, Hugues Fauconnier:
Objets partagés et détecteurs de défaillances. Tech. Sci. Informatiques 30(7): 841-871 (2011) - [c44]Julien Clément, Carole Delporte-Gallet, Hugues Fauconnier, Mihaela Sighireanu:
Guidelines for the Verification of Population Protocols. ICDCS 2011: 215-224 - [c43]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Byzantine agreement with homonyms. PODC 2011: 21-30 - [c42]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Brief Announcement: On the Meaning of Solving a Task with a Failure Detector. DISC 2011: 145-146 - [i3]Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Impersonal Failure Detection. CoRR abs/1109.3056 (2011) - 2010
- [j9]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Tight failure detection bounds on atomic object implementations. J. ACM 57(4): 22:1-22:32 (2010) - [j8]Carole Delporte-Gallet, Stéphane Devismes
Stabilizing leader election in partial synchronous systems with crash failures. J. Parallel Distributed Comput. 70(1): 45-58 (2010) - [c41]Carole Delporte-Gallet, Stéphane Devismes
Algorithms for Extracting Timeliness Graphs. SIROCCO 2010: 127-141 - [c40]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Brief announcement: byzantine agreement with homonyms. SPAA 2010: 74-75 - [c39]Carole Delporte-Gallet, Stéphane Devismes
Approximation of delta-Timeliness. SSS 2010: 435-451 - [i2]Carole Delporte-Gallet, Stéphane Devismes
Algorithms For Extracting Timeliness Graphs. CoRR abs/1003.1058 (2010)
2000 – 2009
- 2009
- [c38]Carole Delporte-Gallet, Hugues Fauconnier:
Two Consensus Algorithms with Atomic Registers and Failure Detector Omega. ICDCN 2009: 251-262 - [c37]Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann:
Fault-Tolerant Consensus in Unknown and Anonymous Networks. ICDCS 2009: 368-375 - [c36]Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann, Felix C. Freiling, Mahir Kilic:
Message-efficient omission-tolerant consensus with limited synchrony. IPDPS 2009: 1-8 - [c35]Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems. OPODIS 2009: 115-128 - [c34]Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Partial synchrony based on set timeliness. PODC 2009: 102-110 - [c33]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
The disagreement power of an adversary: extended abstract. PODC 2009: 288-289 - [c32]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann:
The Disagreement Power of an Adversary. DISC 2009: 8-21 - [c31]Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems. DISC 2009: 358-359 - [i1]Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann:
Fault-Tolerant Consensus in Unknown and Anonymous Networks. CoRR abs/0903.3461 (2009) - 2008
- [j7]Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
On implementing omega in systems with weak reliability and synchrony assumptions. Distributed Comput. 21(4): 285-314 (2008) - [c30]Mohssen Abboud, Carole Delporte-Gallet, Hugues Fauconnier:
Agreement and consistency without knowing the number of processes. NOTERE 2008: 38:1-38:8 - [c29]Mohssen Abboud, Carole Delporte-Gallet, Hugues Fauconnier:
Agreement without knowing everybody: a first step to dynamicity. NOTERE 2008: 49:1-49:5 - [c28]Carole Delporte-Gallet, Stéphane Devismes
With Finite Memory Consensus Is Easier Than Reliable Broadcast. OPODIS 2008: 41-57 - [c27]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Sharing is harder than agreeing. PODC 2008: 85-94 - [c26]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann:
The Weakest Failure Detector for Message Passing Set-Agreement. DISC 2008: 109-120 - 2007
- [j6]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
The perfectly synchronized round-based model of distributed computing. Inf. Comput. 205(5): 783-815 (2007) - [c25]Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Josef Widder:
Clock Synchronization in the Byzantine-Recovery Failure Model. OPODIS 2007: 90-104 - [c24]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert:
Secretive Birds: Privacy in Population Protocols. OPODIS 2007: 329-342 - [c23]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier:
Robust Stabilizing Leader Election. SSS 2007: 219-233 - [c22]Carole Delporte-Gallet, Hugues Fauconnier, Felix C. Freiling, Lucia Draque Penso, Andreas Tielmann:
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors. DISC 2007: 165-178 - 2006
- [c21]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert:
When Birds Die: Making Population Protocols Fault-Tolerant. DCOSS 2006: 51-66 - [c20]Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Consensus with Byzantine Failures and Little System Synchrony. DSN 2006: 147-155 - 2005
- [j5]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distributed Comput. 65(4): 492-505 (2005) - [c19]Carole Delporte-Gallet, Hugues Fauconnier, Felix C. Freiling:
Revisiting Failure Detection and Consensus in Omission Failure Environments. ICTAC 2005: 394-408 - [c18]Carole Delporte-Gallet, Hugues Fauconnier, Stephanie Lorraine Horn, Sam Toueg:
Fast fault-tolerant agreement algorithms. PODC 2005: 169-178 - [c17]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui:
(Almost) All Objects Are Universal in Message Passing Systems. DISC 2005: 184-198 - 2004
- [c16]Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Gérard Le Lann:
Designing Modular Services in the Scattered Byzantine Failure Model. ISPDC/HeteroPar 2004: 262-269 - [c15]Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Communication-efficient leader election and consensus with limited link synchrony. PODC 2004: 328-337 - [c14]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
The weakest failure detectors to solve certain fundamental problems in distributed computing. PODC 2004: 338-346 - 2003
- [j4]Carole Delporte-Gallet, Hugues Fauconnier, Jean-Michel Hélary, Michel Raynal:
Early Stopping in Global Data Computation. IEEE Trans. Parallel Distributed Syst. 14(9): 909-921 (2003) - [c13]Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
On implementing omega with weak reliability and synchrony assumptions. PODC 2003: 306-314 - [c12]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Distributed Programming for Dummies: A Shifting Transformation Technique. SRDS 2003: 349- - 2002
- [c11]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
A Realistic Look At Failure Detectors. DSN 2002: 345-353 - [c10]Carole Delporte-Gallet, Hugues Fauconnier, Jean-Michel Hélary, Michel Raynal:
Early stopping in aglobal data computation. PODC 2002: 258 - [c9]Carole Delporte-Gallet, Hugues Fauconnier:
Latency Measures and Lower Bounds for Consensus with Failure Detectors. SIROCCO 2002: 87-100 - [c8]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui:
Failure Detection Lower Bounds on Registers and Consensus. DISC 2002: 237-251 - 2001
- [c7]Carole Delporte-Gallet, Hugues Fauconnier:
An example of Real-Time Group Communication System. ICDCS Workshops 2001: 5-10 - [c6]Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Stable Leader Election. DISC 2001: 108-122 - 2000
- [c5]Carole Delporte-Gallet, Hugues Fauconnier:
Fault-Tolerant Genuine Atomic Multicast to Multiple Groups. OPODIS 2000: 107-122 - [c4]Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Thrifty Generic Broadcast. DISC 2000: 268-282
1990 – 1999
- 1999
- [c3]Hugues Fauconnier, Carole Delporte-Gallet:
Synchronized Phased Systems. OPODIS 1999: 179-194 - [c2]Carole Delporte-Gallet, Hugues Fauconnier:
Real-Time Fault-Tolerant Atomic Broadcast. SRDS 1999: 48-55 - 1995
- [j3]Bernadette Charron-Bost, Carole Delporte-Gallet, Hugues Fauconnier:
Local and Temporal Predicates In Distributed Systems. ACM Trans. Program. Lang. Syst. 17(1): 157-179 (1995) - 1990
- [j2]Carole Delporte-Gallet, Hugues Fauconnier, Maurice Nivat:
Parallélisation d'algorithmes avec un nombre fixe de processeurs. RAIRO Theor. Informatics Appl. 24: 353-386 (1990)
1980 – 1989
- 1986
- [j1]Krzysztof R. Apt, Carole Delporte-Gallet:
Syntax Directed Analysis of Liveness Properties. Inf. Control. 68(1-3): 223-253 (1986) - 1983
- [c1]Krzysztof R. Apt, Carole Delporte:
An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract). ICALP 1983: 15-27
Coauthor Index
[j25] [c77] [c76] [c75] [j24] [i12] [i11] [j23] [c74] [c73] [c72] [i10] [j22] [j21] [c71] [c70] [c69] [i9] [j19] [c68] [c67] [c66] [c65] [i8] [j18] [c64] [c63] [c62] [i7] [c61] [c60] [c59] [c58] [c57] [i6] [j17] [j16] [c56] [c55] [i5] [i4] [c54] [c53] [c52] [j15] [j14] [c51] [c50] [c49] [c48] [j13] [c47] [c46] [c45] [j12] [j11] [j10] [c44] [c43] [c42] [i3] [j9] [j8] [c41] [c40] [c39] [i2] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [i1] [j7] [c30] [c29] [c28] [c27] [c26] [j6] [c25] [c24] [c23] [c22] [c21] [c20] [j5] [c19] [c18] [c17] [c16] [c15] [c14] [j4] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [j3] [j2]
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-03 20: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: