Livio Colussi

According to our database, Livio Colussi authored at least 19 papers between 1980 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Work function algorithm can forget history without losing competitiveness

Livio Colussi

CoRR, 2012

2011

The convergence classes of Collatz function.

Livio Colussi

Theor. Comput. Sci., 2011

2005

Disjoint paths in arborescences.

Livio Colussi, Michele Conforti, Giacomo Zambelli

Discret. Math., 2005

2004

Precise Analysis of π-Calculus in Cubic Time.

Livio Colussi, Gilberto Filé, A. Griggio

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

1998

On the Comparison Complexity of the String Prefix-Matching Problem.

Dany Breslauer, Livio Colussi, Laura Toniolo

J. Algorithms, 1998

1996

How the Character Comparison Order Shapes the Shift Function of On-Line Pattern Matching Algorithms.

Livio Colussi, Laura Toniolo

Theor. Comput. Sci., 1996

A Time and Space Efficient Data Structure for String Searching on Large Texts.

Livio Colussi, Alessia De Col

Inf. Process. Lett., 1996

1995

On Termination of Constraint Logic Programs.

Livio Colussi, Elena Marchiori, Massimo Marchiori

Proceedings of the Principles and Practice of Constraint Programming, 1995

A Dataflow Semantics for Constraint Logic Programs.

Livio Colussi, Elena Marchiori, Massimo Marchiori

Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1994

Fastest Pattern Matching in Strings.

Livio Colussi

J. Algorithms, 1994

Combining Logic and Control to Characterize Global Invariants of Prolog Programs.

Livio Colussi, Elena Marchiori, Massimo Marchiori

Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994

On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract).

Dany Breslauer, Livio Colussi, Laura Toniolo

Proceedings of the Algorithms, 1994

1993

Tight Comparison Bounds for the String Prefix-Matching Problem.

Dany Breslauer, Livio Colussi, Laura Toniolo

Inf. Process. Lett., 1993

1992

A Predicate Transformer for Unification.

Livio Colussi, Elena Marchiori

Proceedings of the Logic Programming, 1992

1991

Correctness and Efficiency of the Pattern Matching Algorithms

Livio Colussi

Inf. Comput., December, 1991

Proving Correctness of Logic Programs Using Axiomatic Semantics.

Livio Colussi, Elena Marchiori

Proceedings of the Logic Programming, 1991

1990

On the Exact Complexity of String Matching (Extended Abstract)

Livio Colussi, Zvi Galil, Raffaele Giancarlo

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1983

A Divide-and-Conquer Approach to General Context-Free Parsing.

Annalisa Bossi, Nicoletta Cocco, Livio Colussi

Inf. Process. Lett., 1983

1980

Identifiability of compartmental models: algorithms to solve an actual problem by means of symbolic calculus.

Annalisa Bossi, Livio Colussi, Claudio Cobelli, Giorgio Romanin-Jacur

SIGSAM Bull., 1980