default search action
Andrea Sgarro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c22]Laura Franzoi
, Andrea Sgarro
Random Steinhaus Distances for Robust Syntax-Based Classification of Partially Inconsistent Linguistic Data. IPMU (3) 2020: 17-26
2010 – 2019
- 2019
- [c21]Laura Franzoi
Linguistic classification: dealing jointly with irrelevance and inconsistency. RANLP 2019: 345-352 - 2018
- [c20]Anca Dinu, Liviu P. Dinu, Laura Franzoi
Steinhaus Transforms of Fuzzy String Distances in Computational Linguistics. IPMU (1) 2018: 171-182 - 2017
- [c19]Alina Maria Ciobanu, Liviu P. Dinu, Andrea Sgarro:
Towards a Map of the Syntactic Similarity of Languages. CICLing (1) 2017: 576-590 - [c18]Laura Franzoi
Fuzzy hamming distinguishability. FUZZ-IEEE 2017: 1-6 - [c17]Laura Franzoi
Linguistic classification: T-norms, fuzzy distances and fuzzy distinguishabilities. KES 2017: 1168-1177 - 2016
- [c16]Andrea Sgarro, Laura Franzoi
(Ir)relevant T-norm Joint Distributions in the Arithmetic of Fuzzy Quantities. IPMU (2) 2016: 3-11 - [c15]Laura Franzoi
Fuzzy Signals Fed to Gaussian Channels. SMPS 2016: 221-228 - 2015
- [j23]Luca Bortolussi
Coding Theory: A General Framework and Two Inverse Problems. Fundam. Informaticae 141(4): 297-310 (2015) - 2014
- [j22]Rossano Girometti
Differentiating Small (≤1 cm) Focal Liver Lesions as Metastases or Cysts by means of Computed Tomography: A Case-Study to Illustrate a Fuzzy Logic-Based Method to Assess the Impact of Diagnostic Confidence on Radiological Diagnosis. Comput. Math. Methods Medicine 2014: 587976:1-587976:9 (2014) - 2012
- [j21]Luca Bortolussi
Spearman Permutation Distances and Shannon's Distinguishability. Fundam. Informaticae 118(3): 245-252 (2012) - [c14]Andrea Sgarro, Laura Franzoi
Fuzzy Arithmetics for Fuzzy n-Poles: When Is Interactivity Irrelevant? IPMU (3) 2012: 1-8 - 2011
- [j20]Giuseppe Longo, Andrea Sgarro:
Unruly codes with unruly distances raise (combinatorial) problems. Electron. Notes Discret. Math. 38: 575-578 (2011) - [p2]Luca Bortolussi
How many possible languages are there? Biology, Computation and Linguistics 2011: 168-179 - 2010
- [c13]Luca Bortolussi, Andrea Sgarro:
Possibilistic Coding: Error Detection vs. Error Correction. SMPS 2010: 41-48
2000 – 2009
- 2007
- [j19]Francesco Fabris
Splitting the BLOSUM Score into Numbers of Biological Significance. EURASIP J. Bioinform. Syst. Biol. 2007 (2007) - 2006
- [j18]Liviu Petrisor Dinu, Andrea Sgarro:
A Low-complexity Distance for DNA Strings. Fundam. Informaticae 73(3): 361-372 (2006) - [c12]Luca Bortolussi
Possibilistic Channels for DNA Word Design. SMPS 2006: 327-335 - 2005
- [j17]Andrea Sgarro:
Utilities and distortions: an objective approach to possibilities coding. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 13(2): 139-161 (2005) - 2004
- [j16]Andrea Sgarro:
An axiomatic derivation of the coding-theoretic possibilistic entropy. Fuzzy Sets Syst. 143(3): 335-353 (2004) - 2002
- [j15]Andrea Sgarro:
Possibilistic information theory: a coding theoretic approach. Fuzzy Sets Syst. 132(1): 11-32 (2002) - [j14]Andrea Sgarro, Liviu Petrisor Dinu:
Possibilistic Entropies and the Compression of Possibilistic Data. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(6): 635-654 (2002) - 2001
- [c11]Andrea Sgarro:
The Capacity of a Possibilistic Channel. ECSQARU 2001: 398-409 - 2000
- [j13]Paola Castellan, Andrea Sgarro:
Open-Frame Dempster Conditioning for Incomplete Interval Probabilities. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 8(3): 285-294 (2000) - [p1]Massimo Borelli, Andrea Sgarro:
A Possibilistic Distance for Sequences of Equal and Unequal Length. Finite Versus Infinite 2000: 27-38
1990 – 1999
- 1999
- [j12]Francesco Fabris
On the composition of Tunstall messages. IEEE Trans. Inf. Theory 45(5): 1608-1612 (1999) - [c10]Paola Castellan, Andrea Sgarro:
Open-frame Dempster Conditioning for Incomplete Interval Probabilities. ISIPTA 1999: 68-75 - 1998
- [j11]Andrea Sgarro:
An Open-Frame Theory of Incomplete Interval Probabilities. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 6(6): 551-562 (1998) - 1997
- [j10]Andrea Sgarro:
Bodies of Evidence Versus Simple Interval Probabilities. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 5(2): 199-210 (1997) - 1996
- [j9]Francesco Fabris
Tunstall adaptive coding and miscoding. IEEE Trans. Inf. Theory 42(6): 2167-2180 (1996) - 1993
- [j8]Andrea Sgarro:
Information-Theoretic Bounds for Authentication Frauds. J. Comput. Secur. 2: 53-64 (1993) - 1992
- [c9]Andrea Sgarro:
Information-Theoretic Bounds for Authentication Frauds. EUROCRYPT 1992: 467-471 - 1991
- [j7]Rolf Johannesson, Andrea Sgarro:
Strengthening Simmons' bound on impersonation. IEEE Trans. Inf. Theory 37(4): 1182-1185 (1991) - 1990
- [c8]Andrea Sgarro:
A Shannon-theoretic coding theorem in authentication theory. EUROCODE 1990: 282-291 - [c7]Anna Fioretto, Andrea Sgarro:
Joint fractional entropy. EUROCODE 1990: 292-297 - [c6]Andrea Sgarro:
Lower Bounds for Authentication Codes With Splitting. EUROCRYPT 1990: 283-293 - [c5]Giuseppe Longo, Andrea Sgarro:
A Pragmatic Way Out of the Maze of Uncertainty Measures. IPMU 1990: 370-376
1980 – 1989
- 1989
- [c4]Andrea Sgarro:
Informational Divergence Bounds for Authentication Codes. EUROCRYPT 1989: 93-101 - 1988
- [c3]Andrea Sgarro:
A Measure of Semiequivocation. EUROCRYPT 1988: 375-387 - [c2]Andrea Sgarro:
Information Measures from Rate-Distortion Theories. IPMU 1988: 112-118 - 1984
- [c1]Andrea Sgarro:
Equivolcations for Homophonic Ciphers. EUROCRYPT 1984: 51-61 - 1983
- [j6]Andrea Sgarro:
Error probabilities for simple substitution ciphers. IEEE Trans. Inf. Theory 29(2): 190-197 (1983) - 1981
- [j5]Lee D. Davisson, Giuseppe Longo, Andrea Sgarro:
The error exponent for the noiseless encoding of finite ergodic Markov sources. IEEE Trans. Inf. Theory 27(4): 431-437 (1981) - 1980
- [j4]János Körner, Andrea Sgarro:
Universally attainable error exponents for broadcast channels with degraded message sets. IEEE Trans. Inf. Theory 26(6): 670-679 (1980)
1970 – 1979
- 1979
- [j3]Andrea Sgarro:
Noiseless Block-Coding of Useful Information. J. Inf. Process. Cybern. 15(5/6): 309-314 (1979) - [j2]Giuseppe Longo, Andrea Sgarro:
The source coding theorem revisited: A combinatorial approach. IEEE Trans. Inf. Theory 25(5): 544-548 (1979) - 1977
- [j1]Andrea Sgarro:
Source coding with side information at several decoders. IEEE Trans. Inf. Theory 23(2): 179-182 (1977)
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-10-07 22:13 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: