2005 |
17 | EE | Livio Colussi,
Michele Conforti,
Giacomo Zambelli:
Disjoint paths in arborescences.
Discrete Mathematics 292(1-3): 187-191 (2005) |
2004 |
16 | | Livio Colussi,
Gilberto Filé,
A. Griggio:
Precise Analysis of p-Calculus in Cubic Time.
IFIP TCS 2004: 317-332 |
1998 |
15 | | Dany Breslauer,
Livio Colussi,
Laura Toniolo:
On the Comparison Complexity of the String Prefix-Matching Problem.
J. Algorithms 29(1): 18-67 (1998) |
1996 |
14 | EE | Livio Colussi,
Alessia De Col:
A Time and Space Efficient Data Structure for String Searching on Large Texts.
Inf. Process. Lett. 58(5): 217-222 (1996) |
13 | EE | Livio Colussi,
Laura Toniolo:
How the Character Comparison Order Shapes the Shift Function of On-Line Pattern Matching Algorithms.
Theor. Comput. Sci. 163(1&2): 117-144 (1996) |
1995 |
12 | | Livio Colussi,
Elena Marchiori,
Massimo Marchiori:
On Termination of Constraint Logic Programs.
CP 1995: 431-448 |
11 | | Livio Colussi,
Elena Marchiori,
Massimo Marchiori:
A Dataflow Semantics for Constraint Logic Programs.
GULP-PRODE 1995: 557-568 |
10 | | Livio Colussi,
Elena Marchiori,
Massimo Marchiori:
A Dataflow Semantics for Constraint Logic Programs
PLILP 1995: 431-448 |
1994 |
9 | | Dany Breslauer,
Livio Colussi,
Laura Toniolo:
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract).
ESA 1994: 483-494 |
8 | | Livio Colussi:
Fastest Pattern Matching in Strings.
J. Algorithms 16(2): 163-189 (1994) |
1993 |
7 | | Dany Breslauer,
Livio Colussi,
Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem.
CPM 1993: 11-19 |
6 | | Dany Breslauer,
Livio Colussi,
Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem.
Inf. Process. Lett. 47(1): 51-57 (1993) |
1992 |
5 | | Livio Colussi,
Elena Marchiori:
A Predicate Transformer for Unification.
JICSLP 1992: 67-81 |
1991 |
4 | | Livio Colussi,
Elena Marchiori:
Proving Correctness of Logic Programs Using Axiomatic Semantics.
ICLP 1991: 629-642 |
3 | | Livio Colussi:
Correctness and Efficiency of the Pattern Matching Algorithms
Inf. Comput. 95(2): 225-251 (1991) |
1990 |
2 | | Livio Colussi,
Zvi Galil,
Raffaele Giancarlo:
On the Exact Complexity of String Matching (Extended Abstract)
FOCS 1990: 135-144 |
1983 |
1 | | Annalisa Bossi,
Nicoletta Cocco,
Livio Colussi:
A Divide-and-Conquer Approach to General Context-Free Parsing.
Inf. Process. Lett. 16(4): 203-208 (1983) |