Nicola Prezza - RankMe

139 papers A* 7A 2B 27C 13Journal 84Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Incongruity-sensitive access to highly compressed strings. CoRR Ferdinando Cicalese, Zsuzsanna Lipták, Travis Gagie, Gonzalo Navarro, Nicola Prezza, Cristian Urbina
2026	J	`jnl`	On the complexity of computing the co-lexicographic width of a regular language. J. Comput. Syst. Sci. Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza
2025	B	`ed.`	23rd International Symposium on Experimental Algorithms, SEA 2025, Venice, Italy, July 22-24, 2025 SEA Petra Mutzel, Nicola Prezza
2025	J	`jnl`	Compressing Suffix Trees by Path Decompositions. CoRR Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Ragnar Groot Koerkamp, Giovanni Manzini, Nicola Prezza
2025	B	`conf`	Encoding Co-Lex Orders of Finite-State Automata in Linear Space. CPM Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni
2025	J	`jnl`	Encoding Co-Lex Orders of Finite-State Automata in Linear Space. CoRR Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni
2025	J	`jnl`	Preface to "Computation over Compressed Data" at DCC 2022. Inf. Comput. Travis Gagie, Nicola Prezza
2025	J	`jnl`	Testing Suffixient Sets. CoRR Davide Cenzato, Francisco Olivares, Nicola Prezza
2025	B	`conf`	Text Indexing for Simple Regular Expressions. CPM Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow
2025	B	`conf`	The Trie Measure, Revisited. CPM Jarno N. Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
2025	J	`jnl`	The Trie Measure, Revisited. CoRR Jarno N. Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
2025	C	`conf`	Universally Wheeler Languages. DLT Ruben Becker, Giuseppa Castiglione, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza, Antonio Restivo, Brian Riccardi
2025	J	`jnl`	Universally Wheeler Languages. CoRR Ruben Becker, Giuseppa Castiglione, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza, Antonio Restivo, Brian Riccardi
2025	—	`conf`	Wheeler Graphs and Wheeler Languages. The Expanding World of Compressed Data Nicola Cotumaccio, Giovanna D'Agostino, Daniel Gibney, Alberto Policriti, Nicola Prezza, Sharma V. Thankachan
2024	B	`conf`	Computing the LCP Array of a Labeled Graph. CPM Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza
2024	J	`jnl`	Computing the LCP Array of a Labeled Graph. CoRR Jarno Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza
2024	C	`conf`	Indexing Finite-State Automata Using Forward-Stable Partitions. SPIRE Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni
2024	J	`jnl`	Indexing Finite-State Automata Using Forward-Stable Partitions. CoRR Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni
2024	C	`conf`	On Computing the Smallest Suffixient Set. SPIRE Davide Cenzato, Francisco Olivares, Nicola Prezza
2024	J	`jnl`	On Computing the Smallest Suffixient Set. CoRR Davide Cenzato, Francisco Olivares, Nicola Prezza
2024	J	`jnl`	On the Complexity of Computing the Co-lexicographic Width of a Regular Language. CoRR Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza
2024	B	`conf`	Random Wheeler Automata. CPM Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza
2024	J	`jnl`	Regular Expressions: Matching and Indexing (Dagstuhl Seminar 24472). Dagstuhl Reports Inge Li Gørtz, Sebastian Maneth, Gonzalo Navarro, Nicola Prezza
2024	B	`conf`	Sketching and Streaming for Dictionary Compression. DCC Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
2024	B	`conf`	The Rational Construction of a Wheeler DFA. CPM Giovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi
2024	B	`conf`	Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. SEA Patrick Dinklage, Johannes Fischer, Nicola Prezza
2023	J	`jnl`	Algorithms for Massive Data - Lecture Notes. CoRR Nicola Prezza
2023	J	`jnl`	Co-lexicographically Ordering Automata and Regular Languages - Part I. J. ACM Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
2023	B	`conf`	Computing matching statistics on Wheeler DFAs. DCC Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino
2023	J	`jnl`	Computing matching statistics on Wheeler DFAs. CoRR Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino
2023	B	`conf`	Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. CPM Sung-Hwan Kim, Francisco Olivares, Nicola Prezza
2023	J	`jnl`	Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. CoRR Sung-Hwan Kim, Francisco Olivares, Nicola Prezza
2023	C	`conf`	Optimal Wheeler Language Recognition. SPIRE Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
2023	J	`jnl`	Optimal Wheeler Language Recognition. CoRR Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
2023	J	`jnl`	Random Wheeler Automata. CoRR Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza
2023	J	`jnl`	Sketching and Streaming for Dictionary Compression. CoRR Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza
2023	A	`conf`	Sorting Finite Automata via Partition Refinement. ESA Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
2023	J	`jnl`	Sorting Finite Automata via Partition Refinement. CoRR Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
2023	C	`conf`	Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza
2023	J	`jnl`	Space-time Trade-offs for the LCP Array of Wheeler DFAs. CoRR Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza
2023	J	`jnl`	Suffixient Sets. CoRR Lore Depuydt, Travis Gagie, Ben Langmead, Giovanni Manzini, Nicola Prezza
2023	—	`conf`	Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza
2023	J	`jnl`	Toward a Definitive Compressibility Measure for Repetitive Sequences. IEEE Trans. Inf. Theory Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2023	A*	`conf`	Verifiable Learning for Robust Tree Ensembles. CCS Stefano Calzavara, Lorenzo Cazzaro, Giulio Ermanno Pibiri, Nicola Prezza
2023	J	`jnl`	Verifiable Learning for Robust Tree Ensembles. CoRR Stefano Calzavara, Lorenzo Cazzaro, Giulio Ermanno Pibiri, Nicola Prezza
2022	J	`jnl`	Co-lexicographically ordering automata and regular languages. Part I. CoRR Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
2022	B	`conf`	HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. DCC Dominik Köppl, Gonzalo Navarro, Nicola Prezza
2022	B	`conf`	Linear-time Minimization of Wheeler DFAs. DCC Jarno Alanko, Nicola Cotumaccio, Nicola Prezza
2022	J	`jnl`	Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). Algorithmica Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza
2022	J	`jnl`	Special Issue on Algorithms and Data-Structures for Compressed Computation. Algorithms Alberto Policriti, Nicola Prezza
2021	J	`jnl`	Adaptive learning of compressible strings. Theor. Comput. Sci. Gabriele Fici, Nicola Prezza, Rossano Venturini
2021	B	`conf`	Compressed Weighted de Bruijn Graphs. CPM Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini
2021	J	`jnl`	HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. CoRR Dominik Köppl, Gonzalo Navarro, Nicola Prezza
2021	J	`jnl`	Linear-time Minimization of Wheeler DFAs. CoRR Jarno Alanko, Nicola Cotumaccio, Nicola Prezza
2021	B	`conf`	Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
2021	J	`jnl`	On (co-lex) Ordering Automata. CoRR Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza
2021	A*	`conf`	On Indexing and Compressing Finite Automata. SODA Nicola Cotumaccio, Nicola Prezza
2021	A*	`conf`	On Locating Paths in Compressed Tries. SODA Nicola Prezza
2021	J	`jnl`	On the Approximation Ratio of Ordered Parsings. IEEE Trans. Inf. Theory Gonzalo Navarro, Carlos Ochoa, Nicola Prezza
2021	J	`jnl`	Optimal Substring Equality Queries with Applications to Sparse Text Indexing. ACM Trans. Algorithms Nicola Prezza
2021	J	`jnl`	Optimal-Time Dictionary-Compressed Indexes. ACM Trans. Algorithms Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2021	J	`jnl`	Space-efficient construction of compressed suffix trees. Theor. Comput. Sci. Nicola Prezza, Giovanna Rosone
2021	J	`jnl`	Subpath Queries on Compressed Graphs: A Survey. Algorithms Nicola Prezza
2021	J	`jnl`	Wheeler languages. Inf. Comput. Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
2021	J	`jnl`	Which Regular Languages can be Efficiently Indexed? CoRR Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
2020	B	`conf`	Decompressing Lempel-Ziv Compressed Text. DCC Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2020	C	`conf`	Faster Online Computation of the Succinct Longest Previous Factor Array. CiE Nicola Prezza, Giovanna Rosone
2020	J	`jnl`	Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space. J. ACM Travis Gagie, Gonzalo Navarro, Nicola Prezza
2020	B	`conf`	Indexing Compressed Text: A Tale of Time and Space (Invited Talk). SEA Nicola Prezza
2020	J	`jnl`	Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
2020	J	`jnl`	On Indexing and Compressing Finite Automata. CoRR Nicola Cotumaccio, Nicola Prezza
2020	J	`jnl`	On Locating Paths in Compressed Cardinal Trees. CoRR Nicola Prezza
2020	—	`conf`	On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CIRCLE Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco
2020	A*	`conf`	Regular Languages meet Prefix Sorting. SODA Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
2020	J	`jnl`	Subpath Queries on Compressed Graphs: a Survey. CoRR Nicola Prezza
2020	J	`jnl`	Substring Query Complexity of String Reconstruction. CoRR Gabriele Fici, Nicola Prezza, Rossano Venturini
2020	B	`conf`	Towards a Definitive Measure of Repetitiveness. LATIN Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2020	J	`jnl`	Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. BMC Bioinform. Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
2020	J	`jnl`	Wheeler Languages. CoRR Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
2020	J	`jnl`	gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone
2019	C	`conf`	A New Linear-Time Algorithm for Centroid Decomposition. SPIRE Davide Della Giustina, Nicola Prezza, Rossano Venturini
2019	J	`jnl`	On Prefix-Sorting Finite Automata. CoRR Jarno Alanko, Alberto Policriti, Nicola Prezza
2019	J	`jnl`	On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CoRR Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco
2019	J	`jnl`	On the reproducibility of experiments of indexing repetitive document collections. Inf. Syst. Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco
2019	C	`conf`	Online Algorithms on Antipowers and Antiperiods. SPIRE Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone
2019	B	`conf`	Optimal Rank and Select Queries on Dictionary-Compressed Text. CPM Nicola Prezza
2019	J	`jnl`	SNPs detection by eBWT positional clustering. Algorithms Mol. Biol. Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
2019	B	`conf`	Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. CPM Nicola Prezza, Giovanna Rosone
2019	J	`jnl`	Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. CoRR Nicola Prezza, Giovanna Rosone
2019	J	`jnl`	Space-Efficient Construction of Compressed Suffix Trees. CoRR Nicola Prezza, Giovanna Rosone
2019	J	`jnl`	Towards a Definitive Measure of Repetitiveness. CoRR Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza
2019	J	`jnl`	Universal compressed text indexing. Theor. Comput. Sci. Gonzalo Navarro, Nicola Prezza
2018	J	`jnl`	A separation between RLSLPs and LZ77. J. Discrete Algorithms Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2018	A*	`conf`	At the roots of dictionary compression: string attractors. STOC Dominik Kempa, Nicola Prezza
2018	C	`conf`	Detecting Mutations by eBWT. WABI Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
2018	J	`jnl`	Detecting Mutations by eBWT. CoRR Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
2018	J	`jnl`	Fast Lempel-Ziv Decompression in Linear Space. CoRR Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2018	J	`jnl`	Faster Attractor-Based Indexes. CoRR Gonzalo Navarro, Nicola Prezza
2018	J	`jnl`	Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space. CoRR Travis Gagie, Gonzalo Navarro, Nicola Prezza
2018	A*	`conf`	In-Place Sparse Suffix Sorting. SODA Nicola Prezza
2018	J	`jnl`	LZ77 Computation Based on the Run-Length Encoded BWT. Algorithmica Alberto Policriti, Nicola Prezza
2018	—	`conf`	On String Attractors. ICTCS Nicola Prezza
2018	J	`jnl`	On the Approximation Ratio of Greedy Parsings. CoRR Gonzalo Navarro, Nicola Prezza
2018	B	`conf`	On the Approximation Ratio of Lempel-Ziv Parsing. LATIN Travis Gagie, Gonzalo Navarro, Nicola Prezza
2018	J	`jnl`	Optimal Rank and Select Queries on Dictionary-Compressed Text. CoRR Nicola Prezza
2018	J	`jnl`	Optimal Substring-Equality Queries with Applications to Sparse Text Indexing. CoRR Nicola Prezza
2018	A*	`conf`	Optimal-Time Text Indexing in BWT-runs Bounded Space. SODA Travis Gagie, Gonzalo Navarro, Nicola Prezza
2018	A	`conf`	String Attractors: Verification and Optimization. ESA Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
2018	J	`jnl`	String Attractors: Verification and Optimization. CoRR Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
2018	J	`jnl`	Universal Compressed Text Indexing. CoRR Gonzalo Navarro, Nicola Prezza
2017	B	`conf`	A Framework of Dynamic Data Structures for String Processing. SEA Nicola Prezza
2017	J	`jnl`	A Framework of Dynamic Data Structures for String Processing. CoRR Nicola Prezza
2017	J	`jnl`	A Separation Between Run-Length SLPs and LZ77. CoRR Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
2017	J	`jnl`	At the Roots of Dictionary Compression: String Attractors. CoRR Dominik Kempa, Nicola Prezza
2017	—	`—`	Compressed Computation for Text Indexing. Nicola Prezza
2017	J	`jnl`	Fast Locating with the RLBWT. CoRR Travis Gagie, Gonzalo Navarro, Nicola Prezza
2017	C	`conf`	Flexible Indexing of Repetitive Collections. CiE Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
2017	B	`conf`	From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CPM Alberto Policriti, Nicola Prezza
2017	J	`jnl`	From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CoRR Alberto Policriti, Nicola Prezza
2017	J	`jnl`	Practical and Effective Re-Pair Compression. CoRR Philip Bille, Inge Li Gørtz, Nicola Prezza
2017	B	`conf`	Space-Efficient Re-Pair Compression. DCC Philip Bille, Inge Li Gørtz, Nicola Prezza
2017	J	`jnl`	String Attractors. CoRR Nicola Prezza
2017	C	`conf`	Succinct Partial Sums and Fenwick Trees. SPIRE Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen
2017	J	`jnl`	Succinct Partial Sums and Fenwick Trees. CoRR Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen
2016	B	`conf`	Computing LZ77 in Run-Compressed Space. DCC Alberto Policriti, Nicola Prezza
2016	J	`jnl`	Fast Longest Common Extensions in Small Space. CoRR Alberto Policriti, Nicola Prezza
2016	J	`jnl`	Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2. BMC Bioinform. Nicola Prezza, Francesco Vezzi, Max Käller, Alberto Policriti
2016	J	`jnl`	In-Place Longest Common Extensions. CoRR Nicola Prezza
2016	J	`jnl`	Practical combinations of repetition-aware data structures. CoRR Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
2016	J	`jnl`	Space-Efficient Re-Pair Compression. CoRR Philip Bille, Inge Li Gørtz, Nicola Prezza
2015	J	`jnl`	A Compressed-Gap Data-Aware Measure for Indexable Dictionaries. CoRR Nicola Prezza
2015	C	`conf`	Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform. LATA Alberto Policriti, Nicola Gigante, Nicola Prezza
2015	B	`conf`	Composite Repetition-Aware Data Structures. CPM Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
2015	J	`jnl`	Composite repetition-aware data structures. CoRR Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
2015	J	`jnl`	Computing LZ77 in Run-Compressed Space. CoRR Nicola Prezza, Alberto Policriti
2015	C	`conf`	Fast Online Lempel-Ziv Factorization in Compressed Space. SPIRE Alberto Policriti, Nicola Prezza
2015	J	`jnl`	Fast randomized approximate string matching with succinct hash data structures. BMC Bioinform. Alberto Policriti, Nicola Prezza
2014	B	`conf`	Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. ISAAC Alberto Policriti, Nicola Prezza
2012	—	`conf`	ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet. BCB Nicola Prezza, Cristian Del Fabbro, Francesco Vezzi, Emanuale De Paoli, Alberto Policriti