Fault-tolerant search algorithms : reliable computation with unreliable information

von Cicalese, Ferdinando
Veröffentlicht 2013

On the Intractability Landscape of Digraph Intersection Representations

von Caucchiolo, Andrea
Veröffentlicht in IWOCA (33. : 2022 : Trier) Combinatorial algorithms (2022)

On the Redundancy of D-Ary Fano Codes

von Cicalese, Ferdinando
Veröffentlicht in SOFSEM (47. : 2021 : Online) SOFSEM 2021: theory and practice of computer science (2021)

On the Complexity of Directed Intersection Representation of DAGs

von Caucchiolo, Andrea
Veröffentlicht in COCOON (26. : 2020 : Online) Computing and combinatorics (2020)

Competitive evaluation of threshold functions in the priced information model

von Cicalese, Ferdinando
Veröffentlicht in Annals of operations research (2011)

The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets

von Cicalese, Ferdinando
Veröffentlicht in IWOCA (32. : 2021 : Online) Combinatorial Algorithms (2021)

Using Random Forest Distances for Outlier Detection

von Mensi, Antonella
Veröffentlicht in ICIAP (21. : 2022 : Lecce) Image analysis and processing – ICIAP 2022 ; Part 3 (2022)

Distance-Based Random Forest Clustering with Missing Data

von Raniero, Matteo
Veröffentlicht in ICIAP (21. : 2022 : Lecce) Image analysis and processing – ICIAP 2022 ; Part 3 (2022)

Decision Trees with Short Explainable Rules

von Souza, Victor Feitosa
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 17 of 50 (2023)

Combinatorial pattern matching : 26th annual symposium, CPM 2015, Ischia Island, Italy, June 29-July 1, 2015 ; proceedings

Veröffentlicht 2015

Information theory, combinatorics, and search theory : in memory of Rudolf Ahlswede

Veröffentlicht 2013

1st International Workshop on Combinatorics of Searching, Sorting, and Coding (COSSAC '01) : [held during September 7 - 9, 2001, in Ischia, Italy]

Veröffentlicht 2004