Kelly Mears

KnowledgeDomain 02

Computation & Algorithms

Algorithms, data structures, and what they cost.

Notes
33
Links within
74
Links outward
89
Knowledge graph: 84 notes, 163 links.Each dot is a note, sized by how many links it has and colored by topic. Focus or hover a dot to isolate it and its neighbors; activate it to open the note. The graph is a single tab stop: use the arrow keys to move between notes, Home and End for the most and least linked, Enter to open the focused note, and Escape to leave the graph.Ground TruthSilent FailureDeterminismNamingFalsifiabilityGoodhart's LawProvenancePlain LanguageReproducible CaseObservabilityExhaustive ClaimFermi EstimationIdempotencePerformance BudgetRace ConditionCache InvalidationHash FunctionBig-O NotationProcessRegressionVersion ControlFail FastUnit TestFlaky TestHash TableInstrumentationWrite-Ahead LoggingEventual ConsistencyFactory GameNetwork EffectSchema ValidationAssertionCode CoverageRecord and Replay TestingDatabase MigrationIdle GameRelational DatabaseBranch CoverageDefensive DefaultFingerprintBinary SearchContent Delivery NetworkLeast Recently Used CacheACIDMonadPure FunctionChange Data CaptureDatabase ReplicationLoad BalancingSeed DataClosureConsistent HashingFinite State MachineImmutabilityInterpreterMessage QueueRecursionWeb WorkerActor ModelB-TreeCompilerCopy-on-WriteDatabase ShardingEvent LoopGarbage CollectionLazy EvaluationMemoizationPattern MatchingStealth MechanicsTrieType InferenceAmortized AnalysisBloom FilterConcurrency and ParallelismEvent SourcingPremature OptimizationTail Call OptimizationWrite-Behind CacheCurryingDuck TypingDynamic ProgrammingHigher-Order FunctionReflectionRegular Expression

Drag to pan · hold ⌘/ctrl and scroll — or pinch — to zoom.

01

Where it reaches

02

The hubs

03

Every note