E-LIB Suche - Ergebnisse für: Ron, Dana

1

Sample-Based Distance-Approximation for Subsequence-Freenes:

Cohen Sidon, Omer ; Ron, Dana
Algorithmica. , 2024

Link: https://doi.org/10.1007/..

2

A Lower Bound on the Complexity of Testing Grained Distribu..:

Goldreich, Oded ; Ron, Dana
computational complexity. 32 (2023) 2 - p. , 2023

Link: https://doi.org/10.1007/..

3

Testing Distributions of Huge Objects:

Goldreich, Oded ; Ron, Dana
TheoretiCS. 2 (2023) - p. , 2023

Link: https://doi.org/10.46298..

4

Optimal Distribution-Free Sample-Based Testing of Subsequen..:

Ron, Dana ; Rosin, Asaf
ACM Transactions on Computation Theory (TOCT). 14 (2022) 1 - p. 1-31 , 2022

Link: https://dl.acm.org/doi/1..

5

The Structure of Configurations in One-Dimensional Majority..:

, In: Lecture Notes in Computer Science; Cellular Automata,

Nakar, Yonatan ; Ron, Dana - p. 63-72 , 2022

Link: https://doi.org/10.1007/..

6

Optimal Distribution-Free Sample-Based Testing of Subsequen..:

Ron, Dana ; Rosin, Asaf
ACM Transactions on Computation Theory. 14 (2022) 1 - p. 1-31 , 2022

Link: https://doi.org/10.1145/..

7

Optimal Distribution-Free Sample-Based Testing of Subsequen..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Ron, Dana ; Rosin, Asaf - p. 337-256 , 2021

Link: https://doi.org/10.1137/..

8

Property Testing of the Boolean and Binary Rank:

Parnas, Michal ; Ron, Dana ; Shraibman, Adi
Theory of Computing Systems. 65 (2021) 8 - p. 1193-1210 , 2021

Link: https://doi.org/10.1007/..

9

Optimal distribution-free sample-based testing of subsequen..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Ron, Dana ; Rosin, Asaf - p. 337-356 , 2021

Link: https://dl.acm.org/doi/1..

10

On Efficient Distance Approximation for Graph Properties:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Fiat, Nimrod ; Ron, Dana - p. 1618-1637 , 2021

Link: https://doi.org/10.1137/..

11

On efficient distance approximation for graph properties:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Fiat, Nimrod ; Ron, Dana - p. 1618-1637 , 2021

Link: https://dl.acm.org/doi/1..

12

Property testing of planarity in the CONGEST model:

Levi, Reut ; Medina, Moti ; Ron, Dana
Distributed Computing. 34 (2020) 1 - p. 15-32 , 2020

Link: https://doi.org/10.1007/..

13

On the Relation Between the Relative Earth Mover Distance a..:

, In: Lecture Notes in Computer Science; Computational Complexity and Property Testing,

Goldreich, Oded ; Ron, Dana - p. 141-151 , 2020

Link: https://doi.org/10.1007/..

14

On Approximating the Number of $k$-Cliques in Sublinear Tim:

Eden, Talya ; Ron, Dana ; Seshadhri, C.
SIAM Journal on Computing. 49 (2020) 4 - p. 747-771 , 2020

Link: https://doi.org/10.1137/..

15

Testing Bounded Arboricity:

Eden, Talya ; Levi, Reut ; Ron, Dana
ACM Transactions on Algorithms (TALG). 16 (2020) 2 - p. 1-22 , 2020

Link: https://dl.acm.org/doi/1..