default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil D. Jones
Person information
- affiliation: University of Copenhagen, Denmark
Other persons with a similar name
- C. Neil Jones
- Colin N. Jones
![[0000-0001-7239-4799]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-7239-4799")
(aka: Colin Neil Jones) — Ecole Polytechnique Federale de Laussanne, Switzerland - Neil Jones
- Neil Christopher Jones
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c64]Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen:
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. VPT/HCVS@ETAPS 2020: 65-79
2010 – 2019
- 2018
- [c63]Neil D. Jones:
On Modeling and Programming. ISoLA (1) 2018: 22-34 - 2017
- [c62]Daniil Berezun, Neil D. Jones:
Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). PEPM 2017: 1-11 - 2014
- [c61]Neil D. Jones, Geoff W. Hamilton:
Asymptotic Speedups, Bisimulation and Distillation (Work in Progress). Ershov Memorial Conference 2014: 177-185 - 2013
- [c60]Neil D. Jones:
A Swiss Pocket Knife for Computability. Festschrift for Dave Schmidt 2013: 1-17 - 2012
- [j47]Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More:
Fifty years of the spectrum problem: survey and new results. Bull. Symb. Log. 18(4): 505-553 (2012) - [c59]Geoffrey William Hamilton, Neil D. Jones:
Distillation with labelled transition systems. PEPM 2012: 15-24 - [c58]Roberto Giacobazzi, Neil D. Jones, Isabella Mastroeni:
Obfuscation by partial evaluation of distorted interpreters. PEPM 2012: 63-72 - 2011
- [j46]Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist:
Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation. Sci. Ann. Comput. Sci. 21(1): 73-106 (2011) - [j45]Neil D. Jones, Markus Müller-Olm:
Preface to a special section on verification, model checking, and abstract interpretation. Int. J. Softw. Tools Technol. Transf. 13(6): 491-493 (2011) - [c57]Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist:
Computational Biology: A Programming Perspective. Formal Modeling: Actors, Open Systems, Biological Systems 2011: 403-433 - [c56]Geoff W. Hamilton, Neil D. Jones:
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. Ershov Memorial Conference 2011: 153-169 - 2010
- [c55]Matthias Heizmann, Neil D. Jones, Andreas Podelski:
Size-Change Termination and Transition Invariants. SAS 2010: 22-50 - [c54]Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen:
Programming in Biomolecular Computation. CS2Bio 2010: 97-114
2000 – 2009
- 2009
- [j44]Neil D. Jones, Lars Kristiansen:
A flow calculus of mwp-bounds for complexity analysis. ACM Trans. Comput. Log. 10(4): 28:1-28:41 (2009) - [e8]Neil D. Jones, Markus Müller-Olm:
Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5403, Springer 2009, ISBN 978-3-540-93899-6 [contents] - 2008
- [j43]Neil D. Jones, Nina Bohr:
Call-by-Value Termination in the Untyped lambda-Calculus. Log. Methods Comput. Sci. 4(1) (2008) - [c53]Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen:
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE 2008: 67-76 - [c52]Neil D. Jones, René Rydhof Hansen:
CTL as an Intermediate Language. VMCAI 2008: 4 - [i1]Neil D. Jones, Nina Bohr:
Call-by-value Termination in the Untyped Lambda-calculus. CoRR abs/0801.0882 (2008) - 2007
- [j42]Neil D. Jones, Nils Andersen:
Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci. 375(1-3): 120-136 (2007) - [c51]Neil D. Jones, René Rydhof Hansen:
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. APLAS 2007: 303-318 - 2006
- [j41]Wei-Ngan Chin, Siau-Cheng Khoo, Neil D. Jones:
Redundant Call Elimination via Tupling. Fundam. Informaticae 69(1-2): 1-37 (2006) - [j40]Neil D. Jones:
Guest Editor's Foreword. Nord. J. Comput. 13(1-2): 1 (2006) - 2005
- [j39]Arne J. Glenstrup, Neil D. Jones:
Termination analysis and specialization-point insertion in offline partial evaluation. ACM Trans. Program. Lang. Syst. 27(6): 1147-1215 (2005) - [c50]Damien Sereni, Neil D. Jones:
Termination Analysis of Higher-Order Functional Programs. APLAS 2005: 281-297 - [c49]Lars Kristiansen, Neil D. Jones:
The Flow of Data and the Complexity of Algorithms. CiE 2005: 263-274 - 2004
- [j38]David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen:
Compiler Optimization Correctness by Temporal Logic. High. Order Symb. Comput. 17(3): 173-206 (2004) - [j37]Neil D. Jones:
Transformation by interpreter specialisation. Sci. Comput. Program. 52: 307-339 (2004) - [c48]Neil D. Jones, Nina Bohr:
Termination Analysis of the Untyped lamba-Calculus. RTA 2004: 1-23 - [e7]Neil D. Jones, Xavier Leroy:
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004. ACM 2004, ISBN 1-58113-729-X [contents] - 2002
- [c47]Neil D. Jones, Arne J. Glenstrup:
Program Generation, Termination, and Binding-Time Analysis. GPCE 2002: 1-31 - [c46]Neil D. Jones, Arne J. Glenstrup:
Program generation, termination, and binding-time analysis. ICFP 2002: 283 - [c45]David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen:
Proving correctness of compiler optimizations by temporal logic. POPL 2002: 283-294 - [c44]Neil D. Jones, Arne J. Glenstrup:
Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis. PPDP 2002: 1 - 2001
- [j36]Neil D. Jones:
The expressive power of higher-order types or, life without CONS. J. Funct. Program. 11(1): 5-94 (2001) - [c43]Neil D. Jones:
Program Termination Analysis by Size-Change Graphs (Abstract). IJCAR 2001: 1-4 - [c42]Neil D. Jones:
Program Analysis for Implicit Computational Complexity. PADO 2001: 1 - [c41]Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram:
The size-change principle for program termination. POPL 2001: 81-92 - 2000
- [j35]Amir M. Ben-Amram, Neil D. Jones:
Computational complexity via programming languages: constant factors do matter. Acta Informatica 37(2): 83-120 (2000)
1990 – 1999
- 1999
- [j34]Amir M. Ben-Amram, Neil D. Jones:
A Precise Version of a Time Hierarchy Theorem. Fundam. Informaticae 38(1-2): 1-15 (1999) - [j33]Neil D. Jones:
EAPLS: the European Association for Programming Languages and Systems. ACM SIGPLAN Notices 34(2): 19-20 (1999) - [j32]Neil D. Jones:
LOGSPACE and PTIME Characterized by Programming Languages. Theor. Comput. Sci. 228(1-2): 151-174 (1999) - [c40]Neil D. Jones:
The Essence of Program Transformation by Partial Evaluation and Driving. Ershov Memorial Conference 1999: 62-79 - 1998
- [c39]Neil D. Jones, Carsten K. Gomard, Peter Sestoft:
Partial Evaluation for the Lambda Calculus. Partial Evaluation 1998: 203-220 - 1997
- [b4]Neil D. Jones:
Computability and complexity - from a programming perspective. Foundations of computing series, MIT Press 1997, ISBN 978-0-262-10064-9, pp. I-XVI, 1-466 - [j31]Neil D. Jones, Mads Rosendahl:
Higher-Order Minimal Function Graphs. J. Funct. Log. Program. 1997(2) (1997) - [c38]Neil D. Jones:
Combining Abstract Interpretation and Partial Evaluation (Brief Overview). SAS 1997: 396-405 - [e6]Peter Lee, Fritz Henglein, Neil D. Jones:
Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15-17 January 1997. ACM Press 1997, ISBN 0-89791-853-3 [contents] - 1996
- [j30]Neil D. Jones:
An Introduction to Partial Evaluation. ACM Comput. Surv. 28(3): 480-503 (1996) - [j29]Morten Heine Sørensen, Robert Glück, Neil D. Jones:
A Positive Supercompiler. J. Funct. Program. 6(6): 811-838 (1996) - [c37]Neil D. Jones:
What Not to Do When Writing an Interpreter for Specialisation. Dagstuhl Seminar on Partial Evaluation 1996: 216-237 - [c36]Arne J. Glenstrup, Neil D. Jones:
BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation. Ershov Memorial Conference 1996: 273-284 - 1995
- [c35]Neil D. Jones:
Special Address: MIX ten years after. PEPM 1995: 24-38 - [c34]Neil D. Jones:
Complexity and computability from a programming language perspective. MFPS 1995: 313-333 - [e5]Neil D. Jones:
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, USA, June 21-23, 1995. ACM Press 1995, ISBN 0-89791-720-0 [contents] - 1994
- [j28]Kim Marriott, Harald Søndergaard, Neil D. Jones:
Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 607-648 (1994) - [c33]Neil D. Jones, Mads Rosendahl:
Higher-Order Minimal Functional Graphs. ALP 1994: 242-252 - [c32]Nils Andersen, Neil D. Jones:
Generalizing Cook's Transformation to Imperative Stack Programs. Results and Trends in Theoretical Computer Science 1994: 1-18 - [c31]Neil D. Jones:
The Essence of Program Transformation by Partial Evaluation and Driving. Logic, Language and Computation 1994: 206-224 - [c30]Morten Heine Sørensen, Robert Glück, Neil D. Jones:
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. ESOP 1994: 485-500 - [c29]Neil D. Jones:
Program Speedups in Theory and Practice. IFIP Congress (1) 1994: 595-602 - [c28]Neil D. Jones:
Abstract Interpretation and Partial Evaluation in Functional and Logic Programming. ILPS 1994: 17-22 - [e4]Neil D. Jones, Masami Hagiya, Masahiko Sato:
Logic, Language and Computation, Festschrift in Honor of Satoru Takasu. Lecture Notes in Computer Science 792, Springer 1994, ISBN 0-387-57935-4 [contents] - 1993
- [b3]Neil D. Jones, Carsten K. Gomard, Peter Sestoft:
Partial evaluation and automatic program generation. Prentice Hall international series in computer science, Prentice Hall 1993, ISBN 978-0-13-020249-9, pp. I-XII, 1-415 - [c27]Neil D. Jones:
Constant time factors do matter. STOC 1993: 602-611 - 1991
- [j27]Carsten K. Gomard, Neil D. Jones:
A Partial Evaluator for the Untyped lambda-Calculus. J. Funct. Program. 1(1): 21-69 (1991) - [j26]Neil D. Jones:
Foreword (Selected Papers of ESOP '90). Sci. Comput. Program. 17(1-3): 1-2 (1991) - [j25]Carsten K. Gomard, Neil D. Jones:
Compiler Generation by Partial Evaluation: A Case Study. Struct. Program. 12(3): 123-144 (1991) - [j24]Neil D. Jones:
Static Semantics, Types, and Binding Time Analysis. Theor. Comput. Sci. 90(1): 95-118 (1991) - [c26]Neil D. Jones:
Efficient Algebraic Operations on Programs. AMAST 1991: 393-420 - 1990
- [c25]Neil D. Jones:
Partial Evaluation, Self-Application and Types. ICALP 1990: 639-659 - [c24]Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Olivier Danvy, Torben Æ. Mogensen:
A Self-Applicable Partial Evaluator for the Lambda Calculus. ICCL 1990: 49-58 - [e3]Neil D. Jones:
ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings. Lecture Notes in Computer Science 432, Springer 1990, ISBN 3-540-52592-0 [contents]
1980 – 1989
- 1989
- [j23]Neil D. Jones, Peter Sestoft, Harald Søndergaard:
Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. LISP Symb. Comput. 2(1): 9-50 (1989) - [c23]Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones:
Experiments with Implementations of Two Theoretical Constructions. Logic at Botik 1989: 119-133 - [c22]Carsten K. Gomard, Neil D. Jones:
Compiler Generation by Partial Evaluation: A Case Study. IFIP Congress 1989: 1139-1144 - 1988
- [j22]Neil D. Jones:
Scientific Foreword. New Gener. Comput. 6(2&3): 87-90 (1988) - [j21]Neil D. Jones:
Challenging Problems in Partial Evaluation and Mixed Computation. New Gener. Comput. 6(2&3): 291-302 (1988) - 1987
- [c21]Neil D. Jones, Peter Sestoft, Harald Søndergaard:
MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). MFPS 1987: 386-413 - 1986
- [c20]Neil D. Jones, Alan Mycroft:
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. POPL 1986: 296-306 - [e2]Harald Ganzinger, Neil D. Jones:
Programs as Data Objects, Proceedings of a Workshop, Copenhagen, Denmark, October 17-19, 1985. Lecture Notes in Computer Science 217, Springer 1986, ISBN 3-540-16446-4 [contents] - 1985
- [j20]Neil D. Jones, Peter Sestoft, Harald Søndergaard:
An experiment in partial evaluation: the generation of a compiler generator. ACM SIGPLAN Notices 20(8): 82-87 (1985) - [c19]Alan Mycroft, Neil D. Jones:
A relational framework for abstract interpretation. Programs as Data Objects 1985: 156-171 - [c18]Neil D. Jones, Peter Sestoft, Harald Søndergaard:
An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140 - 1984
- [j19]Peter Johansen, Neil D. Jones, Jens Clausen:
A method for detecting structure in polyhedra. Pattern Recognit. Lett. 2(4): 217-225 (1984) - [c17]Neil D. Jones, Alan Mycroft:
Stepwise Development of Operational and Denotational Semantics for Prolog. SLP 1984: 281-288 - 1982
- [c16]Henning Christiansen, Neil D. Jones:
Control Flow Treatment in a Simple Semantics-Directed Compiler Generator. Formal Description of Programming Concepts 1982: 73-98 - [c15]Steven S. Muchnick, Neil D. Jones:
A Fixed-Program Machine for Combinator Expression Evaluation. Symposium on LISP and Functional Programming 1982: 11-20 - [c14]Neil D. Jones, Steven S. Muchnick:
A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. POPL 1982: 66-74 - 1981
- [b2]Steven S. Muchnick, Neil D. Jones:
Program flow analysis - theory and applications. Prentice Hall software series, Prentice Hall 1981, ISBN 978-0-13-729681-1, pp. I-XVII, 1-418 - [j18]Neil D. Jones, Sven Skyum:
A Note on the Complexity of General D0L Membership. SIAM J. Comput. 10(1): 114-117 (1981) - [c13]Neil D. Jones:
Flow Analysis of Lambda Expressions (Preliminary Version). ICALP 1981: 114-128 - 1980
- [c12]Neil D. Jones, David A. Schmidt:
Compiler generation from denotational semantics. Semantics-Directed Compiler Generation 1980: 70-93 - [c11]Neil D. Jones, C. Michael Madsen:
Attribute-influenced LR parsing. Semantics-Directed Compiler Generation 1980: 393-407 - [c10]Neil D. Jones, Steven S. Muchnick:
Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra. FOCS 1980: 185-190 - [e1]Neil D. Jones:
Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus, Denmark, January 14-18, 1980. Lecture Notes in Computer Science 94, Springer 1980, ISBN 3-540-10250-7 [contents]
1970 – 1979
- 1979
- [j17]Neil D. Jones, Sven Skyum:
Complexity of Some Problems Concerning L Systems. Math. Syst. Theory 13: 29-43 (1979) - [c9]Neil D. Jones, Steven S. Muchnick:
Flow Analysis and Optimization of Lisp-Like Structures. POPL 1979: 244-256 - 1978
- [b1]Neil D. Jones, Steven S. Muchnick:
TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages. Lecture Notes in Computer Science 66, Springer 1978, ISBN 3-540-09085-1 - [j16]Robert W. Sebesta, Neil D. Jones:
Parsers for indexed grammars. Int. J. Parallel Program. 7(4): 345-359 (1978) - [j15]Neil D. Jones, Steven S. Muchnick:
The Complexity of Finite Memory Programs with Recursion. J. ACM 25(2): 312-321 (1978) - [j14]Neil D. Jones:
Corrigendum: Context Free Languages and Rudimentary Attributes. Math. Syst. Theory 11: 379-380 (1978) - 1977
- [j13]Neil D. Jones, Sven Skyum:
Recognition of Deterministic ETOL Languages in Logarathimic Space. Inf. Control. 35(3): 177-181 (1977) - [j12]Neil D. Jones:
A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. Inf. Process. Lett. 6(4): 110-112 (1977) - [j11]Neil D. Jones, Steven S. Muchnick:
Even Simple Programs Are Hard To Analyze. J. ACM 24(2): 338-350 (1977) - [j10]Neil D. Jones:
Corrigendum: Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. 15(2): 241 (1977) - [j9]Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien:
Complexity of Some Problems in Petri Nets. Theor. Comput. Sci. 4(3): 277-299 (1977) - [c8]Neil D. Jones, Sven Skyum:
Complexity of Some Problems Concerning L Systems. ICALP 1977: 301-308 - 1976
- [j8]Neil D. Jones, Y. Edmund Lien, William T. Laaser:
New Problems Complete for Nondeterministic Loc Space. Math. Syst. Theory 10: 1-17 (1976) - [j7]Neil D. Jones, William T. Laaser:
Complete Problems for Deterministic Polynomial Time. Theor. Comput. Sci. 3(1): 105-117 (1976) - [c7]Neil D. Jones, Steven S. Muchnick:
Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. POPL 1976: 77-94 - 1975
- [j6]Neil D. Jones:
Space-Bounded Reducibility among Combinatorial Problems. J. Comput. Syst. Sci. 11(1): 68-85 (1975) - [c6]Neil D. Jones, Steven S. Muchnick:
Even Simple Programs are Hard to Analyze. POPL 1975: 106-118 - 1974
- [j5]Neil D. Jones, Alan L. Selman:
Turing Machines and the Spectra of First-Order Formulas. J. Symb. Log. 39(1): 139-150 (1974) - [c5]Neil D. Jones, William T. Laaser:
Complete Problems for Deterministic Polynomial Time. STOC 1974: 40-46 - 1973
- [c4]Gerald L. Engel, Neil D. Jones:
Discrete structures in the undergraduate computer science curriculum. SIGCSE 1973: 56-59 - 1972
- [c3]Neil D. Jones, Alan L. Selman:
Turing Machines and the Spectra of First-Order Formulas with Equality. STOC 1972: 157-167 - 1971
- [j4]Lawrence L. Rose, Neil D. Jones, Bruce H. Barnes:
Automata: a teaching aid for mathematical machines. ACM SIGCSE Bull. 3(1): 12-20 (1971) - [c2]Edward G. Coffman Jr., Neil D. Jones:
Priority Paging Algorithms and the Extension Problem. SWAT 1971: 177-181 - 1970
- [j3]Neil D. Jones:
A Note on the Index of a Context-Free Language. Inf. Control. 16(2): 201-202 (1970)
1960 – 1969
- 1969
- [j2]Neil D. Jones:
Context-Free Languages and Rudimentary Attributes. Math. Syst. Theory 3(2): 102-109 (1969) - 1968
- [j1]Neil D. Jones:
Classes of Automata and Transitive Closure. Inf. Control. 13(3): 207-229 (1968) - 1967
- [c1]Neil D. Jones:
Classes of Automata and Transitive Closure. SWAT 1967: 296-306
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-09-10 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:
