Archives/papers-we-love_papers-we-love
1
0
Fork 0
mirror of https://github.com/papers-we-love/papers-we-love.git synced 2026-10-08 11:51:07 +00:00
Code Issues Projects Releases Wiki Activity

Fix broken hosted-paper link and typos in topic READMEs (#894)

Browse Source 
* Fix broken hosted-paper link and typos in topic READMEs

The FRP index links the hosted paper as
[Deprecating the Observer Pattern](deprecating-the observer-pattern.pdf).
The file on disk really is named with a space, but an unescaped space is not
allowed in a CommonMark link destination, so the entry renders as literal text
instead of a link. Percent-encode the space so it resolves to the committed PDF.

Also correct misspellings in paper titles and descriptions:

- Algorithims -> Algorithms (comp_sci_fundamentals_and_history)
- simplifed -> simplified (data_structures)
- sucessful -> successful, numberator -> numerator,
  demoninator -> denominator, authoratitative -> authoritative
  (information_retrieval)
- Expresions -> Expressions (logic_and_programming)
- represention -> representation (mathematics)
- Probablistic -> Probabilistic (robotics, sublinear_algorithms)
- Philppe -> Philippe (streaming_algorithms)

* Rename the Deprecating the Observer Pattern PDF to drop the space

Per review, renaming the file rather than percent-encoding the link.
This commit is contained in:
Toyeshh Medikonda
2026-09-29 04:45:39 -05:00
committed by GitHub
parent ed4bfd95f0
commit 9b92363eac
10 changed files with 11 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
sublinear_algorithms/README.md
View File

@@ -2,7 +2,7 @@
## Hosted Papers :open_file_folder:
* :scroll: **[Probablistic Counting Algorithms for Database Applications](https://github.com/papers-we-love/papers-we-love/blob/main/sublinear_algorithms/1985-Flajolet-Probabilistic-counting.pdf)**
* :scroll: **[Probabilistic Counting Algorithms for Database Applications](https://github.com/papers-we-love/papers-we-love/blob/main/sublinear_algorithms/1985-Flajolet-Probabilistic-counting.pdf)**
This paper introduces a class of probabilistic counting algorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words) and only a few operations per element scanned. The algorithms are based on statistical observations made on bits of hashed values of records. They are by construction totally insensitive to the replicative structure of elements in the file; they can be used in the context of distributed systems without any degradation of performances and prove especially useful in the context of data bases query optimisation