yusuke1997/dblp-id-title huggingface dataset:
Compound Poisson approximations of subgraph counts in random graphs
Maxima in hypercubes
Oscillations in the height of the Yule tree and application to the binary search tree
Permutations with fixed pattern densities
On fractional K -factors of random graphs
When almost all sets are difference dominated
Tight upper tail bounds for cliques
Hyperbolic Site Percolation
On subgraphs with degrees of prescribed residues in the random graph
Problems and results on judicious partitions
On Random Cartesian Trees
Regular graphs whose subgraphs tend to be acyclic
On variants of the Johnson-Lindenstrauss lemma
The random bipartite nearest neighbor graphs
Approximating average parameters of graphs
Uncommon suffix tries
Haystack hunting hints and locker room communication
Patterns in random permutations avoiding the pattern 321
Random mappings with exchangeable in-degrees
Can You Feel the Double Jump?
Ramsey properties of random discrete structures
Triangle Counting With Local Edge Differential Privacy
Vertex and edge expansion properties for rapid mixing
Clique coloring of binomial random graphs
On the Height of Random m-ary Search Trees
Critical random graphs and the structure of a minimum spanning tree
Restart Perturbations for Reversible Markov Chains: Trichotomy and Pre-Cutoff Equivalence
On the optimality of the random hyperplane rounding technique for MAX CUT
Connectivity of a general class of inhomogeneous random digraphs
Error-resilient DNA computation
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph
Hypergraph list coloring and Euclidean Ramsey theory
The cutoff phenomenon for random birth and death chains
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Independence number of hypergraphs under degree conditions
Learning random points from geometric graphs or orderings
Poisson convergence in the restricted k -partitioning problem
Packing list-colorings
Strong spatial mixing of list coloring of graphs
Very weak zero one law for random graphs with order and random binary functions
Dixon's asymptotic without the classification of finite simple groups
On the Size of a Random Maximal Graph
Optimal stopping for many connected components in a graph
Random trees and random graphs
Random maps, coalescing saddles, singularity analysis, and Airy phenomena
Dynamic Random Intersection Graph: Dynamic Local Convergence and Giant Structure
The number of bounded-degree spanning trees
Vanishing of cohomology groups of random simplicial complexes
The union of two random permutations does not have a directed Hamilton cycle
A generalized Pólya's urn with graph based interactions
How many T-tessellations on k lines? Existence of associated Gibbs measures on bounded convex domains
Finding paths in sparse random graphs requires many queries
On (epsilon, k)-min-wise independent permutations
Dependence and phase changes in random m -ary search trees
The degree sequence of a random graph. I. The models
The looping constant of ℤ d
Patterns in random binary search trees
Braess's Paradox in large random graphs
A query efficient non-adaptive long code test with perfect completeness
A random bit-flipping method for seeking agreement
Note on down-set thresholds
Probabilistic analysis of adaptative sampling
A greedy chip-firing game
Applications of graph containers in the Boolean lattice
Improving the Convergence of Markov Chains via Permutations and Projections
Multicolor containers, extremal entropy, and counting
The component structure of dense random subgraphs of the hypercube
The range of once-reinforced random walk in one dimension
Upper tails for triangles
Random suffix search trees
Paul Erdös and probability theory
On the distribution of the number of roots of polynomials and explicit weak designs
Critical window for the vacant set left by random walk on random regular graphs
Mixing in time and space for lattice spin systems: A combinatorial view
Some remarks on Betti numbers of random polygon spaces
Hamilton cycles in 3-out
A combinatorial approach to jumping particles: The parallel TASEP
Enumeration and randomized constructions of hypertrees
Probabilistic analysis for a multiple depot vehicle routing problem
Algorithms for graph partitioning on the planted partition model
Linear lower bounds for delta c ( p ) for a class of 2D self-destructive percolation models
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs
Exact sampling with coupled Markov chains and applications to statistical mechanics
Normal approximations of the number of records in geometrically distributed random variables
Minimalist designs
Optimal Zero-Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs
Balancing vectors and Gaussian measures of n-dimensional convex bodies
Acyclic edge colourings of graphs with large girth
What is the furthest graph from a hereditary property?
On covering expander graphs by hamilton cycles
The Boyer-Moore-Horspool heuristic with Markovian input
On the connectivity of proper colorings of random graphs and hypergraphs
Gibbs partitions: The convergent case
Spectra of large diluted but bushy random graphs
Sumsets and entropy revisited
Graphical balanced allocations and the (1 + β)-choice process
Probabilistic analysis of column-convex and directed diagonally-convex animals. II: Trajectories and shapes
The quasi-randomness of hypergraph cut properties
The number of descendants in a random directed acyclic graph
Analysis of Steiner subtrees of random trees for traceroute algorithms
The Shape of Stretched Planar Trees
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
Colorings generated by monotone properties
Tiny families of functions with random properties: A quality-size trade-off for hashing
Asymptotic behavior of some factorizations of random words
A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma
Packing random graphs and hypergraphs
Dependent percolation and colliding random walks
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
On induced Folkman numbers
Coloring graphs from random lists of fixed size
The chromatic number of random Borsuk graphs
Combinatorial and stochastic properties of ranked tree-child networks
Percolation on High-Dimensional Product Graphs
The game chromatic number of random graphs
A new lower bound for the critical probability of site percolation on the square lattice
On the K-sat model with large number of clauses
Nash equilibria in random games
Emergence of the giant component in special Marcus-Lushnikov processes
Meyniel's conjecture holds for random d-regular graphs
Sampling colourings of the triangular lattice
A sharp inverse Littlewood-Offord theorem
Quasi-random graphs with given degree sequences
An upper bound on the number of Steiner triple systems
Parking with density
Immersions of Directed Graphs in Tournaments
The asymptotic distribution of long cycles in random regular graphs
An intersection theorem for systems of sets
Divide and conquer martingales and the number of triangles in a random graph
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees
Efficient computation of sparse structures
On the average-case complexity of Shellsort
Discovery Through Gossip
Ramanujan graphings and correlation decay in local algorithms
A sharp concentration inequality with applications
On the Threshold of Chaos in Random Boolean Cellular Automata
Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures
Information percolation and cutoff for the random-cluster model
The Variance of Level Numbers in Certain Families of Trees
Data structures with dynamical random transitions
A graphon approach to limiting spectral distributions of Wigner-type matrices
The mixing time of Glauber dynamics for coloring regular trees
Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case
The shortest distance in random multi-type intersection graphs
Optimal Sampling Strategies for Quicksort
A Sharp Threshold for a Random Version of Sperner's Theorem
A scaling limit for the degree distribution in sublinear preferential attachment schemes
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph"
The maximal probability that k -wise independent bits are all 1
A Shuffle that Mixes Sets of Any Fixed Size Much Faster than It Mixes the Whole Deck
On randomized greedy matchings
How to couple from the past using a read-once source of randomness
Simple Markov-chain algorithms for generating bipartite graphs and tournaments
Analysis of random LC tries
Random Graph Orders Do Not Satisfy a 0-1 Law
The diameter of sparse random graphs
Sampling to provide or to bound: With applications to fully dynamic graph algorithms
A rainbow blow-up lemma
Competition in growth and urns
Epidemics on networks with preventive rewiring
Counting the onion
Rainbow Subgraphs in Properly Edge-colored Graphs
Randomized Adative Sorting
Polynomial time perfect sampling algorithm for two-rowed contingency tables
Weight distribution of random linear codes and Krawtchouk polynomials
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Volumes Spanned by Random Points in the Hypercube
Asymmetric Ramsey properties of random graphs involving cliques
Counting subgraphs in quasi-random 4-uniform hypergraphs
Randomly coloring random graphs
Analysis of Ben-Or's polynomial irreducibility test
An Upper Bound for the Solvability of a Random Stable Roommates Instance
The persistent-access-caching algorithm
How many random edges make a dense hypergraph non-2-colorable?
On the Travelling Salesperson Problem in Many Dimensions
Down-set thresholds
Random graphs with given vertex degrees and switchings
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
The Threshold for Hamilton Cycles in the Square of a Random Graph
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs
Space complexity of random formulae in resolution
On Sidorenko's conjecture for determinants and Gaussian Markov random fields
Sublinear-time approximation algorithms for clustering via random sampling
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree
Rainbow matchings in Dirac bipartite graphs
On the largest part size of low-rank combinatorial assemblies
Extremal subgraphs of random graphs
Randomly Twisted Hypercubes: Between Structure and Randomness
Asymptotic packing and the random greedy algorithm
Cycle packing
The property of having a k -regular subgraph has a sharp threshold
Notes on the variance of the number of maxima in three dimensions
Exploring hypergraphs with martingales
A Bernoulli mean estimate with known relative error distribution
Efficient algorithms for discrepancy minimization in convex sets
Tuza's conjecture for random graphs
Counting strongly-connected, moderately sparse directed graphs
Scaling limits for minimal and random spanning trees in two dimensions
Asymptotic equivalence and contiguity of some random graphs
The scaling window for a random graph with a given degree sequence
Corrigendum to "Online purchasing under uncertainty"
Foundations of positional games
Cube Ramsey numbers are polynomial
Large induced subgraphs of random graphs with given degree sequences
Geometric Algorithms for the Minimum Cost Assignment Problem
Rainbow subdivisions of cliques
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
Large Antichains in the Partition Lattice
Hamilton cycles in the union of random permutations
Efficient approximation of product distributions
A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree
Cycle lengths in randomly perturbed graphs
The Erlang weighted tree, a new branching process
Stability results for random discrete structures
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
Toward characterizing locally common graphs
Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
Large components of bipartite random mappings
An algorithmic version of the blow-up lemma
1-Pancyclic Hamilton Cycles in Random Graphs
Robust locally testable codes and products of codes
Weighted random popular matchings
Loose laplacian spectra of random hypergraphs
A Note on the Connectivity of 2-Regular Digraphs
A Power Law for Connectedness of Some Random Graphs at the Critical Point
Regular induced subgraphs of a random Graph
Hats, auctions and derandomization
Non-abelian homomorphism testing, and distributions close to their self-convolutions
Convergence to equilibrium of biased plane Partitions
Factors in random graphs
A general model of web graphs
On the critical exponents of random k-SAT
Multicolored Trees in Random Graphs
Merging percolation on Z d and classical random graphs: Phase transition
Tight bounds for popping algorithms
Circular law for random matrices with exchangeable entries
Absence of site percolation at criticality in ℤ2×{0, 1}
Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts
Note on the Heights of Random Recursive Trees and Random m-ary Search Trees
Compaction for two models of logarithmic-depth trees: Analysis and experiments
Hamilton cycles in random graphs and directed graphs
Asymmetry and structural information in preferential attachment graphs
A probabilistic approach to the leader problem in random graphs
Limit laws for embedded trees: Applications to the integrated superBrownian excursion
Renewal processes on partially ordered sets
Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems
Asymptotics in Knuth's parking problem for caravans
Harnessing the Bethe free energy
A Graph Fourier Transform and Proportional Graphs
Distributed algorithms in an ergodic Markovian environment
Local resilience of an almost spanning k-cycle in random graphs
Applications of the regularity lemma for uniform hypergraphs
Disproof of a packing conjecture of Alon and Spencer
The emergence of a giant component in random subgraphs of pseudo-random graphs
Random tree recursions: Which fixed points correspond to tangible sets of trees?
Equivalence of a random intersection graph and G ( n , p )
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
Spanning cycles in random directed graphs
Kemeny's constant for nonbacktracking random walks
Balls into bins via local search: Cover time and maximum load
Water transport on infinite graphs
On k-connectivity for a geometric random graph
Some Comments on the Paper "Brownian Bridge Asymptotics for Random Mappings"
Random Čech complexes on manifolds with boundary
Biased games on random boards
The structure and distances in Yule recursive trees
Mixing times of Markov chains for self-organizing lists and biased permutations
Random dyadic tilings of the unit square
Spectral techniques applied to sparse random graphs
Simple Construction of Almost k-wise Independent Random Variables
On large-girth regular graphs and random processes on trees
The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie
Maximum-size antichains in random set-systems
Weighted distances in scale-free preferential attachment models
First order zero-one laws for random graphs on the circle
Coloring graphs of various maximum degree from random lists
Simple proofs of occupancy tail bounds
The zeta(2) limit in the random assignment problem
Two-sided error proximity oblivious testing
Unavoidable trees in tournaments
Edge-coloring linear hypergraphs with medium-sized edges
Infinite paths in randomly oriented lattices
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
Random trees and general branching processes
Linear waste of best fit bin packing on skewed distributions
Unambiguous Parity-Query Complexity
The VC dimension of k-uniform random hypergraphs
Coloring lines and Delaunay graphs with respect to boxes
Threshold functions for asymmetric Ramsey properties involving cycles
Static priority scheduling of aperiodic real-time tasks
Generalized Digital Trees and Their Difference-Differential Equations
Search for the Maximum of a Random Walk
Line percolation
Asymptotically Optimal Proper Conflict-Free Coloring
On the clustering of independent uniform random variables
Rainbow structures in locally bounded colorings of graphs
Reconstructing a three-color scenery by observing it along a simple random walk path
The satisfiability threshold for randomly generated binary constraint satisfaction problems
The square lattice shuffle
Parallel randomized load balancing
On the Littlewood-Offord problem for arbitrary distributions
A unified framework for testing linear-invariant properties
Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
On the all-pairs shortest-path algorithm of Moffat and Takaoka
On the optimality of the uniform random strategy
On the Anti-Ramsey Property of Ramanujan Graphs
The asymptotic distribution of symbols on diagonals of random weighted staircase tableaux
The distribution of height and diameter in random non-plane binary trees
Connectivity of inhomogeneous random graphs
Infinitary Queries and Their Asymptotic Probabilites II. Properties Definable in Least Fixed Point Logic
Fringe Trees for Random Trees With Given Vertex Degrees
Rapid mixing of the switch Markov chain for strongly stable degree sequences
Defective coloring of hypergraphs
Improved bounds for the randomized decision tree Complexity of recursive majority
Recursive reconstruction on periodic trees
Shotgun assembly of random jigsaw puzzles
Johnson-Lindenstrauss lemma for circulant matrices
On random plus/minus 1 matrices: Singularity and determinant
Rainbow Hamilton cycles in random regular graphs
1-Factorizations of pseudorandom graphs
Superconcentration in surface growth
Testing convexity of figures under the uniform distribution
A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
A generic approach for the unranking of labeled combinatorial classes
Contagious sets in a degree-proportional bootstrap percolation process
Testing the diameter of graphs
Dynamic concentration of the triangle-free process
On Generalized Independent Subsets of Trees
On extractors and exposure-resilient functions for sublogarithmic entropy
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints
Almost all trees are almost graceful
Triangle Processes on Graphs With Given Degree Sequence
The minimum expectation selection problem
Sizes of the largest clusters for supercritical percolation on random recursive trees
A few logs suffice to build (almost) all trees (I)
Normal approximation and fourth moment theorems for monochromatic triangles
Algorithms for coloring semi-random graphs
Isomorphic edge disjoint subgraphs of hypergraphs
Hypergeometrics and the Cost Structure of Quadtrees
On the maximal multiplicity of block sizes in a random set partition
The Diameter of a Random Graph with Bounded Diameter
A fourth-moment phenomenon for asymptotic normality of monochromatic subgraphs
The cut-tree of large trees with small heights
When does the top homology of a random simplicial complex vanish?
Quasi-random hypergraphs revisited
On random points in the unit disk
Concentration of vertex degrees in a scale-free random graph process
Improved lower bounds on the randomized complexity of graph properties
Sharp threshold for the appearance of certain spanning trees in random graphs
Avoiding a giant component
Graph bootstrap percolation
Shellsort with three increments
Edge-disjoint Hamilton cycles in random graphs
A simple algorithm for graph reconstruction
The birth of the strong components
Completeness and robustness properties of min-wise independent permutations
On the clique number of noisy random geometric graphs
The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags
Rapid mixing of hypergraph independent sets
Three-wise independent random walks can be slightly unbounded
Expected Hitting and Cover Times of Random Walks on Some Special Graphs
Cores in random hypergraphs and Boolean formulas
Component Behavior Near the Critical Point of the Random Graph Process
Correlations for paths in random orientations of G(n, p) and G(n, m)
The cutoff phenomenon for randomized riffle shuffles
A constant arising from the analysis of algorithms for determining the maximum of a random walk
Spanning universality in random graphs
Sharp threshold for the Erdős-Ko-Rado theorem
On the Computational Complexity of Ordered Subgraph Recognition
An Extension of 0-1 Laws
Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
Twin peaks
An Example of a Superproportional Graph
The size of the giant high-order component in random hypergraphs
On the square of a Hamiltonian cycle in dense graphs
Counting Hamilton cycles in sparse random directed graphs
Size of nodal domains of the eigenvectors of a graph
Random cutting and records in deterministic and random trees
Random perfect matchings in regular graphs
Wireless random-access networks with bipartite interference graphs
Bounds for pairs in judicious partitioning of graphs
Erasures versus errors in local decoding and property testing
Long paths and cycles in random subgraphs of graphs with large minimum degree
The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph
Weighted enumeration of spanning subgraphs in locally tree-like graphs
Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions
A gap between the appearances of a k-core and a (k+1)-chromatic graph
Transference for loose Hamilton cycles in random 3-uniform hypergraphs
Stability of Vertices in Random Boolean Cellular Automata
On smallest triangles
0-1 laws for maps
Isoperimetric inequalities for real-valued functions with applications to monotonicity testing
Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
Large Cliques Elude the Metropolis Process
On the covariance of the level sizes in random recursive trees
Sparse random graphs with clustering
Minors in lifts of graphs
Universality of superconcentration in the Sherrington-Kirkpatrick model
A down-up chain with persistent labels on multifurcating trees
Ronald Louis Graham (1935 - 2020)
On the expected value of the minimum assignment
Disjoint bases in a polymatroid
Large deviations of the greedy independent set algorithm on sparse random graphs
Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
Longest convex chains
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs
On replica symmetry of large deviations in random graphs
A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
Structure of random 312-avoiding permutations
Interpolating between random walk and rotor walk
Exponentially small bounds on the expected optimum of the partition and subset sum problems
Testing properties of directed graphs: acyclicity and connectivity
On the log-product of the subtree-sizes of random trees
On graphs with the maximum number of spanning trees
The number of k-SAT functions
Fast convergence of the Glauber dynamics for sampling independent sets