4rcadia
Community@arcadi4 · Cleveland, OH
Student @cwru
Agent Skills by 4rcadia
Showing 30 vetted skills indexed across 1 GitHub repositories.
sicp
Create structured SICP study plans with Markdown-based Nerdy framework content.
tapl
Inform users that the TaPL skill is pending implementation and request repository stars.
csapp
Guide structured study of CSAPP topics on architecture, assembly, memory hierarchy, and linking.
greedy-algorithms
Certify greedy strategies with exchange argument proofs and optimal substructure.
approximation-algorithms
Prove approximation guarantees for NP-hard optimization problems with certificate-backed analyses.
probabilistic-analysis-and-randomized-algorithms
Analyze probabilistic aspects and randomness in CLRS-style algorithms.
elementary-data-structures
Define operation contracts and invariants for elementary data structures.
minimun-spanning-trees
Produce safe-edge certificates and constructive proofs for minimum spanning-tree problems.
amortized-algorithms
Analyze data-structure operation sequences using aggregate, accounting, and potential methods.
elementary-graph-algorithms
Solve graph-search and representation problems for directed and undirected graphs.
data-structures-for-disjoint-sets
Explain disjoint-set union-find operations and partition invariants with performance bounds.
matrix-operations
Solve CLRS-style matrix problems using LUP decomposition and triangular substitution.
string-matching
Guide exact string-matching algorithm selection with CLRS-style cost analysis.
dynamic-programming
Define states and reconstruct solutions for optimization problems using dynamic programming.
maximum-flow
Model flow networks and verify max-flow solutions with cut certificates.
np-completeness
Audit NP-hardness proofs and polynomial-time reductions for decision problems.
shortest-paths
Select and apply shortest-path algorithms for weighted graphs with negative edges.
parallel-algorithms
Analyze fork-join parallel algorithms for correctness bounds and performance characteristics.
polynomials-and-fft
Multiply polynomials via FFT with padding and root-of-unity handling.
machine-learning-algorithms
Formats machine-learning algorithm prompts with CLRS theorem and proof conventions.
divide-and-conquer
Analyze divide-and-conquer recurrences using Master theorem, Akra-Bazzi, recursion trees, or substitution.
linear-programming
Formulate, analyze, and certify linear programming models with duality proofs.
sorting-and-order-statistics
Select sorting and order-statistic primitives for ranks, medians, and top-k.
binary-search-trees
Analyze BST invariants and rotations to guide production container choices.