Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Close
Copied to clipboard
Close
Unable to share or copy to clipboard
Close
๐๏ธ Data Structures
trees, graphs, hash tables, linked lists
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
186535
posts in
31.0
ms
Automaton-based
Characterisations
of First Order Logic over Infinite Trees
ย
๐
Competitive Programming
arxiv.org
ยท
18h
Adaptive meta-path-based neural network architecture search for
heterogeneous
graphs
ย
๐๏ธ
System Design
sciencedirect.com
ยท
5d
High
Throughput
Bioinformatics
: Theory to/from Practice
ย
๐ป
Bioinformatics
curiouscoding.nl
ยท
2d
Could
NP-hard
search trees be
tackled
through spatial mapping of computation rather than temporal execution?
ย
๐๏ธ
System Design
github.com
ยท
2d
ยท
r/compsci
Design and Analysis of
Algorithms
|
Electrical
Engineering and Computer Science
ย
๐
Algorithms
ocw.mit.edu
ยท
3d
Broad
spectrum
structure discovery in large-scale higher-order networks
ย
๐ป
Bioinformatics
nature.com
ยท
3d
Naming
Things Is Easy Now
ย
๐
RAG
notesbylex.com
ยท
5d
ยท
Hacker News
Local-Run Graph-Based
Scalable
AGI
ย
๐ง
Distributed Systems
boggersthefish.com
ยท
5d
ยท
Hacker News
Relation
morphisms
of directed graphs
ย
๐
Algorithms
arxiv.org
ยท
18h
What holds AI safety together?
Co-authorship
networks from 200
papers
ย
๐ค
AI
lesswrong.com
ยท
5d
Podcast: A Java Performance Quest:
Taming
Unsafe Code, Embracing
Idiomatic
Style & Debugging the Linux Kernel
ย
๐งฉ
LeetCode
infoq.com
ยท
3d
Top
Java
Coding Interview Questions (With
Answers
)
ย
๐งฉ
LeetCode
digitalocean.com
ยท
6d
Python and C killer
seekers
rejoice
ย
๐
Competitive Programming
news.ycombinator.com
ยท
4d
ยท
Hacker News
Incremental
Strongly
Connected Components with Predictions
ย
๐ง
Distributed Systems
arxiv.org
ยท
18h
Small Independent Sets versus Small
Separator
in Geometric
Intersection
Graphs
ย
๐
Algorithms
arxiv.org
ยท
18h
mustafabinguldev/nexus-core
: The central brain between your distributed Minecraft infrastructure and your persistent data layer.
ย
๐๏ธ
System Design
github.com
ยท
5d
ยท
DEV
Fast Core
Identification
ย
๐
Algorithms
arxiv.org
ยท
18h
Graph Construction and Matching for
Imperative
Programs using Neural and
Structural
Methods
ย
๐
Competitive Programming
arxiv.org
ยท
18h
Near-Optimal
Heaps
and
Dijkstra
on Pointer Machines
ย
๐
Algorithms
arxiv.org
ยท
2d
Path-Reporting Distance
Oracles
for
Vertex-Labeled
Graphs
ย
๐
Algorithms
arxiv.org
ยท
18h
« Page 1
ยท
Page 3 »
Log in to enable infinite scrolling
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
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
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help