yusuke1997/dblp-id-title huggingface dataset:
An optimal (ϵ, δ)-randomized approximation scheme for the mean of random variables with bounded relative variance
Random Cayley Graphs and Expanders
Note on a problem of M. Talagrand
On breadth-first constructions of scaling limits of random graphs and random unicellular maps
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
Asymptotic expansions in n -1 for percolation critical values on the n -Cube and Z n
Avoidance of a giant component in half the edge set of a random graph
Tunneling of the hard-core model on finite triangular lattices
Limit theorems for patterns in ranked tree-child networks
Randomized greedy algorithms for finding small k -dominating sets of regular graphs
Efficient algorithms for three-dimensional axial and planar random assignment problems
Swendsen-Wang dynamics for general graphs in the tree uniqueness region
Less hashing, same performance: Building a better Bloom filter
A Parallel Algorithmic Version of the Local Lemma
A sharp threshold for the Hamilton cycle Maker-Breaker game
Estimating the distance to a monotone function
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
Multirange percolation on oriented trees: Critical curve and limit behavior
On the 2-Cyclic Property in 2-Regular Digraphs
Nearest neighbor and hard sphere models in continuum percolation
When does the K 4 -free process stop?
Chromatic thresholds in dense random graphs
Factors in randomly perturbed hypergraphs
Minors in random regular graphs
The onset of dominance in balls-in-bins processes with feedback
Spanning trees in randomly perturbed graphs
Coloring uniform hypergraphs with few colors
Building uniformly random subtrees
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
On the size of the algebraic difference of two random Cantor sets
The Dominating Number of Random Cubic Graph
Lollipop graphs are extremal for commute times
The diameter of randomly perturbed digraphs and some applications
A Tight Lower Bound on the Cover Time for Random Walks on Graphs
Random doubly stochastic tridiagonal matrices
Sumsets and entropy
Almost-spanning universality in random graphs
Poisson Approximation for Large Deviations
The Klee-Minty random edge chain moves with linear speed
The Blocking Probability of Spider-Web Networks
A unified view of graph regularity via matrix decompositions
Piercing random boxes
On random irregular subgraphs
Approximate Hamilton decompositions of random graphs
On the swapping algorithm
Planar graphs: Random walks and bipartiteness testing
Phase transition for Parking blocks, Brownian excursion and coalescence
Exact and approximative algorithms for coloring G(n, p)
Ramsey numbers of cycles in random graphs
Tight Hamilton cycles in random hypergraphs
Hyperuniform and rigid stable matchings
Ten Years!
On the probability of independent sets in random graphs
A decision procedure for well-formed linear quantum cellular automata
Dependent random choice
Broadcasting-induced colorings of preferential attachment trees
Finding a large hidden clique in a random graph
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Proof of a tiling conjecture of Komlós
Matchings in Random Spanning Subgraphs of Cubelike Graphs
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Fractional cycle decompositions in hypergraphs
Random perfect graphs
Limiting distributions for the costs of partial match retrievals in multidimensional tries
A phase transition for avoiding a giant component
Quasi-Random Hypergraphs
The Kőnig graph process
Barrier Coverage
Perfect simulation with exponential tails on the running time
The fraction of large random trees representing a given Boolean function in implicational logic
A note on scrambling permutations
Randomly generated intersecting hypergraphs II
Existence, uniqueness, and algorithmic computation of general lilypond systems
An adaptive O (log n )-optimal policy for the online selection of a monotone subsequence from a random sample
Tail bounds for the height and width of a random tree with a given degree sequence
Some exact rates for the random weighted interval packing problem
Connectivity Properties of Random Subgraphs of the Cube
A Poisson * Negative Binomial Convolution Law for Random Polynomials over Finite Fields
Vector balancing in Lebesgue spaces
Phase diagram for the constrained integer partitioning problem
Integer and fractional packing of families of graphs
Twin-width of random graphs
Large deviation analysis for layered percolation problems on the complete graph
Phase transition and finite-size scaling for the integer partitioning problem
On systematic scan for sampling H-colorings of the path
Perfect fractional matchings in random hypergraphs
Percolation on random recursive trees
The secretary problem on an unknown poset
Mantel's theorem for random hypergraphs
Sharp load thresholds for cuckoo hashing
The time of graph bootstrap percolation
An improved upper bound on the density of universal random graphs
Bounding Ramsey Numbers through Large Deviation Inequalities
Sharp thresholds for constraint satisfaction problems and homomorphisms
Slightly subcritical hypercube percolation
Shortest-path metric approximation for random subgraphs
The Maximum Degree in a Random Tree and Related Problems
Justifying the small-world phenomenon via random recursive trees
Asymmetric Ramsey properties of random graphs involving cliques and cycles
Critical behavior in inhomogeneous random graphs
Topological embeddings into random 2-complexes
Colorings, transversals, and local sparsity
Four random permutations conjugated by an adversary generate S n with high probability
The Greedy Independent Set in a Random Graph with Given Degrees
Equivalent regular partitions of three-uniform hypergraphs
Simply generated trees, B-series and Wigner processes
Approximating the distance to monotonicity of Boolean functions
The Birth of the Giant Component
The shape of large Galton-Watson trees with possibly infinite variance
First-passage percolation on a ladder graph, and the path cost in a VCG auction
Cluster analysis of local convergent sequences of structures
Covering of r-Graphs by Complete r-Partite Subgraphs
On the cut-off phenomenon for the transitivity of randomly generated subgroups
Learning finite binary sequences from half-space data
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
A threshold for the Maker-Breaker clique game
Convergence of branching processes to the local time of a Bessel process
The probabilistic analysis of a greedy satisfiability algorithm
On random orderings of variables for parity ordered binary decision diagrams
Grids in Random Graphs
A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
The upper tail problem for induced 4-cycles in sparse random graphs
Almost All Graphs with 1.44n Edges are 3-Colorable
On the distribution of rank of a random matrix over a finite field
MAX-CUT has a randomized approximation scheme in dense graphs
What is the satisfiability threshold of random balanced Boolean expressions?
A generalization of Faudree-Lehel conjecture holds almost surely for random graphs
Growing uniform planar maps face by face
Right order spectral gap estimates for generating sets of Z 4
Nodes of large degree in random trees and forests
Hydrodynamic limit of the Robinson-Schensted-Knuth algorithm
Local resilience of graphs
A combination of testability and decodability by tensor products
An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number
Critical percolation on random regular graphs
Uniform infinite planar quadrangulations with a boundary
Random majority percolation
Reverse juggling processes
Percolation of arbitrary words in one dimension
Tree decompositions of graphs without large bipartite holes
Analysis of Rabin's irreducibility test for polynomials over finite fields
The height of increasing trees
Counting connected graphs and hypergraphs via the probabilistic method
Optimal bisections of directed graphs
Resilience of perfect matchings and Hamiltonicity in random graph processes
Dirac's theorem for random graphs
Fluctuations in a general preferential attachment model via Stein's method
Two-coloring random hypergraphs
Reinforced Galton-Watson processes I: Malthusian exponents
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
Sparse graphs: Metrics and random models
The Moran Process on a Random Graph
Competing first passage percolation on random regular graphs
Asymptotic degree distribution in random recursive trees
Random covering of an interval and a variation of Kingman's coalescent
Bounds on absorption times of directionally biased random sequences
Discrepancy of random graphs and hypergraphs
Level of nodes in increasing trees revisited
Random nearest neighbor and influence graphs on Z d
Stability Properties of a Flow Process in Graphs
Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one-dimensional labels
Counting independent sets in graphs with bounded bipartite pathwidth
On Tree Census and the Giant Component in Sparse Random Graphs
Multicyclic Components in a Random Graph Process
Property testers for dense constraint satisfaction programs on finite domains
Statistical properties of subgroups of free groups
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets
On the value of the critical point in fractal percolation
Packing vertices and edges in random regular graphs
The genus of the Erdős-Rényi random graph and the fragile genus property
The Marčenko-Pastur law for sparse random bipartite biregular graphs
Extension of Fill's perfect rejection sampling algorithm to general chains
Dispersion on the Complete Graph
Near-optimal list colorings
Geometry of the uniform infinite half-planar quadrangulation
Nucleation and growth in two dimensions
Traveling in randomly embedded random graphs
Coupling vs. conductance for the Jerrum-Sinclair chain
On the max-cut of sparse random graphs
The square of a Hamilton cycle in randomly perturbed graphs
The scaling window of the 2-SAT transition
Proportional Graphs
On the modularity of 3-regular random graphs and random graphs with given degree sequences
On the structure of clique-free graphs
The action of a few permutations on r-tuples is quickly transitive
Stochastic domination in space-time for the contact process
Word maps and spectra of random graph lifts
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
Inside the critical window for cohomology of random k -complexes
A counterexample to the DeMarco-Kahn upper tail conjecture
An algorithmic hypergraph regularity lemma
Mixing of the Glauber dynamics for the ferromagnetic Potts model
The connectivity threshold for the min-degree random graph process
On the threshold problem for Latin boxes
Regular pairs in sparse random graphs I
Singular values of Gaussian matrices and permanent estimators
Judicious partitions of directed graphs
Sampling independent sets in the discrete torus
Coboundary expansion for the union of determinantal hypertrees
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
Concentration of non-Lipschitz functions and applications
Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1
Disjoint Systems
Sparse random graphs: Eigenvalues and eigenvectors
A domination algorithm for {0, 1}-instances of the travelling salesman problem
Counting extensions revisited
A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees
Sharp asymptotic for the chemical distance in long-range percolation
Perfect sampling from spatial mixing
A robust Corrádi-Hajnal theorem
Depth Properties of scaled attachment random recursive trees
Random walks on stochastic hyperbolic half planar triangulations
Cycles in a Random Graph Near the Critical Point
Distribution of the number of consecutive records
Sparse universal graphs for bounded-degree graphs
K 5 -free subgraphs of random graphs
The diameter of inhomogeneous random graphs
Nonrepetitive list colourings of paths
A Harris-Kesten theorem for confetti percolation
Distances in random graphs with finite variance degrees
Addendum to On the log-product of the subtree-sizes of random trees
Increasing the output length of zero-error dispersers
Some applications of the q-Rice formula
Quickest online selection of an increasing subsequence of specified size
Evasive random walks and the clairvoyant demon
A Jump of the Saturation Number in Random Graphs?
List coloring triangle-free hypergraphs
Probabilistic analysis of power assignments
Efficient Generation of Random Nonsingular Matrices
Inexpensive d-dimensional matchings
High degrees in random recursive trees
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
The solution space geometry of random linear equations
Noncrossing trees are almost conditioned Galton-Watson trees
Constrained percolation, Ising model, and XOR Ising model on planar lattices
Efficient sampling and counting algorithms for the Potts model on ℤ d at all temperatures
On the asymmetry of random regular graphs and random graphs
Constructions of sparse uniform hypergraphs with high chromatic number
Concentration estimates for functions of finite high-dimensional random arrays
Sharp bounds for the variance of linear statistics on random permutations
Generating unlabeled connected cubic planar graphs uniformly at random
Simple analysis of graph tests for linearity and PCP
The forgetfulness of balls and bins
Greek letters in random staircase tableaux
Asymptotic distributions for partial match queries in K-d trees
On edge-ordered Ramsey numbers
On the Replica Symmetric Solution in General Diluted Spin Glasses
On the typical structure of graphs not containing a fixed vertex-critical subgraph
The largest hole in sparse random graphs
Random k -SAT and the power of two choices
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
Cycle length distributions in random permutations with diverging cycle weights
A randomized version of Ramsey's theorem
Largest 4-Connected Components of 3-Connected Planar Triangulations
A lower bound for set-coloring Ramsey numbers
Firefighting on a random geometric graph
Decycling numbers of random regular graphs
Average-case complexity of shortest-paths problems in the vertex-potential model
Induced subgraphs with distinct sizes
On the Independence Number of Random Cubic Graphs
A Bayesian Proof of the Spread Lemma
Improved bounds for sampling contingency tables
On induced Ramsey numbers for k -uniform hypergraphs
The lower tail: Poisson approximation revisited
An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
An extension of Janson's inequality
The second largest component in the supercritical 2D Hamming graph
Diffusivity of a random walk on random walks
On large intersecting subfamilies of uniform setfamilies
A probabilistic counting lemma for complete graphs
Invertibility via distance for noncentered random matrices with continuous distributions
Probabilistic behavior of asymmetric level compressed tries
Testing for high-dimensional geometry in random graphs
Perfect simulation of processes with long memory: A "coupling into and from the past" algorithm
Reversible random walks on dynamic graphs
The number of Boolean functions computed by formulas of a given size
Dispersion processes
Percolation in a dependent random environment
A cutting process for random mappings
Bootstrap percolation with inhibition
How complex are random graphs in first order logic?
Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture
Law of the iterated logarithm for random graphs
Tight Hamilton cycles in random uniform hypergraphs
On the concentration of the number of solutions of random satisfiability formulas
Expansion and flooding in dynamic random networks with node churn
Percolation and limit theory for the poisson lilypond model
A periodic isoperimetric problem related to the unique games conjecture
The "Power of Few" Phenomenon: The Sparse Case
Random lifts of graphs: Independence and chromatic number
Long cycles in random subgraphs of graphs with large minimum degree
Approximate counting via random optimization
New approach to nonrepetitive sequences
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model
On the distribution of binary search trees under the random permutation model
A hypergraph blow-up lemma
Pósa's conjecture for graphs of order at least 2 × 10 8
Competing first passage percolation on random graphs with finite variance degrees
Rainbow trees in uniformly edge-colored graphs
Colliding Stacks: A Large Deviations Analysis
Every planar graph with the Liouville property is amenable
Phase transitions of the Moran process and algorithmic consequences
Addendum to "Simple Construction of Almost k-wise Independent Random Variables"
Random partitions with restricted part sizes
Random cliques in random graphs and sharp thresholds for F $$ F $$ -factors
Percolation on dual lattices with k -fold symmetry
On the weight distribution of random binary linear codes
The diamond-free process
Approximating the limiting Quicksort distribution
A generalized Turán problem in random graphs
Simulating events of unknown probabilities via reverse time martingales
The poset of hypergraph quasirandomness
Eigenvalue confinement and spectral gap for random simplicial complexes
Modularity of Erdős-Rényi random graphs
The Bohman-Frieze process near criticality
Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions
A Critical Point for Random Graphs with a Given Degree Sequence
Independent sets in hypergraphs omitting an intersection
Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu
On Hamilton cycles in Erdős-Rényi subgraphs of large graphs
Bin packing with discrete item sizes, part II: Tight bounds on First Fit
Fast algorithms at low temperatures via Markov chains
Matrix rounding with respect to small submatrices
Short cycle distribution in random regular graphs recursively generated by pegging
Probabilistic and combinatorial aspects of the card-cyclic to random insertion shuffle
On densities for solutions to stochastic fixed point equations
Degrees and choice numbers
Finding maximum matchings in random regular graphs in linear expected time
Construction of expanders and superconcentrators using Kolmogorov complexity
Gap-Free Set Partitions
The Johansson-Molloy theorem for DP-coloring
On the variational problem for upper tails in sparse random graphs
Properly colored Hamilton cycles in edge-colored complete graphs
Law of large numbers for increasing subsequences of random permutations
Powers of Hamiltonian cycles in randomly augmented graphs
The Largest Connected in a Random Mapping
The Evaluation of Random Subgraphs of the Cube
Expansion in supercritical random subgraphs of expanders and its consequences
Natural quasirandomness properties
Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process
A new combinatorial representation of the additive coalescent
MOD p -tests, almost independence and small probability spaces
On the concentration of multivariate polynomials with small expectation
Outliers in spectrum of sparse Wigner matrices
Generating random elements of abelian groups
Online Ramsey games for more than two colors
On martingale tail sums for the path length in random trees
A random mapping with preferential attachment
The square lattice shuffle, correction
MAX k -CUT and approximating the chromatic number of random graphs
On the distribution of search cost for the move-to-front rule
Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes
Squares of Hamiltonian cycles in 3-uniform hypergraphs
Random graphs generated by the Star 2-Process
Testing membership in parenthesis languages
On the internal path length of d-dimensional quad trees
Bounds for algebraic gossip on graphs
Almost All Cubic Graphs Are Hamiltonian
Random dense bipartite graphs and directed graphs with specified degrees
Increasing Hamiltonian paths in random edge orderings
On near-critical and dynamical percolation in the tree case
Asymptotic sine laws arising from alternating random permutations and sequences
Lower bounds for adaptive locally decodable codes
Low-Diameter Graph Decomposition Is in NC
Matchings in Superpositions of (n, n)-Bipartite Trees
The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2
Multipass greedy coloring of simple uniform hypergraphs
A parallel search game
Highly nonrepetitive sequences: Winning strategies from the local lemma
Randomized rumor spreading in poorly connected small-world networks
Analysis of a splitting process arising in probabilistic counting and other related algorithms
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
Holes and islands in random point sets
Random cubic planar graphs
Very rapidly mixing Markov chains for 2-colorings and for independent sets in a graph with maximum degree 4
Characterization of quasirandom permutations by a pattern sum
On powers of tight Hamilton cycles in randomly perturbed hypergraphs
Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model
Analysis of Boyer-Moore-Horspool string-matching heuristic
On sampling with Markov chains
Coin flipping from a cosmic source: On error correction of truly random bits
Sets without k-term progressions can have many shorter progressions
Gaussian averages, Bernoulli averages, and Gibbs' measures
Polynomial time approximation of dense weighted instances of MAX-CUT
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
Limit shapes of bumping routes in the Robinson-Schensted correspondence
The cover time of the giant component of a random graph
The size-Ramsey number of trees
Limit Laws for Local Counters in Random Binary Search Tree
The critical behavior of random digraphs
Randomness friendly graphs
Iterated tour partitioning for Euclidean capacitated vehicle routing
Concentration inequalities for functions of independent variables
Finding Adam in random growing trees
Rainbow matchings and Hamilton cycles in random graphs
D·E·K=(1000) 8
Uniform multicommodity flows in the hypercube with random edge-capacities
Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups
Online purchasing under uncertainty
Triangle-free subgraphs in the triangle-free process
Dispersing hash functions
On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
Hamiltonicity of random graphs produced by 2-processes
Site percolation on pseudo-random graphs
The CRT is the scaling limit of unordered binary trees
Finding blocks and other patterns in a random coloring of Z
New and faster filters for multiple approximate string matching
Asymptotics for dependent sums of random vectors
Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes
Prominent examples of flip processes
Poisson approximations for functionals of random trees
Techniques for bounding the convergence rate of genetic algorithms
Positional games on random graphs
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
Upper tail for homomorphism counts in constrained sparse random graphs
The isoperimetric constant of the random graph process
On the minimax spherical designs
Fuzzy transformations and extremality of Gibbs measures for the potts model on a Cayley tree
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions
Convergence of probabilities for the second order monadic properties of a random mapping