You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.
I compiled a list of almost all useful blogs ever published on Codeforces [update: till 09.06.2021]
By parveen1981, history, 5 years ago, In English
I compiled a list of almost all useful blogs ever published on Codeforces [update: till 09.06.2021] <h3 style="color:red">If there are any blogs that I have missed, please tell in the comment section. Thank you.</h3> # Mathematics Stuff - [Number Theory in Competitive Programming [Tutorial]](https://codeforces.me/blog/entry/46620) - [Number of points on Convex hull with lattice points](https://codeforces.me/blog/entry/62183) - [FFT, big modulos, precision errors.](https://codeforces.me/blog/entry/48465) - [Number of ways between two vertices](https://codeforces.me/blog/entry/19078) - [Mathematics For Competitive Programming](https://codeforces.me/blog/entry/76938) - [FFT and NTT](https://codeforces.me/blog/entry/19862) - [Burnside Lemma](https://codeforces.me/blog/entry/51272) - [Number of positive integral solutions of equation 1/x+1/y=1/n!](https://codeforces.me/blog/entry/76836) - [On burnside (again)](https://codeforces.me/blog/entry/64860) - [Simple but often unknown theorems/lemmas/formula? Do you know?](https://codeforces.me/blog/entry/55912) - [Probabili...
://codeforces.com/blog/entry/85984) - [Simple Linear and Effectively Duval Algorithm for Lyndon Factorization

Full text and comments »

  • Vote: I like it
  • +1500
  • Vote: I do not like it

2.
Simple Linear and Effectively Duval Algorithm for Lyndon Factorization
By SPyofgame, history, 6 years ago, In English
Simple Linear and Effectively Duval Algorithm for Lyndon Factorization -------------------- -------------------- -------------------- ### <strong> <center style="color:red;"> Table of content </center> </strong> | Teleporter | Description | | :------------------------------------------- | :----------------------------------------------------- | | [I. Lyndon Definitions](#lyndon) | Definitions of Lyndon word, Lyndon factorization, ... | | [II. Duval Algorithm](#duval) | Talk about the duval algorithm and how it works | | [III. Real Life Applications](#rla) | Motivation to learn the algorithm | | [IV. Programming Applications](#application) | The code is short and simple to implement | | [V. My Questions](#question) | Are there any other applications ? | | ................................................................... |.............................

Full text and comments »

  • Vote: I like it
  • +137
  • Vote: I do not like it

3.
Random notes on Lyndon decomposition
By ko_osaga, history, 4 years ago, In English
Random notes on Lyndon decomposition I recently solved some problems that involved the concept of Lyndon decomposition. Honestly, most of them were too hard to understand for me. I'm just trying to think out loud about things I've read, so I can learn ideas or better takes from smarter people? Note that I will omit almost all proofs as I can't do that. I believe all unproven claims below are facts, but it is always great to have doubts about anything. ## 1. Lyndon decomposition, definition, and algorithms Partly copy-pasted from [this link.](https://cp-algorithms.com/string/lyndon_factorization.html#lyndon-factorization_1) A string is called simple (or a Lyndon word), if it is strictly smaller than any of its own nontrivial suffixes. Examples of simple strings are $a, b, ab, aab, abb, abcd, abac$. It can be shown that a string is simple, if and only if it is strictly smaller than all its nontrivial cyclic shifts. As a corollary, it can be observed that simple words are never periodic (it is not a repetition o...
compute the Lyndon decomposition in linear time. The first algorithm is the well-knownDuval algorithm, . The first algorithm is the well-known Duval algorithm. [E-maxx](https://cp-algorithms.com/string, Duval algorithm maintains a *pre-simple* string in each iteration. Consider a pre-simple string $t

Full text and comments »

  • Vote: I like it
  • +105
  • Vote: I do not like it

4.
Lexicographically Minimal String Rotation
By SPyofgame, history, 6 years ago, In English
Lexicographically Minimal String Rotation -------------------- -------------------- -------------------- -------------------- -------------------- # <strong> <center style="color:red;"> Table of content </center> </strong> | Teleporter | Description | | :---------------------------------------------- | :----------------------------------------------------------- | | [I. The Problem](#problem) | Describe about the problem | | [II. Bruteforce Approach](#brute) | Simple way to do the problem | | [III. Hashing Approach](#hash) | Reduce circular substring comparing complexity | | [IV. Sqrt Decomposition](#sqrt) | Divide into parts, solve each part then solve the whole part | | [V. KMP Approach](#kmp) | Magical Linear Booth-KMP Algorithm ...
Effectively Duval Algorithm for Lyndon Factorization](https://codeforces.me/blog/entry/89629), can read [Simple Linear and Effectively Duval Algorithm for Lyndon Factorization](https, | | [V. KMP Approach](#kmp) | Magical Linear Booth-KMP Algorithm, ##### **2)** Duval Algorithm: , - In $1983$, Duval provides an effecient algorithm for listing the Lyndon words of length at most

Full text and comments »

  • Vote: I like it
  • +106
  • Vote: I do not like it