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 reference-request
Search options answers only
not deleted
user 43
Reference-request is used when the author needs to know about work related to the question.
0
votes
Joining lists with some common elements in average case
I'm not sure I understand the question completely. Do you want an algorithm that, given two sorted sequences each containing no duplicates, outputs a new sorted sequence containing every item in eithe …
- 11.2k
4
votes
Array-like data structure with O(1) worst-case concatenate/join?
I think Purely Functional Worst Case Constant Time Catenable Sorted Lists by Brodal et al. supplies what you want.
- 11.2k
6
votes
Starting point for cache-oblivious algorithms?
I enjoyed the chapter on cache-oblivious data structures in the Handbook of Data Structures and Applications.
- 11.2k
8
votes
Accepted
How high are the higher types that appear in practice?
Okasaki's Functional Pearl, "Even Higher-Order Functions for Parsing or Why Would Anyone Ever Want To Use a Sixth-Order Function?" answers this question with a type of order 6.
- 11.2k
4
votes
Chernoff Bounds for settings with limited dependence
This is the first link on Google for the search "chernoff limited independence":
"Chernoff-Hoeffding Bounds for Applications with Limited Independence" by Schmidt et al.
- 11.2k
608
votes
Accepted
What's new in purely functional data structures since Okasaki?
New purely functional data structures published since 1998:
2001: Ideal Hash Trees, and its 2000 predecessor, Fast And Space Efficient Trie Searches, by Phil Bagwell: Apparently used as a fundamenta …
- 11.2k
9
votes
Accepted
Difference lists in functional programming
Or is the "catch" simply that there's no bound on the running time for "head" and "tail" precisely because those operations may have to plow through an arbitrary pile of deferred computations/subst …
- 11.2k
0
votes
Algorithm for finding heavy hitters in a weighted stream
I think "A High-Performance Algorithm for Identifying Frequent Items in Data Streams" by Anderson, et al. shows an answer, though the weights are integral, not real.
- 11.2k