Thatchaphol Saranurak Coauthor index pubzone.org

Facets and more with CompleteSearch

Listing of the DBLP Bibliography Server - FAQ
Other views (modern): by type - by year
Other mirrors: Trier II - Dagstuhl


Ask others: ACM DL/Guide - CiteSeerx - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2016
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak: The landscape of bounds for binary search trees. CoRR abs/1603.04892 (2016)
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLászló Kozma, Thatchaphol Saranurak: Binary search trees and rectangulations. CoRR abs/1603.08151 (2016)
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDanupon Nanongkai, Thatchaphol Saranurak: Dynamic Spanning Forest with Worst-Case Update Time: Adaptive, Las Vegas, and $O(n^{1/2-ε})$-Time. CoRR abs/1611.03745 (2016)
2015
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak: Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA 2015: 300-312
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak: Pattern-Avoiding Access in Binary Search Trees. FOCS 2015: 410-423
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. STOC 2015: 21-30
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak: Greedy Is an Almost Optimal Deque. WADS 2015: 152-165
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak: A Global Geometric View of Splaying. CoRR abs/1503.03105 (2015)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak: Greedy Is an Almost Optimal Deque. CoRR abs/1506.08319 (2015)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak: Pattern-avoiding access in binary search trees. CoRR abs/1507.06953 (2015)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. CoRR abs/1511.06773 (2015)
2013
i2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThatchaphol Saranurak: Finding the colors of the secret in Mastermind. CTW 2013: 209-212
2012
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThatchaphol Saranurak, Gorav Jindal: Subtraction makes computing integers faster .CoRR abs/1212.2549 (2012)

Coauthor Index

1Parinya Chalermsook[i9] [c4] [c3] [c1] [i6] [i5] [i4]
2Mayank Goswami[i9] [c4] [c3] [c1] [i6] [i5] [i4]
3Monika Henzinger[c2] [i3]
4Gorav Jindal[i1]
5László Kozma 0002[i9] [i8] [c4] [c3] [c1] [i6] [i5] [i4]
6Sebastian Krinninger[c2] [i3]
7Kurt Mehlhorn[i9] [c4] [c3] [c1] [i6] [i5] [i4]
8Danupon Nanongkai[i7] [c2] [i3]

 

Last update 2017-02-04 00:55 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page