Neal Young

Member for 10 years, 5 months
Last seen this week

cs.ucr.edu/~neal

Summary

Reputation

8,228

8.2k
6k
3.9k

2019
2020
2021
2022

Next tag badge

approximation-algorithms

103/100 score

19/20 answers

Badges

28

52

Newest

Custodian

Next badge

355/600

Electorate

Answers

View all 122 answers

Score Activity Newest

31

Reverse Chernoff bound

Nov 26, 2012

26

Toy Examples for Plotkin-Shmoys-Tardos and Arora-Kale solvers

Nov 19, 2012

20

Examples of algorithms and proofs that seem correct, but aren't

Mar 31, 2018

16

NP-hard problems with very fast exponential-time algorithms

Dec 30, 2019

16

Sorting using a black box

Mar 17, 2013

Questions

View all 6 questions

Score Activity Newest Views

16

a geometric variant of k-medians. NP-hard or in P?

May 4, 2015

8

Can you find a counter-example for this proposed Graph Isomorphism algorithm?

Sep 16, 2020

7

mixed vs behavior strategies for zero-sum game with infinite extensive form

Dec 23, 2012

5

reference request: greedy algorithm for fractional interval covering

Aug 10, 2020

4

Complexity of detecting general position in the plane?

Dec 8, 2021

Tags

View all 108 tags

ds.algorithms

221

Score

35

posts

approximation-algorithms

103

Score

19

posts

graph-theory

102

Score

17

posts

cc.complexity-theory

85

Score

16

posts

pr.probability

80

Score

13

posts

Reputation

+85

Quadratic lower bound

+10

Reverse Chernoff bound

+20

What is the polynomial representation of the Hamming weight function?

+10

Dynamic programming and shortest path problem

Badges

View all badges

This user doesn’t have any gold badges yet.

28

silver badges

Pundit

Sep 10, 2015
Civic Duty

Aug 9, 2020
Enthusiast

Dec 14, 2012

52

bronze badges

ds.algorithms

Jan 5, 2019
Cleanup

May 6, 2019
Explainer

Apr 1, 2016

Bookmarks

View all 63 bookmarks

Score Activity Newest Views Added

120

Examples of the price of abstraction?

Aug 26, 2010

103

What are the recent TCS books whose drafts are available online?

Dec 5, 2010

65

Problems that can be used to show polynomial-time hardness results

Sep 14, 2010

46

Problem unsolvable in $2^{o(n)}$ on inputs with $n$ bits, assuming ETH?

Jan 19, 2013

40

Data for testing graph algorithms

Aug 29, 2010

Accounts

View all 32 accounts

Theoretical Computer Science

8,228
28
52

Computer Science

481
3
8

300
1
9

231
1
4

183
8

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

320

upvotes

162

downvotes

355

question votes

127

answer votes

6

this month

2

this week