25,161
edits
Changes
no edit summary
He received his [https://en.wikipedia.org/wiki/Master_of_Engineering Master of Engineering] in computer science from [[Massachusetts Institute of Technology|MIT]] in 2004, where his thesis advisor was [[Charles Leiserson]] <ref>[[Siddhartha Sen]] ('''2004'''). ''[https://dspace.mit.edu/handle/1721.1/33355 Dynamic processor allocation for adaptively parallel work-stealing jobs]''. Master's thesis, [[Massachusetts Institute of Technology|MIT]], advisor [[Charles Leiserson]]</ref>,
and his Ph.D. in computer science at [https://en.wikipedia.org/wiki/Princeton_University Princeton University],
under [[Mathematician#RETarjan|Robert Tarjan]] and [[Mathematician#MJFreedman|Michael Freedman]] <ref>[[Siddhartha Sen]] ('''2013'''). ''[https://www.cs.princeton.edu/research/techreps/TR-946-13 New Systems and Algorithms for Scalable Fault Tolerance]''. Ph.D .thesis, [https://en.wikipedia.org/wiki/Princeton_University Princeton University], advisors [[Mathematician#RETarjan|Robert Tarjan]] and [[Mathematician#MJFreedman|Michael Freedman]]</ref>. His research focuses around [[Algorithms|algorithms]] and [[Data|data structures]]including [https://en.wikipedia.org/wiki/Concurrency_(computer_science) concurrency] in particular for [[NUMA]] architectures.
Along with [[Reid McIlroy-Young]], [[Russell Wang]], [[Jon Kleinberg]] and [[Ashton Anderson]], Siddhartha Sen is involved in the [[Maia Chess]] project of a human-like [[Neural Networks|neural network]] chess engine <ref>[https://maiachess.com/ Maia Chess]</ref>.
* [[Siddhartha Sen]] ('''2004'''). ''[https://dspace.mit.edu/handle/1721.1/33355 Dynamic processor allocation for adaptively parallel work-stealing jobs]''. Master's thesis, [[Massachusetts Institute of Technology|MIT]], advisor [[Charles Leiserson]]
* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2008'''). ''Incremental Topological Ordering and Strong Component Maintenance''. [https://arxiv.org/abs/0803.0792 arXiv:0803.0792]
* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2009'''). ''Heaps Simplified''. [https://arxiv.org/abs/0903.0116 arXiv:0903.0116]<ref>[https://en.wikipedia.org/wiki/Heap_(data_structure) Heap (data structure) from Wikipedia]</ref>* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-03367-4_31 Rank-Balanced Trees]''. [https://dblp.org/db/conf/wads/wads2009.html#HaeuplerST09 WADS 2009]<ref>[https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree Self-balancing binary search tree from Wikipedia]</ref>* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-04128-0_59 Rank-Pairing Heaps]''. [https://dblp.org/db/conf/esa/esa2009.html#HaeuplerST09 ESA 2009]<ref>[https://en.wikipedia.org/wiki/Pairing_heap Pairing heap from Wikipedia]</ref>
==2010 ...==
* [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2010'''). ''[https://dl.acm.org/doi/10.5555/1873601.1873722 Deletion Without Rebalancing in Balanced Binary Trees]''. [https://dblp.org/db/conf/soda/soda2010.html#SenT10 SODA 2010]
* [[Siddhartha Sen]] ('''2013'''). ''[https://www.cs.princeton.edu/research/techreps/TR-946-13 New Systems and Algorithms for Scalable Fault Tolerance]''. Ph.D .thesis, [https://en.wikipedia.org/wiki/Princeton_University Princeton University], advisors [[Mathematician#RETarjan|Robert Tarjan]] and [[Mathematician#MJFreedman|Michael Freedman]]* [https://dblp.org/pid/169/7651.html Daniel H. Larkin], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2014'''). ''A Back-to-Basics Empirical Study of Priority Queues''. [https://arxiv.org/abs/1403.0252 arXiv:1403.0252]<ref>[https://en.wikipedia.org/wiki/Priority_queue Priority queue from Wikipedia]</ref>
* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2015'''). ''[https://dl.acm.org/doi/10.1145/2689412 Rank-Balanced Trees]''. [[ACM#TALG|ACM Transactions on Algorithms]], Vol. 11, No. 4
* [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]], [https://dblp.org/pid/162/7768.html David Hong Kyun Kim] ('''2016'''). ''[https://dl.acm.org/doi/10.1145/2903142 Deletion Without Rebalancing in Binary Search Trees]''. [[ACM#TALG|ACM Transactions on Algorithms]], Vol. 12, No. 4
