Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with algorithms
Search options not deleted
user 143224
Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.
2
votes
0
answers
140
views
Adding elements in a list *in expectation*
Suppose $𝐿_1,…,𝐿_𝑘$ are lists with $n$ elements each. We use a fully independent hash function ℎ to compute a value for each element of each list. (We suppose the hash function returns a value unif …
- 43
1
vote
0
answers
146
views
Bounding the probability of success of adding elements into a list
Suppose $𝐿_1,…,𝐿_𝑘$ are lists with $n$ elements each. We use a fully independent hash function ℎ to compute a value for each element of each list. (We suppose the hash function returns a value unif …
- 43