Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Cicalese, Ferdinand"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Spread of influence in weighted networks under time and budget constraints
Ferdinando Cicalese
,
Gennaro Cordasco
,
Luisa Gargano
,
Martin Milanic̑
,
Joseph Peters
,
Ugo Vaccaro
Theoretical Computer Science
586
, 2015, pp. 40-58
Latency-bounded target set selection in social networks
Ferdinando Cicalese
,
Gennaro Cordasco
,
Luisa Gargano
,
Martin Milanic̑
,
Ugo Vaccaro
Theoretical Computer Science
535
, 2014, pp. 1-15
Improved approximation algorithms for the average-case tree searching problem
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Marco Molinaro
Algorithmica
68
(4), 2014, pp. 1045-1074
Approximating the maximum consecutive subsums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Theoretical Computer Science
525
, 2014, pp. 130-137
Perfect strategies for the Ulam-Rényi game with multi-interval questions
Ferdinando Cicalese
Theory of Computing Systems
54
(4), 2014, pp. 578-594
Algorithms for jumbled pattern matching in strings
Péter Burcsi
,
Ferdinand Cicalese
,
Gabriele Fici
,
Zsuzsanna Liptaḱ
International Journal of Foundations of Computer Science
23
(2), 2012, pp. 357-374
On approximate jumbled pattern matching in strings
Péter Burcsi
,
Ferdinando Cicalese
,
Gabriele Fici
,
Zsuzsanna Lipták
Theory of Computing Systems
50
(1), 2012, pp. 35-51
The binary identification problem for weighted trees
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Caio Valentim
Theoretical Computer Science
459
, 2012, pp. 100-112
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
7354
, 2012, pp. 149-158
On the complexity of searching in trees and partially ordered structures
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Marco Molinaro
Theoretical Computer Science
412
(50), 2011, pp. 6879-6896
Binary identification problems for weighted trees
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Caio Valentim
Lecture Notes in Computer Science
6844
, 2011, pp. 255-266
On the competitive ratio of evaluating priced functions
Ferdinando Cicalese
,
Eduardo Sany Laber
Journal of the ACM
58
(3), 2011, pp. 9: 1-40
On greedy algorithms for decision trees
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Marco Molinaro
Lecture Notes in Computer Science
6507
, 2010, pp. 206-217
Superselectors: Efficient constructions and applications
Ferdinando Cicalese
,
Ugo Vaccaro
Lecture Notes in Computer Science
6346
, 2010, pp. 207-218
On the complexity of searching in trees: Average-case minimization
Tobias Jacobs
,
Ferdinando Cicalese
,
Eduardo Laber
,
Marco Molinaro
Lecture Notes in Computer Science
6198
, 2010, pp. 527-539
Faster deterministic communication in radio networks
Ferdinando Cicalese
,
Fredrik Manne
,
Qin Xin
Algorithmica
54
(2), 2009, pp. 226-242
Function evaluation via linear programming in the priced information model
Ferdinando Cicalese
,
Eduardo Sany Laber
Lecture Notes in Computer Science
5125
, 2008, pp. 173-185
Computing with priced information: When the value makes the price
Ferdinando Cicalese
,
Martin Milanic̑
Lecture Notes in Computer Science
5369
, 2008, pp. 378-389
2-stage fault tolerant interval group testing
Ferdinando Cicalese
,
José Amgarten Quitzau
Lecture Notes in Computer Science
4835
, 2007, pp. 858-868
Faster centralized communication in radio networks
Ferdinando Cicalese
,
Fredrik Manne
,
Qin Xin
Lecture Notes in Computer Science
4288
, 2006, pp. 339-348
Overlaps help: Improved bounds for group testing with interval queries
Ferdinando Cicalese
,
Peter Damaschke
,
Libertad Tansini
,
Sören Werth
Lecture Notes in Computer Science
3595
, 2005, pp. 935-944
An optimal algorithm for querying priced information: Monotone Boolean functions and game trees
Ferdinando Cicalese
,
Eduardo Sany Laber
Lecture Notes in Computer Science
3669
, 2005, pp. 664-676
A new strategy for querying priced information
Ferdinando Cicalese
,
Eduardo Sany Laber
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 674-683
Q
-ary Ulam-Rényi game with weighted constrained lies
Ferdinando Cicalese
,
Christian Deppe
,
Daniele Mundici
Lecture Notes in Computer Science
3106
, 2004, pp. 82-91
Quasi-perfect minimally adaptive
q
-ary search with unreliable tests
Ferdinando Cicalese
,
Christian Deppe
Lecture Notes in Computer Science
2906
, 2003, pp. 527-536
Seiten 1
2
>