default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Dalai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j26]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
An efficient algorithm for group testing with runlength constraints. Discret. Appl. Math. 360: 181-187 (2025)- 2024
- [c33]Stefano Della Fiore, Marco Dalai:
Upper Bounds on the Rate of Linear Q-Ary K-Hash Codes. ISIT 2024: 2610-2615 - [i24]Stefano Della Fiore, Marco Dalai
:
Upper bounds on the rate of linear q-ary k-hash codes. CoRR abs/2401.16288 (2024) - [i23]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
An Efficient Algorithm for Group Testing with Runlength Constraints. CoRR abs/2409.03491 (2024) - 2023
- [j25]Simone Costa, Marco Dalai, Stefano Della Fiore:
Variations on the Erdős distinct-sums problem. Discret. Appl. Math. 325: 172-185 (2023) - [j24]Antonino M. Sommariva, Marco Dalai:
Refined asymptotic analysis of the two-capacitor circuit. Int. J. Circuit Theory Appl. 51(12): 5997-6016 (2023) - [c32]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. ITW 2023: 544-549 - [i22]Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. CoRR abs/2303.07211 (2023) - 2022
- [j23]Stefano Della Fiore, Marco Dalai:
A note on 2‾-separable codes and B2 codes. Discret. Math. 345(3): 112751 (2022) - [j22]Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai:
Mismatched Decoding Reliability Function at Zero Rate. IEEE Trans. Inf. Theory 68(3): 1482-1495 (2022) - [j21]Marco Bondaschi, Marco Dalai:
A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding. IEEE Trans. Inf. Theory 68(5): 2829-2838 (2022) - [j20]Stefano Della Fiore, Simone Costa, Marco Dalai:
Improved Bounds for (b, k)-Hashing. IEEE Trans. Inf. Theory 68(8): 4983-4997 (2022) - [c31]Stefano Della Fiore, Marco Dalai, Ugo Vaccaro:
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. ITW 2022: 576-581 - [i21]Stefano Della Fiore, Marco Dalai, Ugo Vaccaro:
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. CoRR abs/2208.14066 (2022) - 2021
- [j19]Simone Costa, Marco Dalai:
New bounds for perfect k-hashing. Discret. Appl. Math. 289: 374-382 (2021) - [j18]Simone Costa, Marco Dalai:
A gap in the slice rank of k-tensors. J. Comb. Theory A 177: 105335 (2021) - [j17]Giorgio Arici, Marco C. Campi, Algo Carè, Marco Dalai, Federico A. Ramponi:
A Theory of the Risk for Empirical CVaR with Application to Portfolio Selection. J. Syst. Sci. Complex. 34(5): 1879-1894 (2021) - [c30]Stefano Della Fiore, Simone Costa, Marco Dalai:
New upper bounds for (b, k)-hashing. ISIT 2021: 256-261 - [c29]Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai:
Zero-rate Reliability Function for Mismatched Decoding. ISIT 2021: 1142-1146 - [i20]Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai:
Zero-rate reliability function for mismatched decoding. CoRR abs/2101.10238 (2021) - [i19]Stefano Della Fiore, Simone Costa, Marco Dalai:
New upper bounds for (b, k)-hashing. CoRR abs/2101.10916 (2021) - 2020
- [j16]Simone Costa, Marco Dalai, Anita Pasotti:
A tour problem on a toroidal board. Australas. J Comb. 76: 183-207 (2020) - [j15]Roberto Modonesi, Marco Dalai, Pierangelo Migliorati, Riccardo Leonardi:
A Note on Probabilistic and Geometric Shaping for the AWGN Channel. IEEE Commun. Lett. 24(10): 2119-2122 (2020) - [j14]Fabrizio Guerrini, Marco Dalai, Riccardo Leonardi:
Minimal Information Exchange for Secure Image Hash-Based Geometric Transformations Estimation. IEEE Trans. Inf. Forensics Secur. 15: 3482-3496 (2020) - [j13]Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan:
An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel. IEEE Trans. Inf. Theory 66(2): 749-756 (2020) - [c28]Marco Bondaschi, Marco Dalai:
Revisiting Zero-Rate Bounds on the Reliability Function of Discrete Memoryless Channels. ISIT 2020: 2143-2148 - [i18]Simone Costa, Marco Dalai:
New bounds for perfect k-hashing. CoRR abs/2002.11025 (2020) - [i17]Stefano Della Fiore, Simone Costa, Marco Dalai:
Further strengthening of upper bounds for perfect k-Hashing. CoRR abs/2012.00620 (2020)
2010 – 2019
- 2019
- [i16]Marco Bondaschi, Marco Dalai:
Revisiting zero-rate bounds on the reliability function of discrete memoryless channels. CoRR abs/1912.04411 (2019) - 2018
- [j12]Marco Dalai, Yury Polyanskiy:
Bounds on the Reliability Function of Typewriter Channels. IEEE Trans. Inf. Theory 64(9): 6208-6222 (2018) - 2017
- [j11]Marco Dalai:
Some Remarks on Classical and Classical-Quantum Sphere Packing Bounds: Rényi vs. Kullback-Leibler. Entropy 19(7): 355 (2017) - [j10]Marco Dalai:
Bounding Gallager's Expurgated Bound. IEEE Commun. Lett. 21(12): 2574-2577 (2017) - [j9]Marco Dalai:
A note on random coding bounds for classical-quantum channels. Probl. Inf. Transm. 53(3): 222-228 (2017) - [j8]Marco Dalai, Andreas J. Winter:
Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels. IEEE Trans. Inf. Theory 63(9): 5603-5617 (2017) - [c27]Alessio Degani, Marco Dalai, Riccardo Leonardi, Pierangelo Migliorati:
Audio Chord estimation based on meter modeling and two-stage decoding. ISPA 2017: 65-69 - [c26]Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan:
An improved bound on the zero-error list-decoding capacity of the 4/3 channel. ISIT 2017: 1658-1662 - [i15]Marco Dalai, Yury Polyanskiy:
Bounds on the reliability of typewriter channels. CoRR abs/1702.07703 (2017) - 2016
- [c25]Daniel F. Cullina, Marco Dalai, Yury Polyanskiy:
Rate-distance tradeoff for codes above graph capacity. ISIT 2016: 1331-1335 - [c24]Marco Dalai, Yury Polyanskiy:
Bounds on the reliability of a typewriter channel. ISIT 2016: 1715-1719 - [c23]Rahul Devassy, Giuseppe Durisi, Benjamin Lindqvist, Wei Yang, Marco Dalai:
Nonasymptotic coding-rate bounds for binary erasure channels with feedback. ITW 2016: 86-90 - [i14]Marco Dalai, Yury Polyanskiy:
Bounds on the Reliability of a Typewriter Channel. CoRR abs/1607.05064 (2016) - [i13]Daniel Cullina, Marco Dalai, Yury Polyanskiy:
Rate-distance tradeoff for codes above graph capacity. CoRR abs/1607.06384 (2016) - [i12]Rahul Devassy, Giuseppe Durisi, Benjamin Lindqvist, Wei Yang, Marco Dalai:
Nonasymptotic coding-rate bounds for binary erasure channels with feedback. CoRR abs/1607.06837 (2016) - 2015
- [j7]Alessio Degani, Marco Dalai, Riccardo Leonardi, Pierangelo Migliorati:
Comparison of tuning frequency estimation methods. Multim. Tools Appl. 74(15): 5917-5934 (2015) - [j6]Marco Dalai:
Elias Bound for General Distances and Stable Sets in Edge-Weighted Graphs. IEEE Trans. Inf. Theory 61(5): 2335-2350 (2015) - [c22]Alessio Degani, Marco Dalai, Riccardo Leonardi, Pierangelo Migliorati:
Harmonic Change Detection for musical chords segmentation. ICME 2015: 1-6 - [i11]Marco Dalai, Yury Polyanskiy:
Bounds for codes on pentagon and other cycles. CoRR abs/1508.03020 (2015) - [i10]Marco Dalai, Andreas J. Winter:
Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels. CoRR abs/1509.00715 (2015) - 2014
- [c21]Marco Dalai, Andreas J. Winter:
Constant compositions in the sphere packing bound for classical-quantum channels. ISIT 2014: 151-155 - [c20]Marco Dalai:
An Elias bound on the Bhattacharyya distance of codes for channels with a zero-error capacity. ISIT 2014: 1276-1280 - [c19]Alfonso Martinez, Jonathan Scarlett, Marco Dalai, Albert Guillen i Fabregas:
A complex-integration approach to the saddlepoint approximation for random-coding bounds. ISWCS 2014: 618-621 - [i9]Marco Dalai:
An Elias Bound on the Bhattacharyya Distance of Codes for Channels with a Zero-Error Capacity. CoRR abs/1401.2398 (2014) - [i8]Marco Dalai:
Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels. CoRR abs/1401.6039 (2014) - [i7]Marco Dalai:
Elias Bound for General Distances and Stable Sets in Edge-Weighted Graphs. CoRR abs/1406.1308 (2014) - 2013
- [j5]Marco Dalai:
How Would Riemann Evaluate ζ(2n)? Am. Math. Mon. 120(2): 169-171 (2013) - [j4]Marco Dalai:
Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels. IEEE Trans. Inf. Theory 59(12): 8027-8056 (2013) - [c18]Alessio Degani, Marco Dalai, Riccardo Leonardi, Pierangelo Migliorati:
Real-time performance comparison of tuning frequency estimation algorithms. ISPA 2013: 393-398 - [c17]Marco Dalai:
Lovász's theta function, Rényi's divergence and the sphere-packing bound. ISIT 2013: 231-235 - [c16]Marco Dalai:
An "Umbrella" bound of the Lovász-Gallager type. ISIT 2013: 3025-3029 - [c15]Alessio Degani, Marco Dalai, Riccardo Leonardi, Pierangelo Migliorati:
A heuristic for distance fusion in cover song identification. WIAMIS 2013: 1-4 - [i6]Marco Dalai:
Lovász's Theta Function, Rényi's Divergence and the Sphere-Packing Bound. CoRR abs/1301.6339 (2013) - [i5]Marco Dalai:
An "Umbrella" Bound of the Lovász-Gallager Type. CoRR abs/1301.6340 (2013) - 2012
- [c14]Livio Lima, Marco Dalai, Pierangelo Migliorati, Riccardo Leonardi:
Overlay optimization for Peer-to-Peer scalable video streaming. ICIP 2012: 2245-2248 - [c13]Livio Lima, Marco Dalai, Pierangelo Migliorati, Riccardo Leonardi:
Optimal overlay generation for P2P video streaming applications. ISCCSP 2012: 1-5 - [c12]Marco Dalai:
Sphere packing bound for quantum channels. ISIT 2012: 160-164 - [i4]Marco Dalai:
Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels. CoRR abs/1201.5411 (2012) - 2011
- [c11]Marco Dalai:
A new bound on the capacity of the binary deletion channel with high deletion probabilities. ISIT 2011: 499-502 - 2010
- [c10]Marco Dalai, Serena Malavasi, Riccardo Leonardi:
Consistent image decoding from multiple lossy versions. AVSTP2P@MM 2010: 59-64 - [c9]Claudia Tonoli, Marco Dalai, Riccardo Leonardi:
Coherent video reconstruction with motion estimation at the decoder. WIAMIS 2010: 1-4 - [i3]Marco Dalai:
A new bound for the capacity of the deletion channel with high deletion probabilities. CoRR abs/1004.0400 (2010)
2000 – 2009
- 2009
- [p1]Marco Dalai, Riccardo Leonardi:
Video Compression for Camera Networks: A Distributed Approach. Multi-Camera Networks 2009: 267-294 - 2008
- [j3]Marco Dalai, Riccardo Leonardi:
On Unique Decodability. IEEE Trans. Inf. Theory 54(11): 5068-5072 (2008) - [c8]Marco Dalai, Riccardo Leonardi:
Minimal information exchange for image registration. EUSIPCO 2008: 1-5 - [i2]Marco Dalai, Riccardo Leonardi:
On Unique Decodability. CoRR abs/0809.1043 (2008) - 2007
- [j2]Marco Dalai, Erik Weyer, Marco C. Campi:
Parameter identification for nonlinear systems: Guaranteed confidence regions through LSCR. Autom. 43(8): 1418-1425 (2007) - [c7]Marco Dalai, Riccardo Leonardi, Pier Luigi Dragotti:
Distributed Coding of Shifts using the DFT Phase. ICASSP (1) 2007: 517-520 - 2006
- [j1]Marco Dalai, Riccardo Leonardi:
Approximations of One-Dimensional Digital Signals Under the linfty Norm. IEEE Trans. Signal Process. 54(8): 3111-3124 (2006) - [c6]Marco Dalai, Riccardo Leonardi, Fernando Pereira:
Improving Turbo Codec Integration in Pixel-Domain Distributed Video Coding. ICASSP (2) 2006: 537-540 - 2005
- [c5]Marco Dalai, Erik Weyer, Marco C. Campi:
Parametric Identification of Nonlinear Systems: Guaranteed Confidence Regions. CDC/ECC 2005: 6418-6423 - [c4]Marco Dalai, Riccardo Leonardi:
Non prefix-free codes for constrained sequences. ISIT 2005: 1534-1538 - [c3]Marco Dalai, Riccardo Leonardi, Pierangelo Migliorati:
Efficient Digital Pre-filtering for Least-Squares Linear Approximation. VLBV 2005: 161-169 - [i1]Marco Dalai, Riccardo Leonardi:
Non prefix-free codes for constrained sequences. CoRR abs/cs/0506036 (2005) - 2004
- [c2]Marco Dalai, Riccardo Leonardi:
Efficient (piecewise) linear minmax approximation of digital signals. ICASSP (2) 2004: 585-588 - [c1]Marco Dalai, Riccardo Leonardi:
l∞ norm based second generation image coding. ICIP 2004: 3193-3196
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-12 22:54 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:
