# Peter Davies

## Contact Details

NamePeter Davies |
||

Affiliation |
||

Location |
||

## Pubs By Year |
||

## Pub CategoriesComputer Science - Distributed; Parallel; and Cluster Computing (4) Physics - Materials Science (2) Physics - Biological Physics (1) Physics - Soft Condensed Matter (1) |

## Publications Authored By Peter Davies

We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D, randomized broadcasting requires Omega(D log n/D + log^2 n) rounds in expectation, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and Wajc (PODC'2016) showed that this bound can be slightly improved for the model with spontaneous transmissions, providing an O(D log n loglog n / log D + log^O(1) n)-time broadcasting algorithm. Read More

In this paper we improve the deterministic complexity of two fundamental communication primitives in the classical model of ad-hoc radio networks with unknown topology: broadcasting and wake-up. We consider an unknown radio network, in which all nodes have no prior knowledge about network topology, and know only the size of the network $n$, the maximum in-degree of any node $\Delta$, and the eccentricity of the network $D$. For such networks, we first give an algorithm for wake-up, in both directed and undirected networks, based on the existence of small universal synchronizers. Read More

The beep model is a very weak communications model in which devices in a network can communicate only via beeps and silence. As a result of its weak assumptions, it has broad applicability to many different implementations of communications networks. This comes at the cost of a restrictive environment for algorithm design. Read More

We present two optimal randomized leader election algorithms for multi-hop radio networks, which run in expected time asymptotically equal to the time required to broadcast one message to the entire network. We first observe that, under certain assumptions, a simulation approach of Bar-Yehuda, Golreich and Itai (1991) can be used to obtain an algorithm that for directed and undirected networks elects a leader in $O(D \log\frac{n}{D} + \log^2 n)$ expected time, where $n$ is the number of the nodes and $D$ is the eccentricity or the diameter of the network. We then extend this approach and present a second algorithm, which operates on undirected multi-hop radio networks with collision detection and elects a leader in $O(D + \log n)$ expected run-time. Read More

Antifreeze proteins (AFPs) evolved in cold-adapted organisms and serve to protect them against freezing in cold conditions by arresting ice crystal growth. Recently, we have shown quantitatively that adsorption of AFPs not only prevents ice from growing but also from melting. This melting inhibition by AFPs, which results in superheated ice (Celik et al, PNAS 2010), is not a well-known phenomenon. Read More

Theoretical {\em ab initio} and experimental methods were used to investigate the $x$Bi(Zn,Ti)O$_3$-(1-$x$)PbTiO$_3$ (BZT-PT) solid solution. We find that hybridization between Zn 4$p$ and O 2$p$ orbitals allows the formation of short, covalent Zn-O bonds, enabling favorable coupling between A-site and B-site displacements. This leads to large polarization, strong tetragonality and an elevated ferroelectric to paraelectric phase transition temperature. Read More