The following pages link to Ghurumuruhan Ganesan (Q376694):
Displayed 50 items.
- Size of the giant component in a random geometric graph (Q376695) (← links)
- Disjoint crossings, positive speed and deviation estimates for first passage percolation (Q457810) (← links)
- Asymptotically optimal matrix codes with Hamming and rank distances (Q820933) (← links)
- Nominal correlation of inhomogeneous random sequences (Q826702) (← links)
- Recursive methods for some problems in coding and random permutations (Q831746) (← links)
- Achieving positive rates with predetermined dictionaries (Q831747) (← links)
- Stretch and diameter in random geometric graphs (Q1702131) (← links)
- Graph extensions, edit number and regular graphs (Q1732121) (← links)
- Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting (Q1744718) (← links)
- Multiplicity of summands in the random partitions of an integer (Q1948994) (← links)
- Minimum spanning trees of random geometric graphs with location dependent weights (Q1983618) (← links)
- Linear recurrences over a finite field with exactly two periods (Q2020060) (← links)
- Strong identification codes for graphs (Q2037550) (← links)
- Strong and weighted matchings in inhomogenous random graphs (Q2064836) (← links)
- Real-time error correction codes for deletable errors (Q2080010) (← links)
- Computing prices for target profits in contracts (Q2080045) (← links)
- Cliques and chromatic number in multiregime random graphs (Q2082328) (← links)
- Law of large numbers for permanents of random constrained matrices (Q2095062) (← links)
- Euclidean travelling salesman problem with location-dependent and power-weighted edges (Q2135191) (← links)
- Linearized decomposition codes and finite integer set coverings (Q2198389) (← links)
- Traveling salesman problem across well-connected cities and with location-dependent edge lengths (Q2274794) (← links)
- Extremal paths in inhomogenous random graphs (Q2288750) (← links)
- Deviation estimates for Eulerian edit numbers of random graphs (Q2658005) (← links)
- Constrained minimum passage time in random geometric graphs (Q2659771) (← links)
- Stability Region of Multicarrier Channel Aware Aloha (Q3548964) (← links)
- Infection Spread in Random Geometric Graphs (Q5246176) (← links)
- Bridged Hamiltonian cycles in sub-critical random geometric graphs (Q6133739) (← links)
- Phase transitions for Erdos-Renyi graphs (Q6254512) (← links)
- Outermost boundaries for star-connected components in percolation (Q6264871) (← links)
- Duality between star and plus connected components in percolation (Q6266331) (← links)
- Uniqueness of infinite open cluster in bond percolation in $\mathbb{Z}^d$ (Q6271299) (← links)
- Convergence in First Passage Percolation with nonidentical passage times (Q6285091) (← links)
- Duality in percolation via outermost boundaries I: Bond Percolation (Q6285092) (← links)
- Duality in percolation via outermost boundaries II: Star connected components and left right crossings (Q6285235) (← links)
- Duality in percolation via outermost boundaries III: Plus connected components (Q6285548) (← links)
- Long Paths and Hamiltonian paths in Inhomogenous Random Graphs (Q6285549) (← links)
- Cliques and Chromatic Number in Inhomogenous Random Graphs (Q6285550) (← links)
- Randomized detection and detection capacity of multidetector networks (Q6285552) (← links)
- Rates of linear codes with low decoding error probability (Q6291146) (← links)
- Traveling salesman problem across dense cities (Q6296169) (← links)
- Minimum spanning trees across dense cities (Q6296170) (← links)
- Existence of connected regular and nearly regular graphs (Q6296910) (← links)
- Construction and redundancy of codes for correcting deletable errors (Q6301074) (← links)
- Records from partial comparisons and discrete approximations (Q6303237) (← links)
- Correcting an ordered deletion-erasure (Q6303286) (← links)
- Recursive methods for some problems in coding and random permutations (Q6356537) (← links)
- Achieving positive rates with predetermined dictionaries (Q6356538) (← links)
- Real-time error correction codes for deletable errors (Q6361784) (← links)
- Two Applications of Graph Minor Reduction (Q6375285) (← links)
- Approximate MDS Property of Linear Codes (Q6375433) (← links)