195 results on '"Hsien-Kuei Hwang"'
Search Results
2. Asymptotic variance of random symmetric digital search trees
3. Profiles of random trees: plane-oriented recursive trees
4. Efficient maxima-finding algorithms for random planar samples
5. Periodic minimum in the count of binomial coefficients not divisible by a prime.
6. Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow.
7. Identities and periodic oscillations of divide-and-conquer recurrences splitting at half.
8. A Curious Identity Arising From Stirling's Formula and Saddle-Point Method on Two Different Contours.
9. Node profiles of symmetric digital search trees: Concentration properties.
10. Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools.
11. Identities and periodic oscillations of divide-and-conquer recurrences splitting at half.
12. Bell Numbers in Matsunaga's and Arima's Genjikō Combinatorics: Modern Perspectives and Local Limit Theorems.
13. Asymptotic Distribution of Parameters in Random Maps.
14. Asymptotic Expansions for Sub-Critical Lagrangean Forms.
15. External Profile of Symmetric Digital Search Trees (Extended Abstract).
16. An asymptotic distribution theory for Eulerian recurrences with applications.
17. Increasing Diamonds.
18. Dependence and phase changes in random m-ary search trees.
19. Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications.
20. Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation.
21. From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader.
22. Dependence between path-length and size in random digital trees.
23. Phase transitions from exp(n1/2) to exp(n2/3) in the asymptotics of banded plane partitions.
24. Asymptotics and statistics on Fishburn matrices and their generalizations.
25. Shape Measures of Random Increasing k-trees.
26. Probabilistic Analysis of the (1+1)-Evolutionary Algorithm.
27. Preface.
28. Limit distribution of the coefficients of polynomials with only unit roots.
29. Random unfriendly seating arrangement in a dining table.
30. The Connectivity-Profile of Random Increasing k-trees.
31. Psi-series method for equality of random trees and quadratic convolution recurrences.
32. A Binomial Splitting Process in Connection with Corner Parking Problems.
33. An analytic approach to the asymptotic variance of trie statistics and related structures.
34. Analysis of an Exhaustive Search Algorithm in Random Graphs and the nclog n-Asymptotics.
35. Profile of Tries.
36. Threshold Phenomena in k-Dominant Skylines of Random Samples.
37. On the Number of Heaps and the Cost of Heap Construction
38. Dependence between External Path-Length and Size in Random Tries.
39. Maxima-finding algorithms for multidimensional samples: A two-phase approach.
40. Profiles of Tries.
41. Profiles of random trees: Plane-oriented recursive trees.
42. Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.
43. Partial Match Queries in Random k-d Trees.
44. Limit distribution of the number of consecutive records.
45. Maxima in hypercubes.
46. Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees.
47. An asymptotic theory for recurrence relations based on minimization and maximization.
48. Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model.
49. Partial Match Queries in Random Quadtrees.
50. Quickselect And The Dickman Function.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.