Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory (Q4432766): Difference between revisions

Latest revision as of 12:07, 6 June 2024

scientific article; zbMATH DE number 1997819

Language	Label	Description	Also known as
English	Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory	scientific article; zbMATH DE number 1997819

Statements

instance of

scholarly article

0 references

title

Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory (English)

0 references

0 references

0 references

0 references

0 references

0 references

29 October 2003

0 references

zbMATH Keywords

random walks

0 references

complete network

0 references

clique

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/net.10094

0 references

cites work

Q4527009

0 references

Q4252740

0 references

Lower bounds for noisy Boolean decision trees

0 references

Q4250197

0 references

Q3670933

0 references

Identifiers

zbMATH Open document ID

1031.68013

0 references

DOI

10.1002/net.10094

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4432766

@@ Property / author @@
-Evangelos Kranakis
@@ Property / author: Evangelos Kranakis / rank @@
-Normal rank
@@ Property / author @@
-Danny Krizanc
@@ Property / author: Danny Krizanc / rank @@
-Normal rank
@@ Property / author @@
+Evangelos Kranakis
@@ Property / author: Evangelos Kranakis / rank @@
+Normal rank
@@ Property / author @@
+Danny Krizanc
@@ Property / author: Danny Krizanc / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.10094
@@ Property / full work available at URL: https://doi.org/10.1002/net.10094 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2055943982
@@ Property / OpenAlex ID: W2055943982 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527009
@@ Property / cites work: Q4527009 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252740
@@ Property / cites work: Q4252740 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for noisy Boolean decision trees
@@ Property / cites work: Lower bounds for noisy Boolean decision trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250197
@@ Property / cites work: Q4250197 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3670933
@@ Property / cites work: Q3670933 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4432766