In this paper we consider the problem of routing packets in dynamically changing networks, concentratingon two different modes: anycasting and multicasting. In anycasting, a packet has a set of destinations butonly has to reach any one of them, whereas in multicasting, a packet has a set of destinations and has toreach all of them. Both communication modes have a tremendous number o...

We study online variants of weighted bipartite matching on graphs and hypergraphs. In our model for online matching, the vertices on the right-hand side of a bipartite graph are given in advance and the vertices on the left-hand side arrive online in random order. Whenever a vertex arrives, its adjacent edges with the corresponding weights are revealed and the online algorithm has to decide whi...

For a canonical formulation of quantum gravity, the superspace of all possible 3-geometries on a Cauchy hypersurface of a 3 + 1-dimensional Lorentzian manifold plays a key role. While in the analogous 2 + 1-dimensional case the superspace of all Riemannian 2-geometries is well known, the structure of the superspace of all Riemannian 3-geometries has not yet been resolved at present. In this pap...

This paper provides a comprehensive discussion on patch schedules. This discussion occurs over two parts. The first analyses existing implementations of patch schedules with a focus on Microsoft’s monthly patch schedule. The arguments for patch schedules, namely increased patch quality and better planning within organisations are analysed and the impact of the type of disclosure investigated. I...

In the present paper we consider fibrations f : S → B of an algebraic surface over a curve B, with general fibre a curve of genus g. Our main results are: 1) A structure theorem for such fibrations in the case where g = 2 2) A structure theorem for such fibrations in the case where g = 3, the general fibre is nonhyperelliptic, and each fibre is 2connected 3) A theorem giving a complete descript...

In this work, we introduce a novel technique for secure computation over large inputs. Specifically, we provide a new oblivious transfer (OT) protocol with a laconic receiver. Laconic OT allows a receiver to commit to a large input D (of length M) via a short message. Subsequently, a single short message by a sender allows the receiver to learn mD[L], where the messages m0,m1 and the location L...

To my family and friends who make me who I am ACKNOWLEDGEMENTS This work would not have been possible without the support from a number of people who encouraged me during my stay in the United States. Most importantly, I would like to thank Prof. Laurence 'Larry' Jacobs for being an outstanding advisor, teacher, and friend, supporting me in an unprecedented way during my stay at Georgia Tech. F...

The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorithm. Recently, the analysis of this algorithm was refined and it was shown to have an expected optimization time (w. r. t. the number of fitness evaluations) of Θ(n3.25(log n)0.25). In contrast to this simple algorithm...

In analyses of algorithms, a substantial amount of effort has often to be spent on the discussion of special cases. For example, when the analysis considers the cases X < Y and X > Y separately, one might have to be especially careful about what happens when X = Y . On the other hand, experience tells us that when a yet unregarded special case of this kind is discovered, one nearly always finds...