computer science

Feeds to Scour
SubscribedAll
Scoured 292 posts in 7.5 ms

Discovering Data Structures: Nearest Neighbor Search and Beyond

 🔢Homomorphic Encryption  Content type: Academic
arxiv.org·

Mastering Taskwarrior

 🐘postgres

carlosrs14/programming-exercises: Learn C programming language.

 🔢Homomorphic Encryption  Content type: Code
github.com··r/C_Programming

Python Morsels: Stacks and queues in Python

 ⚗️elixir
pythonmorsels.com·

Why Compiler Engineers Rarely Use Strassen's Algorithm for Fast Matrix Multiplications

 🔢Homomorphic Encryption  Content type: News  Content type: Blog

Samuel Mimram — CSC_51051_EP -- Computational logic: from Artificial intelligence to Zero bugs

 mathematics
lix.polytechnique.fr·

Autonomous agents have met their biggest challenge yet: The database.

 🦆duckdb
thenewstack.io·

Redis 8.8: New array data structure, rate limiter, performance improvements

 🪶sqlite  Content type: Discussion

A Proof on the Computational Complexity of the Traveling Salesman Problem: Why P ≠ NP

 🔢Homomorphic Encryption
zenodo.org··Hacker News

Learning Regular Languages with the TTT Algorithm

 🔢Homomorphic Encryption

Are Neural Networks Collision Resistant?

 🔢Homomorphic Encryption
link.aps.org·

How to check username availability at scale with Bloom filters

 🔢Homomorphic Encryption  Content type: Blog
blog.logrocket.com·

Design Reliable, Scalable Distributed Systems

 🔢Homomorphic Encryption
fizzbee.io·

Comp.compilers: An Empirical Comparison of General Context-Free Parsers

 🔢Homomorphic Encryption
compilers.iecc.com·

Presentation: Beyond Speed Limits: Exploring the Performance Power of Valkey

 🔢Homomorphic Encryption  Content type: News
infoq.com
·

A Short Story About SQL's Biggest Rival (QUEL) (2020)

 🐘postgres  Content type: Blog
holistics.io··Hacker News

The coding interview patterns, explained by building them

 🔢Homomorphic Encryption  Content type: Tutorial
iwtlp.com··DEV

Database as a Graph for Relational Deep Learning

 🦆duckdb

SQL

 🐘postgres
remy.wang··Hacker News

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

 🔢Homomorphic Encryption  Content type: Academic
arxiv.org·

Keyboard Shortcuts

Navigation

Next / previous item
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help