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