Tsvi Kopelowitz

From MaRDI portal
Person:294930

Available identifiers

zbMath Open kopelowitz.tsviMaRDI QIDQ294930

List of research outcomes

PublicationDate of PublicationType
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue2023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q60844052023-10-31Paper
Incremental Edge Orientation in Forests2023-09-20Paper
https://portal.mardi4nfdi.de/entity/Q58744432023-02-07Paper
Support optimality and adaptive cuckoo filters2022-03-25Paper
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams2021-07-28Paper
AnO(log3/2n) Parallel Time Population Protocol for Majority withO(logn) States2021-03-15Paper
Contention resolution without collision detection2021-01-19Paper
Approximating text-to-pattern Hamming distances2021-01-19Paper
The Online House Numbering Problem: Min-Max Online List Labeling2020-05-27Paper
Dynamic dictionary matching in the online model2020-01-16Paper
Exponential Separations in the Energy Complexity of Leader Election2019-12-02Paper
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance2019-10-25Paper
Mind the gap!2019-05-17Paper
Streaming pattern matching with \(d\) wildcards2019-05-07Paper
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model2019-02-08Paper
Sparse Text Indexing in Small Space2018-11-05Paper
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses2018-10-11Paper
Higher Lower Bounds from the 3SUM Conjecture2018-07-16Paper
Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time2018-07-16Paper
File Maintenance: When in Doubt, Change the Layout!2018-07-16Paper
Simultaneously load balancing for every p-norm, with reassignments2018-05-03Paper
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap2018-04-19Paper
Streaming Pattern Matching with d Wildcards2018-03-02Paper
https://portal.mardi4nfdi.de/entity/Q46063162018-03-02Paper
Faster worst case deterministic dynamic connectivity2018-03-02Paper
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.2017-10-17Paper
Color-Distance Oracles and Snippets2017-10-17Paper
Contention resolution with log-logstar channel accesses2017-09-29Paper
Brief Announcement2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650852017-09-29Paper
Conditional lower bounds for space/time tradeoffs2017-09-22Paper
Exponential separations in the energy complexity of leader election2017-08-17Paper
The property suffix tree with dynamic properties2016-06-16Paper
Dynamic Set Intersection2015-10-30Paper
Suffix trays and suffix trists: structures for faster text indexing2015-07-10Paper
https://portal.mardi4nfdi.de/entity/Q29346392014-12-18Paper
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing2014-11-14Paper
Cross-document pattern matching2014-08-13Paper
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds2014-07-01Paper
Generalized substring compression2014-03-13Paper
Sparse Suffix Tree Construction in Small Space2013-08-06Paper
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting2013-03-21Paper
Forbidden Patterns2012-06-29Paper
The Property Suffix Tree with Dynamic Properties2010-07-26Paper
On the longest common parameterized subsequence2009-11-18Paper
Suffix trays and suffix trists: structures for faster text indexing2009-03-12Paper
Range Non-overlapping Indexing and Successive List Indexing2009-02-17Paper
Property matching and weighted matching2008-07-10Paper
On the Longest Common Parameterized Subsequence2008-06-17Paper
Improved algorithms for polynomial-time decay and time-decay with additive error2008-04-11Paper
Property Matching and Weighted Matching2007-09-14Paper
Theoretical Computer Science2006-11-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tsvi Kopelowitz