Travelled to:1 × Canada
1 × Greece
1 × Latvia
1 × Switzerland
1 × United Kingdom
6 × USA
Collaborated with:O.Goldreich R.Levi M.A.Bender R.Rubinfeld M.Parnas M.Sudan I.Kremer N.Nisan M.J.Kearns R.E.Schapire L.Sellie A.Fernández A.Sahai S.P.Vadhan Y.Mansour Y.Freund
Talks about:graph (5) test (5) sublinear (2) properti (2) random (2) direct (2) degre (2) time (2) distribut (1) polynomi (1)
Person: Dana Ron
DBLP: Ron:Dana
Contributed to:
20132012
200920012000199919981997199519941993Wrote 12 papers:
- ICALP-v1-2013-LeviR #graph
- A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor (RL, DR), pp. 709–720.
- ICALP-v1-2012-LeviRR #testing
- Testing Similar Means (RL, DR, RR), pp. 629–640.
- STOC-2009-GoldreichR #on the #proximity #testing
- On proximity oblivious testing (OG, DR), pp. 141–150.
- STOC-2001-ParnasR #metric #testing
- Testing metric properties (MP, DR), pp. 276–285.
- ICALP-2000-BenderR #graph #sublinear #testing
- Testing Acyclicity of Directed Graphs in Sublinear Time (MAB, DR), pp. 809–820.
- STOC-1999-GoldreichRS #fault
- Chinese Remaindering with Errors (OG, DR, MS), pp. 225–234.
- STOC-1998-BenderFRSV #graph #power of
- The Power of a Pebble: Exploring and Mapping Directed Graphs (MAB, AF, DR, AS, SPV), pp. 269–278.
- STOC-1998-GoldreichR #graph #sublinear
- A Sublinear Bipartiteness Tester for Bunded Degree Graphs (OG, DR), pp. 289–298.
- STOC-1997-GoldreichR #bound #graph #testing
- Property Testing in Bounded Degree Graphs (OG, DR), pp. 406–415.
- STOC-1995-KremerNR #communication #complexity #on the #random
- On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.
- STOC-1994-KearnsMRRSS #on the
- On the learnability of discrete distributions (MJK, YM, DR, RR, RES, LS), pp. 273–282.
- STOC-1993-FreundKRRSS #automaton #finite #learning #performance #random
- Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.