default search action
Solon P. Pissis
- > Home > Persons > Solon P. Pissis
Publications
- 2023
- [j70]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts:
Maximal degenerate palindromes with gaps and mismatches. Theor. Comput. Sci. 978: 114182 (2023) - 2022
- [j67]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. Algorithmica 84(5): 1418-1440 (2022) - 2021
- [j60]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts:
IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences. BMC Bioinform. 22(1): 51 (2021) - [j59]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient pattern matching in elastic-degenerate strings. Inf. Comput. 279: 104616 (2021) - 2020
- [j50]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Comparing Degenerate Strings. Fundam. Informaticae 175(1-4): 41-58 (2020) - [j47]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, Steven Watts:
Efficient Identification of k-Closed Strings. Int. J. Found. Comput. Sci. 31(5): 595-610 (2020) - [j46]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Property Suffix Array with Applications in Indexing Weighted Sequences. ACM J. Exp. Algorithmics 25: 1-16 (2020) - [j45]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. Theor. Comput. Sci. 812: 2-12 (2020) - [j43]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812: 244-251 (2020) - 2019
- [j42]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
On-line weighted pattern matching. Inf. Comput. 266: 49-59 (2019) - [j41]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37(2): 501-522 (2019) - [j39]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
On overabundant words and their application to biological sequence analysis. Theor. Comput. Sci. 792: 85-95 (2019) - 2018
- [c64]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CPM 2018: 23:1-23:16 - [c62]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Property Suffix Array with Applications. LATIN 2018: 290-302 - [c61]Hayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Mismatches and Applications. SOFSEM 2018: 636-649 - [c60]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. SPIRE 2018: 12-26 - [c59]Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. SPIRE 2018: 27-41 - [c58]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. SPIRE 2018: 42-49 - [c56]Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Maximal Motif Discovery in a Sliding Window. SPIRE 2018: 191-205 - [c55]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Degenerate String Comparison and Applications. WABI 2018: 21:1-21:14 - [i24]Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. CoRR abs/1801.04425 (2018) - [i23]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR abs/1802.06369 (2018) - [i19]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. CoRR abs/1807.11702 (2018) - [i18]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. CoRR abs/1810.02099 (2018) - 2017
- [j30]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1): 5:1-5:12 (2017) - [j28]Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Fast circular dictionary-matching algorithm. Math. Struct. Comput. Sci. 27(2): 143-156 (2017) - [c53]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster Algorithms for 1-Mappability of a Sequence. COCOA (2) 2017: 109-121 - [c52]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON 2017: 99-111 - [c51]Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari:
On-Line Pattern Matching on Similar Texts. CPM 2017: 9:1-9:14 - [c50]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts, Wing-Kin Sung:
Efficient Identification of k-Closed Strings. EANN 2017: 583-595 - [c49]Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Efficient Computation of Palindromes in Sequences with Uncertainties. EANN 2017: 620-629 - [c47]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to Answer a Small Batch of RMQs or LCA Queries in Practice. IWOCA 2017: 343-355 - [c46]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Texts. LATA 2017: 131-142 - [c45]Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor After One Edit Operation. SPIRE 2017: 14-26 - [c43]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. WABI 2017: 4:1-4:14 - [p1]Costas S. Iliopoulos, Solon P. Pissis, M. Sohel Rahman:
Searching and Indexing Circular Patterns. Algorithms for Next-Generation Sequencing Data 2017: 77-90 - [e1]Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman:
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK. LIPIcs 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-036-1 [contents] - [i16]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. CoRR abs/1705.03385 (2017) - [i15]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. CoRR abs/1705.04022 (2017) - [i14]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to answer a small batch of RMQs or LCA queries in practice. CoRR abs/1705.04589 (2017) - 2016
- [j26]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 12 (2016) - [j25]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 21 (2016) - [j23]Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-time superbubble identification algorithm for genome assembly. Theor. Comput. Sci. 609: 374-383 (2016) - [j22]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - [c37]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE 2016: 22-34 - [c36]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. WABI 2016: 1-13 - [i11]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. CoRR abs/1604.08760 (2016) - [i10]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR abs/1606.08275 (2016) - [i9]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Strings. CoRR abs/1610.08111 (2016) - 2015
- [j18]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
Global and local sequence alignment with a bounded number of gaps. Theor. Comput. Sci. 582: 1-16 (2015) - [c33]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. LATA 2015: 85-96 - [c31]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular Sequence Comparison with q-grams. WABI 2015: 203-216 - [c30]Carl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment. SEA 2015: 247-258 - [i8]Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-Time Superbubble Identification Algorithm. CoRR abs/1505.04019 (2015) - 2014
- [j17]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Fast algorithms for approximate circular string matching. Algorithms Mol. Biol. 9: 9 (2014) - [j16]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Optimal computation of all tandem repeats in a weighted sequence. Algorithms Mol. Biol. 9: 21 (2014) - [j13]Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis:
Extending alignments with k-mismatches and ℓ-gaps. Theor. Comput. Sci. 525: 80-88 (2014) - [c29]Vida Ghanaei, Costas S. Iliopoulos, Solon P. Pissis:
Detection of Web Spambot in the Presence of Decoy Actions. BDCloud 2014: 277-279 - [c26]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth:
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. IWOCA 2014: 49-61 - [i4]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. CoRR abs/1406.5480 (2014) - 2013
- [j11]Carl Barton, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Solon P. Pissis:
Querying highly similar sequences. Int. J. Comput. Biol. Drug Des. 6(1/2): 119-130 (2013) - [j10]Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek:
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20: 51-60 (2013) - [j9]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient seed computation revisited. Theor. Comput. Sci. 483: 171-181 (2013) - [j8]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski:
Enhanced string covering. Theor. Comput. Sci. 506: 102-114 (2013) - [c24]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
GapsMis: flexible sequence alignment with a bounded number of gaps. BCB 2013: 402 - [c19]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - [i2]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - 2012
- [j7]Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis:
Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome. Int. J. Found. Comput. Sci. 23(2): 249-259 (2012) - [j6]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012) - [j5]Costas S. Iliopoulos, Derrick G. Kourie, Laurent Mouchard, Themba K. Musombuka, Solon P. Pissis, Corné de Ridder:
An algorithm for mapping short reads to a dynamically changing genomic sequence. J. Discrete Algorithms 10: 15-22 (2012) - [j4]Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17: 15-23 (2012) - [j3]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On left and right seeds of a string. J. Discrete Algorithms 17: 31-44 (2012) - [c17]Mourad Elloumi, Pedram Hayati, Costas S. Iliopoulos, Solon P. Pissis, Arfaat Shah:
Detection of fixed length web spambot using REAL (read aligner). CUBE 2012: 820-825 - [c16]Tomás Flouri, Costas S. Iliopoulos, Kunsoo Park, Solon P. Pissis:
GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. AIAI (2) 2012: 593-601 - [c15]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski:
New and Efficient Approaches to the Quasiperiodic Characterisation of a String. Stringology 2012: 75-88 - 2011
- [j2]Oudone Phanalasy, Mirka Miller, Costas S. Iliopoulos, Solon P. Pissis, Elaheh Vaezpour:
Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. Math. Comput. Sci. 5(1): 81-87 (2011) - [c14]Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
DynMap: mapping short reads to multiple related genomes. BCB 2011: 330-334 - [c13]Tomás Flouri, Kunsoo Park, Kimon Frousios, Solon P. Pissis, Costas S. Iliopoulos, German Tischler:
Approximate string-matching with a single gap for sequence alignment. BCB 2011: 490-492 - [c12]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On the Right-Seed Array of a String. COCOON 2011: 492-502 - [c11]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CPM 2011: 350-363 - [c10]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902 - [c9]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE 2011: 338-343 - [c8]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281 - [i1]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CoRR abs/1104.3153 (2011) - 2010
- [c7]Kimon Frousios, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis, German Tischler:
REAL: an efficient REad ALigner for next generation sequencing reads. BCB 2010: 154-159 - [c6]Tomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis:
An algorithm for mapping short reads to a dynamically changing genomic sequence. BIBM 2010: 133-136 - [c5]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis:
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. Algorithms and Applications 2010: 92-101 - [c4]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler:
Cover Array String Reconstruction. CPM 2010: 251-259 - 2009
- [j1]Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
Algorithms for mapping short degenerate and weighted sequences to a reference genome. Int. J. Comput. Biol. Drug Des. 2(4): 385-397 (2009) - [c3]Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. IJCBS 2009: 174-180 - [c2]Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. PARCO 2009: 150-157 - [c1]Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis:
Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. Stringology 2009: 249-262
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-08-27 21:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint