EDBT 2026 Demo / reviewers in the wild / expert
Livio Colussi
dblp:54/3760
· DBLP profile ↗
11ranked-venue papers
7as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 9 · 6 first-authorDatabases, data management, data science and information retrieval · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Algorithms and data structures · 81% Approximation and online algorithms · 14% Computational complexity · 4% | |
| Software engineering, system software, and programming languages
1 paper |
Program verification · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › sequence algorithms › string algorithms
string matching |
0.0 | 2 | 1991 | Correctness and Efficiency of the Pattern Matching Algorithms · Inf. Comput. 1991 On the Exact Complexity of String Matching (Extended Abstract) · FOCS 1990 |
Program verification
correctness proof |
0.0 | 1 | 1991 | Correctness and Efficiency of the Pattern Matching Algorithms · Inf. Comput. 1991 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.0 | 1 | 1991 | Correctness and Efficiency of the Pattern Matching Algorithms · Inf. Comput. 1991 |
Algorithms and data structures › sequence algorithms › string algorithms › string matching
exact complexity of string matching |
0.0 | 1 | 1990 | On the Exact Complexity of String Matching (Extended Abstract) · FOCS 1990 |
Approximation and online algorithms
online algorithms |
0.0 | 1 | 1990 | On the Exact Complexity of String Matching (Extended Abstract) · FOCS 1990 |
Algorithms and data structures › sequence algorithms › string algorithms › string matching
online string matching |
0.0 | 1 | 1990 | On the Exact Complexity of String Matching (Extended Abstract) · FOCS 1990 |
Algorithms and data structures › sequence algorithms › string algorithms
character comparison bounds |
0.0 | 1 | 1990 | On the Exact Complexity of String Matching (Extended Abstract) · FOCS 1990 |
Computational complexity
lower bounds |
0.0 | 1 | 1990 | On the Exact Complexity of String Matching (Extended Abstract) · FOCS 1990 |
Methods — techniques the papers use, named apart from their topics
linear-time algorithm · 0.0character comparison analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | The convergence classes of Collatz function
Livio Colussi |
Theor. Comput. Sci. | 1 |
| 1996 | A Time and Space Efficient Data Structure for String Searching on Large Texts
Livio Colussi, Alessia De Col |
Inf. Process. Lett. | 1 |
| 1996 | How the Character Comparison Order Shapes the Shift Function of On-Line Pattern Matching Algorithms
Livio Colussi, Laura Toniolo |
Theor. Comput. Sci. | 1 |
| 1995 | On Termination of Constraint Logic Programs
Livio Colussi, Elena Marchiori, Massimo Marchiori |
CP | 1 |
| 1994 | On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract)
Dany Breslauer, Livio Colussi, Laura Toniolo |
ESA | 2 |
| 1993 | Tight Comparison Bounds for the String Prefix-Matching Problem
Dany Breslauer, Livio Colussi, Laura Toniolo |
CPM | 2 |
| 1993 | Tight Comparison Bounds for the String Prefix-Matching Problem
Dany Breslauer, Livio Colussi, Laura Toniolo |
Inf. Process. Lett. | 2 |
| 1991 | Proving Correctness of Logic Programs Using Axiomatic Semantics
Livio Colussi, Elena Marchiori |
ICLP | 1 |
| 1991 | Correctness and Efficiency of the Pattern Matching Algorithms
Livio Colussi |
Inf. Comput. | 1 |
| 1990 | On the Exact Complexity of String Matching (Extended Abstract)abstractThe maximal number of character comparisons made by a linear-time string matching algorithm, given a text string of length n and a pattern string of length m over a general alphabet, is investigated. The number is denoted by c(n,m) or approximated by (1+C)n, where C is a universal constant. The subscript 'online' is added when attention is restricted to online algorithms, and the superscript '1' is added when algorithms that find only one occurrence of the pattern in the text are considered. It is well known that n> Livio Colussi, Zvi Galil, Raffaele Giancarlo |
FOCS | 1 |
| 1983 | A Divide-and-Conquer Approach to General Context-Free Parsing
Annalisa Bossi, Nicoletta Cocco, Livio Colussi |
Inf. Process. Lett. | 3 |