Random Struct. Algorithms - researchr journal

researchr

You are not signed in
Sign in
Sign up

273	--	286	Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald. Largest 4-Connected Components of 3-Connected Planar Triangulations
287	--	300	Catherine C. McGeoch, J. D. Tygar. Optimal Sampling Strategies for Quicksort
301	--	310	Jin-yi Cai, Suresh Chari. On the Impossibility of Amplifying the Independence of Random Variables
337	--	356	Svante Janson. The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph

173	--	208	Jeong Han Kim. The Ramsey Number R(3, t) Has Order of Magnitude t::2::/log t
209	--	222	Michael Molloy, Bruce A. Reed. The Dominating Number of Random Cubic Graph
223	--	268	Dwight Duffus, Mark Ginn, Vojtech Rödl. On the Computational Complexity of Ordered Subgraph Recognition
269	--	272	James B. Shearer. On the Independence Number of Sparse Graphs

97	--	116	Richard M. Karp, Yanjun Zhang. Bounded Branching Process AND/OR Tree Evaluation
117	--	144	Philippe Flajolet, Gilbert Labelle, Louise Laforest, Bruno Salvy. Hypergeometrics and the Cost Structure of Quadtrees
145	--	156	Michael Krivelevich. Bounding Ramsey Numbers through Large Deviation Inequalities
157	--	166	Mark Jerrum. A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph
167	--	172	Joel Spencer. Asymptotic Packing via a Branching Process

1	--	14	Luc Devroye, Jiang Lu. The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags
15	--	40	Jan Krajícek, Pavel Pudlák, Alan R. Woods. An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
41	--	58	Alan M. Frieze, Svante Janson. Perfect Matchings in Random s-Uniform Hypergraphs
59	--	80	Anil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis. Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture
81	--	96	Werner Schachinger. The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie

runs on WebDSL