Random Walks and Bisections in Random Circulant Graphs

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Latin American Symposium on Theoretical Informatics

• Publication date

  2012-04-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-29344-3_46
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Analytic Number Theory

  2021cited by this paper
• Diameters of random circulant graphs

  2011influential reference
• Faster exponential time algorithms for the shortest vector problem

  2010cited by this paper
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

  2010cited by this paper
• The diameter of a random Cayley graph of ℤ q

  2010cited by this paper
• An LLL Algorithm with Quadratic Complexity

  2009cited by this paper
• The LLL Algorithm - Survey and Applications

  2009cited by this paper
• Solving the Shortest Lattice Vector Problem in Time 22.465n

  2009cited by this paper
• Many random walks are faster than one

  2007influential reference
• Improved on-line broadcast scheduling with deadlines

  2006cited by this paper
• LATIN 2004: Theoretical Informatics

  2004cited by this paper
• Bisecting and Gossiping in Circulant Graphs

  2004influential reference
• On the spectral Ádám property for circulant graphs

  2002cited by this paper
• Random Walks on Graphs: A Survey

  2001cited by this paper
• On Routing in Circulant Graphs

  1999cited by this paper
• The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width

  1998cited by this paper
• Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes

  1997cited by this paper
• On Ádám's conjecture for circulant graphs

  1997cited by this paper
• On small cuts separating an abelian Cayley graph into two equal parts

  1996cited by this paper
• An introduction to the theory of numbers (5. ed.)

  1995cited by this paper
• Random Walks on Graphs: A Survey

  1993cited by this paper
• ARRAYS AND TREES

  1992cited by this paper
• Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)

  1992cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• Diskrepanz und Distanz von Maßen bezüglich konvexer und Jordanscher Mengen

  1975cited by this paper
• An Introduction to the Theory of Numbers

  1939cited by this paper

• Gossiping in circulant graphs

  2014influential citation
• Random Walks, Bisections and Gossiping in Circulant Graphs

  2014cites this paper