Sublinear-Time Sampling of Spanning Trees in the Congested Clique | Paper Citation Record

Observation 2067b8cc-5bbf-4211-a684-881378ee452f · outbound

This paper cites an unresolved cited work.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-12T16:51:32.521267Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 8711ab98-086e-4f0e-9435-42f996d8bf1c · outbound

This paper cites Karp, Richard J.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Karp, Richard J

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.511255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6ec4f131-3eea-42bc-8221-af50d7571e09 · outbound

This paper cites Sampling Arborescences in Parallel.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Sampling Arborescences in Parallel

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.501370Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 09fc2b2a-8fda-43a6-a4e8-414c42945029 · outbound

This paper cites Log-concave polynomials iv: approximate exchange, tight mixing times, and near-optimal sam- pling of forests.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Log-concave polynomials iv: approximate exchange, tight mixing times, and near-optimal sam- pling of forests

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.490641Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 62443822-fa5b-48ce-80a7-b5de66fe0a44 · outbound

This paper cites Parallel algorithms for geometric graph problems.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Parallel algorithms for geometric graph problems

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.478580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 832e71d4-7a0f-44f0-9907-4c0d5f242698 · outbound

This paper cites Goemans, Aleksander Mądry, Shayan Oveis Gharan, and Amin Saberi.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Goemans, Aleksander Mądry, Shayan Oveis Gharan, and Amin Saberi

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.461566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a03a9166-59cf-441d-a2e0-9e9888120d5f · outbound

This paper cites Fast personalized pagerank on mapre- duce.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Fast personalized pagerank on mapre- duce

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.451462Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 52a75681-6def-4e2a-b54c-458d915443ad · outbound

This paper cites Short random walks on graphs.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Short random walks on graphs

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.441516Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 87e72667-b6fb-466c-84f9-629b0d410c40 · outbound

This paper cites Communication steps for parallel query processing.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Communication steps for parallel query processing

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.431628Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1e871bbf-48dd-410e-8d0d-730f18a52c49 · outbound

This paper cites Near-optimal approximate shortest paths and transshipment in distributed and streaming models.SIAM Journal on Computing, 50(3):815–856, 2021.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Near-optimal approximate shortest paths and transshipment in distributed and streaming models.SIAM Journal on Computing, 50(3):815–856, 2021

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.421958Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 02fc69b2-24d7-4505-8e98-79a50815b6ec · outbound

This paper cites Randomness-efficient oblivious sampling.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Randomness-efficient oblivious sampling

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.412324Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d7098592-1648-40b2-ad75-bcd3d1fb52b0 · outbound

This paper cites Generating random spanning trees.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Generating random spanning trees

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.402913Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1171db60-7b60-4cd4-aec3-410242e31d66 · outbound

This paper cites Broder and Anna R.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Broder and Anna R

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.393162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4b95e5fd-c031-439b-a491-417437b9a7d4 · outbound

This paper cites Time and space optimal massively parallel algorithm for the 2-ruling set problem.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Time and space optimal massively parallel algorithm for the 2-ruling set problem

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.383504Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a7051f6a-630f-4dac-8b7d-201231e1ed12 · outbound

This paper cites Improved Distributed Algorithms for Random Colorings.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Improved Distributed Algorithms for Random Colorings

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.373163Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6c3694e7-3450-41f5-9bc6-5bbbd63afa33 · outbound

This paper cites Distributed subgraph finding: Progress and challenges, 2024.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Distributed subgraph finding: Progress and challenges, 2024

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.362716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d73a8dce-9956-4b64-ba3b-881b25df0590 · outbound

This paper cites Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.354455Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a6f28cdd-e15d-4ce9-82cf-592974d49df3 · outbound

This paper cites an unresolved cited work.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Unresolved cited work

Reference 18

Resolution: unresolved; raw_fallback, observed 2026-08-12T16:51:32.346042Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 465279cd-e58e-4fc7-a948-d3ad32b45da4 · outbound

This paper cites Colbourn, Wendy J.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Colbourn, Wendy J

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.337829Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0a6c0986-7391-46c9-a91f-9cffbf7aaab8 · outbound

