| Higher lower bounds from the 3SUM conjecture T Kopelowitz, S Pettie, E Porat Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 133 | 2016 |
| An exponential separation between randomized and deterministic complexity in the LOCAL model YJ Chang, T Kopelowitz, S Pettie SIAM Journal on Computing 48 (1), 122-143, 2019 | 126 | 2019 |
| Property matching and weighted matching A Amir, E Chencinski, C Iliopoulos, T Kopelowitz, H Zhang Theoretical Computer Science 395 (2-3), 298-310, 2008 | 62 | 2008 |
| Orienting fully dynamic graphs with worst-case time bounds T Kopelowitz, R Krauthgamer, E Porat, S Solomon International Colloquium on Automata, Languages, and Programming, 532-543, 2014 | 43 | 2014 |
| Dynamic weighted ancestors T Kopelowitz, M Lewenstein Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 43 | 2007 |
| Suffix trays and suffix trists: Structures for faster text indexing R Cole, T Kopelowitz, M Lewenstein Algorithmica 72 (2), 450-466, 2015 | 41* | 2015 |
| Managing unbounded-length keys in comparison-driven data structures with applications to online indexing A Amir, G Franceschini, R Grossi, T Kopelowitz, M Lewenstein, ... SIAM Journal on Computing 43 (4), 1396-1416, 2014 | 37* | 2014 |
| On-line indexing for general alphabets via predecessor queries on subsets of an ordered list T Kopelowitz 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 283-292, 2012 | 37 | 2012 |
| Contention resolution with constant throughput and log-logstar channel accesses MA Bender, T Kopelowitz, S Pettie, M Young SIAM Journal on Computing 47 (5), 1735-1754, 2018 | 34* | 2018 |
| Generalized substring compression O Keller, T Kopelowitz, S Landau, M Lewenstein Annual Symposium on Combinatorial Pattern Matching, 26-38, 2009 | 34* | 2009 |
| Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time SE Huang, D Huang, T Kopelowitz, S Pettie Proceedings of the twenty-eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 33 | 2017 |
| Mind the Gap! A Amir, T Kopelowitz, A Levy, S Pettie, E Porat, BR Shalom Algorithmica 81 (6), 2123-2157, 2019 | 29* | 2019 |
| On the longest common parameterized subsequence O Keller, T Kopelowitz, M Lewenstein Theoretical Computer Science 410 (51), 5347-5353, 2009 | 29 | 2009 |
| Exponential separations in the energy complexity of leader election YJ Chang, T Kopelowitz, S Pettie, R Wang, W Zhan ACM Transactions on Algorithms (TALG) 15 (4), 1-31, 2019 | 28 | 2019 |
| Conditional lower bounds for space/time tradeoffs I Goldstein, T Kopelowitz, M Lewenstein, E Porat Workshop on Algorithms and Data Structures, 421-436, 2017 | 28 | 2017 |
| Range non-overlapping indexing and successive list indexing O Keller, T Kopelowitz, M Lewenstein Workshop on Algorithms and Data Structures, 625-636, 2007 | 28 | 2007 |
| Faster worst case deterministic dynamic connectivity C Kejlberg-Rasmussen, T Kopelowitz, S Pettie, M Thorup arXiv preprint arXiv:1507.05944, 2015 | 27* | 2015 |
| Sparse suffix tree construction in small space P Bille, J Fischer, IL Gørtz, T Kopelowitz, B Sach, HW Vildhøj International Colloquium on Automata, Languages, and Programming, 148-159, 2013 | 27* | 2013 |
| Forbidden patterns J Fischer, T Gagie, T Kopelowitz, M Lewenstein, V Mäkinen, L Salmela, ... Latin American Symposium on Theoretical Informatics, 327-337, 2012 | 25 | 2012 |
| How Hard is it to Find (Honest) Witnesses? I Goldstein, T Kopelowitz, M Lewenstein, E Porat arXiv preprint arXiv:1706.05815, 2017 | 22 | 2017 |
