Bounded Memory in Distributed Networks | Paper Citation Record

Observation 4e94bc7e-4f70-443e-945d-7bbf26433298 · outbound

This paper cites IEEE Std 802.1D-2004 (Revision of IEEE Std 802.1D-1998) , pages 1–281, 2004.

Bounded Memory in Distributed Networks IEEE Std 802.1D-2004 (Revision of IEEE Std 802.1D-1998) , pages 1–281, 2004

Reference 1

Resolution: verified exact; raw_fallback, observed 2026-08-07T04:22:39.183738Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5d9c2e7b-44b8-4140-abed-ccbc29118499 · outbound

This paper cites Mergeable summaries.

Bounded Memory in Distributed Networks Mergeable summaries

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.807116Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1985294c-1d3b-407f-afb6-c69fd355954d · outbound

This paper cites Size bounds and query plans for relational joins.

Bounded Memory in Distributed Networks Size bounds and query plans for relational joins

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.663742Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 72255e63-9e60-4669-9dde-2f0d4ffbcdc7 · outbound

This paper cites Improved routing strategies with succinct tables.

Bounded Memory in Distributed Networks Improved routing strategies with succinct tables

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.668125Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 42d27321-1a29-4086-b806-10de7cbb804d · outbound

This paper cites Routing with polynomial communication- space trade-off.

Bounded Memory in Distributed Networks Routing with polynomial communication- space trade-off

Reference 5

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T04:22:39.796577Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 598cb300-124d-4ba4-bb4b-b3b79f4d7c87 · outbound

This paper cites Efficient mea- surement on programmable switches using probabilistic recirculation.

Bounded Memory in Distributed Networks Efficient mea- surement on programmable switches using probabilistic recirculation

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.785664Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f68c5093-d153-4d02-b560-3773777cac98 · outbound

This paper cites Pint: Probabilistic in-band network telemetry.

Bounded Memory in Distributed Networks Pint: Probabilistic in-band network telemetry

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.774897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d12140a1-cb8b-48ff-ab48-8d4376c99acc · outbound

This paper cites Onos: towards an open, distributed sdn os.

Bounded Memory in Distributed Networks Onos: towards an open, distributed sdn os

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.764193Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3948303d-1a17-4ea6-b952-cb9142b0eb20 · outbound

This paper cites Tres observaciones sobre el algebra lineal.

Bounded Memory in Distributed Networks Tres observaciones sobre el algebra lineal

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.752913Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 59b3bc10-9f80-42bd-a170-d36f802cb7b2 · outbound

This paper cites P4: Programming protocol-independent packet processors.

Bounded Memory in Distributed Networks P4: Programming protocol-independent packet processors

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.741106Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 19347c17-cbc3-40ab-9509-3f461fbd352d · outbound

This paper cites Forwarding metamorphosis: Fast programmable match-action processing in hardware for sdn.

Bounded Memory in Distributed Networks Forwarding metamorphosis: Fast programmable match-action processing in hardware for sdn

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.729063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f0f4974b-71dd-4f88-826b-5a617180b111 · outbound

This paper cites Trident Programmable Switch.

Bounded Memory in Distributed Networks Trident Programmable Switch

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.716546Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d5f0dd1a-85dc-42d3-91e9-d250014fc979 · outbound

This paper cites Compact routing messages in self-healing trees.

Bounded Memory in Distributed Networks Compact routing messages in self-healing trees

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.699419Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0b72eea9-81e9-454c-bd98-f3ae6a4bc1a8 · outbound

This paper cites Fully compact rout- ing in low memory self-healing trees.

Bounded Memory in Distributed Networks Fully compact rout- ing in low memory self-healing trees

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.710538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1793edf9-8f07-4444-98cb-1d19707f0aa3 · outbound

This paper cites Tight distributed listing of cliques.

Bounded Memory in Distributed Networks Tight distributed listing of cliques

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.687961Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4b6f92ae-c74c-4536-bd56-873d88e3dbcb · outbound

This paper cites Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs.

Bounded Memory in Distributed Networks Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs

Reference 16

Resolution: malformed identifier; doi_truncated, observed 2026-08-07T04:22:38.058350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a805df40-5b9a-4f10-8475-84dd3c5bcc35 · outbound

This paper cites On distributed listing of cliques.

Bounded Memory in Distributed Networks On distributed listing of cliques

Reference 17

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T04:22:39.032862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8f428595-3abe-431c-bdd4-459a6cc40b00 · outbound

This paper cites Deterministic expander routing: Faster and more versatile.

