Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference30 articles.
1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem,Journal of Algorithms,7 (1986), 567–583.
2. N. Alon, J. Brusck, J. Naor, M. Naor, and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs,IEEE Transactions on Information Theory,38 (1992), 509–516.
3. N. Alon, Z. Galil, and O. Margalit, On the exponent of the All Pairs Shortest Path problem,Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, 1991, pp. 569–575. AlsoJournal of Computer and System Sciences, to appear.
4. N. Alon, Z. Galil, O. Margalit. and M. Naor, Witnesses for Boolean matrix multiplication and for shortest paths,Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, 1992, pp. 417–426.
5. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almostk-wise independent random variables,Proc. 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 544–553. AlsoRandom Structures and Algorithms,3 (1992), 289–304.
Cited by
84 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products;International Journal of Foundations of Computer Science;2023-11-10
2. A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms;Algorithms;2022-11-28
3. The FastMap Pipeline for Facility Location Problems;PRIMA 2022: Principles and Practice of Multi-Agent Systems;2022-11-12
4. Sparse hypergraphs: From theory to applications;SCIENTIA SINICA Mathematica;2022-07-28
5. Can't See the Forest for the Trees;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20