ebook img

Random Structures & Algorithms 1995: Vol 7 Index PDF

3 Pages·1995·0.92 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Random Structures & Algorithms 1995: Vol 7 Index

Random Structures & Algorithms Author Index to Volume 7 Bender, E.A.: Largest 4-Connected Occupancy and the Satisfiability Components of 3-Connected Planar Threshold Conjecture, 59 Triangulations, 273 Karp, R.M. and Zhang, Y.: Bounded Branching Process and AND/OR Tree Cai, J.-y.: On the Impossibility of Evaluation, 97 Amplifying the Independence of Kim, J.: The Ramsey Number R(3,t) Random Variables, 301 Has Order of Magnitude #7/log t, 173 Chari, S.: See Cai, J.-y., 301 Krajicek, J., Pudlak, P., and Woods, DeLaurentis, J.: Appearance of A.: An Exponential Lower Bound to the Complex Components in a Random Size of Bounded Depth Frege Proofs of Bigraph, 311 the Pigeonhole Principle, 15 Devroye, L. and Lu, J.: The Strong Krivelevich, M.: Bounding Ramsey Convergence of Maximal Degrees in Numbers through Large Deviation Uniform Random Recursive Trees and Inequalities, 145 Dags, 1 Duffus, D., Ginn, M., and Rddl, V.: Labelle, L.: See Flajolet, P., 117 On the Computational Complexity or Laforest, L.: See Flajolet, P., 117 Ordered Subgraph Recognition, 223 Lu, J.: See Devroye, L., 1 Flajolet, P., Labelle, G., Laforest, L., McGeoch, C.C.: Optimal Sampling and Salvy, B.: Hypergeomet-rics and Strategies for Quicksort, 287 the Cost Structure of Quadtrees, 117 Molloy, M. and Reed, B.: The Frieze, A. and Janson, S.: Perfect Dominating Number of Random Cubic Matchings in Random s-Uniform Graph, 209 Hypergraphs, 41 Motwani, R.: See Kamath, A., 59 Ginn, M.: See Duffus, D., 223 Palem, K.: See Kamath, A., 59 Janson, S.: See Frieze, A., 41; The Minimal Spanning Tree in a Complete Reed B.: See Molloy, M., 209 Graph and a Functional Limit Theorem Richmond, L.B.: See Bender, E.A., for Trees in a Random Graph, 337 273 Jerrum, M.: A Very Simple Algorithm Rédl, V.: See Duffus, D., 223 for Estimating the Number of k- Colorings of a Low-Degree Graph, 157 Salvy, B.: See Flajolet, P., 117 Kamath, A., Motwani, R., Palem, K., Shearer, J.B.: On the Independence and Spirakis P.: Tail Bounds for Number of Sparse Graphs, 269 358 AUTHOR INDEX Spencer, J.: Asymptotic Packing via a Tygar, J.D.: See McGeoch, C.C., 287 Branching Process, 167 Wormald, N.C.: See Bender, E.A., 273 Spirakis, P.: See Kamath, A., 59 Schachinger, W.: The Variance of Zhang, Y.: See Karp, R.M., 97 Partial Match Retrieval in a Multidimensional Symmetric Trie, 81

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.