Остановите войну!
for scientists:
default search action
Livio Colussi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [i1]Livio Colussi:
Work function algorithm can forget history without losing competitiveness. CoRR abs/1203.4920 (2012) - 2011
- [j10]Livio Colussi:
The convergence classes of Collatz function. Theor. Comput. Sci. 412(39): 5409-5419 (2011)
2000 – 2009
- 2005
- [j9]Livio Colussi, Michele Conforti, Giacomo Zambelli:
Disjoint paths in arborescences. Discret. Math. 292(1-3): 187-191 (2005) - 2004
- [c10]Livio Colussi, Gilberto Filé, A. Griggio:
Precise Analysis of π-Calculus in Cubic Time. IFIP TCS 2004: 317-331
1990 – 1999
- 1998
- [j8]Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Comparison Complexity of the String Prefix-Matching Problem. J. Algorithms 29(1): 18-67 (1998) - 1996
- [j7]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) - [j6]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
- [c9]Livio Colussi, Elena Marchiori, Massimo Marchiori:
A Dataflow Semantics for Constraint Logic Programs. GULP-PRODE 1995: 557-568 - [c8]Livio Colussi, Elena Marchiori, Massimo Marchiori:
On Termination of Constraint Logic Programs. CP 1995: 431-448 - [c7]Livio Colussi, Elena Marchiori, Massimo Marchiori:
A Dataflow Semantics for Constraint Logic Programs. PLILP 1995: 431-448 - 1994
- [j5]Livio Colussi:
Fastest Pattern Matching in Strings. J. Algorithms 16(2): 163-189 (1994) - [c6]Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). ESA 1994: 483-494 - [c5]Livio Colussi, Elena Marchiori, Massimo Marchiori:
Combining Logic and Control to Characterize Global Invariants of Prolog Programs. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - 1993
- [j4]Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. Inf. Process. Lett. 47(1): 51-57 (1993) - [c4]Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. CPM 1993: 11-19 - 1992
- [c3]Livio Colussi, Elena Marchiori:
A Predicate Transformer for Unification. JICSLP 1992: 67-81 - 1991
- [j3]Livio Colussi:
Correctness and Efficiency of the Pattern Matching Algorithms. Inf. Comput. 95(2): 225-251 (1991) - [c2]Livio Colussi, Elena Marchiori:
Proving Correctness of Logic Programs Using Axiomatic Semantics. ICLP 1991: 629-642 - 1990
- [c1]Livio Colussi, Zvi Galil, Raffaele Giancarlo:
On the Exact Complexity of String Matching (Extended Abstract). FOCS 1990: 135-144
1980 – 1989
- 1983
- [j2]Annalisa Bossi, Nicoletta Cocco, Livio Colussi:
A Divide-and-Conquer Approach to General Context-Free Parsing. Inf. Process. Lett. 16(4): 203-208 (1983) - 1980
- [j1]Annalisa Bossi, Livio Colussi, Claudio Cobelli, Giorgio Romanin-Jacur:
Identifiability of compartmental models: algorithms to solve an actual problem by means of symbolic calculus. SIGSAM Bull. 14(4): 35-40 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint