default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Lengler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j31]Johannes Lengler, Andre Opris, Dirk Sudholt:
Analysing Equilibrium States for Population Diversity. Algorithmica 86(7): 1-35 (2024)- [j30]Carola Doerr, Duri Andrea Janett, Johannes Lengler:
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions. Algorithmica 86(10): 3115-3152 (2024) - [j29]Johannes Lengler, Jonas Meier
:
Large population sizes and crossover help in dynamic environments. Nat. Comput. 23(1): 115-129 (2024) - [c44]Kostas Lakis, Johannes Lengler, Kalina Petrova, Leon Schiller:
Improved Bounds for Graph Distances in Scale Free Percolation and Related Models. APPROX/RANDOM 2024: 74:1-74:22 - [c43]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling:
Hardest Monotone Functions for Evolutionary Algorithms. EvoStar 2024: 146-161 - [c42]Johannes Lengler, Leon Schiller, Oliver Sieberling:
Plus Strategies are Exponentially Slower for Planted Optima of Random Height. GECCO 2024 - [c41]Andre Opris, Johannes Lengler, Dirk Sudholt:
A Tight O(4k/pc) Runtime Bound for a (μ+1)GA on Jumpk for Realistic Crossover Probabilities. GECCO 2024 - [c40]Johannes Lengler, Konstantin Sturm:
Self-adjusting Evolutionary Algorithms are Slow on a Class of Multimodal Landscapes. PPSN (3) 2024: 3-18 - [c39]Diederick Vermetten, Johannes Lengler, Dimitri Rusin, Thomas Bäck, Carola Doerr:
Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler. PPSN (2) 2024: 20-35 - [c38]Cella Florescu, Marc Kaufmann, Johannes Lengler, Ulysse Schaller:
Faster Optimization Through Genetic Drift. PPSN (3) 2024: 70-85 - [c37]Sacha Cerf, Johannes Lengler:
How Population Diversity Influences the Efficiency of Crossover. PPSN (3) 2024: 102-116 - [d1]Diederick Vermetten, Johannes Lengler, Dimitri Rusin, Thomas Bäck, Carola Doerr:
Benchmarking Dynamic Binary Value Problems with IOHprofiler - Reproducibility files. Zenodo, 2024
- [i44]Andre Opris, Johannes Lengler, Dirk Sudholt:
A Tight O(4k/pc) Runtime Bound for a (μ+1) GA on Jumpk for Realistic Crossover Probabilities. CoRR abs/2404.07061 (2024) - [i43]Johannes Lengler, Leon Schiller, Oliver Sieberling:
Plus Strategies are Exponentially Slower for Planted Optima of Random Height. CoRR abs/2404.09687 (2024) - [i42]Johannes Lengler, Konstantin Sturm:
Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes. CoRR abs/2404.12047 (2024) - [i41]Cella Florescu, Marc Kaufmann, Johannes Lengler, Ulysse Schaller:
Faster Optimization Through Genetic Drift. CoRR abs/2404.12147 (2024) - [i40]Sacha Cerf, Johannes Lengler:
How Population Diversity Influences the Efficiency of Crossover. CoRR abs/2404.12268 (2024) - [i39]Diederick Vermetten, Johannes Lengler, Dimitri Rusin, Thomas Bäck, Carola Doerr:
Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler. CoRR abs/2404.15837 (2024) - [i38]Kostas Lakis, Johannes Lengler, Kalina Petrova, Leon Schiller:
Improved bounds for polylogarithmic graph distances in scale-free percolation and related models. CoRR abs/2405.07217 (2024) - [i37]Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, Konstantin Sturm:
Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models. CoRR abs/2408.01268 (2024) - 2023
- [j28]Duri Janett, Johannes Lengler:
Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard. Theor. Comput. Sci. 971: 114072 (2023) - [j27]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
Self-adjusting population sizes for the (1,λ)-EA on monotone functions. Theor. Comput. Sci. 979: 114181 (2023) - [c36]Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl:
On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM 2023: 30:1-30:22 - [c35]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
OneMax Is Not the Easiest Function for Fitness Improvements. EvoCOP 2023: 162-178 - [c34]Carola Doerr, Duri Andrea Janett, Johannes Lengler:
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions. GECCO 2023: 1565-1574 - [c33]Joost Jorritsma, Johannes Lengler, Dirk Sudholt:
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. GECCO 2023: 1602-1610 - [c32]Johannes Lengler, Andre Opris, Dirk Sudholt:
Analysing Equilibrium States for Population Diversity. GECCO 2023: 1628-1636 - [i36]Carola Doerr, Duri Andrea Janett, Johannes Lengler:
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions. CoRR abs/2302.12338 (2023) - [i35]Johannes Lengler, Andre Opris, Dirk Sudholt:
Analysing Equilibrium States for Population Diversity. CoRR abs/2304.09690 (2023) - [i34]Joost Jorritsma, Johannes Lengler, Dirk Sudholt:
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. CoRR abs/2304.09712 (2023) - [i33]Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller:
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I. CoRR abs/2309.11840 (2023) - [i32]Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller:
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II. CoRR abs/2309.11880 (2023) - [i31]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling:
Hardest Monotone Functions for Evolutionary Algorithms. CoRR abs/2311.07438 (2023) - 2022
- [j26]Johannes Lengler, Frank Neumann:
Editorial. Algorithmica 84(6): 1571-1572 (2022) - [j25]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy routing and the algorithmic small-world phenomenon. J. Comput. Syst. Sci. 125: 59-105 (2022) - [j24]Johannes Lengler, Simone Riedi:
Runtime Analysis of the (μ + 1)-EA on the Dynamic BinVal Function. SN Comput. Sci. 3(4): 324 (2022) - [c31]Thomas Helmuth, Johannes Lengler, William G. La Cava:
Population Diversity Leads to Short Running Times of Lexicase Selection. PPSN (2) 2022: 485-498 - [c30]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions. PPSN (2) 2022: 569-585 - [c29]Duri Janett, Johannes Lengler:
Two-Dimensional Drift Analysis: - Optimizing Two Functions Simultaneously Can Be Hard. PPSN (2) 2022: 612-625 - [i30]Duri Janett, Johannes Lengler:
Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously Can Be Hard. CoRR abs/2203.14547 (2022) - [i29]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
Self-adjusting Population Sizes for the (1, λ)-EA on Monotone Functions. CoRR abs/2204.00531 (2022) - [i28]Thomas Helmuth, Johannes Lengler, William G. La Cava:
Population Diversity Leads to Short Running Times of Lexicase Selection. CoRR abs/2204.06461 (2022) - [i27]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
OneMax is not the Easiest Function for Fitness Improvements. CoRR abs/2204.07017 (2022) - [i26]Anne Auger, Carlos M. Fonseca, Tobias Friedrich, Johannes Lengler:
Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081). Dagstuhl Reports 12(2): 87-102 (2022) - 2021
- [j23]Johannes Lengler, Dirk Sudholt, Carsten Witt:
The Complex Parameter Landscape of the Compact Genetic Algorithm. Algorithmica 83(4): 1096-1137 (2021) - [j22]Benjamin Doerr, Carola Doerr, Johannes Lengler:
Self-Adjusting Mutation Rates with Provably Optimal Success Rules. Algorithmica 83(10): 3108-3147 (2021) - [j21]Johannes Lengler, Xun Zou:
Exponential slowdown for larger populations: The (μ + 1)-EA on monotone functions. Theor. Comput. Sci. 875: 28-51 (2021) - [c28]Johannes Lengler, Simone Riedi:
Runtime Analysis of the (μ + 1)-EA on the Dynamic BinVal Function. EvoCOP 2021: 84-99 - 2020
- [j20]Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. Discret. Comput. Geom. 64(3): 700-733 (2020) - [j19]Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko:
Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming. Theor. Comput. Sci. 816: 96-113 (2020) - [j18]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time. Theor. Comput. Sci. 816: 144-168 (2020) - [j17]Johannes Lengler:
A General Dichotomy of Evolutionary Algorithms on Monotone Functions. IEEE Trans. Evol. Comput. 24(6): 995-1009 (2020) - [c27]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA 2020: 17:1-17:12 - [c26]Johannes Lengler, Jonas Meier:
Large Population Sizes and Crossover Help in Dynamic Environments. PPSN (1) 2020: 610-622 - [p1]Johannes Lengler:
Drift Analysis. Theory of Evolutionary Computation 2020: 89-131 - [i25]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm. CoRR abs/2002.05121 (2020) - [i24]Júlia Komjáthy, John Lapinskas, Johannes Lengler:
Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs. CoRR abs/2004.01149 (2020) - [i23]Johannes Lengler, Jonas Meier:
Large Population Sizes and Crossover Help in Dynamic Environments. CoRR abs/2004.09949 (2020) - [i22]Johannes Lengler, Simone Riedi:
Runtime analysis of the (mu+1)-EA on the Dynamic BinVal function. CoRR abs/2010.13428 (2020)
2010 – 2019
- 2019
- [j16]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by Swaps with Noisy Comparisons. Algorithmica 81(2): 796-827 (2019) - [j15]Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger:
Bootstrap percolation with inhibition. Random Struct. Algorithms 55(4): 881-925 (2019) - [j14]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically optimal amplifiers for the Moran process. Theor. Comput. Sci. 758: 73-93 (2019) - [j13]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Geometric inhomogeneous random graphs. Theor. Comput. Sci. 760: 35-54 (2019) - [j12]Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger:
The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. Theor. Comput. Sci. 785: 150-170 (2019) - [c25]Johannes Lengler, Anders Martinsson, Angelika Steger:
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. ANALCO 2019: 94-102 - [c24]Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger:
The Maximum Label Propagation Algorithm on Sparse Random Graphs. APPROX-RANDOM 2019: 58:1-58:15 - [c23]Johannes Lengler, Xun Zou:
Exponential slowdown for larger populations: the (µ + 1)-EA on monotone functions. FOGA 2019: 87-101 - [c22]Johannes Lengler, Anders Martinsson, Angelika Steger:
The (1 + 1)-EA with mutation rate (1 + ϵ)/n is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019). GECCO (Companion) 2019: 25-26 - [c21]Benjamin Doerr, Carola Doerr, Johannes Lengler:
Self-adjusting mutation rates with provably optimal success rules. GECCO 2019: 1479-1487 - [i21]Benjamin Doerr, Carola Doerr, Johannes Lengler:
Self-Adjusting Mutation Rates with Provably Optimal Success Rules. CoRR abs/1902.02588 (2019) - [i20]Johannes Lengler, Xun Zou:
Exponential Slowdown for Larger Populations: The (μ+1)-EA on Monotone Functions. CoRR abs/1907.12821 (2019) - 2018
- [j11]Carola Doerr, Johannes Lengler:
The (1+1) Elitist Black-Box Complexity of LeadingOnes. Algorithmica 80(5): 1579-1603 (2018) - [j10]Johannes Lengler, Angelika Steger:
Drift Analysis and Evolutionary Algorithms Revisited. Comb. Probab. Comput. 27(4): 643-666 (2018) - [c20]Hafsteinn Einarsson, Johannes Lengler, Marcelo Matheus Gauy, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger:
The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. GECCO 2018: 1491-1498 - [c19]Johannes Lengler, Dirk Sudholt, Carsten Witt:
Medium step sizes are harmful for the compact genetic algorithm. GECCO 2018: 1499-1506 - [c18]Mohsen Ghaffari, Johannes Lengler:
Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. PODC 2018: 305-313 - [c17]Johannes Lengler:
A General Dichotomy of Evolutionary Algorithms on Monotone Functions. PPSN (2) 2018: 3-15 - [c16]Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko:
Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. PPSN (2) 2018: 42-54 - [c15]Johannes Lengler, Ulysse Schaller:
The (1+1)-EA on Noisy Linear Functions with Random Positive Weights. SSCI 2018: 712-719 - [i19]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by Swaps with Noisy Comparisons. CoRR abs/1803.04509 (2018) - [i18]Johannes Lengler:
A General Dichotomy of Evolutionary Algorithms on Monotone Functions. CoRR abs/1803.09227 (2018) - [i17]Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko:
Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. CoRR abs/1805.10169 (2018) - [i16]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
Bounding Bloat in Genetic Programming. CoRR abs/1806.02112 (2018) - [i15]Johannes Lengler, Anders Martinsson, Angelika Steger:
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. CoRR abs/1808.01137 (2018) - [i14]Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger:
The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates. CoRR abs/1808.05566 (2018) - 2017
- [j9]Carola Doerr, Johannes Lengler:
OneMax in Black-Box Models with Several Restrictions. Algorithmica 78(2): 610-640 (2017) - [j8]Johannes Lengler, Angelika Steger:
Note on the coefficient of variations of neuronal spike trains. Biol. Cybern. 111(3-4): 229-235 (2017) - [j7]Carola Doerr, Johannes Lengler:
Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms? Evol. Comput. 25(4) (2017) - [j6]Hafsteinn Einarsson, Marcelo M. Gauy, Johannes Lengler, Angelika Steger:
A Model of Fast Hebbian Spike Latency Normalization. Frontiers Comput. Neurosci. 11: 33 (2017) - [j5]Felix Weissenberger, Florian Meier, Johannes Lengler, Hafsteinn Einarsson, Angelika Steger:
Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity. Int. J. Neural Syst. 27(8): 1750044:1-1750044:20 (2017) - [c14]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Sampling Geometric Inhomogeneous Random Graphs in Linear Time. ESA 2017: 20:1-20:15 - [c13]Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler:
Bounding bloat in genetic programming. GECCO 2017: 921-928 - [c12]Tomas Gavenciak, Barbara Geissmann, Johannes Lengler:
Sorting by swaps with noisy comparisons. GECCO 2017: 1375-1382 - [c11]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenon. PODC 2017: 371-380 - [i13]Mohsen Ghaffari, Johannes Lengler:
Tight Analysis for the 3-Majority Consensus Dynamics. CoRR abs/1705.05583 (2017) - [i12]Johannes Lengler:
Drift Analysis. CoRR abs/1712.00964 (2017) - 2016
- [c10]Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. SoCG 2016: 40:1-40:16 - [c9]Carola Doerr, Johannes Lengler:
The (1+1) Elitist Black-Box Complexity of LeadingOnes. GECCO 2016: 1131-1138 - [c8]Christoph Koch, Johannes Lengler:
Bootstrap Percolation on Geometric Inhomogeneous Random Graphs. ICALP 2016: 147:1-147:15 - [i11]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Average Distance in a General Class of Scale-Free Networks with Underlying Geometry. CoRR abs/1602.05712 (2016) - [i10]Christoph Koch, Johannes Lengler:
Bootstrap percolation on geometric inhomogeneous random graphs. CoRR abs/1603.02057 (2016) - [i9]Carola Doerr, Johannes Lengler:
The (1+1) Elitist Black-Box Complexity of LeadingOnes. CoRR abs/1604.02355 (2016) - [i8]Johannes Lengler, Angelika Steger:
Drift Analysis and Evolutionary Algorithms Revisited. CoRR abs/1608.03226 (2016) - [i7]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically Optimal Amplifiers for the Moran Process. CoRR abs/1611.04209 (2016) - [i6]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenom. CoRR abs/1612.05539 (2016) - 2015
- [c7]Johannes Lengler, Nicholas Spooner:
Fixed Budget Performance of the (1+1) EA on Linear Functions. FOGA 2015: 52-61 - [c6]Carola Doerr, Johannes Lengler:
Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms. GECCO 2015: 839-846 - [c5]Carola Doerr, Johannes Lengler:
OneMax in Black-Box Models with Several Restrictions. GECCO 2015: 1431-1438 - [c4]Amin Karbasi, Johannes Lengler, Angelika Steger:
Normalization Phenomena in Asynchronous Networks. ICALP (2) 2015: 688-700 - [i5]Carola Doerr, Johannes Lengler:
OneMax in Black-Box Models with Several Restrictions. CoRR abs/1504.02644 (2015) - [i4]Carola Doerr, Johannes Lengler:
Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms? CoRR abs/1508.06802 (2015) - [i3]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Geometric Inhomogeneous Random Graphs. CoRR abs/1511.00576 (2015) - [i2]Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. CoRR abs/1512.04226 (2015) - 2014
- [j4]Daniel Johannsen, Piyush P. Kurur, Johannes Lengler:
Evolutionary Algorithms for Quantum Computers. Algorithmica 68(1): 152-189 (2014) - [j3]Hafsteinn Einarsson, Johannes Lengler, Angelika Steger:
A high-capacity model for one shot association learning in the brain. Frontiers Comput. Neurosci. 8: 140 (2014) - 2013
- [j2]Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen:
Black-box complexities of combinatorial problems. Theor. Comput. Sci. 471: 84-106 (2013) - 2011
- [c3]Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen:
Black-box complexities of combinatorial problems. GECCO 2011: 981-988 - [i1]Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen:
Black-Box Complexities of Combinatorial Problems. CoRR abs/1108.0342 (2011) - 2010
- [c2]Daniel Johannsen, Piyush P. Kurur, Johannes Lengler:
Can quantum search accelerate evolutionary algorithms? GECCO 2010: 1433-1440
2000 – 2009
- 2007
- [j1]Benjamin Doerr, Johannes Lengler, David Steurer:
The Interval Liar Game. Electron. Notes Discret. Math. 28: 425-432 (2007) - 2006
- [c1]Benjamin Doerr, Johannes Lengler, David Steurer:
The Interval Liar Game. ISAAC 2006: 318-327
Coauthor Index
Carola Doerr
aka: Carola Winzen
aka: Carola Winzen
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-10-08 20:36 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:
