Home › Entities › academia › An O(log<sub>2</sub> N) SMC<sup>2</sup> Algorithm on Distributed Memory with an Approx. Optimal L-Kernel

An O(log<sub>2</sub> N) SMC<sup>2</sup> Algorithm on Distributed Memory with an Approx. Optimal L-Kernel

Research article (2023 IEEE Symposium Sensor Data Fusion and International Conference on Multisensor Fusion and Integration (SDF-MFI), 2023) · cited 11× · AI/ML
academia openalex:W4390044799
Press Enter · cited answer in seconds

An O(log2 N) SMC2 Algorithm on Distributed Memory with an Approx. Optimal L-Kernel

Summary

An O(log2 N) SMC2 Algorithm on Distributed Memory with an Approx. Optimal L-Kernel is a scholarly article[1].

Key Facts

  • An O(log2 N) SMC2 Algorithm on Distributed Memory with an Approx. Optimal L-Kernel's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). An O(log<sub>2</sub> N) SMC<sup>2</sup> Algorithm on Distributed Memory with an Approx. Optimal L-Kernel. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-o-log-sub-2-sub-n-smc-sup-2-sup-algorithm-on-distributed-memory-with-an-approx-optimal-l-kernel
MLA “An O(log<sub>2</sub> N) SMC<sup>2</sup> Algorithm on Distributed Memory with an Approx. Optimal L-Kernel.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-o-log-sub-2-sub-n-smc-sup-2-sup-algorithm-on-distributed-memory-with-an-approx-optimal-l-kernel.
BibTeX @misc{4ortxyz_an-o-log-sub-2-sub-n-smc-sup-2-sup-algorithm-on-distributed-memory-with-an-approx-optimal-l-kernel_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An O(log<sub>2</sub> N) SMC<sup>2</sup> Algorithm on Distributed Memory with an Approx. Optimal L-Kernel}}, year = {2026}, url = {https://4ort.xyz/entity/an-o-log-sub-2-sub-n-smc-sup-2-sup-algorithm-on-distributed-memory-with-an-approx-optimal-l-kernel}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An O(log<sub>2</sub> N) SMC<sup>2</sup> Algorithm on Distributed Memory with an Approx. Optimal L-Kernel — https://4ort.xyz/entity/an-o-log-sub-2-sub-n-smc-sup-2-sup-algorithm-on-distributed-memory-with-an-approx-optimal-l-kernel (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/an-o-log-sub-2-sub-n-smc-sup-2-sup-algorithm-on-distributed-memory-with-an-approx-optimal-l-kernel · Last refreshed: