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
[1]
Hilfe
Suche: Author="Nardelli, Enrico"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nearly linear time minimum spanning tree maintenance for transient node failures
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Algorithmica
40
(2), 2004, pp. 119-132
Swapping a failing edge of a single source shortest paths tree is good and fast
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Algorithmica
35
(1), 2003, pp. 56-74
Finding the most vital node of a shortest path
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Theoretical Computer Science
296
(1), 2003, pp. 167-177
Fully dynamic distributed search trees can be balanced in
0(\lg^2 N)
time
Fabio Barillari
,
Enrico Nardelli
,
Massimo Pepe
Journal Parallel Distributed Computing
62
(11), 2002, pp. 1617-1628
A faster computation of the most vital edge of a shortest path
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Information Processing Letters
79
(2), 2001, pp. 81-85
Finding the most vital node of a shortest path
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Lecture Notes in Computer Science
2108
, 2001, pp. 278-287
How to survive while visiting a graph
Claudio Arbib
,
Michele Flammini
,
Enrico Nardelli
Discrete Applied Mathematics
99
(1-3), 2000, pp. 279-293
Maintaining a minimum spanning tree under transient node failures
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Lecture Notes in Computer Science
1879
, 2000, pp. 346-355
How to swap a failing edge of a single source shortest paths tree
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Lecture Notes in Computer Science
1627
, 1999, pp. 144-153
Efficient searching for multi-dimensional data made simple
Enrico Nardelli
,
Maurizio Talamo
,
Paola Vocca
Lecture Notes in Computer Science
1643
, 1999, pp. 339-353
Distributed searching of multi-dimensional data: A performance evaluation study
Enrico Nardelli
,
Fabio Barillari
,
Massimo Pepe
Journal Parallel Distributed Computing
49
(1), 1998, pp. 111-134
Finding the detour-critical edge of a shortest path between two nodes
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Information Processing Letters
67
(1), 1998, pp. 51-54
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Lecture Notes in Computer Science
1461
, 1998, pp. 55-66
ATM layouts with bounded hop count and congestion
Michele Flammini
,
Enrico Nardelli
,
Guido Proietti
Lecture Notes in Computer Science
1320
, 1997, pp. 52-65
On building the transitive reduction of a two-dimensional poset
Enrico Nardelli
,
Vincenzo Mastrobuoni
,
Alesiano Santomo
Information Processing Letters
63
(1), 1997, pp. 9-12
Computing a poset from its realizer
Enrico Nardelli
,
Vincenzo Mastrobuoni
,
Alesiano Santomo
Information Processing Letters
64
(3), 1997, pp. 149-154
Experiences in using parallel systems for land information management
Ettore Apollini
,
Franco Arcieri
,
Enrico Nardelli
,
Maurizio Talamo
Proceedings of the 1st International Conference on Massively Parallel Computing Systems (Ischia, Italy, May 2-6, 1994)
, 1994, pp. 223-228
A model for performance evaluation of message passing architectures in spatial data processing
Enrico Nardelli
,
Carmine D'Amico
,
Marco Santacroce
Proceedings of the 1st International Conference on Massively Parallel Computing Systems (Ischia, Italy, May 2-6, 1994)
, 1994, pp. 460-470
Workshop on parallel and distributed spatial data structures (P-SPADS)
Enrico Nardelli
Proceedings of the 1st International Conference on Massively Parallel Computing Systems (Ischia, Italy, May 2-6, 1994)
, 1994, pp. 221-222
A pointer-free data structure for merging heaps and min-max heaps
Giorgio Gambosi
,
Enrico Nardelli
,
Maurizio Talamo
Theoretical Computer Science
84
, 1991, pp. 107-126