K. Mehlhorn introduced a class of polynomial time computable operators in order to study poly time reducibilities between functions. This class is deened using a generalization of A. Cobham'sâ€¦ (More)

The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence of edge insertions and deletions, answer queries of the form q(a, b):â€¦ (More)

For a graph-based representation of a social network, the identity of participants can be uniquely determined if an adversary has background structural knowledge about the graph. We focus onâ€¦ (More)

We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full information modelâ€¦ (More)

This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space. The fully dynamic graph connectivity problem is the following: given a graph on aâ€¦ (More)

We consider the problem of computing Byzantine Agreement in a synchronous network with n processors each with a private random string, where each pair of processors is connected by a privateâ€¦ (More)

We present two logical systems for reasoning about cryptographic constructions which are sound with respect to standard cryptographic definitions of security. Soundness of the first system is provedâ€¦ (More)

We introduce a typed programming formalism, type-2 inflationary tiered loop programs or ITLP2, that characterizes the type-2 basic feasible functionals. ITLP2 is based on Bellantoni and Cookâ€™s [BC92]â€¦ (More)