default search action
Ugo Vaccaro
Person information
- affiliation: University of Salerno, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j78]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
- [j77]Roberto Bruno
, Ugo Vaccaro
Entropic Bounds on the Average Length of Codes with a Space. Entropy 26(4): 283 (2024) - [j76]Adele A. Rescigno
Improved Algorithms and Bounds for List Union-Free Families. IEEE Trans. Inf. Theory 70(4): 2456-2463 (2024) - [j75]Roberto Bruno
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees. IEEE Trans. Inf. Theory 70(10): 6974-6988 (2024) - [e5]Adele Anna Rescigno
Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings. Lecture Notes in Computer Science 14764, Springer 2024, ISBN 978-3-031-63020-0 [contents] - [i24]Roberto Bruno, Ugo Vaccaro:
Entropic Bounds on the Average Length of Codes with a Space. CoRR abs/2405.06379 (2024) - [i23]Roberto Bruno, Ugo Vaccaro:
A Note on Equivalent Conditions for Majorization. CoRR abs/2405.07787 (2024) - [i22]Roberto Bruno, Roberto De Prisco, Alfredo De Santis, Ugo Vaccaro:
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees. CoRR abs/2407.16443 (2024) - [i21]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
- [j74]Adele A. Rescigno
Bounds and algorithms for generalized superimposed codes. Inf. Process. Lett. 182: 106365 (2023) - [c56]Marco Dalai
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. ITW 2023: 544-549 - [i20]Marco Dalai
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. CoRR abs/2303.07211 (2023) - 2022
- [c55]Stefano Della Fiore, Marco Dalai
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. ITW 2022: 576-581 - [i19]Stefano Della Fiore, Marco Dalai
Achievable Rates and Algorithms for Group Testing with Runlength Constraints. CoRR abs/2208.14066 (2022) - 2020
- [j73]Annalisa De Bonis, Ugo Vaccaro:
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. Theor. Comput. Sci. 806: 219-235 (2020) - [j72]Luisa Gargano
Low-weight superimposed codes and related combinatorial structures: Bounds and applications. Theor. Comput. Sci. 806: 655-672 (2020) - [j71]Gennaro Cordasco
Whom to befriend to influence people. Theor. Comput. Sci. 810: 26-42 (2020) - [j70]Gennaro Cordasco
Fast and frugal targeting with incentives. Theor. Comput. Sci. 812: 62-79 (2020)
2010 – 2019
- 2019
- [j69]Ferdinando Cicalese
Minimum-Entropy Couplings and Their Applications. IEEE Trans. Inf. Theory 65(6): 3436-3451 (2019) - [c54]Ferdinando Cicalese, Luisa Gargano
An Information Theoretic Approach to Probability Mass Function Truncation. ISIT 2019: 702-706 - [i18]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Minimum-Entropy Couplings and their Applications. CoRR abs/1901.07530 (2019) - 2018
- [j68]Gennaro Cordasco
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm. Algorithmica 80(6): 1804-1833 (2018) - [j67]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. Theory Comput. Syst. 62(6): 1470-1489 (2018) - [j66]Gennaro Cordasco
Evangelism in social networks: Algorithms and complexity. Networks 71(4): 346-357 (2018) - [j65]Ferdinando Cicalese
Bounds on the Entropy of a Function of a Random Variable and Their Applications. IEEE Trans. Inf. Theory 64(4): 2220-2230 (2018) - [c53]Luisa Gargano
Low-Weight Superimposed Codes and Their Applications. FAW 2018: 197-211 - [c52]Ferdinando Cicalese, Ugo Vaccaro:
Maximum Entropy Interval Aggregations. ISIT 2018: 1764-1768 - [c51]Paolo D'Arco, Roberto De Prisco
Probabilistic Secret Sharing. MFCS 2018: 64:1-64:16 - [c50]Gennaro Cordasco
Time-Bounded Influence Diffusion with Incentives. SIROCCO 2018: 280-295 - [i17]Ferdinando Cicalese, Ugo Vaccaro:
Maximum Entropy Interval Aggregations. CoRR abs/1805.05375 (2018) - [i16]Gennaro Cordasco, Luisa Gargano, Joseph Peters, Adele Anna Rescigno, Ugo Vaccaro:
Time-Bounded Influence Diffusion with Incentives. CoRR abs/1807.06921 (2018) - 2017
- [j64]Annalisa De Bonis
ε-Almost Selectors and Their Applications to Multiple-Access Communication. IEEE Trans. Inf. Theory 63(11): 7304-7319 (2017) - [c49]Luisa Gargano
On k-Strong Conflict-Free Multicoloring. COCOA (2) 2017: 276-290 - [c48]Ferdinando Cicalese, Luisa Gargano
H(X) vs. H(f(X)). ISIT 2017: 51-55 - [c47]Ferdinando Cicalese, Luisa Gargano
How to find a joint probability distribution of minimum entropy (almost) given the marginals. ISIT 2017: 2173-2177 - [i15]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals. CoRR abs/1701.05243 (2017) - [i14]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
H(X) vs. H(f(X)). CoRR abs/1704.07059 (2017) - [i13]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Bounds on the Entropy of a Function of a Random Variable and their Applications. CoRR abs/1712.07906 (2017) - 2016
- [c46]Annalisa De Bonis, Ugo Vaccaro:
A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks. ALGOSENSORS 2016: 45-61 - [c45]Ferdinando Cicalese, Luisa Gargano
Approximating probability distributions with short vectors, via information theoretic distance measures. ISIT 2016: 1138-1142 - [c44]Gennaro Cordasco
Evangelism in Social Networks. IWOCA 2016: 96-108 - [c43]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. IWOCA 2016: 437-448 - [c42]Gennaro Cordasco
Brief Announcement: Active Information Spread in Networks. PODC 2016: 435-437 - [i12]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. CoRR abs/1605.02131 (2016) - [i11]Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro:
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm. CoRR abs/1610.03721 (2016) - [i10]Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno, Ugo Vaccaro:
Evangelism in Social Networks: Algorithms and Complexity. CoRR abs/1610.09486 (2016) - [i9]Gennaro Cordasco, Luisa Gargano, Manuel Lafond, Lata Narayanan, Adele A. Rescigno, Ugo Vaccaro, Kangkang Wu:
Whom to befriend to influence people. CoRR abs/1611.08687 (2016) - 2015
- [j63]Luisa Gargano
Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584: 53-66 (2015) - [j62]Ferdinando Cicalese, Gennaro Cordasco
Spread of influence in weighted networks under time and budget constraints. Theor. Comput. Sci. 586: 40-58 (2015) - [c41]Gennaro Cordasco
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks. COCOA 2015: 193-208 - [c40]Annalisa De Bonis, Ugo Vaccaro:
ϵ-Almost Selectors and Their Applications. FCT 2015: 255-268 - [c39]Gennaro Cordasco
Optimizing Spread of Influence in Social Networks via Partial Incentives. SIROCCO 2015: 119-134 - [e4]Ferdinando Cicalese, Ely Porat, Ugo Vaccaro:
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. Lecture Notes in Computer Science 9133, Springer 2015, ISBN 978-3-319-19928-3 [contents] - [i8]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
Spread of Influence in Weighted Networks under Time and Budget Constraints. CoRR abs/1502.05599 (2015) - [i7]Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives. CoRR abs/1512.06372 (2015) - 2014
- [j61]Ferdinando Cicalese, Gennaro Cordasco
Latency-bounded target set selection in social networks. Theor. Comput. Sci. 535: 1-15 (2014) - [c38]Ferdinando Cicalese, Gennaro Cordasco
How to go Viral: Cheaply and Quickly. FUN 2014: 100-112 - [i6]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. CoRR abs/1404.3033 (2014) - 2013
- [j60]Ferdinando Cicalese, Martin Milanic
On the approximability and exact algorithms for vector domination and related problems in graphs. Discret. Appl. Math. 161(6): 750-767 (2013) - [j59]Jean-Claude Bermond, Luisa Gargano
Optimal time data gathering in wireless networks with multidirectional antennas. Theor. Comput. Sci. 509: 122-139 (2013) - [c37]Ferdinando Cicalese, Gennaro Cordasco
Latency-Bounded Target Set Selection in Social Networks. CiE 2013: 65-77 - [c36]Ferdinando Cicalese, Luisa Gargano
Information theoretic measures of distances and their econometric applications. ISIT 2013: 409-413 - [c35]Luisa Gargano
Influence Diffusion in Social Networks under Time Window Constraints. SIROCCO 2013: 141-152 - [i5]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-Bounded Target Set Selection in Social Networks. CoRR abs/1303.6785 (2013) - [i4]Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence Diffusion in Social Networks under Time Window Constraints. CoRR abs/1311.5193 (2013) - 2011
- [c34]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. FCT 2011: 288-297 - [c33]Jean-Claude Bermond, Luisa Gargano
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. SIROCCO 2011: 306-317 - 2010
- [c32]Ferdinando Cicalese, Ugo Vaccaro:
Superselectors: Efficient Constructions and Applications. ESA (1) 2010: 207-218 - [i3]Ferdinando Cicalese, Ugo Vaccaro:
Superselectors: Efficient Constructions and Applications. CoRR abs/1010.1024 (2010) - [i2]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. CoRR abs/1012.1529 (2010)
2000 – 2009
- 2009
- [j58]Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe
Two Batch Search With Lie Cost. IEEE Trans. Inf. Theory 55(4): 1433-1439 (2009) - [e3]Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro:
Search Methodologies, 05.07. - 10.07.2009. Dagstuhl Seminar Proceedings 09281, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i1]Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro:
09281 Abstracts Collection - Search Methodologies. Search Methodologies 2009 - 2007
- [c31]Ferdinando Cicalese, Luisa Gargano
Tunstall Parse Trees Optimum under Various Criteria. ISIT 2007: 81-85 - 2006
- [j57]Gianluca De Marco
Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355(3): 315-326 (2006) - [j56]Ferdinando Cicalese, Luisa Gargano
A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes. IEEE Trans. Inf. Theory 52(8): 3772-3777 (2006) - [j55]Annalisa De Bonis, Ugo Vaccaro:
Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes. IEEE Trans. Inf. Theory 52(10): 4673-4680 (2006) - 2005
- [j54]Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro:
Optimal group testing algorithms with interval queries and their application to splice site detection. Int. J. Bioinform. Res. Appl. 1(4): 363-388 (2005) - [j53]Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro:
Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. Comput. 34(5): 1253-1270 (2005) - [c30]Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro:
Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. International Conference on Computational Science (2) 2005: 1029-1037 - [c29]Gianluca De Marco, Luisa Gargano
Asynchronous Deterministic Rendezvous in Graphs. MFCS 2005: 271-282 - 2004
- [j52]Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro:
Preface. Discret. Appl. Math. 137(1): 1-2 (2004) - [j51]Ferdinando Cicalese, Luisa Gargano
On searching strategies, parallel questions, and delayed answers. Discret. Appl. Math. 144(3): 247-262 (2004) - [j50]Luisa Gargano
Spanning spiders and light-splitting switches. Discret. Math. 285(1-3): 83-95 (2004) - [j49]Ferdinando Cicalese, Ugo Vaccaro:
Bounding the average length of optimal source codes via majorization theory. IEEE Trans. Inf. Theory 50(4): 633-637 (2004) - [c28]Annalisa De Bonis, Ugo Vaccaro:
New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures. ISIT 2004: 257 - 2003
- [j48]Ferdinando Cicalese, Ugo Vaccaro:
Binary search with delayed and missing answers. Inf. Process. Lett. 85(5): 239-247 (2003) - [j47]Annalisa De Bonis, Ugo Vaccaro:
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theor. Comput. Sci. 306(1-3): 223-243 (2003) - [c27]Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro:
Generalized Framework for Selectors with Applications in Optimal Group Testing. ICALP 2003: 81-96 - [c26]Luisa Gargano
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems. IPDPS 2003: 223 - 2002
- [j46]Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro:
Least adaptive optimal search with unreliable tests. Theor. Comput. Sci. 270(1-2): 877-893 (2002) - [j45]Ferdinando Cicalese, Ugo Vaccaro:
Supermodularity and subadditivity properties of the entropy on the majorization lattice. IEEE Trans. Inf. Theory 48(4): 933-938 (2002) - [c25]Annalisa De Bonis, Ugo Vaccaro:
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels. ESA 2002: 335-347 - [c24]Luisa Gargano
Spanning Trees with Bounded Number of Branch Vertices. ICALP 2002: 355-365 - 2001
- [j44]Luisa Gargano
Efficient communication in unknown networks. Networks 38(1): 39-49 (2001) - [j43]Gianluca De Marco
Concurrent multicast in weighted networks. Theor. Comput. Sci. 259(1-2): 359-377 (2001) - [j42]Annalisa De Bonis, Luisa Gargano
Efficient algorithms for chemical threshold testing problems. Theor. Comput. Sci. 259(1-2): 493-511 (2001) - [j41]Alfredo De Santis
Bounds on entropy in a guessing game. IEEE Trans. Inf. Theory 47(1): 468-473 (2001) - 2000
- [j40]Ferdinando Cicalese, Ugo Vaccaro:
An improved heuristic for "Ulam-Rényi game". Inf. Process. Lett. 73(3-4): 119-124 (2000) - [j39]Ferdinando Cicalese, Ugo Vaccaro:
Optimal Strategies Against a Liar. Theor. Comput. Sci. 230(1-2): 167-193 (2000) - [j38]Jean-Claude Bermond, Luisa Gargano
Efficient collective communication in optical networks. Theor. Comput. Sci. 233(1-2): 165-189 (2000) - [c23]Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Optimal Approximation of Uniform Distributions with a Biased Coin. ICALP Satellite Workshops 2000: 23-38 - [c22]Ugo Vaccaro:
Introduction: Approximation and Randomized Algorithms in Communication Networks. ICALP Satellite Workshops 2000: 97-98 - [c21]Ferdinando Cicalese, Ugo Vaccaro:
coping with Delays and Time-Outs in Binary Search Procedures. ISAAC 2000: 96-107 - [c20]Ferdinando Cicalese, Ugo Vaccaro, Daniele Mundici:
Least Adaptive Optimal Search with Unreliable Tests. SWAT 2000: 549-562 - [c19]Luisa Gargano
Efficient Communication in Unknown Networks. WG 2000: 172-183 - [e2]José D. P. Rolim, Andrei Z. Broder, Andrea Corradini, Roberto Gorrieri, Reiko Heckel, Juraj Hromkovic, Ugo Vaccaro, J. B. Wells:
ICALP Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000. Carleton Scientific, Waterloo, Ontario, Canada 2000, ISBN 1-894145-07-0 [contents]
1990 – 1999
- 1999
- [j37]Carlo Blundo, Alfredo De Santis
Randomness Complexity of Private Computation. Comput. Complex. 8(2): 145-168 (1999) - [j36]Luca G. Tallini, Ugo Vaccaro:
Efficient m-ary Balanced Codes. Discret. Appl. Math. 92(1): 17-56 (1999) - [j35]Luisa Gargano
Efficient generation of fair dice with few biased coins. IEEE Trans. Inf. Theory 45(5): 1600-1606 (1999) - 1998
- [j34]Luisa Gargano
Minimum time broadcast in faulty star networks. Discret. Appl. Math. 83(1-3): 97-119 (1998) - [j33]Carlo Blundo, Alfredo De Santis
Perfectly Secure Key Distribution for Dynamic Conferences. Inf. Comput. 146(1): 1-23 (1998) - [j32]Carlo Blundo, Alfredo De Santis
On Secret Sharing Schemes. Inf. Process. Lett. 65(1): 25-32 (1998) - [j31]Gianluca De Marco, Ugo Vaccaro:
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults. Inf. Process. Lett. 66(6): 321-326 (1998) - [j30]Annalisa De Bonis, Ugo Vaccaro:
Improved Algorithms for Group Testing with Inhibitors. Inf. Process. Lett. 67(2): 57-64 (1998) - [j29]Adele A. Rescigno
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks. Parallel Process. Lett. 8(2): 221-230 (1998) - [j28]Jean-Claude Bermond, Luisa Gargano
Fast Gossiping by Short Messages. SIAM J. Comput. 27(4): 917-941 (1998) - [c18]Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro:
Improved Algorithms for Chemical Threshold Testing Problems. COCOON 1998: 127-136 - [c17]Gianluca De Marco
Concurrent Multicast in Weighted Networks. SWAT 1998: 193-204 - 1997
- [j27]Carlo Blundo, Alfredo De Santis
Tight Bounds on the Information Rate of Secret Sharing Schemes. Des. Codes Cryptogr. 11(2): 107-122 (1997) - [j26]Annalisa De Bonis, Luisa Gargano
Group Testing with Unreliable Tests. Inf. Sci. 96(1&2): 1-14 (1997) - [j25]Luisa Gargano
Communication Complexity of Gossiping by Packets. J. Parallel Distributed Comput. 45(1): 73-81 (1997) - [e1]Bruno Carpentieri, Alfredo De Santis, Ugo Vaccaro, James A. Storer:
Compression and Complexity of SEQUENCES 1997, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, Proceedings. IEEE 1997, ISBN 0-8186-8132-2 [contents] - 1996
- [j24]Carlo Blundo
Randomness in Distribution Protocols. Inf. Comput. 131(2): 111-139 (1996) - [j23]Carlo Blundo
On the Information Rate of Secret Sharing Schemes. Theor. Comput. Sci. 154(2): 283-306 (1996) - [j22]Carlo Blundo
Fully Dynamic Secret Sharing Schemes. Theor. Comput. Sci. 165(2): 407-440 (1996) - [c16]Jean-Claude Bermond, Luisa Gargano
Efficient Collective Communication in Optical Networks. ICALP 1996: 574-585 - [c15]Luisa Gargano
Communication Complexity of Gossiping by Packets. SWAT 1996: 234-245 - 1995
- [j21]Annalisa De Bonis, Luisa Gargano
optimal Detection of a Counterfeit Coin with Multi-arms Balances. Discret. Appl. Math. 61(2): 121-131 (1995) - [j20]Luisa Gargano
On the capacity of boolean graph formulæ. Graphs Comb. 11(1): 29-48 (1995) - [j19]Carlo Blundo, Alfredo De Santis
Graph Decompositions and Secret Sharing Schemes. J. Cryptol. 8(1): 39-64 (1995) - [j18]Carlo Blundo
New bounds on the information rate of secret sharing schemes. IEEE Trans. Inf. Theory 41(2): 549-554 (1995) - [c14]Jean-Claude Bermond, Luisa Gargano
Fast Gossiping by Short Messages. ICALP 1995: 135-146 - [c13]Carlo Blundo, Alfredo De Santis
On the Number of Random Bits in Totally Private Computation. ICALP 1995: 171-182 - 1994
- [j17]Luisa Gargano, János Körner, Ugo Vaccaro:
Capacities: From Information Theory to Extremal Set Theory. J. Comb. Theory A 68(2): 296-316 (1994) - [j16]Renato M. Capocelli, Luisa Gargano
A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. Theor. Comput. Sci. 134(1): 63-78 (1994) - [c12]Carlo Blundo, Alfredo De Santis
Multi-Secret Sharing Schemes. CRYPTO 1994: 150-163 - [c11]Carlo Blundo, Alfredo De Santis
Randomness in Distributed Protocols. ICALP 1994: 568-579 - 1993
- [j15]Luisa Gargano
Sperner capacities. Graphs Comb. 9(1): 31-46 (1993) - [j14]Luisa Gargano
Fault Tolerant Routing in the Star and Pancake Interconnection Networks. Inf. Process. Lett. 45(6): 315-320 (1993) - [j13]Renato M. Capocelli, Alfredo De Santis
On the Size of Shares for Secret Sharing Schemes. J. Cryptol. 6(3): 157-167 (1993) - [j12]Luisa Gargano
Fault - tolerant hypercube broadcasting via information dispersal. Networks 23(4): 271-282 (1993) - [c10]Carlo Blundo, Antonella Cresti, Alfredo De Santis
Fully Dynamic Secret Sharing Schemes. CRYPTO 1993: 110-125 - [c9]Marco Carpentieri, Alfredo De Santis
Size of Shares and Probability of Cheating in Threshold Schemes. EUROCRYPT 1993: 118-125 - [c8]Carlo Blundo, Alfredo De Santis
Secret Sharing Schemes with Veto Capabilities. Algebraic Coding 1993: 82-89 - [c7]Carlo Blundo, Alfredo De Santis
Efficient Sharing of Many Secrets. STACS 1993: 692-703 - 1992
- [j11]Luisa Gargano
Search problems for two irregular coins with incomplete feedback: the underweight model. Discret. Appl. Math. 36(2): 191-197 (1992) - [j10]Luisa Gargano
An improved algorithm for quantitative group testing. Discret. Appl. Math. 36(3): 299-306 (1992) - [j9]Luisa Gargano, János Körner, Ugo Vaccaro:
Qualitative Independence and Sperner Problems for Directed Graphs. J. Comb. Theory A 61(2): 173-192 (1992) - [j8]Luisa Gargano, Ugo Vaccaro:
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults. SIAM J. Discret. Math. 5(2): 178-198 (1992) - [j7]Renato M. Capocelli, Alfredo De Santis
On the construction of statistically synchronizable codes. IEEE Trans. Inf. Theory 38(2): 407-414 (1992) - [c6]Carlo Blundo, Alfredo De Santis
On the Information Rate of Secret Sharing Schemes (Extended Abstract). CRYPTO 1992: 148-167 - [c5]Carlo Blundo, Alfredo De Santis
Perfectly-Secure Key Distribution for Dynamic Conferences. CRYPTO 1992: 471-486 - [c4]Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro:
Graph Decompositions and Secret Sharing Schemes. EUROCRYPT 1992: 1-24 - 1991
- [j6]Renato M. Capocelli, Luisa Gargano
Efficient q-ary immutable codes. Discret. Appl. Math. 33(1-3): 25-41 (1991) - [j5]Renato M. Capocelli, Luisa Gargano
Decoders with Initial State Invariance for Multivalued Encodings. Theor. Comput. Sci. 86(2): 365-375 (1991) - [c3]Renato M. Capocelli, Alfredo De Santis
On the Size of Shares for Secret Sharing Schemes. CRYPTO 1991: 101-113 - 1990
- [c2]Gérard D. Cohen, Luisa Gargano
Unidirectional error-detecting codes. EUROCODE 1990: 94-105
1980 – 1989
- 1989
- [j4]Renato M. Capocelli, Ugo Vaccaro:
Structure of decoders for multivalued encodings. Discret. Appl. Math. 23(1): 55-71 (1989) - [j3]Luisa Gargano
On the construction of minimal broadcast networks. Networks 19(6): 673-689 (1989) - [j2]Renato M. Capocelli, Luisa Gargano
An efficient algorithm for testing immutability of variable-length codes. IEEE Trans. Inf. Theory 35(6): 1310-1314 (1989) - [c1]Renato M. Capocelli, Luisa Gargano
Time Bound for Broadcasting in Bounded Degree Graphs. WG 1989: 19-33 - 1988
- [j1]Renato M. Capocelli, Luisa Gargano
On the characterization of statistically synchronizable variable-length codes. IEEE Trans. Inf. Theory 34(4): 817-825 (1988)
Coauthor Index
[j72] [j71] [j70] [j69] [c54] [i18] [j68] [j66] [j65] [c53] [c50] [i16] [c49] [c48] [c47] [i15] [i14] [i13] [c45] [c44] [c42] [i11] [i10] [i9] [j63] [j62] [c41] [c39] [i8] [i7] [j61] [c38] [i6] [j59] [c37] [c36] [c35] [i5] [i4] [c33] [c31] [j57] [j56] [c29] [j51] [j50] [c26] [c24] [j44] [j43] [j42] [j38] [c23] [c19] [j35] [j34] [j28] [c18] [c17] [j26] [j25] [j23] [c16] [c15] [j21] [j20] [c14] [j17] [j16] [j15] [j14] [j13] [j12] [c8] [j11] [j10] [j9] [j8] [j7] [c6] [j6] [j5] [c3] [c2] [j3] [j2] [c1] [j1]
Adele A. Rescigno
aka: Adele Anna Rescigno
aka: Adele Anna Rescigno
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-10 22:17 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: