Giulia Bernardini

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Differentially Private Substring and Document Counting	2024	Giulia Bernardini Philip Bille Inge Li Gørtz Teresa Anna Steiner
+	Fixed points and attractors of reactantless and inhibitorless reaction systems	2023	Rocco Ascone Giulia Bernardini Luca Manzoni
+	Constructing Phylogenetic Networks via Cherry Picking and Machine Learning	2023	Giulia Bernardini Leo van Iersel Esther Julien Leen Stougie
+	Fixed Points and Attractors of Reactantless and Inhibitorless Reaction Systems	2023	Rocco Ascone Giulia Bernardini Luca Manzoni
+ PDF Chat	Elastic-Degenerate String Matching via Fast Matrix Multiplication	2022	Giulia Bernardini Paweł Gawrychowski Nadia Pisanti Solon P. Pissis Giovanna Rosone
+	A Universal Error Measure for Input Predictions Applied to Online Graph Problems	2022	Giulia Bernardini Alexander Lindermayr Alberto Marchetti-Spaccamela Nicole Megow Leen Stougie Michelle Sweering
+	Elastic-Degenerate String Matching with 1 Error	2022	Giulia Bernardini Estéban Gabory Solon P. Pissis Leen Stougie Michelle Sweering Wiktor Zuba
+ PDF Chat	Elastic-Degenerate String Matching with 1 Error	2022	Giulia Bernardini Esteban Gabory Solon P. Pissis Leen Stougie Michelle Sweering Wiktor Zuba
+ PDF Chat	Incomplete Directed Perfect Phylogeny in Linear Time	2021	Giulia Bernardini Paola Bonizzoni Paweł Gawrychowski
+ PDF Chat	Combinatorial Algorithms for String Sanitization	2020	Giulia Bernardini Huiping Chen Alessio Conte Roberto Grossi Grigorios Loukides Nadia Pisanti Solon P. Pissis Giovanna Rosone Michelle Sweering
+	Incomplete Directed Perfect Phylogeny in Linear Time	2020	Giulia Bernardini Paola Bonizzoni Paweł Gawrychowski
+	Substring Complexity in Sublinear Space.	2020	Giulia Bernardini Gabriele Fici Paweł Gawrychowski Solon P. Pissis
+	On Two Measures of Distance between Fully-Labelled Trees	2020	Giulia Bernardini Paola Bonizzoni Paweł Gawrychowski
+	Incomplete Directed Perfect Phylogeny in Linear Time	2020	Giulia Bernardini Paola Bonizzoni Paweł Gawrychowski
+	Substring Complexity in Sublinear Space	2020	Giulia Bernardini Gabriele Fici Paweł Gawrychowski Solon P. Pissis
+	String Sanitization: A Combinatorial Approach	2019	Giulia Bernardini Huiping Chen Alessio Conte Roberto Grossi Grigorios Loukides Nadia Pisanti Solon P. Pissis Giovanna Rosone
+	Combinatorial Algorithms for String Sanitization	2019	Giulia Bernardini Huiping Chen Alessio Conte Roberto Grossi Grigorios Loukides Nadia Pisanti Solon P. Pissis Giovanna Rosone Michelle Sweering
+	A rearrangement distance for fully-labelled trees	2019	Giulia Bernardini Paola Bonizzoni Gianluca Della Vedova Murray Patterson
+	Combinatorial Algorithms for String Sanitization	2019	Giulia Bernardini Huiping Chen Alessio Conte Roberto Grossi Grigorios Loukides Nadia Pisanti Solon P. Pissis Giovanna Rosone Michelle Sweering
+	Elastic-Degenerate String Matching via Fast Matrix Multiplication	2019	Giulia Bernardini Paweł Gawrychowski Nadia Pisanti Solon P. Pissis Giovanna Rosone
+ PDF Chat	Longest Property-Preserved Common Factor	2018	Lorraine A. K. Ayad Giulia Bernardini Roberto Grossi Costas S. Iliopoulos Nadia Pisanti Solon P. Pissis Giovanna Rosone
+ PDF Chat	Longest Property-Preserved Common Factor	2018	Lorraine A. K. Ayad Giulia Bernardini Roberto Grossi Costas S. Iliopoulos Nadia Pisanti Solon P. Pissis Giovanna Rosone
+	Longest Property-Preserved Common Factor	2018	Lorraine A. K Ayad Giulia Bernardini Roberto Grossi Costas S. Iliopoulos Nadia Pisanti Solon P. Pissis Giovanna Rosone

Common Coauthors

Coauthor	Papers Together
Solon P. Pissis	13
Nadia Pisanti	9
Giovanna Rosone	9
Paweł Gawrychowski	8
Roberto Grossi	7
Michelle Sweering	6
Paola Bonizzoni	5
Huiping Chen	4
Leen Stougie	4
Grigorios Loukides	4
Alessio Conte	4
Costas S. Iliopoulos	3
Wiktor Zuba	2
Rocco Ascone	2
Lorraine A. K. Ayad	2
Gabriele Fici	2
Luca Manzoni	2
Inge Li Gørtz	1
Nicole Megow	1
Philip Bille	1
Estéban Gabory	1
Teresa Anna Steiner	1
Murray Patterson	1
Esteban Gabory	1
Lorraine A. K Ayad	1
Gianluca Della Vedova	1
Alexander Lindermayr	1
Alberto Marchetti-Spaccamela	1
Leo van Iersel	1
Esther Julien	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Inferring clonal evolution of tumors from single nucleotide somatic mutations	2014	Wei Jiao Shankar Vembu Amit G. Deshwar Lincoln Stein Quaid Morris	2
+	The Clonal Evolution of Tumor Cell Populations	1976	Peter C. Nowell̀	2
+	Dynamic graph connectivity with improved worst case update time and sublinear space	2015	David R. Gibb Bruce M. Kapron Valerie King Nolan Thorn	2
+	Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)	2005	M. Lothaire	2
+ PDF Chat	Sublinear Space Algorithms for the Longest Common Substring Problem	2014	Tomasz Kociumaka Tatiana Starikovskaya Hjalte Wedel Vildhøj	2
+ PDF Chat	Computing a Longest Common Palindromic Subsequence	2014	Shihabur Rahman Chowdhury Md. Mahbubul Hasan Sumaiya Iqbal M. Sohel Rahman	2
+	Enumeration of factors in the Thue-Morse word	1989	Srečko Brlek	1
+ PDF Chat	Fast context-free grammar parsing requires fast boolean matrix multiplication	2002	Lillian Lee	1
+ PDF Chat	Uniqueness theorems for periodic functions	1965	N. J. Fine Herbert S. Wilf	1
+ PDF Chat	Multiplying matrices faster than coppersmith-winograd	2012	Virginia Vassilevska Williams	1
+ PDF Chat	All pairs shortest paths using bridging sets and rectangular matrix multiplication	2002	Uri Zwick	1
+	The binary perfect phylogeny with persistent characters	2012	Paola Bonizzoni Chiara Braghin Riccardo Dondi Gabriella Trucco	1
+	Decremental Dynamic Connectivity	1999	Mikkel Thorup	1
+ PDF Chat	Powers of tensors and fast matrix multiplication	2014	François Le Gall	1
+	On the combinatorics of finite words	1999	Aldo de Luca	1
+ PDF Chat	Orthogonal range searching on the RAM, revisited	2011	Timothy M. Chan Kasper Green Larsen Mihai Pătraşcu	1
+ PDF Chat	Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems	2014	Amir Abboud Virginia Vassilevska Williams	1
+ PDF Chat	Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture	2015	Monika Henzinger Sebastian Krinninger Danupon Nanongkai Thatchaphol Saranurak	1
+ PDF Chat	Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree	2016	Jesper Jansson Ramesh Rajaby Chuanqi Shen Wing‐Kin Sung	1
+ PDF Chat	Sublinear Algorithms for Approximating String Compressibility	2012	Sofya Raskhodnikova Dana Ron Ronitt Rubinfeld Adam Smith	1
+ PDF Chat	The “Runs” Theorem	2017	Hideo Bannai I Tomohiro Shunsuke Inenaga Yuto Nakashima Masayuki Takeda Kazuya Tsuruta	1
+ PDF Chat	Approximate Hamming Distance in a Stream	2016	Raphaël Clifford Tatiana Starikovskaya	1
+ PDF Chat	Streaming K-Mismatch with Error Correcting and Applications	2017	Jakub Radoszewski Tatiana Starikovskaya	1
+	Fully Dynamic Connectivity in <i>O</i>(log <i>n</i>(log log <i>n</i>)<sup>2</sup>) Amortized Expected Time	2017	Shang-En Huang Dawei Huang Tsvi Kopelowitz Seth Pettie	1
+ PDF Chat	Efficient Pattern Matching in Elastic-Degenerate Texts	2017	Costas S. Iliopoulos Ritu Kundu Solon P. Pissis	1
+	Boolean matrix multiplication and transitive closure	1971	Michael J. Fischer Albert R. Meyer	1
+ PDF Chat	A Dichotomy for Regular Expression Membership Testing	2017	Karl Bringmann Allan Grønlund Kasper Green Larsen	1
+ PDF Chat	A hardness result and new algorithm for the longest common palindromic subsequence problem	2017	Shunsuke Inenaga Heikki Hyyrö	1
+	Indexing Weighted Sequences: Neat and Efficient	2017	Carl Barton Tomasz Kociumaka Chang Liu Solon P. Pissis Jakub Radoszewski	1
+ PDF Chat	At the roots of dictionary compression: string attractors	2018	Dominik Kempa Nicola Prezza	1
+ PDF Chat	An improved combinatorial algorithm for Boolean matrix multiplication	2018	Huacheng Yu	1
+	Longest Common Factor Made Fully Dynamic.	2018	Amihood Amir Panagiotis Charalampopoulos Solon P. Pissis Jakub Radoszewski	1
+ PDF Chat	Constructing Antidictionaries in Output-Sensitive Space	2019	Lorraine A. K. Ayad Golnaz Badkobeh Gabriele Fici Alice Héliou Solon P. Pissis	1
+ PDF Chat	Complexity of the dynamics of reaction systems	2019	Alberto Dennunzio Enrico Formenti Luca Manzoni Antonio E. Porreca	1
+ PDF Chat	Longest Common Prefixes with k-Errors and Applications	2018	Lorraine A. K. Ayad Carl Barton Panagiotis Charalampopoulos Costas S. Iliopoulos Solon P. Pissis	1
+ PDF Chat	Conditional Lower Bounds for All-Pairs Max-Flow	2018	Robert Krauthgamer Ohad Trabelsi	1
+ PDF Chat	String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure	2019	Dominik Kempa Tomasz Kociumaka	1
+ PDF Chat	Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product	2016	Karl Bringmann Fabrizio Grandoni Barna Saha Virginia Vassilevska Williams	1
+ PDF Chat	Which Regular Expression Patterns Are Hard to Match?	2016	Artūrs Bačkurs Piotr Indyk	1
+ PDF Chat	Computing quartet distance is equivalent to counting 4-cycles	2019	Bartłomiej Dudek Paweł Gawrychowski	1
+	Fully dynamic connectivity in O(log n(log log n)2) amortized expected time	2017	Shang-En Huang Dawei Huang Tsvi Kopelowitz Seth Pettie	1
+	Faster Algorithms for All-Pairs Bounded Min-Cuts	2018	Amir Abboud Loukas Georgiadis Giuseppe F. Italiano Robert Krauthgamer Nikos Parotsidis Ohad Trabelsi Przemysław Uznański Daniel Wolleb-Graf	1
+ PDF Chat	Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space	2020	Travis Gagie Gonzalo Navarro Nicola Prezza	1
+ PDF Chat	New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs	2019	Amir Abbou Robert Krauthgamer Ohad Trabelsi	1
+	Faster Divergence Maximization for Faster Maximum Flow	2020	Yang P. Liu Aaron Sidford	1
+	SOPanG 2: online searching over a pan-genome without false positives.	2020	Aleksander Cisłak Szymon Grabowski	1
+	On repetitiveness measures of Thue-Morse words	2020	Kanaru Kutsukake Takuya Matsumoto Yuto Nakashima Shunsuke Inenaga Hideo Bannai Masayuki Takeda	1
+ PDF Chat	Lempel–Ziv-Like Parsing in Small Space	2020	Dmitry Kosolobov Daniel Valenzuela Gonzalo Navarro Simon J. Puglisi	1
+ PDF Chat	Approximating text-to-pattern Hamming distances	2020	Timothy M. Chan Shay Golan Tomasz Kociumaka Tsvi Kopelowitz Ely Porat	1
+	Time-Space Tradeoffs for Finding a Long Common Substring	2020	Stav Ben-Nun Shay Golan Tomasz Kociumaka Matan Kraus	1