Aviad Rubinstein
@AviadRubinstein
Followers
392
Following
471
Media
3
Statuses
89
Algorithms for Toddlers (https://t.co/1CuoUx2whF) | Algs for Teenagers (https://t.co/L220qEBmqA) | Algs for Grown Ups (https://t.co/bNhR2xF3vV)
Joined July 2018
RT @minilek: Postdoc opportunity: if interested in a postdoc related to sketching starting Summer/Fall'25, especially applied to more effic….
0
6
0
RT @thomasahle: o1-preview one-shots my hardest programming interview question. What do I do?.
0
2
0
Yet another awesome (but this time local) TCS opportunity:. 🥳We're hosting TOCA-SV at Stanford on Nov 8th🥳 . Free registration and everything else you always wanted to know about the 11th TOCA-SV:.
sites.google.com
Friday Nov. 8, 2024
0
3
20
RT @Tim_Roughgarden: Over the past three summers @a16zcrypto we've had 19 tremendous research interns. Want to be part of the summer '25 co….
0
27
0
Looks like Jamboard is actually frozen :(. Good (hopefully free) alternatives? Ideally ones where we can both easily draw and write latex?.
0
1
5
2 awesome opportunities for TCS research (in different career stages):. 1. Motwani Postdoc applications just opened!. 2. Our crowdsourced spreadsheet of TCS Masters programs (same link, Fall 2024 updated info):.
4
16
54
RT @wtgowers: Occasionally in mathematics a statement that just has to be true turns out to be false. A paper appeared on arXiv today that….
arxiv.org
We give an explicit counterexample to the Bunkbed Conjecture introduced by Kasteleyn in 1985. The counterexample is given by a planar graph on $7222$ vertices, and is built on the recent work of...
0
156
0
RT @AlgoSvensson: @SebastienBubeck Amazing, we basically did the same last semester in the introduction to algorithms course at EPFL with 5….
0
6
0
RT @DIMACSCenter: Are you a TCS grad student who doesn't know much about fine-grained complexity, but wish you did? Check out the DIMACS T….
0
6
0
RT @karthikcs_: Along with Amir Abboud and Nick Fischer, I'm organizing a tutorial in Fine-grained complexity in July 2024, primarily for g….
0
9
0
RT @Aaroth: Traditional swap regret algorithms are not monotone! But recent ones are, and we give a reduction that lets you use them in the….
arxiv.org
We study a repeated contracting setting in which a Principal adaptively chooses amongst $k$ Agents at each of $T$ rounds. The Agents are non-myopic, and so a mechanism for the Principal induces a...
0
1
0
RT @syrgkanis: Postdoc opportunity to work on collaborative healthcare related projects with several Stanford faculty .
0
9
0
RT @Aaroth: Here is a 3 page paper giving a super-simple deterministic online algorithm that guarantees 2√T distance to calibration. The an….
0
10
0
RT @anupamg: The STOC/TheoryFest 2024 call for workshops has been posted. The deadline for proposals is Feb 16!. The conference will be hel….
0
4
0
RT @econ_cs: Quantum Communication Complexity of Classical Auctions. (arXiv:2311.12444v1 [) .
cs.gt
A trully free bio link tool.
0
1
0
RT @ShengwuLi: On the job market, please feel free to use a completely canned cover letter. I have never read them, and as far as I can tel….
0
10
0
RT @YannaiGonch: Following up on previous years' compilations of Market Design job-market profiles, @AssafRomm @RanShorrer and I are compil….
0
19
0