The following pages link to Ferdinando Cicalese (Q235728):
Displayed 50 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Perfect strategies for the Ulam-Rényi game with multi-interval questions (Q489747) (← links)
- Fault-tolerant search algorithms. Reliable computation with unreliable information (Q625104) (← links)
- Competitive evaluation of threshold functions in the priced information model (Q646704) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Classifying through a fuzzy algebraic structure (Q678959) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- On the redundancy of \(D\)-ary Fano codes (Q831818) (← links)
- Overlaps help: Improved bounds for group testing with interval queries (Q868385) (← links)
- Searching with lies under error cost constraints (Q947085) (← links)
- Binary search with delayed and missing answers (Q1007537) (← links)
- Faster deterministic communication in radio networks (Q1022346) (← links)
- Perfect two-fault tolerant search with minimum adaptiveness (Q1585493) (← links)
- An improved heuristic for the ``Ulam-Rényi game'' (Q1607032) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Correction to: ``Trading off worst and expected cost in decision tree problems'' (Q1755752) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- On searching strategies, parallel questions, and delayed answers (Q1765232) (← links)
- On the approximability and exact algorithms for vector domination and related problems in graphs (Q1946216) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- On the complexity of directed intersection representation of DAGs (Q2019504) (← links)
- The tandem duplication distance problem is hard over bounded alphabets (Q2115851) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice (Q2290640) (← links)
- Approximating decision trees with value dependent testing costs (Q2345858) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Hardness and approximation of multiple sequence alignment with column score (Q2682925) (← links)
- (Q2704221) (← links)
- (Q2722011) (← links)
- (Q2766824) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488) (← links)
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS (Q2909200) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Efficient Reconstruction of RC-Equivalent Strings (Q3000522) (← links)
- On Greedy Algorithms for Decision Trees (Q3060774) (← links)
- Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
- Searching with lies under error transition cost constraints (Q3439239) (← links)
- Q-ary Ulam-Rényi game with constrained lies (Q3439260) (← links)
- Trading off Worst and Expected Cost in Decision Tree Problems (Q3459863) (← links)