Bounded Memory in Distributed Networks Deterministic expander routing: Faster and more versatile

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.676764Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 420baeb2-ec7b-48e6-93c6-e8c195ab7f25 · outbound

This paper cites The complexity of distributed approximation of packing and covering integer linear programs.

Bounded Memory in Distributed Networks The complexity of distributed approximation of packing and covering integer linear programs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.664839Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8645d7bc-490e-4b6b-b65b-2161a03b458a · outbound

This paper cites Near- optimal distributed triangle enumeration via expander decompositions.

Bounded Memory in Distributed Networks Near- optimal distributed triangle enumeration via expander decompositions

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.653443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 47ef3c7f-cd3d-4780-b07d-d3a8a40b9f63 · outbound

This paper cites Distributed triangle detection via expander decomposition.

Bounded Memory in Distributed Networks Distributed triangle detection via expander decomposition

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.642293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 22bf4d57-bef1-4c40-b2e2-72adfb2bb169 · outbound

This paper cites Improved distributed expander de- composition and nearly optimal triangle enumeration.

Bounded Memory in Distributed Networks Improved distributed expander de- composition and nearly optimal triangle enumeration

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.741825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38cc9086-b7ce-4fda-90aa-cfe749c5dd29 · outbound

This paper cites Deterministic distributed expander decomposition and routing with applications in distributed derandomization.

Bounded Memory in Distributed Networks Deterministic distributed expander decomposition and routing with applications in distributed derandomization

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.630848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation effc8210-f96a-46d0-b420-b7ba2b376292 · outbound

This paper cites tri, tri again.

Bounded Memory in Distributed Networks tri, tri again

Reference 24

Resolution: malformed identifier; no resolver link, observed 2026-08-07T04:22:37.748908Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b4482b4-a751-4398-932d-f629c8701f28 · outbound

This paper cites Sublinear- time distributed algorithms for detecting small cliques and even cycles.

Bounded Memory in Distributed Networks Sublinear- time distributed algorithms for detecting small cliques and even cycles

Reference 25

Resolution: verified exact; doi, observed 2026-08-07T04:22:38.039172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 89a971cd-f6cc-4fac-9f13-d4044e659ebf · outbound

This paper cites Near-optimal distributed routing with low memory.

Bounded Memory in Distributed Networks Near-optimal distributed routing with low memory

Reference 26

Resolution: verified exact; doi, observed 2026-08-07T04:22:38.026465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1a7fea25-cc97-4e80-a096-e56f80fd58f3 · outbound

This paper cites On efficient distributed construction of near optimal routing schemes.

Bounded Memory in Distributed Networks On efficient distributed construction of near optimal routing schemes

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.618592Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 16d58a8c-4c78-4174-a6f9-4dedb55fcfc5 · outbound

This paper cites Stone age distributed computing.

Bounded Memory in Distributed Networks Stone age distributed computing

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.607648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b0ec82ad-591c-4070-ae78-0906f38ee8c3 · outbound

This paper cites Graph distances in the streaming model: the value of space.

Bounded Memory in Distributed Networks Graph distances in the streaming model: the value of space

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.597011Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation dc369664-1ffa-4987-85a4-9a06db151118 · outbound

This paper cites Orion: Google’s{Software-Defined} networking control plane.

Bounded Memory in Distributed Networks Orion: Google’s{Software-Defined} networking control plane

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.584998Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5c99007d-7014-4127-aa03-44e905260fa0 · outbound

This paper cites Possibilities and impossibilities for distributed subgraph detection.

Bounded Memory in Distributed Networks Possibilities and impossibilities for distributed subgraph detection

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.572742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f8e2e491-a9fb-4747-a8c6-44a504ffed8a · outbound

This paper cites Fisher and F.

Bounded Memory in Distributed Networks Fisher and F

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.560681Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7f0b56e2-8843-4119-b8cc-13e5c1465044 · outbound

This paper cites Memory requirement for universal routing schemes.

Bounded Memory in Distributed Networks Memory requirement for universal routing schemes

Reference 33

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T04:22:38.876198Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fa217eca-372a-453f-9654-3ca5ecdb3d11 · outbound

This paper cites Local memory requirement of universal routing schemes.

Bounded Memory in Distributed Networks Local memory requirement of universal routing schemes

Reference 34

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T04:22:38.771404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fd349127-93f7-40ea-ab61-d4dc33a26bc4 · outbound

This paper cites Header-size lower bounds for end-to-end communication in memoryless networks.

