CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Naor-M"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2014 | 1995 | 1992 | 1991 | 1990
Number of items: 7.

2014

Rabani, Yuval and Schulman, Leonard J. and Swamy, Chaitanya (2014) Learning mixtures of arbitrary distributions over large discrete domains. In: ITCS '14 Proceedings of the 5th conference on Innovations in theoretical computer science. ACM , New York, NY, pp. 207-224. ISBN 978-1-4503-2698-8. https://resolver.caltech.edu/CaltechAUTHORS:20161212-165501273

Moore, Cristopher and Schulman, Leonard J. (2014) Tree Codes and a Conjecture on Exponential Sums. In: Proceedings of the 5th conference on Innovations in theoretical computer science. ACM , New York, NY, pp. 145-154. ISBN 978-1-4503-2698-8. https://resolver.caltech.edu/CaltechAUTHORS:20140331-152623727

1995

Naor, Moni and Schulman, Leonard J. and Srinivasan, Aravind (1995) Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press , Los Alamitos, CA, pp. 182-191. ISBN 0-8186-7183-1. https://resolver.caltech.edu/CaltechAUTHORS:20120223-112750729

1992

Ajtai, M. and Alon, N. and Bruck, J. et al. (1992) Fault tolerant graphs, perfect hash functions and disjoint paths. In: 33rd Annual Symposium on Foundations of Computer Science, 1992. IEEE , Piscataway, NJ, pp. 693-702. ISBN 0818629002. https://resolver.caltech.edu/CaltechAUTHORS:ATJfocs92

Alon, Noga and Bruck, Jehoshua and Naor, Joseph et al. (1992) Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38 (2). pp. 509-516. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:ALOieeetit92

1991

Alon, Noga and Bruck, Jehoshua and Naor, Joseph et al. (1991) Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. In: IEEE International Symposium on Information Theory (ISIT '91). IEEE , Piscataway, NJ, p. 139. ISBN 0780300564. https://resolver.caltech.edu/CaltechAUTHORS:ALOisit91

1990

Bruck, Jehoshua and Naor, Moni (1990) The hardness of decoding linear codes with preprocessing. IEEE Transactions on Information Theory, 36 (2). pp. 381-385. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90b

This list was generated on Fri Aug 7 04:02:02 2020 PDT.