<--- Back to Details
First PageDocument Content
Primality tests / Lucas–Lehmer primality test / Binary search algorithm / Conjectures / Computational complexity theory / Disjunct matrix / Combinatorics / Mathematics / Group testing
Date: 2010-04-16 15:49:51
Primality tests
Lucas–Lehmer primality test
Binary search algorithm
Conjectures
Computational complexity theory
Disjunct matrix
Combinatorics
Mathematics
Group testing

Add to Reading List

Source URL: www.cse.buffalo.edu

Download Document from Source Website

File Size: 92,19 KB

Share Document on Facebook

Similar Documents

Searching BWT compressed text with the Boyer-Moore algorithm and binary search Tim Bell1 Matt Powell1

DocID: 1uCWS - View Document

Mathematics / Geometry / Computer science / Search algorithms / Discrete geometry / Computational geometry / Mathematical optimization / Closest pair of points problem / Nearest neighbor search / Nearest neighbor graph / K-nearest neighbors algorithm / Euclidean minimum spanning tree

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

DocID: 1qXBI - View Document

Combinatorial optimization / Routing algorithms / Search algorithms / Binary trees / Mathematics / Computer programming / Applied mathematics / Probability / With high probability / A* search algorithm / Rope

Rumor Spreading with Bounded In-Degree∗ Sebastian Daum, Fabian Kuhn, and Yannic Maus Deptartment of Computer Science, University of FreiburgFreiburg, Germany , {kuhn, yannic.maus}@cs.uni-

DocID: 1qTXs - View Document

Computing / String computer science) / Computer programming / Arrays / LCP array / Suffix array / String searching algorithm / Binary search algorithm / Approximate string matching / FM-index / Trie / Array data type

Genome Informatics 12: 175–Indexing Huge Genome Sequences for Solving Various Problems

DocID: 1pYuy - View Document

Search algorithms / Graph theory / Data structures / Information science / Information retrieval / Disjoint-set data structure / Binary trees / Minimum spanning tree / Routing algorithms / Link/cut tree / HeldKarp algorithm

Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

DocID: 1pSri - View Document