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="Silvestri, Francesco"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exploiting non-constant safe memory in resilient algorithms and data structures
Lorenzo De Stefani
,
Francesco Silvestri
Theoretical Computer Science
583
, 2015, pp. 86-97
Communication lower bounds for distributed-memory computations
Michele Scquizzato
,
Francesco Silvestri
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 627-638
Oblivious algorithms for multicores and networks of processors
Rezaul Alam Chowdhury
,
Vijaya Ramachandran
,
Francesco Silvestri
,
Brandon Blakeley
Journal Parallel Distributed Computing
73
(7), 2013, pp. 911-925
Space-efficient parallel algorithms for combinatorial search problems
Andrea Pietracaprina
,
Geppino Pucci
,
Francesco Silvestri
,
Fabio Vandin
Lecture Notes in Computer Science
8087
, 2013, pp. 717-728
Dynamic programming in faulty memory hierarchies (cache-obliviously)
Saverio Caminiti
,
Irene Finocchi
,
Emanuele G. Fusco
,
Francesco Silvestri
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 433-444
On the limits of cache-oblivious rational permutations
Francesco Silvestri
Theoretical Computer Science
402
(2-3), 2008, pp. 221-233