Sledovat
Tsvi Kopelowitz
Tsvi Kopelowitz
E-mailová adresa ověřena na: biu.ac.il - Domovská stránka
Název
Citace
Citace
Rok
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
1962016
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
1702019
Property matching and weighted matching
A Amir, E Chencinski, C Iliopoulos, T Kopelowitz, H Zhang
Theoretical Computer Science 395 (2-3), 298-310, 2008
612008
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
542019
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
53*2018
Orienting fully dynamic graphs with worst-case time bounds
T Kopelowitz, R Krauthgamer, E Porat, S Solomon
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
532014
Fully Dynamic Connectivity in Amortized Expected Time
SE Huang, D Huang, T Kopelowitz, S Pettie, M Thorup
TheoretiCS 2, 2023
522023
Suffix trays and suffix trists: Structures for faster text indexing
R Cole, T Kopelowitz, M Lewenstein
Algorithmica 72 (2), 450-466, 2015
51*2015
Conditional lower bounds for space/time tradeoffs
I Goldstein, T Kopelowitz, M Lewenstein, E Porat
Algorithms and Data Structures: 15th International Symposium, WADS 2017, St …, 2017
482017
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
472012
Dynamic weighted ancestors
T Kopelowitz, M Lewenstein
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
462007
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
45*2014
Generalized substring compression
O Keller, T Kopelowitz, S Landau, M Lewenstein
Annual Symposium on Combinatorial Pattern Matching, 26-38, 2009
40*2009
Faster worst case deterministic dynamic connectivity
C Kejlberg-Rasmussen, T Kopelowitz, S Pettie, M Thorup
arXiv preprint arXiv:1507.05944, 2015
39*2015
Mind the gap! online dictionary matching with one gap
A Amir, T Kopelowitz, A Levy, S Pettie, E Porat, BR Shalom
Algorithmica 81, 2123-2157, 2019
36*2019
Range non-overlapping indexing and successive list indexing
O Keller, T Kopelowitz, M Lewenstein
Algorithms and Data Structures: 10th International Workshop, WADS 2007 …, 2007
342007
On the longest common parameterized subsequence
O Keller, T Kopelowitz, M Lewenstein
Theoretical Computer Science 410 (51), 5347-5353, 2009
332009
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
32*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
282012
An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States
S Ben-Nun, T Kopelowitz, M Kraus, E Porat
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
262020
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20