Diameter

Diameter is an authentication, authorization, and accounting protocol for computer networks. It evolved from and replaces the much less capable… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1953-2018
010020019532017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The adaptive regulation of the balance between exploitation and exploration is critical for the optimization of behavioral… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Previous studies of the relationship between the size of nerve fibers and . the velocity of conduction of impulses have resulted… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Peter F. DeCarlo,1,2 Jay G. Slowik,4 Douglas R. Worsnop,5 Paul Davidovits,4 and Jose L. Jimenez2,3 1Program in Atmospheric and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Monodisperse silicon nanowires were synthesized by exploiting well-defined gold nanoclusters as catalysts for one-dimensional… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for several… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In the recent past, there has been considerable progress in devising algorithms for the allpairs shortest paths problem running… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This paper proposes a simple algorithm for the graph design of small-diameter networks. For given nodes n and degree d, this… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?