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)- Eigenvalue algorithm (← links)
- Electronic Colloquium on Computational Complexity (← links)
- Exact algorithm (← links)
- The Complexity of Songs (← links)
- Backdoor (computing) (← links)
- Communicating sequential processes (← links)
- Concurrent computing (← links)
- Coroutine (← links)
- Distributed computing (← links)
- Document mosaicing (← links)
- Embodied agent (← links)
- Gbcast (← links)
- Graph coloring (← links)
- Hirschberg–Sinclair algorithm (← links)
- Horner's method (← links)
- Lamport timestamps (← links)
- Minimum bounding box algorithms (← links)
- Paxos (computer science) (← links)
- Point in polygon (← links)
- Protection ring (← links)
- Regular number (← links)
- Scratch (programming language) (← links)
- S-expression (← links)
- Virtual machine (← links)
- Wiener index (← links)
- Connes embedding problem (← links)
- Distributed hash table (← links)
- Xerox Network Systems (← links)
- Arithmetic coding (← links)
- Byte (← links)
- Combined linear congruential generator (← links)
- E-text (← links)
- Even-Rodeh coding (← links)
- Hyperoperation (← links)
- Lehmer random number generator (← links)
- Linear congruential generator (← links)
- Logarithmic number system (← links)
- Paper prototyping (← links)
- Safety-critical system (← links)
- Sieve of Eratosthenes (← links)
- Code coverage (← links)
- 16,807 (← links)
- Domain testing (← links)
- Chen–Ho encoding (← links)
- Gauss's constant (← links)
- Bit (← links)
- Hexadecimal (← links)
- Augmented transition network (← links)
- Trie (← links)
- K-d tree (← links)