This paper cites Simple, deterministic, constant-round coloring in the congested clique.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Simple, deterministic, constant-round coloring in the congested clique

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.328905Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2e082830-2207-4759-9dfc-b85d8a0543ef · outbound

This paper cites Distributed random walks.J.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Distributed random walks.J

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.319016Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 02b08b15-2a27-430c-b89e-354097223ccd · outbound

This paper cites Tri, Tri Again.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Tri, Tri Again

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.310061Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 39e2fe35-5689-4de5-bf13-a28b9d415d8b · outbound

This paper cites Random spanning trees for expanders, sparsifiers, and virtual network security.Computer Communications, 212:21–34, 2023.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Random spanning trees for expanders, sparsifiers, and virtual network security.Computer Communications, 212:21–34, 2023

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.300615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation aea2a4c6-e28a-4fdf-97ee-d6791719f3c0 · outbound

This paper cites Exponentially faster shortest paths in the congested clique.J.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Exponentially faster shortest paths in the congested clique.J

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.291615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f83ddf83-0899-4bbf-ab68-74f5e4667d80 · outbound

This paper cites On the power of the congested clique model.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique On the power of the congested clique model

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.282566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 73f3db33-d114-44a0-b46a-e997a3ec5f8d · outbound

This paper cites an unresolved cited work.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-08-12T16:51:32.273465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6f78cb39-d1bc-40c0-9467-830c388976a0 · outbound

This paper cites Hayes, and Yitong Yin.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Hayes, and Yitong Yin

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.264607Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 79c6ee99-0c2b-46b9-9923-17373705f354 · outbound

This paper cites Hayes, and Yitong Yin.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Hayes, and Yitong Yin

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.255639Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f6ce09c4-e7bf-4e5a-9522-dac6cb8ee857 · outbound

This paper cites What can be sampled locally? InProceedings of the ACM Symposium on Principles of Distributed Computing, PODC ’17, page 121–130, New York, NY, USA, 2017.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique What can be sampled locally? InProceedings of the ACM Symposium on Principles of Distributed Computing, PODC ’17, page 121–130, New York, NY, USA, 2017

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.247160Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6aa0ec1c-8340-4027-85ab-9bce01aa4bfa · outbound

This paper cites On local distributed sampling and counting.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique On local distributed sampling and counting

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.238575Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2f438abd-6943-456e-b180-dc2f5caff79c · outbound

This paper cites A simple parallel and distributed sampling technique: Local glauber dynamics.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique A simple parallel and distributed sampling technique: Local glauber dynamics

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.230061Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 477870e7-67bf-4fed-9f53-5af8c6923302 · outbound

This paper cites The laplacian paradigm in the broadcast congested clique.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique The laplacian paradigm in the broadcast congested clique

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.221078Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 8bc7e6d5-63a5-464b-bc8d-cc794612a5a0 · outbound

This paper cites Harvey, and Debmalya Panigrahi.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Harvey, and Debmalya Panigrahi

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.212311Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation cd57737f-895f-4ab0-9164-3bc91a11a9f3 · outbound

This paper cites Distributed MIS via all-to-all communication.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Distributed MIS via all-to-all communication

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.202906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f6a6a7c5-5672-4338-9dd4-3d0f247ee24f · outbound

This paper cites Improved massively parallel computation algorithms for mis, matching, and vertex cover.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Improved massively parallel computation algorithms for mis, matching, and vertex cover

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.193481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 62919e89-3b4c-48fc-b282-130ff634492b · outbound

This paper cites Congested clique algorithms for the minimum cut problem.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Congested clique algorithms for the minimum cut problem

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.184138Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dd4c9241-62be-438f-8956-d84f4d576757 · outbound

This paper cites MST in Log-Star Rounds of Congested Clique.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique MST in Log-Star Rounds of Congested Clique

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.174781Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6fdf2cce-70e3-497d-bb9c-ba2bead78654 · outbound

This paper cites A randomized rounding approach to the traveling salesman problem.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique A randomized rounding approach to the traveling salesman problem

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.165210Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5ce6dea6-7cfa-4304-9c81-a9799c70646a · outbound

This paper cites Random minimum spanning trees, Oct 2018.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Random minimum spanning trees, Oct 2018

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.155233Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 912bf94c-5d9f-406d-aa38-8e696fada0df · outbound

This paper cites Goodrich, Nodari Sitchinava, and Qin Zhang.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Goodrich, Nodari Sitchinava, and Qin Zhang

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.146945Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 9b93e7d4-42d0-4d77-8360-bce7d74ab14e · outbound

This paper cites Expanders via random spanning trees.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Expanders via random spanning trees

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.138774Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 7f434112-949d-4acf-b3c9-74fe2f69430c · outbound

This paper cites Uniform sampling through the lovász local lemma.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Uniform sampling through the lovász local lemma

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.129748Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 238dbb5e-2971-4f41-b726-854c1c4f0836 · outbound

This paper cites an unresolved cited work.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Unresolved cited work

Reference 43

Resolution: unresolved; raw_fallback, observed 2026-08-12T16:51:32.120614Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 52fae08c-71f2-481c-96b8-3be1e8830050 · outbound

This paper cites Hegeman, Gopal Pandurangan, Sriram V.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Hegeman, Gopal Pandurangan, Sriram V

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.111017Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ac157dfe-d20a-4fb9-8b23-6687ef1a1a91 · outbound

This paper cites Hegeman, Sriram V.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Hegeman, Sriram V

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.100691Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5cc18eaf-0284-49e8-b84d-371837c43647 · outbound

This paper cites A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.J.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.J

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.091235Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 085a8b1a-266d-40f8-aa94-4ac76cd7edca · outbound

This paper cites Valiant, and Vijay V.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Valiant, and Vijay V

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.080792Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 734cc0fa-965c-4f76-a279-e2ed8152e758 · outbound

This paper cites Mst in o(1) rounds of congested clique.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Mst in o(1) rounds of congested clique

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.071071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a27a4875-1132-48e3-aafc-284d3939c436 · outbound

This paper cites Karlin, Nathan Klein, and Shayan Oveis Gharan.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Karlin, Nathan Klein, and Shayan Oveis Gharan

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.061347Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a7484f95-a3cd-4e63-a16e-d5534d50d5c1 · outbound

This paper cites Karlin, Nathan Klein, Shayan Oveis Gharan, and Xinzhi Zhang.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Karlin, Nathan Klein, Shayan Oveis Gharan, and Xinzhi Zhang

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.051535Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ebd11990-ef79-4f4f-9849-eb76719a083c · outbound

This paper cites A model of computation for mapre- duce.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique A model of computation for mapre- duce

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.041848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 81ab77d0-f88d-4f23-a226-46f405f49148 · outbound

This paper cites Kelner and Aleksander Madry.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Kelner and Aleksander Madry

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.032275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 180600e4-fcc3-476e-b3d6-115c470d9234 · outbound

This paper cites Kirby, Roger B.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Kirby, Roger B

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.023517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0e2c822b-0c82-40e4-8688-a40f81ec7e98 · outbound

This paper cites Distributed Computation of Large-scale Graph Problems.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Distributed Computation of Large-scale Graph Problems

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.014258Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 49eb0361-6534-4a55-8dba-072c53ce8f9e · outbound

This paper cites Approximate Gaussian Elimination.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Approximate Gaussian Elimination

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:32.004320Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0d7379ea-d5f3-41e0-b299-3126b9616157 · outbound

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

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Optimal deterministic routing and sorting on the congested clique

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.995004Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 363cbafa-4aa7-4a96-b4d8-adc5e02bbe1b · outbound

This paper cites Walking randomly, massively, and efficiently.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Walking randomly, massively, and efficiently

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.985573Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a0d24579-b442-4713-83c1-f9b0c4ac58c7 · outbound

This paper cites Mst construction in o(log log n) communication rounds.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Mst construction in o(log log n) communication rounds

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.976145Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b25a278c-438b-4205-b978-652e1919897c · outbound

This paper cites Random walks on graphs: A survey.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Random walks on graphs: A survey

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.967177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 94772428-bdc7-4a49-9fec-92bc5fca2ee8 · outbound

This paper cites Distributed pagerank computation: an improved theoretical study.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Distributed pagerank computation: an improved theoretical study

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.957926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 850c5d3f-68bc-422d-b49b-56fed2dce82c · outbound

