Search the dblp DataBase
Ferdinando Cicalese :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Ferdinando Cicalese , Fredrik Manne , Qin Xin Faster Centralized Communication in Radio Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2006, pp:339-348 [Conf ] 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 ] 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 ] Ferdinando Cicalese , Eduardo Sany Laber On the competitive ratio of evaluating priced functions. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:944-953 [Conf ] Ferdinando Cicalese , Eduardo Sany Laber A new strategy for querying priced information. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:674-683 [Conf ] Ferdinando Cicalese , Ugo Vaccaro , Daniele Mundici Least Adaptive Optimal Search with Unreliable Tests. [Citation Graph (0, 0)][DBLP ] SWAT, 2000, pp:549-562 [Conf ] Ferdinando Cicalese , Christian Deppe Q-Ary Ulam-Renyi Game with Constrained Lies. [Citation Graph (0, 0)][DBLP ] GTIT-C, 2006, pp:678-694 [Conf ] 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 ] Ferdinando Cicalese , Daniele Mundici , Ugo Vaccaro Preface. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:137, n:1, pp:1-2 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Superselectors: Efficient Constructions and Applications. [Citation Graph (, )][DBLP ] Function Evaluation Via Linear Programming in the Priced Information Model. [Citation Graph (, )][DBLP ] On the Complexity of Searching in Trees: Average-Case Minimization. [Citation Graph (, )][DBLP ] 2-Stage Fault Tolerant Interval Group Testing. [Citation Graph (, )][DBLP ] Computing with Priced Information: When the Value Makes the Price. [Citation Graph (, )][DBLP ] Searching for Jumbled Patterns in Strings. [Citation Graph (, )][DBLP ] On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. [Citation Graph (, )][DBLP ] A Better Bouncer's Algorithm. [Citation Graph (, )][DBLP ] Faster Deterministic Communication in Radio Networks. [Citation Graph (, )][DBLP ] On the Complexity of Searching in Trees: Average-case Minimization [Citation Graph (, )][DBLP ] Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case [Citation Graph (, )][DBLP ] Searching with lies under error cost constraints. [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.007secs