The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Abstract
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning identical copies of a simple algorithm to small local portions of the problem input. The algorithm is designed so that when the copies are executed in parallel the correct problem output is produced very quickly. A very simple Monte Carlo algorithm for the MIS problem is presented which is based upon this strategy. The second strategy is a general and powerful technique for removing randomization from algorithms. This strategy is used to convert the Monte Carlo algorithm for this MIS problem into a simple deterministic algorithm with the same parallel running time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
An Introduction to Probability Theory and Its Applications, Vol. 2
Feller, W., & Teichmann, T. (1967) · Physics Today · doi:10.1063/1.3034322 · Cited by 1,280
Parallel models of associative memory
Heath, R. (1982) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(82)90036-0 · Cited by 1,095
Parallelism in random access machines
Fortune, S., & Wyllie, J. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804339 · Cited by 891
A taxonomy of problems with fast parallel algorithms
Cook, S. A. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80041-3 · Cited by 641
On the application of the Borel-Cantelli lemma
Chung, K. L., & Erdös, P. (1952) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1952-0045327-5 · Cited by 225
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Concentration of Measure for the Analysis of Randomized Algorithms
Dubhashi, D. P., & Panconesi, A. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511581274 · Cited by 945
BoomerAMG: A parallel algebraic multigrid solver and preconditioner
Henson, V. E., & Yang, U. M. (2002) · Applied Numerical Mathematics · doi:10.1016/s0168-9274(01)00115-5 · Cited by 885
hypre: A Library of High Performance Preconditioners
Falgout, R. D., & Yang, U. M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47789-6_66 · Cited by 867
A fast and simple randomized parallel algorithm for the maximal independent set problem
Alon, N., Babai, L., & Itai, A. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90019-2 · Cited by 823
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
Small-Bias Probability Spaces: Efficient Constructions and Applications
Naor, J., & Naor, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222053 · Cited by 560
Simple Constructions of Almost k‐wise Independent Random Variables
Alon, N., Goldreich, O., Håstad, J., & Peralta, R. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030308 · Cited by 556
A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
Karypis, G., & Kumar, V. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1403 · Cited by 500
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Abrams, Z., Goel, A., & Plotkin, S. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984684 · Cited by 362
A simple parallel algorithm for the maximal independent set problem
Luby, M. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22146 · Cited by 349
Self-citationThe tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993501 · Cited by 312
Parallel multilevel k-way partitioning scheme for irregular graphs
Karypis, G., & Kumar, V. (1996) · Proceedings of the 1996 ACM/IEEE conference on Supercomputing · doi:10.1145/369028.369103 · Cited by 310
The Algorithmic Aspects of the Regularity Lemma
Alon, N., Duke, R. A., Lefmann, H., Rodl, V., & Yuster, R. (1994) · Journal of Algorithms · doi:10.1006/jagm.1994.1005 · Cited by 305
Simple Local Search Problems that are Hard to Solve
Schäffer, A. A. (1991) · SIAM Journal on Computing · doi:10.1137/0220004 · Cited by 291
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
Naor, M., & Reingold, O. (1999) · Journal of Cryptology · doi:10.1007/pl00003817 · Cited by 285
What cannot be computed locally!
Kuhn, F., Moscibroda, T., & Wattenhofer, R. (2004) · Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing · doi:10.1145/1011767.1011811 · Cited by 274
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
Chaporkar, P., Kar, K., Luo, X., & Sarkar, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913537 · Cited by 253
Metadata
- Authors
- Luby, M.
- Venue
- SIAM Journal on Computing
- Published
- 1986-11
- Volume
- 15
- Issue
- 4
- Pages
- 1036-1053
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2100061495
- Cited by
- 1,147
- References
- 8
- FWCI
- 15.74
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.