Difference between revisions of "Siddhartha Sen"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 25: | Line 25: | ||
* [[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 | * [[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 | * [[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 | ||
| − | * [https://scholar.google.com/citations?user=5aWoGywAAAAJ&hl=en Irina Calciu], [[Siddhartha Sen]], [[Mathematician#MBalakrishnan|Mahesh Balakrishnan]], [[Mathematician#MKAguilera|Marcos K. Aguilera | + | * [https://scholar.google.com/citations?user=5aWoGywAAAAJ&hl=en Irina Calciu], [[Siddhartha Sen]], [[Mathematician#MBalakrishnan|Mahesh Balakrishnan]], [[Mathematician#MKAguilera|Marcos K. Aguilera]] ('''2017'''). ''[https://dl.acm.org/doi/10.1145/3093336.3037721 Black-box Concurrent Data Structures for NUMA Architectures]''. [[ACM#SIGPLAN|ACM SIGPLAN Notices]], Vol. 52, No. 4, [https://cs.brown.edu/people/irina/papers/asplos2017-final.pdf pdf] |
| − | * [https://scholar.google.com/citations?user=5aWoGywAAAAJ&hl=en Irina Calciu], [[Siddhartha Sen]], [[Mathematician#MBalakrishnan|Mahesh Balakrishnan]], [[Mathematician#MKAguilera|Marcos K. Aguilera | + | * [https://scholar.google.com/citations?user=5aWoGywAAAAJ&hl=en Irina Calciu], [[Siddhartha Sen]], [[Mathematician#MBalakrishnan|Mahesh Balakrishnan]], [[Mathematician#MKAguilera|Marcos K. Aguilera]] ('''2017'''). ''[https://dl.acm.org/doi/10.1145/3139645.3139650 How to implement any concurrent data structure for modern servers]''. [[ACM#SIGOPS|ACM SIGOPS]], Vol. 51, No. 1 |
| − | * [https://scholar.google.com/citations?user=5aWoGywAAAAJ&hl=en Irina Calciu], [[Siddhartha Sen]], [[Mathematician#MBalakrishnan|Mahesh Balakrishnan]], [[Mathematician#MKAguilera|Marcos K. Aguilera | + | * [https://scholar.google.com/citations?user=5aWoGywAAAAJ&hl=en Irina Calciu], [[Siddhartha Sen]], [[Mathematician#MBalakrishnan|Mahesh Balakrishnan]], [[Mathematician#MKAguilera|Marcos K. Aguilera]] ('''2018'''). ''[https://cacm.acm.org/magazines/2018/12/232880-how-to-implement-any-concurrent-data-structure/fulltext How to implement any concurrent data structure]''. [[ACM#Communications|Communications of the ACM]], Vol. 61, No. 12 |
==2020 ...== | ==2020 ...== | ||
* [[Reid McIlroy-Young]], [[Siddhartha Sen]], [[Jon Kleinberg]], [[Ashton Anderson]] ('''2020'''). ''Aligning Superhuman AI with Human Behavior: Chess as a Model System''. In Proceedings of the 26th [[ACM#SIGKDD|ACM SIGKDD 2020]], [https://arxiv.org/abs/2006.01855 arXiv:2006.01855] | * [[Reid McIlroy-Young]], [[Siddhartha Sen]], [[Jon Kleinberg]], [[Ashton Anderson]] ('''2020'''). ''Aligning Superhuman AI with Human Behavior: Chess as a Model System''. In Proceedings of the 26th [[ACM#SIGKDD|ACM SIGKDD 2020]], [https://arxiv.org/abs/2006.01855 arXiv:2006.01855] | ||
Revision as of 00:16, 9 December 2020
Home * People * Siddhartha Sen
Siddhartha Sen[1]
Siddhartha Sen,
an American electrical engineer, computer scientist and principal researcher in the Microsoft Research New York City lab, where he leads the AI/Systems group [2]-
He received his Master of Engineering in computer science from MIT in 2004, where his thesis advisor was Charles Leiserson [3],
and his Ph.D. in computer science at Princeton University,
under Robert Tarjan and Michael Freedman [4].
His research focuses around algorithms and data structures.
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 network chess engine [5].
Contents
Selected Publications
2004 ...
- Siddhartha Sen (2004). Dynamic processor allocation for adaptively parallel work-stealing jobs. Master's thesis, MIT, advisor Charles Leiserson
- Bernhard Haeupler, Siddhartha Sen, Robert Tarjan (2008). Incremental Topological Ordering and Strong Component Maintenance. arXiv:0803.0792
- Bernhard Haeupler, Siddhartha Sen, Robert Tarjan (2009). Heaps Simplified. arXiv:0903.0116
- Bernhard Haeupler, Siddhartha Sen, Robert Tarjan (2009). Rank-Balanced Trees. WADS 2009
- Bernhard Haeupler, Siddhartha Sen, Robert Tarjan (2009). Rank-Pairing Heaps. ESA 2009
2010 ...
- Siddhartha Sen, Robert Tarjan (2010). Deletion Without Rebalancing in Balanced Binary Trees. SODA 2010
- Siddhartha Sen (2013). New Systems and Algorithms for Scalable Fault Tolerance. Ph.D .thesis, Princeton University, advisors Robert Tarjan and Michael Freedman
- Daniel H. Larkin, Siddhartha Sen, Robert Tarjan (2014). A Back-to-Basics Empirical Study of Priority Queues. arXiv:1403.0252
- Bernhard Haeupler, Siddhartha Sen, Robert Tarjan (2015). Rank-Balanced Trees. ACM Transactions on Algorithms, Vol. 11, No. 4
- Siddhartha Sen, Robert Tarjan, David Hong Kyun Kim (2016). Deletion Without Rebalancing in Binary Search Trees. ACM Transactions on Algorithms, Vol. 12, No. 4
- Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera (2017). Black-box Concurrent Data Structures for NUMA Architectures. ACM SIGPLAN Notices, Vol. 52, No. 4, pdf
- Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera (2017). How to implement any concurrent data structure for modern servers. ACM SIGOPS, Vol. 51, No. 1
- Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera (2018). How to implement any concurrent data structure. Communications of the ACM, Vol. 61, No. 12
2020 ...
- Reid McIlroy-Young, Siddhartha Sen, Jon Kleinberg, Ashton Anderson (2020). Aligning Superhuman AI with Human Behavior: Chess as a Model System. In Proceedings of the 26th ACM SIGKDD 2020, arXiv:2006.01855
- Reid McIlroy-Young, Russell Wang, Siddhartha Sen, Jon Kleinberg, Ashton Anderson (2020). Learning Personalized Models of Human Behavior in Chess. arXiv:2008.10086
External Links
- Siddhartha Sen at Microsoft Research
- Siddhartha Sen - Microsoft Research NYC
- Siddhartha Sen - Google Scholar
- Siddhartha Sen - The Mathematics Genealogy Project
References
- ↑ Maia Chess
- ↑ Siddhartha Sen - Microsoft Research NYC
- ↑ Siddhartha Sen (2004). Dynamic processor allocation for adaptively parallel work-stealing jobs. Master's thesis, MIT, advisor Charles Leiserson
- ↑ Siddhartha Sen (2013). New Systems and Algorithms for Scalable Fault Tolerance. Ph.D .thesis, Princeton University, advisors Robert Tarjan and Michael Freedman
- ↑ Maia Chess
- ↑ Siddhartha Sen - Google Scholar
- ↑ dblp: Siddhartha Sen
