/
Navigation
C
Chronicles
Browse all articles
C
E
Explore
Semantic exploration
E
R
Research
Entity momentum
R
N
Nexus
Correlations & relationships
N
~
Story Arc
Topic evolution
S
Drift Map
Semantic trajectory animation
D
P
Posts
Analysis & commentary
P
Browse
@
Entities
Companies, people, products, technologies
Domains
Browse by publication source
Handles
Browse by social media handle
Detection
?
Concept Search
Semantic similarity search
!
High Impact Stories
Top coverage by position
+
Sentiment Analysis
Positive/negative coverage
*
Anomaly Detection
Unusual coverage patterns
Analysis
vs
Rivalry Report
Compare two entities head-to-head
/\
Semantic Pivots
Narrative discontinuities
!!
Crisis Response
Event recovery patterns
Connected
Nav: C E R N
Search: /
Command: ⌘K
Embeddings: large
VOICE ARCHIVE

Huck Bennett

@huckbennett
1 posts
2024-04-11
Woohoo! Avi Wigderson is a prolific author, but his very first paper (according to DBLP) is about a simple and beautiful algorithm for graph coloring ( https://www.math.ias.edu/...). The set-up is this. Say say you're promised that an n-node graph G = (V, E) is 3-colorable. 1/3
2024-04-11 View on X
Quanta Magazine

Computer scientist Avi Wigderson wins the 2023 Turing Award for his “foundational contributions to the theory of computation”, including his work on randomness

friend and mentor to so many (including me) https://www.acm.org/... Tarun Chitra / @tarunchitra : Some of my favorite Wigderson papers are: 1. Hardness vs. Randomness 2. Algebrizat...