default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Prezza
Person information
- affiliation: Ca' Foscari University of Venice, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c48]Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio
, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza:
Computing the LCP Array of a Labeled Graph. CPM 2024: 1:1-1:15- [c47]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. CPM 2024: 5:1-5:15 - [c46]Giovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi:
The Rational Construction of a Wheeler DFA. CPM 2024: 23:1-23:15 - [c45]Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza:
Sketching and Streaming for Dictionary Compression. DCC 2024: 213-222 - [c44]Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni:
Indexing Finite-State Automata Using Forward-Stable Partitions. SPIRE 2024: 26-40 - [c43]Davide Cenzato, Francisco Olivares, Nicola Prezza:
On Computing the Smallest Suffixient Set. SPIRE 2024: 73-87 - [c42]Patrick Dinklage, Johannes Fischer, Nicola Prezza:
Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. SEA 2024: 9:1-9:20 - [i53]Jarno Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza:
Computing the LCP Array of a Labeled Graph. CoRR abs/2404.14235 (2024) - [i52]Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni:
Indexing Finite-State Automata Using Forward-Stable Partitions. CoRR abs/2406.02763 (2024) - [i51]Davide Cenzato, Francisco Olivares, Nicola Prezza:
On Computing the Smallest Suffixient Set. CoRR abs/2407.18753 (2024) - 2023
- [j21]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Co-lexicographically Ordering Automata and Regular Languages - Part I. J. ACM 70(4): 27:1-27:73 (2023) - [j20]Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Toward a Definitive Compressibility Measure for Repetitive Sequences. IEEE Trans. Inf. Theory 69(4): 2074-2092 (2023) - [c41]Stefano Calzavara, Lorenzo Cazzaro, Giulio Ermanno Pibiri, Nicola Prezza:
Verifiable Learning for Robust Tree Ensembles. CCS 2023: 1850-1864 - [c40]Sung-Hwan Kim, Francisco Olivares, Nicola Prezza:
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. CPM 2023: 16:1-16:16 - [c39]Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino:
Computing matching statistics on Wheeler DFAs. DCC 2023: 150-159 - [c38]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. ESA 2023: 15:1-15:15 - [c37]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS 2023 - [c36]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. SPIRE 2023: 62-74 - [c35]Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza:
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE 2023: 143-156 - [i50]Nicola Prezza:
Algorithms for Massive Data - Lecture Notes. CoRR abs/2301.00754 (2023) - [i49]Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino:
Computing matching statistics on Wheeler DFAs. CoRR abs/2301.05338 (2023) - [i48]Sung-Hwan Kim, Francisco Olivares, Nicola Prezza:
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. CoRR abs/2304.10962 (2023) - [i47]Stefano Calzavara, Lorenzo Cazzaro, Giulio Ermanno Pibiri, Nicola Prezza:
Verifiable Learning for Robust Tree Ensembles. CoRR abs/2305.03626 (2023) - [i46]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. CoRR abs/2305.05129 (2023) - [i45]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. CoRR abs/2306.04737 (2023) - [i44]Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza:
Space-time Trade-offs for the LCP Array of Wheeler DFAs. CoRR abs/2306.05684 (2023) - [i43]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. CoRR abs/2307.07267 (2023) - [i42]Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza:
Sketching and Streaming for Dictionary Compression. CoRR abs/2310.17980 (2023) - [i41]Lore Depuydt, Travis Gagie, Ben Langmead, Giovanni Manzini, Nicola Prezza:
Suffixient Sets. CoRR abs/2312.01359 (2023) - 2022
- [j19]Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza:
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). Algorithmica 84(3): 565 (2022) - [j18]Alberto Policriti, Nicola Prezza:
Special Issue on Algorithms and Data-Structures for Compressed Computation. Algorithms 15(12): 457 (2022) - [c34]Jarno Alanko, Nicola Cotumaccio, Nicola Prezza:
Linear-time Minimization of Wheeler DFAs. DCC 2022: 53-62 - [c33]Dominik Köppl, Gonzalo Navarro, Nicola Prezza:
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. DCC 2022: 83-92 - [i40]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Co-lexicographically ordering automata and regular languages. Part I. CoRR abs/2208.04931 (2022) - 2021
- [j17]Nicola Prezza:
Subpath Queries on Compressed Graphs: A Survey. Algorithms 14(1): 14 (2021) - [j16]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Wheeler languages. Inf. Comput. 281: 104820 (2021) - [j15]Nicola Prezza:
Optimal Substring Equality Queries with Applications to Sparse Text Indexing. ACM Trans. Algorithms 17(1): 7:1-7:23 (2021) - [j14]Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Optimal-Time Dictionary-Compressed Indexes. ACM Trans. Algorithms 17(1): 8:1-8:39 (2021) - [j13]Nicola Prezza, Giovanna Rosone:
Space-efficient construction of compressed suffix trees. Theor. Comput. Sci. 852: 138-156 (2021) - [j12]Gabriele Fici, Nicola Prezza, Rossano Venturini:
Adaptive learning of compressible strings. Theor. Comput. Sci. 896: 46-52 (2021) - [j11]Gonzalo Navarro, Carlos Ochoa, Nicola Prezza:
On the Approximation Ratio of Ordered Parsings. IEEE Trans. Inf. Theory 67(2): 1008-1026 (2021) - [c32]Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini:
Compressed Weighted de Bruijn Graphs. CPM 2021: 16:1-16:16 - [c31]Nicola Prezza:
On Locating Paths in Compressed Tries. SODA 2021: 744-760 - [c30]Nicola Cotumaccio, Nicola Prezza:
On Indexing and Compressing Finite Automata. SODA 2021: 2585-2599 - [c29]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM 2021: 249-262 - [i39]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Which Regular Languages can be Efficiently Indexed? CoRR abs/2102.06798 (2021) - [i38]Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza:
On (co-lex) Ordering Automata. CoRR abs/2106.02309 (2021) - [i37]Dominik Köppl, Gonzalo Navarro, Nicola Prezza:
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. CoRR abs/2111.02478 (2021) - [i36]Jarno Alanko, Nicola Cotumaccio, Nicola Prezza:
Linear-time Minimization of Wheeler DFAs. CoRR abs/2111.02480 (2021) - 2020
- [j10]Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone:
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15(1): 18 (2020) - [j9]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. BMC Bioinform. 21-S(8): 260 (2020) - [j8]Travis Gagie, Gonzalo Navarro, Nicola Prezza:
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space. J. ACM 67(1): 2:1-2:54 (2020) - [c28]Nicola Prezza, Giovanna Rosone:
Faster Online Computation of the Succinct Longest Previous Factor Array. CiE 2020: 339-352 - [c27]Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco:
On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CIRCLE 2020 - [c26]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Decompressing Lempel-Ziv Compressed Text. DCC 2020: 143-152 - [c25]Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Towards a Definitive Measure of Repetitiveness. LATIN 2020: 207-219 - [c24]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Regular Languages meet Prefix Sorting. SODA 2020: 911-930 - [c23]Nicola Prezza:
Indexing Compressed Text: A Tale of Time and Space (Invited Talk). SEA 2020: 3:1-3:2 - [i35]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Wheeler Languages. CoRR abs/2002.10303 (2020) - [i34]Nicola Prezza:
On Locating Paths in Compressed Cardinal Trees. CoRR abs/2004.01120 (2020) - [i33]Nicola Cotumaccio, Nicola Prezza:
On Indexing and Compressing Finite Automata. CoRR abs/2007.07718 (2020) - [i32]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR abs/2008.08506 (2020) - [i31]Gabriele Fici, Nicola Prezza, Rossano Venturini:
Substring Query Complexity of String Reconstruction. CoRR abs/2011.07143 (2020) - [i30]Nicola Prezza:
Subpath Queries on Compressed Graphs: a Survey. CoRR abs/2011.10008 (2020)
2010 – 2019
- 2019
- [j7]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
SNPs detection by eBWT positional clustering. Algorithms Mol. Biol. 14(1): 3:1-3:13 (2019) - [j6]Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco:
On the reproducibility of experiments of indexing repetitive document collections. Inf. Syst. 83: 181-194 (2019) - [j5]Gonzalo Navarro, Nicola Prezza:
Universal compressed text indexing. Theor. Comput. Sci. 762: 41-50 (2019) - [c22]Nicola Prezza:
Optimal Rank and Select Queries on Dictionary-Compressed Text. CPM 2019: 4:1-4:12 - [c21]Nicola Prezza, Giovanna Rosone:
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. CPM 2019: 7:1-7:18 - [c20]Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone:
Online Algorithms on Antipowers and Antiperiods. SPIRE 2019: 175-188 - [c19]Davide Della Giustina, Nicola Prezza, Rossano Venturini:
A New Linear-Time Algorithm for Centroid Decomposition. SPIRE 2019: 274-282 - [i29]Nicola Prezza, Giovanna Rosone:
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. CoRR abs/1901.05226 (2019) - [i28]Jarno Alanko, Alberto Policriti, Nicola Prezza:
On Prefix-Sorting Finite Automata. CoRR abs/1902.01088 (2019) - [i27]Nicola Prezza, Giovanna Rosone:
Space-Efficient Construction of Compressed Suffix Trees. CoRR abs/1908.04686 (2019) - [i26]Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Towards a Definitive Measure of Repetitiveness. CoRR abs/1910.02151 (2019) - [i25]Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco:
On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CoRR abs/1912.11944 (2019) - 2018
- [j4]Alberto Policriti, Nicola Prezza:
LZ77 Computation Based on the Run-Length Encoded BWT. Algorithmica 80(7): 1986-2011 (2018) - [j3]Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A separation between RLSLPs and LZ77. J. Discrete Algorithms 50: 36-39 (2018) - [c18]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. ESA 2018: 52:1-52:13 - [c17]Nicola Prezza:
On String Attractors. ICTCS 2018: 12-16 - [c16]Travis Gagie, Gonzalo Navarro, Nicola Prezza:
On the Approximation Ratio of Lempel-Ziv Parsing. LATIN 2018: 490-503 - [c15]Travis Gagie, Gonzalo Navarro, Nicola Prezza:
Optimal-Time Text Indexing in BWT-runs Bounded Space. SODA 2018: 1459-1477 - [c14]Nicola Prezza:
In-Place Sparse Suffix Sorting. SODA 2018: 1496-1508 - [c13]Dominik Kempa, Nicola Prezza:
At the roots of dictionary compression: string attractors. STOC 2018: 827-840 - [c12]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
Detecting Mutations by eBWT. WABI 2018: 3:1-3:15 - [i24]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Fast Lempel-Ziv Decompression in Linear Space. CoRR abs/1802.10347 (2018) - [i23]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. CoRR abs/1803.01695 (2018) - [i22]Nicola Prezza:
Optimal Substring-Equality Queries with Applications to Sparse Text Indexing. CoRR abs/1803.01723 (2018) - [i21]Gonzalo Navarro, Nicola Prezza:
On the Approximation Ratio of Greedy Parsings. CoRR abs/1803.09517 (2018) - [i20]Gonzalo Navarro, Nicola Prezza:
Universal Compressed Text Indexing. CoRR abs/1803.09520 (2018) - [i19]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
Detecting Mutations by eBWT. CoRR abs/1805.01876 (2018) - [i18]Travis Gagie, Gonzalo Navarro, Nicola Prezza:
Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space. CoRR abs/1809.02792 (2018) - [i17]Nicola Prezza:
Optimal Rank and Select Queries on Dictionary-Compressed Text. CoRR abs/1811.01209 (2018) - [i16]Gonzalo Navarro, Nicola Prezza:
Faster Attractor-Based Indexes. CoRR abs/1811.12779 (2018) - 2017
- [b1]Nicola Prezza:
Compressed Computation for Text Indexing. University of Udine, Italy, 2017 - [c11]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Flexible Indexing of Repetitive Collections. CiE 2017: 162-174 - [c10]Alberto Policriti, Nicola Prezza:
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CPM 2017: 17:1-17:10 - [c9]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Space-Efficient Re-Pair Compression. DCC 2017: 171-180 - [c8]Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen:
Succinct Partial Sums and Fenwick Trees. SPIRE 2017: 91-96 - [c7]Nicola Prezza:
A Framework of Dynamic Data Structures for String Processing. SEA 2017: 11:1-11:15 - [i15]Nicola Prezza:
A Framework of Dynamic Data Structures for String Processing. CoRR abs/1701.07238 (2017) - [i14]Alberto Policriti, Nicola Prezza:
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CoRR abs/1702.01340 (2017) - [i13]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Practical and Effective Re-Pair Compression. CoRR abs/1704.08558 (2017) - [i12]Travis Gagie, Gonzalo Navarro, Nicola Prezza:
Fast Locating with the RLBWT. CoRR abs/1705.10382 (2017) - [i11]Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen:
Succinct Partial Sums and Fenwick Trees. CoRR abs/1705.10987 (2017) - [i10]Nicola Prezza:
String Attractors. CoRR abs/1709.05314 (2017) - [i9]Dominik Kempa, Nicola Prezza:
At the Roots of Dictionary Compression: String Attractors. CoRR abs/1710.10964 (2017) - [i8]Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A Separation Between Run-Length SLPs and LZ77. CoRR abs/1711.07270 (2017) - 2016
- [j2]Nicola Prezza, Francesco Vezzi, Max Käller, Alberto Policriti:
Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2. BMC Bioinform. 17(S-4): 69 (2016) - [c6]Alberto Policriti, Nicola Prezza:
Computing LZ77 in Run-Compressed Space. DCC 2016: 23-32 - [i7]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Practical combinations of repetition-aware data structures. CoRR abs/1604.06002 (2016) - [i6]Alberto Policriti, Nicola Prezza:
Fast Longest Common Extensions in Small Space. CoRR abs/1607.06660 (2016) - [i5]Nicola Prezza:
In-Place Longest Common Extensions. CoRR abs/1608.05100 (2016) - [i4]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Space-Efficient Re-Pair Compression. CoRR abs/1611.01479 (2016) - 2015
- [j1]Alberto Policriti, Nicola Prezza:
Fast randomized approximate string matching with succinct hash data structures. BMC Bioinform. 16(S-9): S4 (2015) - [c5]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Composite Repetition-Aware Data Structures. CPM 2015: 26-39 - [c4]Alberto Policriti, Nicola Gigante, Nicola Prezza:
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform. LATA 2015: 587-598 - [c3]Alberto Policriti, Nicola Prezza:
Fast Online Lempel-Ziv Factorization in Compressed Space. SPIRE 2015: 13-20 - [i3]Nicola Prezza:
A Compressed-Gap Data-Aware Measure for Indexable Dictionaries. CoRR abs/1502.03288 (2015) - [i2]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Composite repetition-aware data structures. CoRR abs/1502.05937 (2015) - [i1]Nicola Prezza, Alberto Policriti:
Computing LZ77 in Run-Compressed Space. CoRR abs/1510.06257 (2015) - 2014
- [c2]Alberto Policriti, Nicola Prezza:
Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. ISAAC 2014: 157-168 - 2012
- [c1]Nicola Prezza, Cristian Del Fabbro, Francesco Vezzi, Emanuale De Paoli, Alberto Policriti:
ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet. BCB 2012: 12-19
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:12 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:
