Part of the Computer Sciences Commons
An algorithm and estimates for the Erdős–Selfridge function, Brianna Sorenson, Jonathan Sorenson, Jonathan Webster Scholarship and Professional Work - LAS
Link
Two Algorithms to Find Primes in Patterns, Jonathan Sorenson, Jonathan Webster Scholarship and Professional Work - LAS
Strong pseudoprimes to twelve bases, Jonathan Sorenson, Jonathan Webster Scholarship and Professional Work - LAS
Theory and Implementation of Online Multiselection Algorithms, Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Satti, Jonathan Sorenson Scholarship and Professional Work - LAS
Approximately Counting Semismooth Integers, Eric Bach, Jonathan Sorenson Scholarship and Professional Work - LAS
Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumera- tion and Wheel Datastructures, Jonathan Sorenson Scholarship and Professional Work - LAS
Online Sorting via Searching and Selection, Ankur Gupta, Anna Kispert, Jonathan Sorenson Scholarship and Professional Work - LAS
An honors course on Alan M. Turing, Jonathan Sorenson Scholarship and Professional Work - LAS
A fast algorithm for approximately counting smooth numbers, Jonathan Sorenson Scholarship and Professional Work - LAS
Experiences with Writing Assignments in Upper-Division Computer Science Courses, Jonathan Sorenson Scholarship and Professional Work - LAS
Trading time for space in prime number sieves, Jonathan Sorenson Scholarship and Professional Work - LAS
Efficient algorithms for computing the Jacobi symbol, Shawna Meyer Eikenberry, Jonathan Sorenson Scholarship and Professional Work - LAS
Approximating the number of integers with small prime factors, Simon Hunter, Jonathan Sorenson Scholarship and Professional Work - LAS
A space-efficient fast prime number sieve, Brian Dunten, Julie Jones, Jonathan Sorenson Scholarship and Professional Work - LAS
Counting the Integers Factorable via Cyclotomic Methods, Carl Pomerance, Jonathan Sorenson Scholarship and Professional Work - LAS
Analysis of Lehmer’s Euclidean GCD algorithm, Jonathan Sorenson Scholarship and Professional Work - LAS
Two Fast Parallel Prime Number Sieves, Jonathan Sorenson, Ian Parberry Scholarship and Professional Work - LAS
Analysis of the left-shift binary GCD algorithm, Jeffrey Shallit, Jonathan Sorenson Scholarship and Professional Work - LAS
Two Fast GCD Algorithms, Jonathan Sorenson Scholarship and Professional Work - LAS
Sieve Algorithms for Perfect Power Testing, Eric Bach, Jonathan Sorenson Scholarship and Professional Work - LAS
A Binary Algorithm for the Jacobi Symbol, Jeffrey Shallit, Jonathan Sorenson Scholarship and Professional Work - LAS
Algorithms in Number Theory, Jonathan Sorenson Scholarship and Professional Work - LAS
An Introduction to Prime Number Sieves, Jonathan Sorenson Scholarship and Professional Work - LAS
Advanced Search
Search Help