Bounded Memory in Distributed Networks Header-size lower bounds for end-to-end communication in memoryless networks

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.549881Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 929148a3-5c6f-4bf1-a334-1cea37fb7c1d · outbound

This paper cites Cr-precis: A deterministic summary structure for update data streams.

Bounded Memory in Distributed Networks Cr-precis: A deterministic summary structure for update data streams

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.538672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6b275804-cd61-4bf0-8ef0-7bf57ec27118 · outbound

This paper cites Memory requirements for routing in distributed networks (extended abstract).

Bounded Memory in Distributed Networks Memory requirements for routing in distributed networks (extended abstract)

Reference 37

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T04:22:38.703733Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2c23e1d3-ceb1-4179-8495-c75e67413c42 · outbound

This paper cites On the complexity of local distributed graph problems.

Bounded Memory in Distributed Networks On the complexity of local distributed graph problems

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.808599Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aecd8ac4-1667-4332-b78a-cc42ad32a948 · outbound

This paper cites Distributed MST and routing in almost mixing time.

Bounded Memory in Distributed Networks Distributed MST and routing in almost mixing time

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.528401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e59dcdeb-0a16-4f38-a45f-32af9e9fded8 · outbound

This paper cites New distributed algorithms in almost mixing time via transformations from parallel algorithms.

Bounded Memory in Distributed Networks New distributed algorithms in almost mixing time via transformations from parallel algorithms

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.518024Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b59a9c89-d4d0-4c52-94ce-646558558431 · outbound

This paper cites Space-efficient online computation of quantile summaries.

Bounded Memory in Distributed Networks Space-efficient online computation of quantile summaries

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.819802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32542fe5-ed72-4e2c-b8f7-e6b3d7636e0a · outbound

This paper cites Stream order and order statistics: Quantile estimation in random-order streams.

Bounded Memory in Distributed Networks Stream order and order statistics: Quantile estimation in random-order streams

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.499650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f5d4bb54-c8f2-439c-bd14-1c194fae2a9a · outbound

This paper cites Pingmesh: A large-scale system for data center network latency measurement and analysis.

Bounded Memory in Distributed Networks Pingmesh: A large-scale system for data center network latency measurement and analysis

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.488669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8747fcb2-4395-4e36-afa4-2aa97d0691bc · outbound

This paper cites FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches.

Bounded Memory in Distributed Networks FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.830859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4aaebcfa-cd6f-4ad5-b06a-87491ea5354f · outbound

This paper cites B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google’s software-defined wan.

Bounded Memory in Distributed Networks B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google’s software-defined wan

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.477470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 56bccd49-a8fd-4873-b4d7-703ad61e9706 · outbound

This paper cites Hucaby and D.

Bounded Memory in Distributed Networks Hucaby and D

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.464472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e5a09e00-6a4b-4ede-b503-e8ab887755de · outbound

This paper cites Intel tofino programmable ethernet switch asic.

Bounded Memory in Distributed Networks Intel tofino programmable ethernet switch asic

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.344722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 54c1e440-0fa6-4611-9acb-cf3e9c89c645 · outbound

This paper cites P416 intel ® tofino™ native architecture – public version.

Bounded Memory in Distributed Networks P416 intel ® tofino™ native architecture – public version

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.331616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 49237e9c-066e-4eae-9367-18277115f779 · outbound

This paper cites Triangle finding and listing in CONGEST networks.

Bounded Memory in Distributed Networks Triangle finding and listing in CONGEST networks

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.851485Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb2f96c6-07a1-4a2c-a5b7-db128152b071 · outbound

This paper cites Approximating the permanent.

Bounded Memory in Distributed Networks Approximating the permanent

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.310871Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 96568d89-1808-4d56-a80b-458709a3aec7 · outbound

This paper cites Karloff, Siddharth Suri, and Sergei Vassilvitskii.

Bounded Memory in Distributed Networks Karloff, Siddharth Suri, and Sergei Vassilvitskii

Reference 51

Resolution: malformed identifier; no resolver link, observed 2026-08-07T04:22:37.860764Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 283ed5be-62fd-42e4-8592-c4eaa509de02 · outbound

This paper cites On a cut-matching game for the sparsest cut problem.

Bounded Memory in Distributed Networks On a cut-matching game for the sparsest cut problem

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.296803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 71f89f44-bd08-4363-a0ba-565be46a51a6 · outbound

This paper cites Graph partitioning using single commodity flows.

Bounded Memory in Distributed Networks Graph partitioning using single commodity flows

Reference 53

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T04:22:38.550347Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f6f91465-1c66-40ca-8a47-91d362e2b4e1 · outbound

