Zoekresultaten - Rubinfeld, Ronitt

Monotone probability distributions over the Boolean cube can be learned with sublinear samples door Rubinfeld, Ronitt, Vasilyan, Arsen

Volledige tekst
Volledige tekst

Testing distributional assumptions of learning algorithms door Rubinfeld, Ronitt, Vasilyan, Arsen

Volledige tekst
Volledige tekst

Testing Bipartiteness in Logarithmic Rounds door Fei, Yumou, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Local Algorithms for Sparse Spanning Graphs door Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

A Local Algorithm for Constructing Spanners in Minor-Free Graphs door Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Sampling Multiple Edges Efficiently door Eden, Talya, Mossel, Saleet, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling door Compton, Spencer, Mitrović, Slobodan, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Properly learning monotone functions via local reconstruction door Lange, Jane, Rubinfeld, Ronitt, Vasilyan, Arsen

Volledige tekst
Volledige tekst

Locally computing edge orientations door Mitrović, Slobodan, Rubinfeld, Ronitt, Singhal, Mihir

Volledige tekst
Volledige tekst

Quality control in sublinear time: a case study via random graphs door Marcussen, Cassandra, Rubinfeld, Ronitt, Sudan, Madhu

Volledige tekst
Volledige tekst

Testable algorithms for approximately counting edges and triangles in sublinear time and space door Eden, Talya, Rubinfeld, Ronitt, Vasilyan, Arsen

Volledige tekst
Volledige tekst

No Price Tags? No Problem: Query Strategies for Unpriced Information door Nadimpalli, Shivam, Qiao, Mingda, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Quality Control Algorithms for Pattern Counting door Marcussen, Cassandra, Rubinfeld, Ronitt, Sudan, Madhu

Volledige tekst
Volledige tekst

Graph Spectral Sparsification is in Catalytic Logspace door Marcussen, Cassandra, Pyne, Edward, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Local Access to Huge Random Objects through Partial Sampling door Biswas, Amartya Shankha, Rubinfeld, Ronitt, Yodpinyanee, Anak

Volledige tekst
Volledige tekst

Local Access to Random Walks door Biswas, Amartya Shankha, Pyne, Edward, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time door Biswas, Amartya Shankha, Eden, Talya, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Stochastic Matching via In-n-Out Local Computation Algorithms door Azarmehr, Amir, Behnezhad, Soheil, Ghafari, Alma, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst

Optimal Algorithms for Augmented Testing of Discrete Distributions door Aliakbarpour, Maryam, Indyk, Piotr, Rubinfeld, Ronitt, Silwal, Sandeep

Volledige tekst
Volledige tekst

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time door Eden, Talya, Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

Volledige tekst
Volledige tekst