Personal channel of @lancern
Topics: programming, hacking, memes, life, and more. Forward anything as you wish.
Join the discussion group for more fun.
Discord: https://discord.gg/RwUx9et7
Topics: programming, hacking, memes, life, and more. Forward anything as you wish.
Join the discussion group for more fun.
Discord: https://discord.gg/RwUx9et7
Evaluating SIMD Compiler-Intrinsics for Database Systems
https://lawben.com/publication/autovec-db/autovec_db_adms23.pdf
https://lawben.com/publication/autovec-db/autovec_db_adms23.pdf
上海有没有什么废话少动作快的理发店推荐啊
国家统计局:8月起暂停发布青年人失业率数据。
Emulating x86 on X64 on Aarch64 https://neugierig.org/software/blog/2023/08/x86-x64-aarch64.html
AST vs. Bytecode: Interpreters in the Age of Meta-Compilation
(submitted to OOPSLA)
https://stefan-marr.de/downloads/oopsla23-larose-et-al-ast-vs-bytecode-interpreters-in-the-age-of-meta-compilation.pdf
(submitted to OOPSLA)
https://stefan-marr.de/downloads/oopsla23-larose-et-al-ast-vs-bytecode-interpreters-in-the-age-of-meta-compilation.pdf
明天怎么又要上班了😡
Introduction to Graph Theory
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and arborescences. Among the features discussed are Eulerian circuits, Hamiltonian cycles, spanning trees, the matrix-tree and BEST theorems, proper colorings, Turan's theorem, bipartite matching and the Menger and Gallai--Milgram theorems. The basics of network flows are introduced in order to prove Hall's marriage theorem.
https://arxiv.org/abs/2308.04512
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and arborescences. Among the features discussed are Eulerian circuits, Hamiltonian cycles, spanning trees, the matrix-tree and BEST theorems, proper colorings, Turan's theorem, bipartite matching and the Menger and Gallai--Milgram theorems. The basics of network flows are introduced in order to prove Hall's marriage theorem.
https://arxiv.org/abs/2308.04512
国铁闸机的通行效率一言难尽还不如人工
属于是用着21世纪的科技做着19世纪的事情了
属于是用着21世纪的科技做着19世纪的事情了