Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Appel, Martin J. B.
and
Russo, Ralph P.
1997.
The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d.
Advances in Applied Probability,
Vol. 29,
Issue. 3,
p.
582.
Appel, Martin J. B.
and
Russo, Ralph P.
1997.
The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d.
Advances in Applied Probability,
Vol. 29,
Issue. 3,
p.
582.
Díaz, Josep
Petit, Jordi
and
Serna, Maria
1998.
Randomization and Approximation Techniques in Computer Science.
Vol. 1518,
Issue. ,
p.
294.
Penrose, Mathew D.
1999.
Onk-connectivity for a geometric random graph.
Random Structures and Algorithms,
Vol. 15,
Issue. 2,
p.
145.
Penrose, Mathew D.
2000.
Central limit theorems for k-nearest neighbour distances.
Stochastic Processes and their Applications,
Vol. 85,
Issue. 2,
p.
295.
Faragó, András
2002.
Scalable analysis and design of ad hoc networks via random graph theory.
p.
43.
Penrose, Mathew D.
2002.
Focusing of the scan statistic and geometric clique number.
Advances in Applied Probability,
Vol. 34,
Issue. 4,
p.
739.
Appel, Martin J. B.
Najim, Christopher A.
and
Russo, Ralph P.
2002.
Limit laws for the diameter of a random point set.
Advances in Applied Probability,
Vol. 34,
Issue. 1,
p.
1.
Penrose, Mathew D.
2002.
Focusing of the scan statistic and geometric clique number.
Advances in Applied Probability,
Vol. 34,
Issue. 4,
p.
739.
Appel, Martin J. B.
Najim, Christopher A.
and
Russo, Ralph P.
2002.
Limit laws for the diameter of a random point set.
Advances in Applied Probability,
Vol. 34,
Issue. 1,
p.
1.
Appel, Martin J.B.
and
Russo, Ralph P.
2002.
The connectivity of a graph on uniform points on [0,1]d.
Statistics & Probability Letters,
Vol. 60,
Issue. 4,
p.
351.
Cannings, C.
and
Penman, D.B.
2003.
Stochastic Processes: Modelling and Simulation.
Vol. 21,
Issue. ,
p.
51.
McDiarmid, Colin
2003.
Random channel assignment in the plane.
Random Structures & Algorithms,
Vol. 22,
Issue. 2,
p.
187.
Diaz, J.
Petit, J.
and
Serna, M.
2003.
A random graph model for optical networks of sensors.
IEEE Transactions on Mobile Computing,
Vol. 2,
Issue. 3,
p.
186.
Eren, T.
Goldenberg, O.K.
Whiteley, W.
Yang, Y.R.
Morse, A.S.
Anderson, B.D.O.
and
Belhumeur, P.N.
2004.
Rigidity, computation, and randomization in network localization.
Vol. 4,
Issue. ,
p.
2673.
Xingde Jia
2004.
Wireless networks and random geometric graphs.
p.
575.
Fekete, S. P.
Kröller, A.
Pfisterer, D.
Fischer, S.
and
Buschmann, C.
2004.
Algorithmic Aspects of Wireless Sensor Networks.
Vol. 3121,
Issue. ,
p.
123.
Ister, V.
Kannan, S.
and
Daniilidis, K.
2004.
Sampling based sensor-network deployment.
Vol. 2,
Issue. ,
p.
1780.
Faragó, András
2005.
On the typical case complexity of graph optimization.
Discrete Applied Mathematics,
Vol. 153,
Issue. 1-3,
p.
73.
Desai, M.
and
Manjunath, D.
2005.
On Range Matrices and Wireless Networks in d Dimensions.
p.
190.