Cycle detection

Known as: Floyd cycle-finding algorithm, Cycle, The Tortoise and the Hare (disambiguation) 
In computer science, cycle detection or cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values. For… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
A novel life-cycle monitoring and voltage-managing device for dc-link electrolytic capacitors in pulsewidth modulation converters… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Over the last years, there has been an increasing research interest in the application of accelerometry data for many kinds of… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Despite decades of successful implementation at the K–12 level, cooperative learning (CL) has been slow to catch on at the… (More)
  • table 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We propose a new approach to appearance based loop detection from metric 3D maps, exploiting the NDT surface representation… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This dissertation is concerned with three-dimensional (3D) sensing and 3D scan representation. Three-dimensional records are… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
  • figure 3.5
Is this relevant?
2004
2004
We present an algorithm for detecting periodicity in sequences produced by repeated application of a given func algorithm uses… (More)
  • figure 1
Is this relevant?
2003
2003
The fair cycle detection problem is at the heart of both LTL and fair CTL model checking. This paper presents a new distributed… (More)
Is this relevant?
2001
2001
This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we… (More)
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 6
  • table 1
Is this relevant?
1983
1983
This paper presents algorithms for maintaining a directed acyclic graph in a dynamically changing environment. In such an… (More)
Is this relevant?