Pages that link to "Communications of the ACM"
From HandWiki
The following pages link to Communications of the ACM:
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Wikipedia (← links)
- Monorepo (← links)
- Electronic Document System (← links)
- Markup language (← links)
- Hyperlink (← links)
- Hypertext Editing System (← links)
- Capability Maturity Model (← links)
- Bernoulli sampling (← links)
- Left-child right-sibling binary tree (← links)
- Point location (← links)
- Cartesian tree (← links)
- Binary heap (← links)
- Research Unix (← links)
- Range searching (← links)
- Levenshtein distance (← links)
- Timeline of binary prefixes (← links)
- Disjoint-set data structure (← links)
- Binary search algorithm (← links)
- Linear hashing (← links)
- Indeterminacy in concurrent computation (← links)
- Anisotropic filtering (← links)
- Intersection number (graph theory) (← links)
- Linear probing (← links)
- Algorithmic composition (← links)
- Davis–Putnam algorithm (← links)
- DPLL algorithm (← links)
- MinHash (← links)
- Heapsort (← links)
- Partial sorting (← links)
- Functional programming (← links)
- X + Y sorting (← links)
- External sorting (← links)
- Structured programming (← links)
- Linked data structure (← links)
- Information hiding (← links)
- Quine (computing) (← links)
- Lattice-based access control (← links)
- Uncontrolled format string (← links)
- Bloom filter (← links)
- Clique problem (← links)
- Floyd–Warshall algorithm (← links)
- Strahler number (← links)
- Dhrystone (← links)
- Dijkstra's algorithm (← links)
- Quicksort (← links)
- Hypertext (← links)
- Logic programming (← links)
- Principle of least privilege (← links)
- Direct function (← links)
- Structured program theorem (← links)