List of publications

Papers

  • R. Ahlswede, F. Cicalese, C. Deppe and U. Vaccaro
    `` Two Batch Search with weighted lies''.
    IEEE Transactions on Information Theory, vol 55, No. 4, pp. 1433-1439, 2009.

  • R. Ahlswede, F. Cicalese, C. Deppe,
    "Searching with lies under error cost constraints'',
    Discrete Applied Mathematics, vol. 156, n. 9, pp. 1444-1460, 2008.

  • F. Cicalese, P. Damaschke, L. Tansini, S. Werth,
    ``Overlaps Help: Improved Bounds for Group Testing with Interval Queries'',
    Discrete Applied Mathematics, vol. 155, pp. 288-299, 2007.

  • F. Cicalese and C. Deppe,
    `Perfect Minimally Adaptive q-ary Search with Unreliable Tests'',
    Journal of Statistical Planning and Inference, vol. 137, pp. 162-175, 2007.

  • A. De Bonis and U. Vaccaro
    "Optimal Algorithms for Two Group Testing Problems and New Bounds on Generalized Superimposed Codes''.
    IEEE Transactions on Information Theory, vol. 52, No. 10, pp. 4673-4680, 2006.

  • F. Cicalese, P. Damaschke and U. Vaccaro,
    `Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection'',
    International Journal of Bioinformatics Research and Applications, vol. 1, No. 4, pp. 363-388, 2005.

  • A. De Bonis, L. Gasieniec, and U. Vaccaro,
    ``Optimal Two-Stage Algorithms for Group Testing Problems",
    SIAM Journal on Computing, vol. 34, No. 5, pp. 1253-1270, 2005.

  • F. Cicalese and E. Laber,
    ``A New Strategy for Querying Priced Information'',
    to appear in:Proceedings of the 37th ACM Symposium on Theory of Computing (STOC 2005) , 2005.

  • F. Cicalese, P. Damaschke, L. Tansini, and S. Werth,
    ``Overlaps Help: Improved Bounds for Group Testing with Interval Queries'',
    in:Proceedings of the 11th International Computing and Combinatorics Conference (COCOON 2005), Lecture Notes in Computer Science, Springer-Verlag, 2005, to appear.

  • M. Aigner, G. De Marco, and M. Montangero,
    ``The Plurality Problem with Three Colors and More,''
    Theoretical Computer Science, to appear.

  • G. De Marco and A. Pelc,
    ``Randomized Algorithms for Determining the Majority on Graphs'',
    Combinatorics, Probability & Computing, to appear.

  • F. Cicalese, P. Damaschke, and U. Vaccaro,
    ``Optimal Group Testing Algorithms with Interval Queries and Their Application to Splice Site Detection'',
    to appear in:Proceedings of the International Workshop on Bioinformatics Research and Applications (IWBRA 2005) , Lectures Notes in Computer Science 2005.

  • F. Cicalese and C. Deppe,
    ``Q-ary Ulam-Rényi game with constrained lies'',
    to appear in: General Theory of Information Transfer and Combinatorics R. Ahlswede (Ed.), Shannon Foundation Publisher, 2005.

  • F. Cicalese, C. Deppe, and D. Mundici,
    ``Q-ary Ulam-Renyi Game with Weighted Constrained Lies'',
    in:Proceedings of the 10th International Computing and Combinatorics Conference (COCOON 2004), Lecture Notes in Computer Science, vol. 3106, pp. 82-91, Springer-Verlag, 2004.

  • M. Aigner, G. De Marco, and M. Montangero,
    `` The Plurality Problem with Three Colors'',
    in: Proc. of 21th Intern. Symp. on Theoretical Aspects of Computer Science (STACS 2004), Montpellier, France, March 2004.

  • G. De Marco and A. Pelc,
    ``Randomized Algorithms for Determining the Majority on Graphs,''
    in: Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), Bratislava, Slovak Republic, LNCS 2747, 368-377.

  • F. Cicalese, D. Mundici, U. Vaccaro (Eds.),
    COSSAC: Combinatorics of Sorting, Searching, and Coding,
    Special Issue of Discrete Applied Mathematics, vol. 137, Issue 1, February 27, 2004.

  • F. Cicalese, L. Gargano, and U. Vaccaro,
    "On Searching Strategies, Parallel Questions, and Delayed Answers'',
    Discrete Applied Mathematics, vol. 144, Issue 3, pp. 247-262, 2004.

  • A. De Bonis, U. Vaccaro,
    ``New Results and Applications of Superimposed Codes (and Related Combinatorial Structures)
    to the Design of Efficient Group Testing Procedures''
    in: Proceedings of 2004 International Symposium in Information Theory (ISIT2004), p. 257.

  • F. Cicalese, C. Deppe,
    ``Quasy-Perfect Minimally Adaptive q-ary Search with Unreliable Tests'',
    in:Proceedings of the 14th International Symposium on Algorithms (ISAAC2003), Lecture Notes in Computer Science, vol. 2906, pp. 527-536, Springer-Verlag, 2003.

  • F. Cicalese, D. Munidici
    ``Learning and the Art of Fault-tolerant Guesswork'',
    in: Adaptivity and Learning - An Interdisciplinary Debate Kühn, R./ Menzel, R./ Menzel, W./ Ratsch, U./ Richter, M.M./ Stamatescu, I.O. (Eds.) Springer--Verlag (2003), pp. 117-143.

  • A. De Bonis and U. Vaccaro,
    ``Constructions of Generalized Superimposed Codes with Applications to Group Testing
    and Conflict Resolution in Multiple Access Channels'',
    Theoretical Computer Science, vol. 306, Issue 1-3, pp. 223-243, 2003.

  • A. De Bonis, L. Gasieniec, and U. Vaccaro
    ``Generalized Framework for Selectors with Applications in Optimal Group Testing'',
    in: ICALP '03 , J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger (Eds.), Lectures Notes in Computer Science, vol. 2719,
    pp. 81-96, Springer-Verlag, 2003.

  • F. Cicalese and U. Vaccaro,
    ``Binary Search with Delayed and Missing Answers'',
    Information Processing Letters, Vol. 85, n. 5, pp. 239-247, 2003.

  • A. De Bonis and U. Vaccaro,
    ``Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing
    and Conflict Resolution in Multiple Access Channels'',
    in: ESA '02 , R. Möring and R. Raman (Eds.), Lectures Notes in Computer Science, vol. 2461,
    pp. 335-347, Springer-Verlag, 2002.

  • F. Cicalese, D. Mundici, and U. Vaccaro
    ``Least Adaptive Optimal Search with Unreliable Tests'',
    Theoretical Computer Science, Vol. 270, Issue 1-2, pp. 877-893, 2002.

  • A. De Bonis, L. Gargano, and U. Vaccaro
    ``Efficient Algorithms for Chemical Threshold Testing Problems'',
    Theoretical Computer Science, vol. 259, no. 1-2, pp. 493--511, 2001.

  • F. Cicalese and U. Vaccaro
    ``Coping with Delays and Time-Outs in Binary Search Procedures'',
    in: Eleventh Annual International Symposium on Algorithms and Computation (ISAAC2000) D. T. Lee and Shang-Hua Teng (Eds.), Lectures Notes in Computer Science, vol. 1969, pp. 96--107, Springer--Verlag, (2000).

  • F. Cicalese, D. Mundici, and U. Vaccaro
    ``Rota-Metropolis cubic logic and Ulam-Renyi games'',
    in: Algebraic Combinatorics and Computer Science · A Tribute to Giancarlo Rota S,enato, D.; Crapo, H., (Eds.), Springer--Verlag, (2000)

  • F. Cicalese and D. Mundici,
    ``Optimal coding with one asymmetric error: below the Sphere Packing bound '',
    in: Proceedings of 6th Annual International Conference on Computing and Combinatorics-- COCOON'2000, Lecture Notes in Computer Science, vol. 1858 , pp. 159--169, Springer--Verlag, 2000.

  • F. Cicalese and D. Mundici
    ``Least adaptive optimal search with two unreliable tests'',
    Advanced in Applied Mathematics, vol. 25, pp. 65--101, 2000.

  • F. Cicalese, D. Mundici, and U. Vaccaro
    ``Perfect, Minimally Adaptive, Error-Correcting Searching Strategies'',
    in: International Symposium in Information Theory (ISIT2000), pp. 377, IEEE Press, 2000.

  • F. Cicalese and U. Vaccaro
    ``An Improved Heuristic for Ulam-Renyi Game'',
    Information Processing Letters, vol. 73, no. 3-4, pp. 119-124, 2000.

  • F. Cicalese and U. Vaccaro
    ``Optimal Strategies Against a Liar'',
    Theoretical Computer Science, vol. 230, no. 1--2, pp. 167--193, 2000.

  • F. Cicalese and D. Mundici
    ``Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness'',
    in: Proceedings of European Symposium on Algorithms (ESA' 99),
    J. Nesetril (Ed.), Lectures Notes in Computer Science, vol. 1643, pp. 257--266, Springer--Verlag, 1999.

  • A. De Bonis, L. Gargano, and U. Vaccaro
    ``Improved Algorithms for Chemical Threshold Testing Problems'',
    in: Proceedings of 4th International Conference on Computing and Combinatorics - COCOON'98, W.-L. Hsu and M.-Y. Kao (Eds.), Lectures Notes in Computer Science, vol. 1449, pp. 127-136, Springer-Verlag, 1998.

  • F. Cicalese
    ``Q-ary Searching with Lies'',
    in Proceedings of the 6th ICTCS, World Scientific, (1998), pp. 228-240.

  • A. De Bonis and U. Vaccaro
    ``Improved Algorithms for Group Testing with Inibithors'',
    Information Processing Letters, vol. 67, pp. 57--64, 1998.

  • A. De Bonis
    ``A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi--Arms Balance'',
    Discrete Applied Mathematics, vol. 86, (1998), pp. 191-200.

  • A. De Bonis, L. Gargano, and U. Vaccaro
    ``Group Testing with Unreliable Tests'',
    Information Sciences, vol. 96, pp. 1--14, 1997.

  • A. De Bonis, L. Gargano, and U. Vaccaro
    ``Optimal Detection of a Counterfeit Coin with Multi--Arms Balances'',
    Discrete Applied Mathematics, vol. 61, pp. 121--131, 1995.

  • L. Gargano, J. Körner, and U. Vaccaro
    ``Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Model'',
    Discrete Applied Mathematics, vol. 36, pp. 191--197, 1992.

  • L. Gargano, V. Montuori, G. Setaro, and U. Vaccaro
    ``An Improved Algorithm for Quantitative Group Testing'',
    Discrete Applied Mathematics, vol. 36, pp. 299--306, 1992.