default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBart Demoen
Person information
- affiliation: Catholic University of Leuven, Belgium
SPARQL queries 
🛈 Please note that only 66% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[c69]Zimcke Van de Staey, Tobias Verlinde, Bart Demoen, Bern Martens:
Co-de: an online learning platform for computational thinking. WiPSCE 2018: 32:1-32:2- 2017
- [c68]Bern Martens, Bart Demoen, Febe Karpez, Dorien Vandenhove, Kristien Van Loon:
Bringing Algorithms to Flemish Classrooms: Teaching the Teachers, and some Students. WiPSCE 2017: 103-104 - 2016
- [j32]Bart Demoen, Phuong-Lan Nguyen:
Graphs with coloring redundant edges. Electron. J. Graph Theory Appl. 4(2): 223-230 (2016) - 2015
- [j31]Christopher Mears, Maria Garcia de la Banda
, Mark Wallace, Bart Demoen:
A method for detecting symmetries in constraint models and its generalisation. Constraints An Int. J. 20(2): 235-273 (2015) - [c67]Tom Decroos, Patrick De Causmaecker, Bart Demoen:
Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization. GECCO (Companion) 2015: 1379-1380 - [c66]Willem Van Onsem, Bart Demoen, Patrick De Causmaecker:
Learning a Hidden Markov Model-Based Hyper-heuristic. LION 2015: 74-88 - 2014
- [j30]Christopher Mears, Maria Garcia de la Banda, Bart Demoen, Mark Wallace:
Lightweight dynamic symmetry breaking. Constraints An Int. J. 19(3): 195-242 (2014) - [j29]Tom Schrijvers, Bart Demoen, Markus Triska, Benoit Desouter:
Tor: Modular search with hookable disjunction. Sci. Comput. Program. 84: 101-120 (2014) - [j28]Bart Demoen, Maria Garcia de la Banda:
Redundant Sudoku rules. Theory Pract. Log. Program. 14(3): 363-377 (2014) - [c65]Tom Schrijvers, Nicolas Wu, Benoit Desouter, Bart Demoen:
Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation. PPDP 2014: 259-270 - 2013
- [j27]Bart Demoen, Maria Garcia de la Banda:
Redundant disequalities in the Latin Square problem. Constraints An Int. J. 18(4): 471-477 (2013) - [j26]Phuong-Lan Nguyen, Bart Demoen:
Representation sharing for Prolog. Theory Pract. Log. Program. 13(1): 71-106 (2013) - [j25]Tom Schrijvers, Bart Demoen, Benoit Desouter, Jan Wielemaker:
Delimited continuations for prolog. Theory Pract. Log. Program. 13(4-5): 533-546 (2013) - 2012
- [j24]Bart Demoen, Maria Garcia de la Banda:
Introduction to the special issue on Prolog systems. Theory Pract. Log. Program. 12(1-2): 1-4 (2012) - [c64]Tom Schrijvers, Markus Triska, Bart Demoen:
Tor: extensible search with hookable disjunction. PPDP 2012: 103-114 - [i12]Bart Demoen, Maria Garcia de la Banda:
Redundant Sudoku Rules. CoRR abs/1207.5926 (2012) - 2011
- [j23]Angelika Kimmig, Bart Demoen, Luc De Raedt, Vítor Santos Costa, Ricardo Rocha:
On the implementation of the probabilistic logic programming language ProbLog. Theory Pract. Log. Program. 11(2-3): 235-262 (2011) - [i11]Phuong-Lan Nguyen, Bart Demoen:
Representation Sharing for Prolog. CoRR abs/1106.1311 (2011) - [i10]Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, Henk Vandecasteele:
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs. CoRR abs/1106.1803 (2011) - [i9]Timon Van Overveldt, Bart Demoen:
High-Level Multi-Threading in hProlog. CoRR abs/1112.3786 (2011) - 2010
- [i8]Angelika Kimmig, Bart Demoen, Luc De Raedt, Vítor Santos Costa, Ricardo Rocha:
On the Implementation of the Probabilistic Logic Programming Language ProbLog. CoRR abs/1006.4442 (2010)
2000 – 2009
- 2009
- [j22]Jon Sneyers, Tom Schrijvers, Bart Demoen:
The computational power and complexity of constraint handling rules. ACM Trans. Program. Lang. Syst. 31(2): 8:1-8:42 (2009) - 2008
- [j21]Alexander Serebrenik, Tom Schrijvers, Bart Demoen:
Improving Prolog programs: Refactoring for Prolog. Theory Pract. Log. Program. 8(2): 201-215 (2008) - [j20]Bart Demoen:
Learn Prolog Now! Patrick Blackburn, Johan Bos, Kristina Striegnitz: College Publications, 2006 Paperback, ISBN 1-904987-17-6, xiv + 265 pages. Theory Pract. Log. Program. 8(2): 235-242 (2008) - [j19]Tom Schrijvers, Bart Demoen, David Scott Warren:
TCHR: a framework for tabled CLP. Theory Pract. Log. Program. 8(4): 491-526 (2008) - [c63]Christopher Mears, Maria J. García de la Banda, Mark Wallace, Bart Demoen:
A Novel Approach For Detecting Symmetries in CSP Models. CPAIOR 2008: 158-172 - [c62]Tom Schrijvers, Bart Demoen:
Uniting the Prolog Community. ICLP 2008: 7-8 - [c61]Angelika Kimmig, Vítor Santos Costa, Ricardo Rocha, Bart Demoen, Luc De Raedt:
On the Efficient Execution of ProbLog Programs. ICLP 2008: 175-189 - [c60]Bart Demoen, Phuong-Lan Nguyen:
Two WAM Implementations of Action Rules. ICLP 2008: 621-635 - [c59]Tom Schrijvers, Vítor Santos Costa, Jan Wielemaker, Bart Demoen:
Towards Typed Prolog. ICLP 2008: 693-697 - [c58]Bart Demoen, Phuong-Lan Nguyen:
Environment Reuse in the WAM. ICLP 2008: 698-702 - [p5]Leslie De Koninck, Tom Schrijvers, Bart Demoen:
A Flexible Search Framework for CHR. Constraint Handling Rules 2008: 16-47 - [p4]Peter Van Weert, Pieter Wuille, Tom Schrijvers, Bart Demoen:
CHR for Imperative Host Languages. Constraint Handling Rules 2008: 161-212 - [p3]Jon Sneyers, Tom Schrijvers, Bart Demoen:
Guard Reasoning in the Refined Operational Semantics of CHR. Constraint Handling Rules 2008: 213-244 - 2007
- [j18]Remko Tronçon, Gerda Janssens, Bart Demoen, Henk Vandecasteele:
Fast Frequent Querying with Lazy Control Flow Compilation. Theory Pract. Log. Program. 7(4): 481-498 (2007) - [j17]Ruben Vandeginste, Bart Demoen:
Incremental copying garbage collection for WAM-based Prolog systems. Theory Pract. Log. Program. 7(5): 505-536 (2007) - [c57]Leslie De Koninck, Tom Schrijvers, Bart Demoen:
The Correspondence Between the Logical Algorithms Language and CHR. ICLP 2007: 209-223 - [c56]Jon Sneyers, Peter Van Weert, Tom Schrijvers, Bart Demoen:
Aggregates in Constraint Handling Rules. ICLP 2007: 446-448 - [c55]Peter Van Weert, Jon Sneyers, Bart Demoen:
Aggregates for CHR through Program Transformation. LOPSTR 2007: 59-73 - [c54]Leslie De Koninck, Tom Schrijvers, Bart Demoen:
User-definable rule priorities for CHR. PPDP 2007: 25-36 - [i7]Tom Schrijvers, Bart Demoen, David Scott Warren:
TCHR: a framework for tabled CLP. CoRR abs/0712.3830 (2007) - [i6]Alexander Serebrenik, Tom Schrijvers, Bart Demoen:
Improving Prolog programs: Refactoring for Prolog. CoRR abs/cs/0702083 (2007) - 2006
- [j16]Tom Schrijvers, Bart Demoen, Maria J. García de la Banda, Peter J. Stuckey:
Improving PARMA trailing. Theory Pract. Log. Program. 6(6): 609-644 (2006) - [c53]Jon Sneyers, Tom Schrijvers, Bart Demoen:
Memory Reuse for CHR. ICLP 2006: 72-86 - [c52]Leslie De Koninck, Tom Schrijvers, Bart Demoen:
INCLP(R) - Interval-based Nonlinear Constraint Logic Programming over the Reals. WLP 2006: 91-100 - [c51]Jon Sneyers, Tom Schrijvers, Bart Demoen:
Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR. WLP 2006: 182-191 - [i5]Ruben Vandeginste, Bart Demoen:
Incremental copying garbage collection for WAM-based Prolog systems. CoRR abs/cs/0601003 (2006) - [i4]Remko Tronçon, Gerda Janssens, Bart Demoen, Henk Vandecasteele:
Fast Frequent Querying with Lazy Control Flow Compilation. CoRR abs/cs/0601072 (2006) - 2005
- [j15]Bart Demoen:
Book review: Programming in Prolog. Using the ISO Standard by William F. Clocksin , Christopher S. Mellish, Springer-Verlag, 2003, ISBN 3-540-00678-8. Theory Pract. Log. Program. 5(3): 391-395 (2005) - [j14]Maria J. García de la Banda, Warwick Harvey, Kim Marriott, Peter J. Stuckey, Bart Demoen:
Checking modes of HAL programs. Theory Pract. Log. Program. 5(6): 623-668 (2005) - [c50]Jon Sneyers, Tom Schrijvers, Bart Demoen:
Guard and Continuation Optimization for Occurrence Representations of CHR. ICLP 2005: 83-97 - [c49]Jon Sneyers, Tom Schrijvers, Bart Demoen:
Guard Simplification in CHR programs. W(C)LP 2005: 123-134 - [c48]Tom Schrijvers, Bart Demoen, Gregory J. Duck, Peter J. Stuckey, Thom W. Frühwirth:
Automatic Implication Checking for CHR Constraints. RULE@RDP 2005: 93-111 - [i3]Tom Schrijvers, Maria J. García de la Banda, Bart Demoen, Peter J. Stuckey:
Improving PARMA Trailing. CoRR abs/cs/0505085 (2005) - 2004
- [c47]Edgar G. Daylight, Bart Demoen, Francky Catthoor:
Formally Specifying Dynamic Data Structures for Embedded Software Design: an Initial Approach. FESCA@ETAPS 2004: 99-112 - [p2]Bart Demoen, Maria J. García de la Banda, Warwick Harvey, Kim Marriott, David Overton, Peter J. Stuckey:
Herbrand Constraints in HAL. Program Development in Computational Logic 2004: 499-538 - [e2]Bart Demoen, Vladimir Lifschitz:
Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings. Lecture Notes in Computer Science 3132, Springer 2004, ISBN 3-540-22671-0 [contents] - [i2]Maria J. García de la Banda, Warwick Harvey, Kim Marriott, Peter J. Stuckey, Bart Demoen:
Checking modes of HAL programs. CoRR cs.PL/0409038 (2004) - 2003
- [j13]Vítor Santos Costa, Ashwin Srinivasan, Rui Camacho, Hendrik Blockeel, Bart Demoen, Gerda Janssens, Jan Struyf, Henk Vandecasteele, Wim Van Laer:
Query Transformations for Improving the Efficiency of ILP Systems. J. Mach. Learn. Res. 4: 465-491 (2003) - [c46]Alexander Serebrenik, Bart Demoen:
Refactoring Logic Programs: Extended Abstract. ICLP 2003: 509-510 - 2002
- [j12]Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, Henk Vandecasteele:
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs. J. Artif. Intell. Res. 16: 135-166 (2002) - [c45]Maria J. García de la Banda, Bart Demoen, Kim Marriott, Peter J. Stuckey:
To the Gates of HAL: A HAL Tutorial. FLOPS 2002: 47-66 - [c44]Tom Schrijvers, Maria J. García de la Banda, Bart Demoen:
Trailing Analysis for HAL. ICLP 2002: 38-53 - [c43]Bart Demoen:
A Different Look at Garbage Collection for the WAM. ICLP 2002: 179-193 - [c42]Bart Demoen, Phuong-Lan Nguyen, Ruben Vandeginste:
Copying Garbage Collection for the WAM: To Mark or Not to Mark? ICLP 2002: 194-208 - [c41]Ruben Vandeginste, Konstantinos Sagonas, Bart Demoen:
Segment Order Preserving and Generational Garbage Collection for Prolog. PADL 2002: 299-317 - [c40]Tom Schrijvers, Bart Demoen:
Combining an improvement to PARMA trailing with trailing analysis. PPDP 2002: 88-98 - 2001
- [j11]Bart Demoen, Konstantinos Sagonas:
Heap Memory Management in Prolog with Tabling: Principles and Practice. J. Funct. Log. Program. 2001(9) (2001) - 2000
- [j10]Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens:
Project Report on LP+: A Second Generation Logic Programming Language. AI Commun. 13(1): 13-18 (2000) - [j9]Bart Demoen, Konstantinos Sagonas:
CHAT: the copy-hybrid approach to tabling. Future Gener. Comput. Syst. 16(7): 809-830 (2000) - [c39]Bart Demoen, Phuong-Lan Nguyen:
So Many WAM Variations, So Little Time. Computational Logic 2000: 1240-1254 - [c38]Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, Henk Vandecasteele:
Executing Query Packs in ILP. ILP 2000: 60-77 - [c37]Hendrik Blockeel, Bart Demoen, Gerda Janssens, Henk Vandecasteele, Wim Van Laer:
Two Advanced Transormations for Improving the Efficiency of an ILP system. ILP Work-in-progress reports 2000 - [c36]Bart Demoen:
Prolog and abduction 4 writing garbage collectors. LOPSTR 2000 - [c35]Bart Demoen, Konstantinos Sagonas:
Heap Garbage Collection in XSB: Practice and Experience. PADL 2000: 93-108 - [c34]Bjorn De Sutter, Bruno De Bus, Koenraad De Bosschere, P. Keyngnaert, Bart Demoen:
On the Static Analysis of Indirect Control Transfers in Binaries. PDPTA 2000 - [i1]Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart Demoen:
Scaling Up Inductive Logic Programming by Learning from Interpretations. CoRR cs.LG/0011044 (2000)
1990 – 1999
- 1999
- [j8]Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart Demoen:
Scaling Up Inductive Logic Programming by Learning from Interpretations. Data Min. Knowl. Discov. 3(1): 59-93 (1999) - [j7]Bart Demoen, Konstantinos Sagonas:
CAT: The Copying Approach to Tabling. J. Funct. Log. Program. 1999(Special Issue 2) (1999) - [c33]Henk Vandecasteele, Bart Demoen, Gerda Janssens:
A Finite Domain CLP Solver on Top of Mercury. New Trends in Constraints 1999: 256-273 - [c32]Bart Demoen, Maria J. García de la Banda, Warwick Harvey, Kim Marriott, Peter J. Stuckey:
An Overview of HAL. CP 1999: 174-188 - [c31]Bart Demoen, Maria J. García de la Banda, Warwick Harvey, Kim Marriott, Peter J. Stuckey:
Herbrand Constraint Solving in HAL. ICLP 1999: 260-274 - [c30]Bart Demoen, Konstantinos Sagonas:
CHAT Is Theta(SLG-Wam). LPAR 1999: 337-357 - [c29]Bart Demoen, Konstantinos Sagonas:
CHAT: The Copy-Hybrid Approach to Tabling. PADL 1999: 106-121 - 1998
- [j6]Michael Codish, Bart Demoen, Konstantinos Sagonas:
Semantics-Based Program Analysis for Logic-Based Languages Using XSB. Int. J. Softw. Tools Technol. Transf. 2(1): 29-45 (1998) - [c28]Bart Demoen, Konstantinos Sagonas:
Memory Management for Prolog with Tabling. ISMM 1998: 97-106 - [c27]Bart Demoen, Konstantinos Sagonas:
CAT: The Copying Approach to Tabling. PLILP/ALP 1998: 21-35 - 1997
- [j5]Paul Tarau, Koenraad De Bosschere, Bart Demoen:
On Delphi Lemmas and other Memoing Techniques for Deterministic Logic Programs. J. Log. Program. 30(2): 145-163 (1997) - [c26]Michael Codish, Bart Demoen, Konstantinos Sagonas:
XSB as the Natural Habitat for General Purpose Program Analysis. ICLP 1997: 416 - 1996
- [j4]Paul Tarau, Koenraad De Bosschere, Bart Demoen:
Partial Translation: Towards a Portable and Efficient Prolog Implementation Technology. J. Log. Program. 29(1-3): 65-83 (1996) - [c25]Bart Demoen, Geert Engels, Paul Tarau:
Segment order preserving copying garbage collection for WAM based Prolog. SAC 1996: 380-386 - [c24]Maurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers:
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. SAS 1996: 128-142 - 1995
- [j3]Michael Codish, Bart Demoen:
Analyzing Logic Programs Using "PROP"-ositional Logic Programs and a Magic Wand. J. Log. Program. 25(3): 249-274 (1995) - [c23]Paul Tarau, Bart Demoen, Koenraad De Bosschere:
The power of partial tanslation: an experiment with the C-ification of binary Prolog. SAC 1995: 152-156 - 1994
- [j2]Patrick Weemeeuw, Bart Demoen:
A Fine-Grained Parallel Memory Compaction Algorithm. J. Parallel Distributed Comput. 20(2): 176-186 (1994) - [c22]Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop. GULP-PRODE (1) 1994: 327-341 - [c21]Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - [c20]Bart Demoen, Greet Maris:
A Comparison of Some Schemes for Translating Logic to C. ICLP Workshop: Parallel and Data Parallel Execution of Logic Programs 1994: 79-91 - [c19]Remco Moolenaar, Bart Demoen:
Hybrid Tree Search in the Andorra Model. ICLP 1994: 110-123 - [c18]Paul Tarau, Bart Demoen:
Language Embedding by Dual Compilation and State Mirroring. LPE 1994 - [c17]Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. SAS 1994: 281-296 - [e1]Koenraad De Bosschere, Bart Demoen, Paul Tarau:
ILPS 1994, Workshop 4: Implementation Techniques for Logic Programming Languages, Ithaca, New York, USA, November 17, 1994. 1994 [contents] - 1993
- [c16]Remco Moolenaar, Bart Demoen:
Optimization Techniques for Nondeterministic Promotion in the Andorra Kernel Language. ICLP Workshop on Concurrent Constraint Programming 1993 - [c15]Remco Moolenaar, Bart Demoen:
A Parallel Implementation for AKL. PLILP 1993: 246-261 - [c14]Michael Codish, Bart Demoen:
Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand. ILPS 1993: 114-129 - 1992
- [c13]Patrick Weemeeuw, Bart Demoen:
Garbage Collection in Aurora: An Overview. IWMM 1992: 454-472 - [c12]Bart Demoen:
On the Transformation of a Prolog Program to a More Efficient Binary Program. LOPSTR 1992: 242-252 - 1991
- [c11]Remco Moolenaar, Henk Van Acker, Bart Demoen:
KAPPA: A Kernel Andorra Prolog Parallel Architecture Design. ICLP Workshop on Parallel Execution of Logic Programs 1991: 54-69 - [c10]Bart Demoen, André Mariën:
Implementation of Prolog as Binary Definite Programs. RCLP 1991: 165-176 - [c9]Egon Börger, Bart Demoen:
A Framework to Specify Database Update Views for Prolog. PLILP 1991: 147-158 - [c8]André Mariën, Bart Demoen:
A New Scheme for Unification in WAM. ISLP 1991: 257-271 - 1990
- [c7]Alain Callebaut, Bart Demoen:
Program Source as Model for Debugging Prolog. LPE 1990: 80-83 - [c6]Patrick Weemeeuw, Bart Demoen:
A la Recherche de la Mémoire Perdue OR Memory Compaction for Shard Memory Multiprocessors. NACLP 1990: 306-320
1980 – 1989
- 1989
- [c5]Bart Demoen, André Mariën, Alain Callebaut:
Indexing Prolog Clauses. NACLP 1989: 1001-1012 - [c4]André Mariën, Bart Demoen:
On the Management of Choicepoint and Environment Frames in the WAM. NACLP 1989: 1030-1047 - 1988
- [j1]Raf Venken, Bart Demoen:
A Partial Evaluation System for Prolog: some Practical Considerations. New Gener. Comput. 6(2&3): 279-290 (1988) - [c3]Gerda Janssens, Bart Demoen, André Mariën:
Improving the Register Allocation of WAM by Recording Unification. ICLP/SLP 1988: 1388-1402 - [p1]William G. Imlah, Bart Demoen:
A Flexible Prolog-Based Lexical Database System. Prolog and Databases 1988: 332-339 - 1987
- [c2]Maurice Bruynooghe, Gerda Janssens, Alain Callebaut, Bart Demoen:
Abstract Interpretation: Towards the Global Optimization of Prolog Programs. SLP 1987: 192-204 - [c1]Peter Van Roy, Bart Demoen, Yves D. Willems:
Improving the Execution Speed of Compiled Prolog with Modes, Clause Selection, and Determinism. TAPSOFT, Vol.2 1987: 111-125
Coauthor Index
Maria Garcia de la Banda
aka: Maria J. García de la Banda
aka: Maria J. García de la Banda
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-13 00:44 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:
