We reopen the issue of finding an implicit data struc-ture for the dictionary problem. In particu... more We reopen the issue of finding an implicit data struc-ture for the dictionary problem. In particular, we examine the problem of maintaining n data values in the first n lo-cations of an array in such a way that we can efficiently perform the operations insert, delete and search. No in-formation other than n and the data is to be retained; andthe only operations which we may perform on the data values (other than reads and writes) are comparisons. Ourstructure supports these operations in
… Conference on Advances in Infrastructure for …, 2002
... Scienze Economiche, University of Pisa. Gualerzi@ec.unipi.it 2 Elena Lodi is with Dipartiment... more ... Scienze Economiche, University of Pisa. Gualerzi@ec.unipi.it 2 Elena Lodi is with Dipartimento di Matematica, University of Siena. Lodi@unisi.it 3 Linda Pagli is with Dipartimento di Informatica, University of Pisa. Pagli@di.unipi.it ...
Pr o c.-th. ANaCC ACM IEEE Internati o nal …, 2002
... Trees via Dense Trees Fabrizio Luccio and Linda Pagli Dipartimento di Informatica, Universit ... more ... Trees via Dense Trees Fabrizio Luccio and Linda Pagli Dipartimento di Informatica, Universit a di Pisa, Italia. ADDRESS: Corso Italia 40, 56125 Pisa, Italy. ... Fabrizio Luccio and Linda Pagli Dipartimento di Informatica, Universit a di Pisa, Italia. Abstract ...
Consulting dating on-line sites, or adopting greedy algorithms, exhaustive search, approximation,... more Consulting dating on-line sites, or adopting greedy algorithms, exhaustive search, approximation, and random search are some of the strategies that can be used to find a soulmate. We discuss techniques and show true life examples, leaving the choice of selecting the most satisfactory method to the reader interested in such an activity.
We introduce spatial graphs through a natural extension of the concept of planarity in three dime... more We introduce spatial graphs through a natural extension of the concept of planarity in three dimensions. For a graph G = (V; E), a face is a simple cycle of edges, and a complete set of faces is such that each edge belonging to a cycle in E is on at least one face in the set. G is spatial if admits a three-dimensional representation R with a complete set of faces consisting of simple surfaces, such that no two faces intersect except along the common edge. In particular G is called k-spatial if R includes k cells (spatial regions); and is called plane-face spatial if all the faces in R are plane. We prove that all graphs are 1-spatial, but not all of them are (k > 1)-spatial or plane-face spatial. In particular, K n is n 2 3n 2 -spatial and plane-face spatial. We derive some basic properties of spatial graphs as natural three-dimensional extensions of the properties of planar graphs. Key words. Planarity, Three-dimensional representation, k-spatial graph, Polyhedra, Euler...
In systems using shortest-path routing tables, a single link failure is enough to interrupt the m... more In systems using shortest-path routing tables, a single link failure is enough to interrupt the message transmission by disconnecting one or more shortestpath spanning trees. The on-line recomputation of an alternative path or of the entire new shortest path trees, rebuilding the routing tables accordingly, is rather
We reopen the issue of finding an implicit data struc-ture for the dictionary problem. In particu... more We reopen the issue of finding an implicit data struc-ture for the dictionary problem. In particular, we examine the problem of maintaining n data values in the first n lo-cations of an array in such a way that we can efficiently perform the operations insert, delete and search. No in-formation other than n and the data is to be retained; andthe only operations which we may perform on the data values (other than reads and writes) are comparisons. Ourstructure supports these operations in
… Conference on Advances in Infrastructure for …, 2002
... Scienze Economiche, University of Pisa. Gualerzi@ec.unipi.it 2 Elena Lodi is with Dipartiment... more ... Scienze Economiche, University of Pisa. Gualerzi@ec.unipi.it 2 Elena Lodi is with Dipartimento di Matematica, University of Siena. Lodi@unisi.it 3 Linda Pagli is with Dipartimento di Informatica, University of Pisa. Pagli@di.unipi.it ...
Pr o c.-th. ANaCC ACM IEEE Internati o nal …, 2002
... Trees via Dense Trees Fabrizio Luccio and Linda Pagli Dipartimento di Informatica, Universit ... more ... Trees via Dense Trees Fabrizio Luccio and Linda Pagli Dipartimento di Informatica, Universit a di Pisa, Italia. ADDRESS: Corso Italia 40, 56125 Pisa, Italy. ... Fabrizio Luccio and Linda Pagli Dipartimento di Informatica, Universit a di Pisa, Italia. Abstract ...
Consulting dating on-line sites, or adopting greedy algorithms, exhaustive search, approximation,... more Consulting dating on-line sites, or adopting greedy algorithms, exhaustive search, approximation, and random search are some of the strategies that can be used to find a soulmate. We discuss techniques and show true life examples, leaving the choice of selecting the most satisfactory method to the reader interested in such an activity.
We introduce spatial graphs through a natural extension of the concept of planarity in three dime... more We introduce spatial graphs through a natural extension of the concept of planarity in three dimensions. For a graph G = (V; E), a face is a simple cycle of edges, and a complete set of faces is such that each edge belonging to a cycle in E is on at least one face in the set. G is spatial if admits a three-dimensional representation R with a complete set of faces consisting of simple surfaces, such that no two faces intersect except along the common edge. In particular G is called k-spatial if R includes k cells (spatial regions); and is called plane-face spatial if all the faces in R are plane. We prove that all graphs are 1-spatial, but not all of them are (k > 1)-spatial or plane-face spatial. In particular, K n is n 2 3n 2 -spatial and plane-face spatial. We derive some basic properties of spatial graphs as natural three-dimensional extensions of the properties of planar graphs. Key words. Planarity, Three-dimensional representation, k-spatial graph, Polyhedra, Euler...
In systems using shortest-path routing tables, a single link failure is enough to interrupt the m... more In systems using shortest-path routing tables, a single link failure is enough to interrupt the message transmission by disconnecting one or more shortestpath spanning trees. The on-line recomputation of an alternative path or of the entire new shortest path trees, rebuilding the routing tables accordingly, is rather
Uploads
Papers by Linda Pagli