Viewing profile — randomizedalgs
randomizedalgs
HN member- Joined
- Mon, Dec 13, 2021, 9:19 PM UTC
- HN karma
- 57
- Public activity
- 17 items
- HN profile
- View on Hacker News ↗
About randomizedalgs
No profile information was provided.
Recent public activity
-
comment
Comment #49184638
Even the experts on the problem being solved find the writeups nearly impossible to read. Example: https://nitter.poast.org/henryquantum/status/208362369543662... Seems like a diss…
-
comment
Comment #49141668
After skimming some of the writeups, I'm surprised that the frontier internal model still writes just as poorly as Sol. Maybe good AI paper writing is further away than I thought..…
-
comment
Comment #46568323
I'm an active researcher in TCS. For me, AI has not been very helpful on technical things (or even technical writing), but has been super helpful for (1) literature reviews; (2) ed…
-
comment
Comment #44635246
For perspective, the CS programs in the NSF already have a two-submission limit per year [1]. Besides reducing the incentive to spam, this rule has had another positive effect: As …
-
comment
Comment #44607280
For perspective, in the same time period, The number of employees at Google multiplied by five. I wouldn't be surprised if the growth of the software industry, at least, actually o…
-
comment
Comment #44607262
For perspective, in the same time period, The number of employees at Google multiplied by five. It seems likely that the number of highly educated positions, in general, increased …
-
comment
Comment #41591534
Cool paper! As a small comment, this seems closely related to another recent paper: History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures (PO…
-
comment
Comment #39694283
I don't think the claim is true in quite as much generality as the author claims. Some deterministic data structures use much more space than time, for example, the deterministic i…
-
comment
Comment #39448672
Maybe quotient filters?
-
comment
Comment #39334716
I think you may have a backwards. Libcuckoo, CLHT, and TBB are widely used high performance C/C++ DRAM hash tables. I think TBB is the hash table Intel maintains, if I remember rig…
-
comment
Comment #39323707
I think these are more-often called "cache oblivious" algorithms
-
comment
Comment #39323693
IcebergHT isn't just for persistent memory (although I can see why you might think it is based on the paper's title). The paper also gives experiments showing that the hash table p…
-
comment
Comment #38559232
As a super minor grammar point for the author, "ubiquitous" is a rare example of a word that starts with a vowel but should be proceeded by "a" instead of "an".
-
comment
Comment #38416917
Consider the imaginary world that the author describes, in which people's estimate of their score is independent of their actual score. Wouldn't it be fair to say that, in this ima…
-
comment
Comment #29544918
The randomized version of this algorithm is also fun: repeatedly find an edge that is not yet covered, select one of the two end points at random , and add it to S. It's a nice exe…
- story
-
comment
Comment #29544806
This is a classic example of price discrimination. Slowly but surely, companies such as Toyota will converge to a state where every consumer individually pays the maximum amount th…