This paper cites Optimal deterministic routing and sorting on the congested clique.

Bounded Memory in Distributed Networks Optimal deterministic routing and sorting on the congested clique

Reference 55

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T04:22:38.483317Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 31159612-38e3-4267-9ab9-c2091016ba65 · outbound

This paper cites Fast routing table construction using small messages: extended abstract.

Bounded Memory in Distributed Networks Fast routing table construction using small messages: extended abstract

Reference 56

Resolution: malformed identifier; no resolver link, observed 2026-08-07T04:22:37.879547Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a146832-97d6-4755-9523-5f173c02b877 · outbound

This paper cites Fast partial distance estimation and applications.

Bounded Memory in Distributed Networks Fast partial distance estimation and applications

Reference 57

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T04:22:38.345287Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1dce959e-47c1-4c50-9b47-25c39f3bdaec · outbound

This paper cites Locality in distributed graph algorithms.

Bounded Memory in Distributed Networks Locality in distributed graph algorithms

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.887138Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2ab65823-c411-452d-ab5b-6c8d5e105346 · outbound

This paper cites Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching.

Bounded Memory in Distributed Networks Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.891565Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1eac4c1-4c1d-4d48-b8d2-0f2f0f0179aa · outbound

This paper cites Minimum-weight spanning tree construction in O(log log n) communication rounds.

Bounded Memory in Distributed Networks Minimum-weight spanning tree construction in O(log log n) communication rounds

Reference 60

Resolution: verified exact; doi, observed 2026-08-07T04:22:37.972396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fe95e2fc-5a82-47e9-b928-73da2dfd89c1 · outbound

This paper cites Openflow: enabling innovation in campus networks.ACM SIGCOMM computer communication review, 38(2):69–74, 2008.

Bounded Memory in Distributed Networks Openflow: enabling innovation in campus networks.ACM SIGCOMM computer communication review, 38(2):69–74, 2008

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.284198Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b7b92da2-3a01-453b-afa0-09f60a17b086 · outbound

This paper cites Opendaylight: Towards a model-driven sdn controller architecture.

Bounded Memory in Distributed Networks Opendaylight: Towards a model-driven sdn controller architecture

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.272420Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 35153438-3b5f-4b9e-aeac-884e511b7244 · outbound

This paper cites Miller, Richard Peng, and Shen Chen Xu.

Bounded Memory in Distributed Networks Miller, Richard Peng, and Shen Chen Xu

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.261569Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8eb76261-2946-40de-b003-0203d18298c9 · outbound

This paper cites Finding repeated elements.

Bounded Memory in Distributed Networks Finding repeated elements

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.250826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 624bb3c9-5548-4e8a-aa3e-cf998e1d41a5 · outbound

This paper cites Distributed Computing: A Locality-Sensitive Approach.

Bounded Memory in Distributed Networks Distributed Computing: A Locality-Sensitive Approach

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-07T04:22:37.915022Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23b604cd-badd-4d2e-856c-7e316b9ca92b · outbound

This paper cites A trade-off between space and efficiency for routing tables.

Bounded Memory in Distributed Networks A trade-off between space and efficiency for routing tables

Reference 66

Resolution: verified exact; raw_fallback, observed 2026-08-07T04:22:38.264647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3e49d426-ba80-4e8d-a2fc-52a33a9729b1 · outbound

This paper cites Computing cut-based hierar- chical decompositions in almost linear time.

Bounded Memory in Distributed Networks Computing cut-based hierar- chical decompositions in almost linear time

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.230389Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0c3ac1d9-7240-477d-b1a2-4f23f6d345a0 · outbound

This paper cites Counting cycles and finite dimensional Lp norms.

Bounded Memory in Distributed Networks Counting cycles and finite dimensional Lp norms

Reference 68

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.219667Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3660ed5d-a39e-4296-a89a-05ce38057972 · outbound

This paper cites Polylogarithmic-time deterministic net- work decomposition and distributed derandomization.

Bounded Memory in Distributed Networks Polylogarithmic-time deterministic net- work decomposition and distributed derandomization

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.208559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 878ca494-483c-4c8c-b81c-1e129b3d5cdf · outbound

This paper cites with high probability.

Bounded Memory in Distributed Networks with high probability

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:22:39.196840Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 283f53b3-7247-4db1-9db3-05d81d27ef4c · outbound

This paper cites an unresolved cited work.

Bounded Memory in Distributed Networks Unresolved cited work

Reference 2006

Resolution: verified exact; doi, observed 2026-08-07T04:22:38.014703Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers