Skip to content
<title>Channels - Formalizing Randomized Matching Algorithms :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Formalizing Randomized Matching Algorithms
Search for more channels:
Similar Items: Formalizing Randomized Matching Algorithms
Channel Options
View Record
Explore related channels
Quick Look
Formal Languages, Formally and Coinductively
Quick Look
Algorithmic Randomness and Capacity of Closed Sets
Quick Look
Matching Logic
Quick Look
Formal Primal-Dual Algorithm Analysis
Quick Look
Abstract Completion, Formalized
Quick Look
Fourier spectra of measures associated with algorithmically random Brownian motion
Quick Look
Algorithmic randomness for Doob's martingale convergence theorem in continuous time
Quick Look
Formal Theories for Linear Algebra
Quick Look
$sigma$-locales in Formal Topology
Quick Look
Formalizing the Face Lattice of Polyhedra
Quick Look
The Formal Theory of Monads, Univalently
Quick Look
Enhancing Random Forest Using Genetic Algorithm for Lifelong Machine Learning
Quick Look
Decidability of higher-order matching
Quick Look
A Few Notes on Formal Balls
Quick Look
A Theory of Formal Choreographic Languages
Quick Look
Algebraic Pattern Matching in Join Calculus
Quick Look
Regular matching problems for infinite trees
Quick Look
Robust Point Matching with Distance Profiles
Quick Look
Coinductive Formal Reasoning in Exact Real Arithmetic
Quick Look
TRX: A Formally Verified Parser Interpreter
Quick Look
Formalization of Abstract State Transition Systems for SAT
Quick Look
A Formal Proof of the Irrationality of $zeta(3)$
Quick Look
Modified honey bee algorithm with random selection of virtual machines for dynamic load balancing
Quick Look
Adaptive Non-linear Pattern Matching Automata
Load more items
View Record
Prev
Explore related channels
Next
