default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Shen
Person information
Other persons with a similar name
SPARQL queries 
🛈 Please note that only 57% 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
2020 – today
- 2024
[c38]Alexander Shen
:
Kolmogorov Complexity as a Combinatorial Tool. CiE 2024: 27-31- [c37]Luca Masserano, Alexander Shen, Michele Doro, Tommaso Dorigo, Rafael Izbicki, Ann B. Lee:
Classification under Nuisance Parameters and Generalized Label Shift in Likelihood-Free Inference. ICML 2024 - [i52]Luca Masserano, Alexander Shen, Michele Doro, Tommaso Dorigo, Rafael Izbicki, Ann B. Lee:
Classification under Nuisance Parameters and Generalized Label Shift in Likelihood-Free Inference. CoRR abs/2402.05330 (2024) - [i51]Alexander Shen:
Conditional normality and finite-state dimensions revisited. CoRR abs/2403.01534 (2024) - [i50]Alexander Shen:
Kolmogorov complexity as a combinatorial tool. CoRR abs/2405.09304 (2024) - 2023
- [j40]Ruslan Ishkuvatov, Daniil Musatov, Alexander Shen:
Approximating Kolmogorov complexity. Comput. 12(3): 283-297 (2023) - [j39]George Barmpalias, Alexander Shen:
The Kučera-Gács theorem revisited by Levin. Theor. Comput. Sci. 947: 113693 (2023) - [j38]Ilir Çapuni, Jarkko Kari, Alexander Shen:
Taming randomness and complexity - Essays in honour of Professor Péter Gács. Theor. Comput. Sci. 949: 113776 (2023) - [c36]Alexander Shen:
Inequalities for Entropies and Dimensions. CiE 2023: 120-131 - [i49]Alexander Shen:
The Kraft-Barmpalias-Lewis-Pye lemma revisited. CoRR abs/2304.04852 (2023) - 2022
- [j37]Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. Comput. 11(3-4): 165-185 (2022) - [j36]Alexander Shen:
Individual codewords. Theor. Comput. Sci. 908: 120-122 (2022) - [i48]Andrei E. Romashchenko, Alexander Shen, Marius Zimand:
27 Open Problems in Kolmogorov Complexity. CoRR abs/2203.15109 (2022) - [i47]Alexander Shen:
Inequalities for entropies and dimensions. CoRR abs/2209.07243 (2022) - 2021
- [j35]Alexander Kozachinskiy, Alexander Shen:
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited. J. Comput. Syst. Sci. 118: 75-107 (2021) - [j34]Andrei E. Romashchenko, Alexander Shen, Marius Zimand:
27 Open Problems in Kolmogorov Complexity. SIGACT News 52(4): 31-54 (2021) - [i46]Alexander Shen:
Gács-Kučera's Theorem Revisited by Levin. CoRR abs/2111.00516 (2021) - [i45]Alexander Shen:
Individual codewords. CoRR abs/2111.00857 (2021) - 2020
- [j33]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
On the Structure of Ammann A2 Tilings. Discret. Comput. Geom. 63(3): 577-606 (2020) - [c35]Alexander Shen:
Randomness Tests: Theory and Practice. Fields of Logic and Computation III 2020: 258-290 - [i44]Alexander Shen:
Complexity of majorants. CoRR abs/2004.02844 (2020) - [i43]Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. CoRR abs/2010.10221 (2020)
2010 – 2019
- 2019
- [c34]Alexander Kozachinskiy, Alexander Shen:
Two Characterizations of Finite-State Dimension. FCT 2019: 80-94 - [c33]Gleb Posobin, Alexander Shen:
Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. STACS 2019: 57:1-57:14 - 2018
- [j32]Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen:
Algorithmic identification of probabilities is hard. J. Comput. Syst. Sci. 95: 98-108 (2018) - [j31]Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. Theor. Comput. Sci. 705: 99-112 (2018) - [c32]Vladimir Uspenskiy, Alexander Shen:
Algorithms and Geometric Constructions. CiE 2018: 410-420 - [c31]Mikhail Andreev, Gleb Posobin, Alexander Shen:
Plain Stopping Time and Conditional Complexities Revisited. MFCS 2018: 2:1-2:12 - [i42]Bruno Bauwens, Alexander Shen:
Information Distance Revisited. CoRR abs/1807.11087 (2018) - [i41]Gleb Posobin, Alexander Shen:
Random noise increases Kolmogorov complexity and Hausdorff dimension. CoRR abs/1808.04626 (2018) - [i40]Alexander Shen:
Axiomatic approach to the theory of algorithms and relativized computability. CoRR abs/1811.06259 (2018) - 2017
- [j30]Bruno Bauwens, Alexander Shen, Hayato Takahashi:
Conditional Probabilities and van Lambalgen's Theorem Revisited. Theory Comput. Syst. 61(4): 1315-1336 (2017) - [j29]Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen:
Layerwise Computability and Image Randomness. Theory Comput. Syst. 61(4): 1353-1375 (2017) - [c30]Nikolay K. Vereshchagin, Alexander Shen:
Algorithmic Statistics: Forty Years Later. Computability and Complexity 2017: 669-737 - [c29]Alexander Shen:
Compressibility and Probabilistic Proofs. CiE 2017: 101-111 - [c28]Alexander Shen:
Automatic Kolmogorov Complexity and Normality Revisited. FCT 2017: 418-430 - [i39]Alexander Shen:
Automatic Kolmogorov complexity and normality revisited. CoRR abs/1701.09060 (2017) - [i38]Alexander Shen:
Compressibility and probabilistic proofs. CoRR abs/1703.03342 (2017) - [i37]Mikhail Andreev, Gleb Posobin, Alexander Shen:
Plain stopping time and conditional complexities revisited. CoRR abs/1708.08100 (2017) - [i36]Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. CoRR abs/1709.05266 (2017) - 2016
- [b5]Alexander Shen:
Geometry in Problems. MSRI Mathematical Circles Library 18, American Mathematical Society 2016, ISBN 978-1-4704-3011-5, pp. I-XI, 1-214 - [j28]Laurent Bienvenu, Damien Desfontaines, Alexander Shen:
Generic algorithms for halting problem and optimal machines revisited. Log. Methods Comput. Sci. 12(2) (2016) - [i35]Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen:
Layerwise computability and image randomness. CoRR abs/1607.04232 (2016) - [i34]Nikolai K. Vereshchagin, Alexander Shen:
Algorithmic statistics: forty years later. CoRR abs/1607.08077 (2016) - 2015
- [j27]Andrei E. Romashchenko, Alexander Shen:
Topological Arguments for Kolmogorov Complexity. Theory Comput. Syst. 56(3): 513-526 (2015) - [c27]Laurent Bienvenu, Alexander Shen:
K-trivial, K-low and MLR-low Sequences: A Tutorial. Fields of Logic and Computation II 2015: 1-23 - [c26]Laurent Bienvenu, Damien Desfontaines, Alexander Shen:
What Percentage of Programs Halt? ICALP (1) 2015: 219-230 - [i33]Nikolai K. Vereshchagin, Alexander Shen:
Algorithmic statistics revisited. CoRR abs/1504.04950 (2015) - [i32]Alexander Shen:
Around Kolmogorov complexity: basic notions and results. CoRR abs/1504.04955 (2015) - 2014
- [j26]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren:
The axiomatic power of Kolmogorov complexity. Ann. Pure Appl. Log. 165(9): 1380-1402 (2014) - [j25]Andrei Yu. Rumyantsev, Alexander Shen:
Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma. Fundam. Informaticae 132(1): 1-14 (2014) - [j24]Bruno Bauwens, Alexander Shen:
Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity. J. Symb. Log. 79(2): 620-632 (2014) - [c25]Laurent Bienvenu, Benoit Monin, Alexander Shen:
Algorithmic Identification of Probabilities Is Hard. ALT 2014: 85-95 - [i31]Laurent Bienvenu, Alexander Shen:
K-trivial, K-low and MLR-low sequences: a tutorial. CoRR abs/1407.4259 (2014) - 2013
- [j23]Bruno Bauwens, Alexander Shen:
An Additivity Theorem for Plain Kolmogorov Complexity. Theory Comput. Syst. 52(2): 297-302 (2013) - [i30]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen, Antoine Taveneaux, Stijn Vermeeren:
The axiomatic power of Kolmogorov complexity. CoRR abs/1301.3392 (2013) - [i29]Andrei Yu. Rumyantsev, Alexander Shen:
Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma. CoRR abs/1305.1535 (2013) - 2012
- [j22]Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen:
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. Inf. Comput. 210: 21-30 (2012) - [j21]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3): 731-764 (2012) - [c24]Laurent Bienvenu, Alexander Shen:
Random Semicomputable Reals Revisited. Computation, Physics and Beyond 2012: 31-45 - [c23]Alexander Shen:
Game Arguments in Computability Theory and Algorithmic Information Theory. CiE 2012: 655-666 - [c22]Alexander Shen, Andrei E. Romashchenko:
Topological arguments for Kolmogorov complexity. AUTOMATA & JAC 2012: 127-132 - [i28]Alexander Shen:
Game arguments in computability theory and algorithmic information theory. CoRR abs/1204.0198 (2012) - [i27]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin:
Limit complexities revisited [once more]. CoRR abs/1204.0201 (2012) - 2011
- [j20]Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. Theory Comput. Syst. 49(2): 227-245 (2011) - [j19]Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen:
Not every domain of a plain decompressor contains the domain of a prefix-free one. Theor. Comput. Sci. 412(4-5): 482-486 (2011) - [c21]Alexander Shen:
Kolmogorov Complexity as a Language. CSR 2011: 105-119 - [i26]Alexander Shen:
Kolmogorov complexity as a language. CoRR abs/1102.5418 (2011) - [i25]Laurent Bienvenu, Péter Gács, Mathieu Hoyrup, Cristobal Rojas, Alexander Shen:
Algorithmic tests and randomness with respect to a class of measures. CoRR abs/1103.1529 (2011) - [i24]Alexander Shen:
Are random axioms useful? CoRR abs/1109.5526 (2011) - [i23]Bruno Bauwens, Alexander Shen:
An additivity theorem for plain complexity. CoRR abs/1111.4372 (2011) - 2010
- [b4]Alexander Shen:
Algorithms and Programming - Problems and Solutions, Second Edition. Springer undergraduate texts in mathematics and technology, Springer 2010, ISBN 978-1-4419-1747-8, pp. I-XII, 1-272 - [j18]Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu, Alexander Shen:
Sets of k-Independent Strings. Int. J. Found. Comput. Sci. 21(3): 321-327 (2010) - [j17]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin:
Limit Complexities Revisited. Theory Comput. Syst. 47(3): 720-736 (2010) - [j16]Vladimir Vovk, Alexander Shen:
Prequential randomness and probability. Theor. Comput. Sci. 411(29-30): 2632-2646 (2010) - [c20]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Effective Closed Subshifts in 1D Can Be Implemented in 2D. Fields of Logic and Computation 2010: 208-226 - [c19]Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen:
Ergodic-Type Characterizations of Algorithmic Randomness. CiE 2010: 49-58 - [c18]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
1D Effectively Closed Subshifts and 2D Tilings. JAC 2010: 2-7 - [c17]Alexander Shen:
Decomposition Complexity. JAC 2010: 203-213 - [i22]Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen:
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One. CoRR abs/1001.4462 (2010) - [i21]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed point theorem and aperiodic tilings. CoRR abs/1003.2801 (2010) - [i20]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Effective closed subshifts in 1D can be implemented in 2D. CoRR abs/1003.3103 (2010) - [i19]Andrej Muchnik, Ilya Mezhirov, Alexander Shen, Nikolai K. Vereshchagin:
Game interpretation of Kolmogorov complexity. CoRR abs/1003.4712 (2010) - [i18]Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen:
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. CoRR abs/1007.5249 (2010) - [i17]Alexander Shen:
Decomposition Complexity. CoRR abs/1012.1283 (2010) - [i16]Bruno Durand, Alexander Shen, Andrei E. Romashchenko:
1D Effectively Closed Subshifts and 2D Tilings. CoRR abs/1012.1329 (2010)
2000 – 2009
- 2009
- [j15]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point Theorem and Aperiodic Tilings. Bull. EATCS 97: 126-136 (2009) - [c16]Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. CSR 2009: 250-262 - [c15]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
High Complexity Tilings with Sparse Errors. ICALP (1) 2009: 403-414 - [c14]Alexander Shen:
Algorithmic Information Theory and Foundations of Probability. RP 2009: 26-34 - [i15]Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. CoRR abs/0904.3116 (2009) - [i14]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed-point tile sets and their applications. CoRR abs/0910.2415 (2009) - 2008
- [j14]Laurent Bienvenu, Wolfgang Merkle, Alexander Shen:
A Simple Proof of Miller-Yu Theorem. Fundam. Informaticae 83(1-2): 21-24 (2008) - [j13]Bruno Durand, Leonid A. Levin, Alexander Shen:
Complex tilings. J. Symb. Log. 73(2): 593-613 (2008) - [c13]Alexey V. Chernov, Alexander Shen, Nikolai K. Vereshchagin, Vladimir Vovk:
On-Line Probability, Complexity and Randomness. ALT 2008: 138-153 - [c12]Vladimir Vovk, Alexander Shen:
Prequential Randomness. ALT 2008: 154-168 - [c11]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings. Developments in Language Theory 2008: 276-288 - [c10]Laurent Bienvenu, Andrei E. Romashchenko, Alexander Shen:
Sparse sets. JAC 2008: 18-28 - [c9]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolay Veraschagin:
Limit complexities revisited. STACS 2008: 73-84 - [i13]Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings. CoRR abs/0802.2432 (2008) - [i12]Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin:
Limit complexities revisited. CoRR abs/0802.2833 (2008) - [i11]Andrej Muchnik, Alexey V. Chernov, Alexander Shen:
Algorithmic randomness and splitting of supermartingales. CoRR abs/0807.3156 (2008) - [i10]Bruno Durand, Alexander Shen, Andrei E. Romashchenko:
Fixed Point and Aperiodic Tilings. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j12]Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin:
Partitioning multi-dimensional sets in a small number of "uniform" parts. Eur. J. Comb. 28(1): 134-144 (2007) - [j11]Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity. Theor. Comput. Sci. 384(1): 77-86 (2007) - 2006
- [c8]Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible Descriptions for Conditional Kolmogorov Complexity. TAMC 2006: 308-317 - [c7]Alexander Shen:
Multisource Algorithmic Information Theory. TAMC 2006: 327-338 - [i9]Alexander Shen:
Combinatorial proof of Muchnik's theorem. Kolmogorov Complexity and Applications 2006 - [i8]Alexander Shen:
Multisource Algorithmic Information Theory. Kolmogorov Complexity and Applications 2006 - [i7]Alexander Shen:
Multisource algorithmic information theory. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i6]Noga Alon, Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin:
Partitioning multi-dimensional sets in a small number of "uniform" parts. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i5]Andrei A. Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [b3]Alexander Shen, Nikolai K. Vereshchagin:
Basic set theory. Student mathematical library 17, American Mathematical Society 2002, ISBN 978-0-8218-2731-4, pp. I-VIII, 1-116 - [j10]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences. Theor. Comput. Sci. 271(1-2): 47-58 (2002) - [j9]Alexey V. Chernov, Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Upper semi-lattice of binary strings with the relation "x is simple conditional to y". Theor. Comput. Sci. 271(1-2): 69-95 (2002) - [j8]Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial interpretation of Kolmogorov complexity. Theor. Comput. Sci. 271(1-2): 111-123 (2002) - [j7]Alexander Shen, Nikolai K. Vereshchagin:
Logical operations and Kolmogorov complexity. Theor. Comput. Sci. 271(1-2): 125-129 (2002) - 2001
- [c6]Bruno Durand, Leonid A. Levin, Alexander Shen:
Complex tilings. STOC 2001: 732-739 - [i4]Bruno Durand, Leonid A. Levin, Alexander Shen:
Complex Tilings. CoRR cs.CC/0107008 (2001) - [i3]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive complexity of computable sequences. Electron. Colloquium Comput. Complex. TR01 (2001) - [i2]Alexander Shen, Nikolai K. Vereshchagin:
Logical operations and Kolmogorov complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j6]Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Inequalities for Shannon Entropy and Kolmogorov Complexity. J. Comput. Syst. Sci. 60(2): 442-464 (2000) - [c5]Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity. CCC 2000: 131-137 - [i1]Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Combinatorial Interpretation of Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j5]Alexander Shen:
Discussion on Kolmogorov Complexity and Statistical Analysis. Comput. J. 42(4): 340-342 (1999) - [c4]Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y". CCC 1999: 114- - [c3]Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive Complexity of Computable Sequences. STACS 1999: 153-162 - 1998
- [j4]Daniel Hammer, Alexander Shen:
A Strange Application of Kolmogorov Complexity. Theory Comput. Syst. 31(1): 1-4 (1998) - 1997
- [b2]Alexander Shen:
Algorithms and programming - problems and solutions. Birkhäuser 1997, ISBN 978-0-8176-3847-4, pp. I-VIII, 1-217 - [c2]Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Inequalities for Shannon entropies and Kolmogorov complexities. CCC 1997: 13-23 - 1996
- [j3]Vladimir A. Uspensky, Alexander Shen:
Relations Between Varieties of Kolmogorov Complexities. Math. Syst. Theory 29(3): 271-292 (1996) - 1994
- [c1]Katalin Friedl, Zsolt Hátsági, Alexander Shen:
Low-degree Tests. SODA 1994: 57-64 - 1993
- [b1]Israel M. Gelfand, Alexander Shen:
Algebra. Birkhäuser 1993, ISBN 978-0-8176-3677-7, pp. 1-153 - 1992
- [j2]Alexander Shen:
IP = PSPACE: Simplified Proof. J. ACM 39(4): 878-880 (1992) - 1991
- [j1]Wayne D. Grover, Witold A. Krzymien, Alexander Shen:
Simulation and Experimental Studies on the Concept of a Rate-Adaptive Digital Subscriber Loop (RA-DSL). IEEE J. Sel. Areas Commun. 9(6): 941-950 (1991)
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-10-07 21:23 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:
