default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenzo Sprugnoli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j39]Donatella Merlini
, Renzo Sprugnoli:
Arithmetic into geometric progressions through Riordan arrays. Discret. Math. 340(2): 160-174 (2017)- [j38]Donatella Merlini, Renzo Sprugnoli:
Corrigendum to "Arithmetic into geometric progressions through Riordan arrays" [Discrete Math. 340(2) (2017) 160-174]. Discret. Math. 340(8): 2070 (2017) - 2015
- [j37]Renza Campagni, Donatella Merlini, Renzo Sprugnoli, Maria Cecilia Verri:
Data mining models for student careers. Expert Syst. Appl. 42(13): 5508-5521 (2015) - 2014
- [j36]Ana Luzón, Donatella Merlini, Manuel A. Morón, Renzo Sprugnoli:
Complementary Riordan arrays. Discret. Appl. Math. 172: 75-87 (2014) - 2012
- [c16]Donatella Merlini, Renza Campagni, Renzo Sprugnoli:
Analyzing paths in a student database. EDM 2012: 208-209 - 2011
- [j35]Donatella Merlini, Renzo Sprugnoli:
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern. Theor. Comput. Sci. 412(27): 2988-3001 (2011) - 2010
- [j34]Silvia Bacchelli, Luca Ferrari, Renzo Pinzani, Renzo Sprugnoli:
Mixed succession rules: The commutative case. J. Comb. Theory A 117(5): 568-582 (2010) - [j33]Donatella Merlini, Renzo Sprugnoli:
The relevant prefixes of coloured Motzkin walks: An average case analysis. Theor. Comput. Sci. 411(1): 148-163 (2010)
2000 – 2009
- 2009
- [j32]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Combinatorial sums and implicit Riordan arrays. Discret. Math. 309(2): 475-486 (2009) - [j31]Tian-Xiao He, Renzo Sprugnoli:
Sequence characterization of Riordan arrays. Discret. Math. 309(12): 3962-3974 (2009) - [c15]Donatella Merlini, Renzo Sprugnoli:
An algorithm for proving identities with Riordan transformations. ICTCS 2009: 169-174 - 2008
- [j30]Renzo Sprugnoli:
Negation of binomial coefficients. Discret. Math. 308(22): 5070-5077 (2008) - 2007
- [j29]Davide Baccherini, Donatella Merlini, Renzo Sprugnoli:
Binary words excluding a pattern and proper Riordan arrays. Discret. Math. 307(9-10): 1021-1037 (2007) - [j28]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
The Method of Coefficients. Am. Math. Mon. 114(1): 40-57 (2007) - [c14]Davide Baccherini, Donatella Merlini, Renzo Sprugnoli:
Tablatures for Stringed Instruments and Generating Functions. FUN 2007: 40-52 - [c13]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
The random generation of derangements. ICTCS 2007: 139-150 - 2006
- [j27]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
The Cauchy numbers. Discret. Math. 306(16): 1906-1920 (2006) - [j26]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Combinatorial inversions and implicit Riordan arrays. Electron. Notes Discret. Math. 26: 103-110 (2006) - [c12]Estela Saquete, Patricio Martínez-Barco, Rafael Muñoz, Matteo Negri, Manuela Speranza, Renzo Sprugnoli:
Automatic resolution rule assignment to multilingual Temporal Expressions using annotated corpora. TIME 2006: 218-224 - 2004
- [j25]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Waiting patterns for a printer. Discret. Appl. Math. 144(3): 359-373 (2004) - 2002
- [j24]Donatella Merlini, Renzo Sprugnoli:
Fountains and histograms. J. Algorithms 44(1): 159-176 (2002) - [j23]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
The Tennis Ball Problem. J. Comb. Theory A 99(2): 307-344 (2002) - [j22]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
A strip-like tiling algorithm. Theor. Comput. Sci. 282(2): 337-352 (2002) - [j21]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Modified binary searching for static tables. Theor. Comput. Sci. 285(1): 73-88 (2002) - 2000
- [j20]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Strip tiling and regular grammars. Theor. Comput. Sci. 242(1-2): 109-124 (2000) - [c11]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Modified Binary Searching for Static Tables. CIAC 2000: 211-225
1990 – 1999
- 1999
- [j19]Donatella Merlini, Douglas G. Rogers, Renzo Sprugnoli, M. Cecilia Verri:
Underdiagonal Lattice Paths with Unrestricted Steps. Discret. Appl. Math. 91(1-3): 197-213 (1999) - [c10]Donatella Merlini, S. Petruzzi, Renzo Sprugnoli, M. Cecilia Verri:
A System for Algorithms' Animation. ICMCS, Vol. 2 1999: 1033-1034 - 1998
- [j18]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Average-Case Analysis for a Simple Compression Algorithm. Algorithmica 22(4): 585-599 (1998) - [j17]Cristiano Corsani, Donatella Merlini, Renzo Sprugnoli:
Left-inversion of combinatorial sums. Discret. Math. 180(1-3): 107-122 (1998) - 1996
- [j16]Renzo Sprugnoli:
Recurrence Relations on Heaps. Algorithmica 15(5): 467-480 (1996) - [j15]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
A Uniform Model for the Storage Utilization of B-Tree-Like Structures. Inf. Process. Lett. 57(1): 53-58 (1996) - [j14]Elena Barcucci, Alberto Del Lungo, Renzo Pinzani, Renzo Sprugnoli:
Polyominoes Defined by Their Vertical and Horizontal Projections. Theor. Comput. Sci. 159(1): 129-136 (1996) - [c9]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
The Area Determined by Underdiagonal Lattice Paths. CAAP 1996: 59-71 - 1995
- [j13]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
The random generation of underdiagonal walks. Discret. Math. 139(1-3): 3-18 (1995) - [j12]Renzo Sprugnoli:
Riordan arrays and the Abel-Gould identity. Discret. Math. 142(1-3): 213-233 (1995) - 1994
- [j11]Renzo Sprugnoli:
Riordan arrays and combinatorial sums. Discret. Math. 132(1-3): 267-290 (1994) - [j10]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
The Random Generation of Directed Animals. Theor. Comput. Sci. 127(2): 333-350 (1994) - [c8]Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Algebraic and Combinatorial Properties of Simple, Coloured Walks. CAAP 1994: 218-233 - 1993
- [c7]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
Directed Column-Convex Polyominoes by Recurrence Relations. TAPSOFT 1993: 282-298 - 1992
- [j9]Renzo Sprugnoli:
Properties of Binary Trees Related to Position. Comput. J. 35(4): 395-404 (1992) - [j8]Renzo Sprugnoli:
The Generation of Binary Trees as a Numerical Problem. J. ACM 39(2): 317-327 (1992) - 1991
- [c6]Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli:
A Characterization of Binary Search Networks. FCT 1991: 126-135 - 1990
- [j7]Renzo Sprugnoli:
Counting Labels in Binary Trees. BIT 30(1): 62-69 (1990) - [j6]Renzo Sprugnoli:
On the Approximation of Catalan Numbers and Other Quantities. Eur. J. Comb. 11(1): 65-72 (1990) - [j5]Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
Optimal Selection of Secondary Indexes. IEEE Trans. Software Eng. 16(1): 32-38 (1990)
1980 – 1989
- 1989
- [j4]Renzo Sprugnoli:
The Analysis of a Simple In-Place Merging Algorithm. J. Algorithms 10(3): 366-380 (1989) - [c5]Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani:
On Some Properties of (a, b)-Trees. Optimal Algorithms 1989: 139-152 - 1983
- [c4]M. R. Laganá, E. Locuratolo, Renzo Sprugnoli:
A Model for Word Processing Systems. ICOD-2 Workshop on New Applications of Data Bases 1983: 129-138 - 1982
- [j3]Renzo Pinzani, Renzo Sprugnoli:
The Separability of Formal Languages. RAIRO Theor. Informatics Appl. 16(1): 13-31 (1982) - 1981
- [j2]Renzo Sprugnoli:
On the Allocation of Binary Trees to Secondary Storage. BIT 21(3): 305-316 (1981)
1970 – 1979
- 1977
- [j1]Renzo Sprugnoli:
Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. Commun. ACM 20(11): 841-850 (1977) - 1974
- [c3]Gianni Aguzzi, Francesca Cesarini, Renzo Pinzani, Giovanni Soda, Renzo Sprugnoli:
Tree structures handling by APS. Symposium on Programming 1974: 120-129 - 1973
- [c2]Gianni Aguzzi, Francesca Cesarini, Renzo Pinzani, Giovanni Soda, Renzo Sprugnoli:
Towards an Automatic Generation of Interpreters. GI Jahrestagung 1973: 94-103 - 1972
- [c1]Gianni Aguzzi, Renzo Pinzani, Renzo Sprugnoli:
An Algorithmic Approach to the Semantics of Programming Languages. ICALP 1972: 147-166
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-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
