Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleFinding cycles and trees in sublinear time.AuthorsCzumaj, Artur; Goldreich, Oded; Ron, Dana; Seshadhri, C.; Shapira, Asaf; Sohler, ChristianAbstractABSTRACT We present sublinear-time (randomized) algorithms for finding simple cycles of length at leastSubjectsPATHS &; cycles in graph theory; BOUNDED arithmetics; FUNCTIONS of bounded variation; COMPUTATIONAL complexity; COMPUTER algorithms; PROBABILITY theoryPublicationRandom Structures & Algorithms, 2014, Vol 45, Issue 2, p139ISSN1042-9832Publication typeArticleDOI10.1002/rsa.20462