Skip to content
sahil.science
Questions
Papers
Topics
Syntheses
Almanac
About
C⁶
2026
← Questions
Source-derived question
How did Tarjan's depth-first search and union-find data structure speed up graph algorithms by an order of magnitude?
Algorithms and Data Structures
Sources that address it
ACM A.M. Turing Award
almanac
Related questions
Does interleaved practice improve implicit or procedural learning, not just explicit skills?
How can a computational framework for modeling memory decay and retrieval probability be used to derive optimal spaced repetition schedules rather than relying on hand-tuned heuristics?
How can a nondeterministic finite automaton be converted into a deterministic one without losing expressive power?
How can a reaction-diffusion model, building on Turing's 1952 framework, explain the spontaneous emergence of spatial pattern from an initially homogeneous meristem?
How can deep neural network models serve as testable, end-to-end trainable implementations of cognitive theories?
How can scarcity problems in economics be expressed as systems of linear inequalities?
How did Benveniste claim that a homeopathic signal from water could be transmitted digitally over a telephone line?
How did CTSS create the illusion that each user had the whole computer to themselves?