Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Ron, Dana"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deterministic stateless centralized local algorithms for bounded degree graphs
Guy Even
,
Moti Medina
,
Dana Ron
Lecture Notes in Computer Science
8737
, 2014, pp. 394-405
Testing similar means
Reut Levi
,
Dana Ron
,
Ronitt Rubinfeld
SIAM Journal on Discrete Mathematics
28
(4), 2014, pp. 1699-1724
A quasi-polynomial time partition oracle for graphs with an excluded minor
Reut Levi
,
Dana Ron
Lecture Notes in Computer Science
7965
, 2013, pp. 709-720
Sublinear algorithms for approximating string compressibility
Sofya Raskhodnikova
,
Dana Ron
,
Ronitt Rubinfeld
,
Adam Smith
Algorithmica
65
(3), 2013, pp. 685-709
Testing similar means
Reut Levi
,
Dana Ron
,
Ronitt Rubinfeld
Lecture Notes in Computer Science
7391
, 2012, pp. 629-640
Testing computability by width-two OBDDs
Dana Ron
,
Gilad Tsur
Theoretical Computer Science
420
, 2012, pp. 64-79
Algorithmic aspects of property testing in the dense graphs model
Oded Goldreich
,
Dana Ron
SIAM Journal on Computing
40
(2), 2011, pp. 376-445
On proximity-oblivious testing
Oded Goldreich
,
Dana Ron
SIAM Journal on Computing
40
(2), 2011, pp. 534-566
Counting stars and other small subgraphs in sublinear-time
Mira Gonen
,
Dana Ron
,
Yuval Shavitt
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1365-1411
Testing Eulerianity and connectivity in directed sparse graphs
Yaron Orenstein
,
Dana Ron
Theoretical Computer Science
412
(45), 2011, pp. 6390-6408
On the benefits of adaptivity in property testing of dense graphs
Mira Gonen
,
Dana Ron
Algorithmica
58
(4), 2010, pp. 811-830
Testing computability by width-2 OBDDs where the variable order is unknown
Dana Ron
,
Gilad Tsur
Lecture Notes in Computer Science
6078
, 2010, pp. 131-142
On proximity oblivious testing
Oded Goldreich
,
Dana Ron
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 141-150
Strong lower bounds for approximating distribution support size and the distinct elements problem
Sofya Raskhodnikova
,
Dana Ron
,
Amir Shpilka
,
Adam Smith
SIAM Journal on Computing
39
(3), 2009, pp. 813-842
Testing triangle-freeness in general graphs
Noga Alon
,
Tali Kaufman
,
Michael Krivelevich
,
Dana Ron
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 786-819
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Michal Parnas
,
Dana Ron
Theoretical Computer Science
381
(1-3), 2007, pp. 183-196
The hardness of the Expected Decision Depth problem
Dana Ron
,
Amir Rosenfeld
,
Salil Vadhan
Information Processing Letters
101
(3), 2007, pp. 112-118
Testing polynomials over general fields
Tali Kaufman
,
Dana Ron
SIAM Journal on Computing
36
(3), 2006, pp. 779-802
Tolerant property testing and distance approximation
Michal Parnas
,
Dana Ron
,
Ronitt Rubinfeld
Journal of Computer and System Sciences
72
(6), 2006, pp. 1012-1042
Testing of clustering
Noga Alon
,
Seannie Dar
,
Michal Parnas
,
Dana Ron
SIAM Review
46
(2), 2004, pp. 285-308
Testing juntas
Eldar Fischer
,
Guy Kindler
,
Dana Ron
,
Shmuel Safra
,
Alex Samorodnitsky
Journal of Computer and System Sciences
68
(4), 2004, pp. 753-787
Tight bounds for testing bipartiteness in general graphs
Tali Kaufman
,
Michael Krivelevich
,
Dana Ron
SIAM Journal on Computing
33
(6), 2004, pp. 1441-1483
Testing of clustering
Noga Alon
,
Seannie Dar
,
Michal Parnas
,
Dana Ron
SIAM Journal on Discrete Mathematics
16
(3), 2003, pp. 393-417
Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
Guy Even
,
Zvi Lotker
,
Dana Ron
,
Shakhar Smorodinsky
SIAM Journal on Computing
33
(1), 2003, pp. 94-136
A Markovian model for the acquisition of morphological structure
Leonid Kontorovich
,
Dana Ron
,
Yoram Singer
Technical Report (2003-26), 2003
Seiten 1
2
3
>