We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...