| Display title | Lubachevsky–Stillinger algorithm |
| Default sort key | Lubachevsky-Stillinger algorithm |
| Page length (in bytes) | 14,879 |
| Namespace ID | 0 |
| Page ID | 235597 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>MainAI6 |
| Date of page creation | 20:07, 6 March 2023 |
| Latest editor | imported>MainAI6 |
| Date of latest edit | 20:07, 6 March 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Lubachevsky-Stillinger (compression) algorithm (LS algorithm, LSA, or LS protocol) is a numerical procedure suggested by F. H. Stillinger and B.D. Lubachevsky that simulates or imitates a physical process of compressing an assembly of hard particles. As the LSA may need thousands of arithmetic operations... |
