The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ferdinando Cicalese: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ferdinando Cicalese, Christian Deppe, Daniele Mundici
    Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:82-91 [Conf]
  2. Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
    Overlaps Help: Improved Bounds for Group Testing with Interval Queries. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:935-944 [Conf]
  3. Ferdinando Cicalese, Daniele Mundici
    Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:159-169 [Conf]
  4. Ferdinando Cicalese, Eduardo Sany Laber
    An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:664-676 [Conf]
  5. Ferdinando Cicalese, Daniele Mundici
    Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:257-266 [Conf]
  6. Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
    Optimal Approximation of Uniform Distributions with a Biased Coin. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:23-38 [Conf]
  7. Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro
    Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:1029-1037 [Conf]
  8. Ferdinando Cicalese, Christian Deppe
    Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:527-536 [Conf]
  9. Ferdinando Cicalese, Fredrik Manne, Qin Xin
    Faster Centralized Communication in Radio Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:339-348 [Conf]
  10. Ferdinando Cicalese, Ugo Vaccaro
    coping with Delays and Time-Outs in Binary Search Procedures. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:96-107 [Conf]
  11. Ferdinando Cicalese, Antonio di Nola, Vincenzo Loia
    A Fuzzy Evolutionary Framework for Adaptive Agents. [Citation Graph (0, 0)][DBLP]
    SAC, 1999, pp:233-237 [Conf]
  12. Ferdinando Cicalese, Eduardo Sany Laber
    On the competitive ratio of evaluating priced functions. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:944-953 [Conf]
  13. Ferdinando Cicalese, Eduardo Sany Laber
    A new strategy for querying priced information. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:674-683 [Conf]
  14. Ferdinando Cicalese, Ugo Vaccaro, Daniele Mundici
    Least Adaptive Optimal Search with Unreliable Tests. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:549-562 [Conf]
  15. Ferdinando Cicalese, Christian Deppe
    Q-Ary Ulam-Renyi Game with Constrained Lies. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:678-694 [Conf]
  16. Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
    On searching strategies, parallel questions, and delayed answers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:247-262 [Journal]
  17. Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:1, pp:1-2 [Journal]
  18. Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
    Overlaps help: Improved bounds for group testing with interval queries. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:288-299 [Journal]
  19. Ferdinando Cicalese, Ugo Vaccaro
    An improved heuristic for "Ulam-Rényi game". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:3-4, pp:119-124 [Journal]
  20. Ferdinando Cicalese, Ugo Vaccaro
    Binary search with delayed and missing answers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:239-247 [Journal]
  21. Ferdinando Cicalese, Vincenzo Loia
    A fuzzy evolutionary approach to the classification problem. [Citation Graph (0, 0)][DBLP]
    Journal of Intelligent and Fuzzy Systems, 1998, v:6, n:1, pp:117-129 [Journal]
  22. Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro
    Least adaptive optimal search with unreliable tests. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:877-893 [Journal]
  23. Ferdinando Cicalese, Ugo Vaccaro
    Optimal Strategies Against a Liar. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:230, n:1-2, pp:167-193 [Journal]
  24. Ferdinando Cicalese, Ugo Vaccaro
    Supermodularity and subadditivity properties of the entropy on the majorization lattice. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:933-938 [Journal]
  25. Ferdinando Cicalese, Ugo Vaccaro
    Bounding the average length of optimal source codes via majorization theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:4, pp:633-637 [Journal]
  26. Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
    A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3772-3777 [Journal]

  27. Superselectors: Efficient Constructions and Applications. [Citation Graph (, )][DBLP]


  28. Function Evaluation Via Linear Programming in the Priced Information Model. [Citation Graph (, )][DBLP]


  29. On the Complexity of Searching in Trees: Average-Case Minimization. [Citation Graph (, )][DBLP]


  30. 2-Stage Fault Tolerant Interval Group Testing. [Citation Graph (, )][DBLP]


  31. Computing with Priced Information: When the Value Makes the Price. [Citation Graph (, )][DBLP]


  32. Searching for Jumbled Patterns in Strings. [Citation Graph (, )][DBLP]


  33. On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. [Citation Graph (, )][DBLP]


  34. A Better Bouncer's Algorithm. [Citation Graph (, )][DBLP]


  35. Faster Deterministic Communication in Radio Networks. [Citation Graph (, )][DBLP]


  36. On the Complexity of Searching in Trees: Average-case Minimization [Citation Graph (, )][DBLP]


  37. Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case [Citation Graph (, )][DBLP]


  38. Searching with lies under error cost constraints. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002