Search: lemire.me | Heykuki News

HK

Heykuki News

Top New Best Ask Show Jobs

Top New Best Ask Show Jobs

901.

Reusing a thread in C++ for better performance

6 years ago

2 points

902.

Reordering Columns for Smaller Indexes

6 years ago

2 points

903.

Predictions from 2020 to 2100

6 years ago

2 points

904.

Encoding Binary in ASCII Fast

6 years ago

2 points

905.

Encoding Binary in ASCII Fast

6 years ago

2 points

906.

Sampling Efficiently from Groups

6 years ago

2 points

907.

Multiplying backward for profit – Daniel Lemire's blog

6 years ago

2 points

908.

Avoiding Cache Line Overlap

6 years ago

2 points

909.

Avoiding cache line overlap by replacing a 256-bit store with two 128-bit stores

6 years ago

2 points

910.

Fast Float Parsing in Practice

6 years ago

2 points

911.

Fast divisionless computation of binomial coefficients

6 years ago

2 points

912.

Research should not stop with the research paper

6 years ago

2 points

913.

Allocating large blocks of memory: bare-metal C++ speeds

6 years ago

2 points

914.

How fast can you allocate a large block of memory in C++?

6 years ago

2 points

915.

Parsing numbers in C++: streams, strtod, from_chars

7 years ago

2 points

916.

Amazon’s new ARM servers: Graviton 2

7 years ago

2 points

917.

AMD Zen 2 and branch mispredictions

7 years ago

2 points

918.

AMD Zen 2 and branch mispredictions

7 years ago

2 points

919.

Cloud Computing: A Story of Incentives

7 years ago

2 points

920.

Better computational complexity does not imply better speed

7 years ago

2 points

921.

Better computational complexity does not imply better speed

7 years ago

2 points

922.

Not even eventual consistency

15 years ago

2 points

923.

Better computational complexity does not imply better speed

7 years ago

2 points

924.

A Short History of Technology

7 years ago

2 points

925.

Memory Parallelism: AMD Rome versus Intel

7 years ago

2 points

926.

How expensive is it to parse numbers from a string in C++?

7 years ago

2 points

927.

Benchmarking is hard: processors learn to predict branches

7 years ago

2 points

928.

Benchmarking is hard: processors learn to predict branches

7 years ago

2 points

929.

How far can you scale interleaved binary searches?

7 years ago

2 points

930.

Passing integers by reference can be expensive

7 years ago

2 points