Link register

Known as: LR, LR register 
A link register is a special-purpose register which holds the address to return to when a function call completes. This is more efficient than the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2016
01219942016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In the matching problem, each node maintains a pointer to one of its neighbor or to null, and a maximal matching is computed when… (More)
  • figure 1
Is this relevant?
2017
2017
In the matching problem, each node maintains a pointer to one of its neighbor or to null, and a maximal matching is computed when… (More)
  • figure 1
Is this relevant?
2016
2016
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is O(n) moves… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
In recent years, on-chip trace generation has been recognized as a solution to the debugging of increasingly complex software. An… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
2014
2014
  • R. Vijayadharshini
  • 2014
Abstract – The Idea at the back of ad hoc network is multi-hop broadcasting in which packets are sent from the source node to… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
2014
2014
Software debugging is now widely reported to constitute the majority of software development time and cost, largely due to the… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
2010
2010
This paper presents a deterministic self-stabilizing algorithm that approximates a minimum vertex cover in anonymous networks… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
As wireless systems are prevalently deployed, wireless coexistence problems are arising as an inevitable issue. In particular… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into… (More)
Is this relevant?
1994
1994
The ring-orientation problem requires all processors on an anonymous ring to reach agreement on a direction along the ring. A… (More)
Is this relevant?