default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaymond R. Devillers
Person information
- affiliation: Universite Libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[b2]Eike Best, Raymond R. Devillers:
Petri Net Primer - A Compendium on the Core Model, Analysis, and Synthesis. Springer 2024, ISBN 978-3-031-48277-9, pp. 1-504- [c55]Eike Best, Raymond R. Devillers:
Petri Net Synthesis from a Reachability Set. Petri Nets 2024: 223-243 - [c54]Eike Best, Raymond R. Devillers:
Coverability in Well-Formed Free-Choice Petri Nets. Taming the Infinities of Concurrency 2024: 122-132 - 2023
- [j49]Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
An Efficient State Space Construction for a Class of Timed Automata. Trans. Petri Nets Other Model. Concurr. 17: 246-263 (2023) - [c53]Raymond R. Devillers:
On the Reversibility of Circular Conservative Petri Nets. Petri Nets 2023: 307-323 - [c52]Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
Factorization of the State Space Construction for Cyclic Systems with Data. VECoS 2023: 1-14 - 2022
- [j48]Raymond R. Devillers, Ronny Tredup:
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. Fundam. Informaticae 187(2-4): 139-165 (2022) - [j47]Raymond R. Devillers, Ronny Tredup:
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. Fundam. Informaticae 187(2-4): 167-196 (2022) - [j46]Raymond R. Devillers, Ronny Tredup:
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. Fundam. Informaticae 189(3-4): 261-296 (2022) - [c51]Raymond R. Devillers, Ronny Tredup:
Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues. Petri Nets 2022: 213-235 - [c50]Raymond R. Devillers, Ronny Tredup:
Complexity of Distributed Petri Net Synthesis. TASE 2022: 15-28 - [i8]Raymond R. Devillers, Ronny Tredup:
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. CoRR abs/2203.09233 (2022) - 2021
- [j45]Raymond R. Devillers:
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis. Fundam. Informaticae 183(1-2): 1-31 (2021) - [j44]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
:
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. Trans. Petri Nets Other Model. Concurr. 15: 75-100 (2021) - [c49]Raymond R. Devillers:
Synthesis of (Choice-Free) Reset Nets. Petri Nets 2021: 274-291 - [i7]Raymond R. Devillers:
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis. CoRR abs/2111.00202 (2021) - [i6]Raymond R. Devillers, Ronny Tredup:
Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues. CoRR abs/2112.03605 (2021) - [i5]Raymond R. Devillers, Ronny Tredup:
Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues. CoRR abs/2112.03608 (2021) - 2020
- [j43]Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks. Fundam. Informaticae 175(1-4): 59-95 (2020) - [j42]Eike Best, Raymond R. Devillers, Evgeny Erofeev, Harro Wimmel:
Target-oriented Petri Net Synthesis. Fundam. Informaticae 175(1-4): 97-122 (2020) - [c48]Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
Models for Dynamic Exploration of the Statespaces of Autonomous Vehicles. PNSE@Petri Nets 2020: 29-48 - [c47]Eike Best, Raymond R. Devillers, Evgeny Erofeev:
A New Property of Choice-Free Petri Net Systems. Petri Nets 2020: 89-108 - [c46]Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
VERIFCAR: A Framework for Modeling and Model checking Communicating Autonomous Vehicles. AAMAS 2020: 2126-2127
2010 – 2019
- 2019
- [j41]Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
VerifCar: a framework for modeling and model checking communicating autonomous vehicles. Auton. Agents Multi Agent Syst. 33(3): 353-381 (2019) - [j40]Raymond R. Devillers, Thomas Hujsa:
Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. Fundam. Informaticae 169(1-2): 1-30 (2019) - [j39]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. Trans. Petri Nets Other Model. Concurr. 14: 172-191 (2019) - [c45]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems. ATAED@Petri Nets/ACSD 2019: 6-22 - [c44]Raymond R. Devillers:
Articulation of Transition Systems and Its Application to Petri Net Synthesis. Petri Nets 2019: 113-126 - [i4]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. CoRR abs/1910.14387 (2019) - [i3]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. CoRR abs/1911.00474 (2019) - [i2]Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
Dynamic exploration of multi-agent systems with timed periodic tasks. CoRR abs/1911.07591 (2019) - 2018
- [j38]Raymond R. Devillers:
Factorisation of transition systems. Acta Informatica 55(4): 339-362 (2018) - [j37]Eike Best, Raymond R. Devillers, Uli Schlachter:
Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica 55(7): 575-611 (2018) - [j36]Eike Best, Raymond R. Devillers, Uli Schlachter, Harro Wimmel:
Simultaneous Petri Net Synthesis. Sci. Ann. Comput. Sci. 28(2): 199-236 (2018) - [j35]Thomas Hujsa, Raymond R. Devillers:
On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets. Fundam. Informaticae 161(4): 383-421 (2018) - [j34]Eike Best, Raymond R. Devillers:
Pre-synthesis of Petri nets based on prime cycles and distance paths. Sci. Comput. Program. 157: 41-55 (2018) - [c43]Raymond R. Devillers, Thomas Hujsa:
Analysis and Synthesis of Weighted Marked Graph Petri Nets. Petri Nets 2018: 19-39 - [c42]Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa:
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. ATAED@Petri Nets/ACSD 2018: 75-90 - [c41]Raymond R. Devillers, Uli Schlachter:
Factorisation of Petri Net Solvable Transition Systems. Petri Nets 2018: 82-98 - 2017
- [j33]Eike Best, Raymond R. Devillers:
Characterisation of the state spaces of marked graph Petri nets. Inf. Comput. 253: 399-410 (2017) - [c40]Thomas Hujsa, Raymond R. Devillers:
On Liveness and Deadlockability in Subclasses of Weighted Petri Nets. Petri Nets 2017: 267-287 - [c39]Johan Arcile, Raymond R. Devillers, Hanna Klaudel, Witold Klaudel, Bozena Wozna-Szczesniak:
Modeling and checking robustness of communicating autonomous vehicles. DCAI 2017: 173-180 - [c38]Eike Best, Raymond R. Devillers, Uli Schlachter:
A Graph-Theoretical Characterisation of State Separation. SOFSEM 2017: 163-175 - 2016
- [j32]Curtis Bright, Raymond R. Devillers, Jeffrey O. Shallit:
Minimal Elements for the Prime Numbers. Exp. Math. 25(3): 321-331 (2016) - [j31]Raymond R. Devillers, Antti Valmari, Wojciech Penczek:
Preface. Fundam. Informaticae 146(1): v-vi (2016) - [c37]Raymond R. Devillers:
Products of Transition Systems and Additions of Petri Nets. ACSD 2016: 65-73 - [c36]Eike Best, Raymond R. Devillers:
The Power of Prime Cycles. Petri Nets 2016: 59-78 - [c35]Raymond R. Devillers, Hanna Klaudel:
Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata. FORMATS 2016: 140-156 - 2015
- [j30]Eike Best, Raymond R. Devillers:
Synthesis and reengineering of persistent systems. Acta Informatica 52(1): 35-60 (2015) - [j29]Eike Best, Raymond R. Devillers:
State space axioms for T-systems. Acta Informatica 52(2-3): 133-152 (2015) - [j28]Eike Best, Raymond R. Devillers:
Synthesis of Live and Bounded Persistent Systems. Fundam. Informaticae 140(1): 39-59 (2015) - [c34]Eike Best, Raymond R. Devillers:
Synthesis of Bounded Choice-Free Petri Nets. CONCUR 2015: 128-141 - [c33]Johan Arcile, Tadeusz Czachórski, Raymond R. Devillers, Jean-Yves Didier, Hanna Klaudel, Artur Rataj:
Modelling and Analysing Mixed Reality Applications. ICMMI 2015: 3-17 - [c32]Johan Arcile, Jean-Yves Didier, Hanna Klaudel, Raymond R. Devillers, Artur Rataj:
Indefinite waitings in MIRELA systems. ESSS 2015: 5-18 - [e1]Raymond R. Devillers, Antti Valmari:
Application and Theory of Petri Nets and Concurrency - 36th International Conference, PETRI NETS 2015, Brussels, Belgium, June 21-26, 2015, Proceedings. Lecture Notes in Computer Science 9115, Springer 2015, ISBN 978-3-319-19487-5 [contents] - 2014
- [c31]Eike Best, Raymond R. Devillers:
Synthesis of Persistent Systems. Petri Nets 2014: 111-129 - [c30]Raymond R. Devillers, Jean-Yves Didier, Hanna Klaudel, Johan Arcile:
Deadlock and Temporal Properties Analysis in Mixed Reality Applications. ISSRE 2014: 55-65 - [c29]Eike Best, Raymond R. Devillers:
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. LATA 2014: 161-172 - 2013
- [j27]Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers:
A Petri Net Interpretation of Open Reconfigurable Systems. Fundam. Informaticae 122(1-2): 85-117 (2013) - [c28]Raymond R. Devillers, Jean-Yves Didier, Hanna Klaudel:
Implementing Timed Automata Specifications: The "Sandwich" Approach. ACSD 2013: 226-235 - 2011
- [c27]Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers:
A Petri Net Interpretation of Open Reconfigurable Systems. Petri Nets 2011: 208-227 - 2010
- [c26]Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers:
A Decidable Characterization of a Graphical Pi-calculus with Iterators. INFINITY 2010: 47-61
2000 – 2009
- 2009
- [c25]Franck Pommereau, Raymond R. Devillers, Hanna Klaudel:
Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. INFINITY 2009: 119-129 - 2008
- [j26]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny:
A compositional Petri net translation of general pi -calculus terms. Formal Aspects Comput. 20(4-5): 429-450 (2008) - [c24]Roland Bouroulet, Raymond R. Devillers, Hanna Klaudel, Elisabeth Pelz, Franck Pommereau:
Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets. Petri Nets 2008: 72-91 - [c23]Vincent Nélis, Joël Goossens, Raymond R. Devillers, Dragomir Milojevic, Nicolas Navet:
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms. SUTC 2008: 209-216 - 2007
- [j25]Anastasia Yartseva, Hanna Klaudel, Raymond R. Devillers, François Képès:
Incremental and unifying modelling formalism for biological interaction networks. BMC Bioinform. 8 (2007) - [j24]Anastasia Yartseva, Raymond R. Devillers, Hanna Klaudel, François Képès:
From MIN model to ordinary differential equations. J. Integr. Bioinform. 4(3) (2007) - [c22]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny:
Modelling Mobility in High-level Petri Nets. ACSD 2007: 110-119 - [c21]Vandy Berten, Raymond R. Devillers, Guy Louchard:
FIFO Queuing of Constant Length Fully Synchronous Jobs. GSEM 2007: 81-95 - [i1]Vincent Nélis, Joël Goossens, Nicolas Navet, Raymond R. Devillers, Dragomir Milojevic:
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms. CoRR abs/0712.2958 (2007) - 2006
- [j23]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny:
Petri Net Semantics of the Finite pi-calculus Terms. Fundam. Informaticae 70(3): 203-226 (2006) - [j22]Raymond R. Devillers, Laurent Van Begin:
Boundedness undecidability for synchronized nets. Inf. Process. Lett. 99(5): 208-214 (2006) - [j21]Maxime Van Assche, Joël Goossens, Raymond R. Devillers:
Joint garbage collection and hard real-time scheduling. J. Embed. Comput. 2(3-4): 313-326 (2006) - [c20]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny:
A Petri Net Translation of pi-Calculus Terms. ICTAC 2006: 138-152 - 2005
- [j20]Raymond R. Devillers, Hanna Klaudel:
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets. Fundam. Informaticae 66(3): 221-257 (2005) - [c19]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny:
A Petri Net Semantics of a Simple Process Algebra for Mobility. EXPRESS 2005: 71-94 - 2004
- [c18]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny:
Context-based Process Algebras for Mobility. ACSD 2004: 79-88 - [c17]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny:
Petri Net Semantics of the Finite pi-Calculus. FORTE 2004: 309-325 - 2003
- [j19]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau:
Asynchronous Box Calculus. Fundam. Informaticae 54(4): 295-344 (2003) - [j18]Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann:
General parameterised refinement and recursion for the M-net calculus. Theor. Comput. Sci. 300(1-3): 259-300 (2003) - 2002
- [j17]Eike Best, Raymond R. Devillers, Maciej Koutny:
The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178(1): 44-100 (2002) - [c16]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau:
An Algebra of Non-safe Petri Boxes. AMAST 2002: 192-207 - 2001
- [b1]Eike Best, Raymond R. Devillers, Maciej Koutny:
Petri net algebra. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2001, ISBN 978-3-540-67398-9, pp. I-XI, 1-378 - [j16]Eike Best, Raymond R. Devillers, Maciej Koutny:
Recursion and Petri nets. Acta Informatica 37(11-12): 781-829 (2001) - [p3]Eike Best, Raymond R. Devillers, Maciej Koutny:
A Unified Model for Nets and Process Algebras. Handbook of Process Algebra 2001: 873-944 - 2000
- [j15]Raymond R. Devillers, Joël Goossens:
Liu and Layland's schedulability test revisited. Inf. Process. Lett. 73(5-6): 157-161 (2000) - [j14]Raymond R. Devillers, Hanna Klaudel, Elisabeth Pelz:
An Algebraic Box Calculus. J. Autom. Lang. Comb. 5(2): 81-107 (2000)
1990 – 1999
- 1999
- [j13]Raymond R. Devillers, Joël Goossens:
General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks. Fundam. Informaticae 40(2-3): 199-219 (1999) - [c15]Eike Best, Raymond R. Devillers, Maciej Koutny:
The Box Algebra - A Model of Nets and Process Expressions. ICATPN 1999: 344-363 - [c14]Joël Goossens, Raymond R. Devillers:
Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines. RTCSA 1999: 54-61 - 1998
- [c13]Raymond R. Devillers, Maciej Koutny:
Recursive Nets in the Box Algebra. ACSD 1998: 239-249 - 1997
- [j12]Joël Goossens, Raymond R. Devillers:
The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems. Real Time Syst. 13(2): 107-126 (1997) - [c12]Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann:
General Refinement for High Level Petri Nets. FSTTCS 1997: 297-311 - 1996
- [c11]Eike Best, Raymond R. Devillers, Maciej Koutny:
Petri Nets, Process Algebras and Concurrent Programming Languages. Petri Nets (2) 1996: 1-84 - [c10]Raymond R. Devillers:
Petri Boxes and Finite Precedence. CONCUR 1996: 465-480 - 1995
- [j11]Raymond R. Devillers:
S-Invariant Analysis of General Recursive Petri Boxes. Acta Informatica 32(4): 313-345 (1995) - [c9]Eike Best, Raymond R. Devillers, Elisabeth Pelz, Arend Rensink, Manuel Silva, Enrique Teruel:
CALIBAN - Esprit Basic Research WG 6067. STRICT 1995: 2-31 - [c8]Raymond R. Devillers, Hanna Klaudel:
Refinement and Recursion in a High Level Petri Box Calculus. STRICT 1995: 144-159 - 1993
- [j10]Thierry Massart, Raymond R. Devillers:
Equality of Agent Expressions is preserved Under an Extension of the Universe of Actions. Formal Aspects Comput. 5(1): 79-88 (1993) - [c7]Raymond R. Devillers:
Construction of S-invariants and S-components for Refined Petri Boxes. Application and Theory of Petri Nets 1993: 242-261 - [c6]Eike Best, Raymond R. Devillers, Javier Esparza:
General Refinement and Recursion Operators for the Petri Box Calculus. STACS 1993: 130-140 - 1992
- [j9]Raymond R. Devillers:
Maximality Preserving Bisimulation. Theor. Comput. Sci. 102(1): 165-183 (1992) - [p2]Eike Best, Raymond R. Devillers, Jon G. Hall:
The box calculus: a new causal algebra with multi-label communication. Advances in Petri Nets: The DEMON Project 1992: 21-69 - [p1]Raymond R. Devillers:
Maximality preservation and the ST-idea for action refinements. Advances in Petri Nets: The DEMON Project 1992: 108-151 - 1991
- [j8]Eike Best, Raymond R. Devillers, Astrid Kiehn, Lucia Pomello:
Concurrent Bisimulations in Petri Nets. Acta Informatica 28(3): 231-264 (1991)
1980 – 1989
- 1988
- [c5]Raymond R. Devillers:
The semantics of capacities in P/T nets. European Workshop on Applications and Theory in Petri Nets 1988: 128-150 - 1987
- [j7]Eike Best, Raymond R. Devillers:
Sequential and Concurrent Behaviour in Petri Net Theory. Theor. Comput. Sci. 55(1): 87-136 (1987) - [c4]Eike Best, Raymond R. Devillers:
Interleaving and partial orders in concurrency: a formal comparison. Formal Description of Programming Concepts 1987: 299-324 - 1986
- [j6]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) - 1984
- [c3]Ryszard Janicki, Peter E. Lauer, Raymond R. Devillers:
Maximally Concurrent Evolution of Non-sequential Systems. Seminar on Concurrency 1984: 268-280 - 1982
- [j5]J. J. Cocu, Raymond R. Devillers:
On a Class of Allocation Strategies Inducing Bounded Delays Only. Comput. J. 25(1): 52-55 (1982) - 1980
- [c2]Peter E. Lauer, Piero R. Torrigiani, Raymond R. Devillers:
Specification of highly parallel and distributed resource management. Symposium on Programming 1980: 223-239
1970 – 1979
- 1978
- [j4]Raymond R. Devillers, Peter E. Lauer:
A General Mechanism for Avoiding Starvation with Distributed Control. Inf. Process. Lett. 7(3): 156-158 (1978) - 1977
- [j3]Raymond R. Devillers:
Game Interpretation of the Deadlock Avoidance Problem. Commun. ACM 20(10): 741-745 (1977) - [c1]Raymond R. Devillers, Guy Louchard:
Using Auxiliary Variables in Parallel Programs Verification. International Computing Symposium 1977: 217-225 - 1976
- [j2]Raymond R. Devillers, Guy Louchard:
Improvement of Parallelism in a Finite Buffer Sharing Policy. Comput. J. 19(3): 238-245 (1976) - 1973
- [j1]Raymond R. Devillers, Guy Louchard:
Realization of Petri Nets Without Conditional Statements. Inf. Process. Lett. 2(4): 105-107 (1973)
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-06-28 23:43 CEST 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:
