Entity usage

Showing below up to 50 results in range #51 to #100.

51. Eigenvalues of Euclidean random matrices: Label: en
52. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP: Label: en
53. Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models: Label: en
54. A combinatorial approach to jumping particles: The parallel TASEP: Label: en
55. Local resilience of graphs: Label: en
56. Sampling independent sets in the discrete torus: Label: en
57. Random walks on the vertices of transportation polytopes with constant number of sources: Label: en
58. Sharp thresholds for constraint satisfaction problems and homomorphisms: Label: en
59. The cycle structure of two rows in a random Latin square: Label: en
60. The rank of random graphs: Label: en
61. How to get more mileage from randomness extractors: Label: en
62. On variants of the Johnson–Lindenstrauss lemma: Label: en
63. What is the furthest graph from a hereditary property?: Label: en
64. The evolution of the mixing rate of a simple random walk on the giant component of a random graph: Label: en
65. Testing monotonicity over graph products: Label: en
66. Perfect simulation with exponential tails on the running time: Label: en
67. Factors in random graphs: Label: en
68. Hitting time of large subsets of the hypercube: Label: en
69. The persistent-access-caching algorithm: Label: en
70. Less hashing, same performance: Building a better Bloom filter: Label: en
71. A spectral technique for random satisfiable 3CNF formulas: Label: en
72. Approximating average parameters of graphs: Label: en
73. Percolation on dual lattices withk-fold symmetry: Label: en
74. Random partitions with restricted part sizes: Label: en
75. The cover time of the giant component of a random graph: Label: en
76. Path coupling using stopping times and counting independent sets and colorings in hypergraphs: Label: en
77. How many random edges make a dense hypergraph non-2-colorable?: Label: en
78. Probabilistic analysis of a parallel algorithm for finding maximal independent sets: Label: en
79. A functional limit theorem for random graphs with applications to subgraph count statistics: Label: en
80. Complete matchings in random subgraphs of the cube: Label: en
81. Quasi-random hypergraphs: Label: en
82. Improved lower bounds on the randomized complexity of graph properties: Label: en
83. The chance that a convex body is lattice-point free: A relative of Buffon's needle problem: Label: en
84. Profiles of random trees: Plane-oriented recursive trees: Label: en
85. The weight of the shortest path tree: Label: en
86. The geometry of logconcave functions and sampling algorithms: Label: en
87. Concentration for self-bounding functions and an inequality of Talagrand: Label: en
88. Sharp thresholds and percolation in the plane: Label: en
89. Limit laws for embedded trees: Applications to the integrated superBrownian excursion: Label: en
90. The square lattice shuffle: Label: en
91. Randomly coloring sparse random graphs with fewer colors than the maximum degree: Label: en
92. Coloring complete bipartite graphs from random lists: Label: en
93. Some conditional correlation inequalities for percolation and related processes: Label: en
94. Large deviations for mean field models of probabilistic cellular automata: Label: en
95. A spectral heuristic for bisecting random graphs: Label: en
96. Existence, uniqueness, and algorithmic computation of general lilypond systems: Label: en
97. Regular graphs whose subgraphs tend to be acyclic: Label: en
98. On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution: Label: en
99. Law of large numbers for increasing subsequences of random permutations: Label: en
100. Covering minimum spanning trees of random subgraphs: Label: en