Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
Algorithms
📊 Algorithms
Data structures, complexity, sorting
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
266
posts in
9.3
ms
Max-Min Secrecy Rate Optimization for Secure ISAC Networks: Global Optimization and
Low-Complexity
Algorithm
🧮
Math
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Max-Min Secrecy Rate Optimization for Secure ISAC Networks: Global Optimization and Low-Complexity Algorithm
Linked
List
Cycle Detection
🔀
Concurrency
leetcode.com
·
1d
1 day ago
·
DEV
Actions for Linked List Cycle Detection
Random Proposals: A Softmax-Based Local-Improvement Framework for Maximum Weighted Matching
🔬
eBPF
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Random Proposals: A Softmax-Based Local-Improvement Framework for Maximum Weighted Matching
TiruArt/Pedigree-Polytopes-Lean4: Lean 4 machine-verified proof that Membership Problem for Pedigree Polytopes, M3P ∈ P and P = NP via properties of Pedigree Polytopes.
🌱
Open Source
Content type:
Code
github.com
·
6d
6 days ago
·
Hacker News
Actions for TiruArt/Pedigree-Polytopes-Lean4: Lean 4 machine-verified proof that Membership Problem for Pedigree Polytopes, M3P ∈ P and P = NP via properties of Pedigree Polytopes.
Delete Node in a
Linked
List
🔀
Concurrency
leetcode.com
·
2d
2 days ago
·
DEV
Actions for Delete Node in a Linked List
Sketching Intersection Profiles: A Simple Proof and Three Applications
🧮
Math
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Sketching Intersection Profiles: A Simple Proof and Three Applications
Diffusion-Network Alignment: An Efficient
Algorithm
and Explicit Probability Bounds
🧮
Math
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds
Learning with Simulators: No Regret in a
Computationally
Bounded World
🤖
AI
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Learning with Simulators: No Regret in a Computationally Bounded World
tttsam/concurrent-HashMap
: this hash
map
is part of a larger c project of doing a persistent kv storage this one uses liner probing
🔀
Concurrency
Content type:
Code
github.com
·
3d
3 days ago
·
r/C_Programming
Actions for tttsam/concurrent-HashMap: this hash map is part of a larger c project of doing a persistent kv storage this one uses liner probing
Binary
Search
Variants: A Comprehensive Analysis
⚙️
Systems Programming
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Binary Search Variants: A Comprehensive Analysis
A unified
complexity
bound for logconcave sampling
🤖
AI
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for A unified complexity bound for logconcave sampling
Quasi-linear
Time
Multiplication of Sparse Polynomials with Integer Coefficients
🧮
Math
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients
Random Generation of $k$-coloured Motzkin Paths
🧮
Math
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Random Generation of $k$-coloured Motzkin Paths
Testing Bipartiteness in Logarithmic Rounds
🧮
Math
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Testing Bipartiteness in Logarithmic Rounds
Two Sum |
HashMap
Pattern
🧮
Math
leetcode.com
·
5d
5 days ago
·
DEV
Actions for Two Sum | HashMap Pattern
Near-Optimal Distributed 2-Ruling Sets on
Graphs
with Low Arboricity
🕸️
Distributed Systems
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
On finding exact solutions of linear
programs
in the oracle model
🧮
Math
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for On finding exact solutions of linear programs in the oracle model
Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling
🤖
AI
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling
(Un)ranking Permutation Classes
🧮
Math
Content type:
Academic
arxiv.org
·
9h
9 hours ago
Actions for (Un)ranking Permutation Classes
A Unified Lower Bound on the Noisy Query
Complexity
of Boolean Functions
🔀
Concurrency
Content type:
Academic
arxiv.org
·
1d
1 day ago
Actions for A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions
« 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