Theoretical Computer Science
Meta user
Network profile
1,197
reputation
9
18

Yonatan N

I work on algorithms for Amazon's Emerging Devices team.

17
answers
0
questions
~6k
people reached
  • Bay Area, CA
  • yonatan.us
  • Member for 8 years, 5 months
  • 260 profile views
  • Last seen 5 hours ago

Communities (10)

Top network posts

Top tags (27)

Score 31
Posts 6
Posts % 35
Score 24
Posts 5
Score 22
Posts 3
Score 20
Posts 6
Score 16
Posts 1
Score 9
Posts 3
View all tags →

Top posts (17) All Questions Answers | Votes Newest

16 Best communication complexity lower bound of disjointness Jan 25 '13
13 Questions regarding SETH Aug 10 '16
10 What is the complexity of this path problem? Feb 17 '14
9 What is the reference for the proof Gödel's first incompleteness theorem based on the undecidability of the halting problem? Feb 15
8 Natural NP-complete problems with high density? Nov 30 '15
7 Is there an efficient algorithm for finding edges that are part of all hamiltonian paths? Jan 3 '14
6 All-or-Nothing Single-Sink Flow Problem Oct 26 '18
4 Variants of Densest Subgraph Problems Dec 27 '13
4 Is there an approximation algorithm for MAX k DOUBLE SET COVER? Jul 16 '16
3 How to design an algorithm which turns an undirected graph into directed with all nodes of indegree higher than 0? Oct 31 '17
View all questions and answers →

Badges (27)

Gold

—

Silver

9

Rarest

Bronze

18

Rarest

View all badges →