Research output per year
Research output per year
- 50 - 57 out of 57 results
Search results
-
1994
On the learnability of discrete distributions
Kearns, M., Rubinfeld, R., Mansour, Y., Schapire, R. E., Ron, D. & Univemity, H., 23 May 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 273-282 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
1993
Efficient learning of typical finite automata from random walks
Freund, Y., Keams, M., Ron, D., Rubinfeld, R., Schapire, R. E. & Sellie, L., 1 Jun 1993, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, p. 315-324 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129585).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Learning fallible finite state automata
Ron, D. & Rubinfeld, R., 1993, Proc 6 Annu ACM Conf Comput Learn Theory. Association for Computing Machinery (ACM), p. 218-227 10 p. (Proc 6 Annu ACM Conf Comput Learn Theory).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
1992
Interactive proofs with space bounded provers
Kilian, J. & Rubinfeld, R., 1992, Advances in Cryptology — CRYPTO 1991, Proceedings. Feigenbaum, J. (ed.). Springer Verlag, p. 225-231 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 576 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access -
Reconstructing algebraic functions from mixed data
Ar, S., Lipton, R. J., Rubinfeld, R. & Sudan, M., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 503-512 10 p. 267801. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Self-testing polynomial functions efficiently and over rational domains
Rubinfeld, R. & Sudan, M., 1 Sep 1992, Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Association for Computing Machinery, p. 23-32 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129721).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
1990
Self-testing/correcting with applications to numerical problems
Blum, M., Luby, M. & Rubinfield, R., 1990, Proc 22nd Annu ACM Symp Theory Comput. Association for Computing Machinery (ACM), p. 73-83 11 p. (Proc 22nd Annu ACM Symp Theory Comput).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access