Dana Ron

1. On Efficient Distance Approximation for Graph Properties
   2020/01/06 by Nimrod Fiat, Fiat, Nimrod, Dana Ron +1 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Topological and Geometric Data Analysis
2. Distributed Maximum Matching in Bounded Degree Graphs
   2014/07/29 by Guy Even, Even, Guy, Moti Medina +3 · 2 citations
   Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Privacy-Preserving Technologies in Data #Stochastic Gradient Optimization Techniques #and Cluster Computing (cs.DC)
3. A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded\n Minor
   2013/02/14 by Reut Levi, Levi, Reut, Dana Ron +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms
4. The Power of an Example: Hidden Set Size Approximation Using Group\n Queries and Conditional Sampling
   2014/04/20 by Dana Ron, Gilad Tsur, Ron, Dana +1 · 1 citation
   Computer Science · Mathematics · #Machine Learning and Algorithms #Complexity and Algorithms in Graphs #Limits and Structures in Graph Theory
5. Finding Cycles and Trees in Sublinear Time
   2010/07/23 by Artur Czumaj, Oded Goldreich, Czumaj, Artur +9 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Machine Learning and Algorithms #Privacy-Preserving Technologies in Data