This paper cites Distributed pagerank computation with improved round complexities.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Distributed pagerank computation with improved round complexities

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.948277Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f57b9f5a-a698-4eb8-b40c-073e47edae01 · outbound

This paper cites Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.938615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4c50f4ec-a1d5-4d74-9375-bf278341df36 · outbound

This paper cites From graphs to matrices, and back: new techniques for graph algorithms.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique From graphs to matrices, and back: new techniques for graph algorithms

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.929139Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation acdde8b9-ad79-4856-9de2-ceac16b44c6e · outbound

This paper cites Fast generation of random span- ning trees and the effective resistance metric.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Fast generation of random span- ning trees and the effective resistance metric

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.920722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 89c45fa5-d852-424d-9285-0527e9035384 · outbound

This paper cites A deterministic algorithm for the mst problem in constant rounds of con- gested clique.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique A deterministic algorithm for the mst problem in constant rounds of con- gested clique

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.910393Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f707863c-a9a5-480b-a989-a3ae12b7f94b · outbound

This paper cites Congested clique algorithms for graph spanners.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Congested clique algorithms for graph spanners

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.899351Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 37d10693-060b-4666-be55-e789a91925f7 · outbound

This paper cites Pemmaraju and Vivek B.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Pemmaraju and Vivek B

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.887920Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a30ceb4f-74a8-452d-a617-45b2fcf1b1ac · outbound

This paper cites Pemmaraju and Joshua Z.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Pemmaraju and Joshua Z

Reference 68

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.876151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bf16fb4a-4fe1-4901-bc25-56fa56142daa · outbound

This paper cites An almost-linear time algorithm for uniform random spanning tree generation.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique An almost-linear time algorithm for uniform random spanning tree generation

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.864300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bb242825-afa0-4f46-879c-9b5b5ea420a2 · outbound

This paper cites Independent sets versus perfect matchings.Theoretical Computer Science, 145(1):381–390, 1995.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Independent sets versus perfect matchings.Theoretical Computer Science, 145(1):381–390, 1995

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.853232Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0fd8e053-e69e-43b4-9d2f-f85465d1c12b · outbound

This paper cites Pseudorandomness.Foundations and Trends® in Theoretical Computer Sci- ence, 7(1–3):1–336, 2012.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Pseudorandomness.Foundations and Trends® in Theoretical Computer Sci- ence, 7(1–3):1–336, 2012

Reference 71

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.842560Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e358c11e-a2bc-4901-ae2e-71dd4b07f9fe · outbound

This paper cites New bounds for ma- trix multiplication: from alpha to omega.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique New bounds for ma- trix multiplication: from alpha to omega

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.831189Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 57211856-1a5b-4b71-8cc7-2c6c26fc9e3d · outbound

This paper cites Generating random spanning trees more quickly than the cover time.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Generating random spanning trees more quickly than the cover time

Reference 73

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.820968Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation af1be608-9fd5-496a-8ccb-ba01b2edd598 · outbound

This paper cites This results in an arbitrary spanning tree being returned.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique This results in an arbitrary spanning tree being returned

Reference 75

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.809235Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bca3ac6a-17e2-444d-a9f3-ba77ff2c2c44 · outbound

This paper cites an unresolved cited work.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Unresolved cited work

Reference 76

Resolution: unresolved; raw_fallback, observed 2026-08-12T16:51:31.797444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b8c47c86-5330-46e7-81c0-cc753f64603e · outbound

This paper cites 5.1 Solving Problem 1 The clear solution to the first problem is to convert the algorithm from a Monte Carlo to Las Vegas approach.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique 5.1 Solving Problem 1 The clear solution to the first problem is to convert the algorithm from a Monte Carlo to Las Vegas approach

Reference 77

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:51:31.784659Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 7716daeb-fe4e-4a21-907e-36838d84959b · outbound

This paper cites an unresolved cited work.

Sublinear-Time Sampling of Spanning Trees in the Congested Clique Unresolved cited work

Reference 2014

Resolution: unresolved; no resolver link, observed 2026-08-12T16:51:31.500286Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers