Tsvi Kopelowitz
Orcid: 0000-0002-3525-8314Affiliations:
- Bar-Ilan University, Ramat Gan, Israel
According to our database1,
Tsvi Kopelowitz
authored at least 70 papers
between 2005 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Fully Dynamic Connectivity in O(log n(loglog n)<sup>2</sup>) Amortized Expected Time.
TheoretiCS, 2023
2022
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue.
ACM Trans. Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
2021
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
An O(log<sup>3/2</sup>n) Parallel Time Population Protocol for Majority with O(log n) States.
CoRR, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
An <i>O</i>(log<sup>3/2</sup> <i>n</i>) Parallel Time Population Protocol for Majority with <i>O</i>(log <i>n</i>) States.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020
2019
ACM Trans. Algorithms, 2019
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model.
SIAM J. Comput., 2019
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
2018
SIAM J. Comput., 2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
Fully Dynamic Connectivity in <i>O</i>(log <i>n</i>(log log <i>n</i>)<sup>2</sup>) Amortized Expected Time.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
2016
Fully Dynamic Connectivity in O(log n(log log n)<sup>2</sup>) Amortized Expected Time.
CoRR, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016
2015
Breaking the Variance: Approximating the Hamming Distance in $\tilde O(1/ε)$ Time Per Alignment.
CoRR, 2015
Algorithmica, 2015
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing.
SIAM J. Comput., 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
2013
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing.
CoRR, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
2012
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
Proceedings of the String Processing and Information Retrieval, 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2009
2008
Theory Comput. Syst., 2008
2007
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2005
Proceedings of the String Processing and Information Retrieval, 2005