The following pages link to Mark Daniel Ward (Q426886):
Displaying 37 items.
- Partitions with distinct multiplicities of parts: on an ``unsolved problem'' posed by Herbert Wilf (Q426887) (← links)
- Asymptotic distribution of two-protected nodes in random binary search trees (Q714563) (← links)
- The truncated geometric election algorithm: duration of the election (Q893906) (← links)
- On the variety of shapes in digital trees (Q1692230) (← links)
- Number of survivors in the presence of a demon (Q2428650) (← links)
- On a leader election algorithm: truncated geometric case study (Q2452871) (← links)
- Asymptotic joint normality of counts of uncorrelated motifs in recursive trees (Q2513659) (← links)
- On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees (Q2815493) (← links)
- Asymptotic analysis of the Nörlund and Stirling polynomials (Q2853264) (← links)
- (Q2920872) (← links)
- (Q2926289) (← links)
- Inverse auctions (Q2930297) (← links)
- (Q2959934) (← links)
- Asymptotic Properties of a Leader Election Algorithm (Q3014993) (← links)
- Average-Case Analysis of Cousins in <i>m</i>-ary Tries (Q3535643) (← links)
- Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments (Q3548234) (← links)
- (Q3576750) (← links)
- On the shape of the fringe of various types of random trees (Q3634637) (← links)
- (Q4632481) (← links)
- The number of distinct adjacent pairs in geometrically distributed words (Q4987263) (← links)
- The Average Profile of Suffix Trees (Q5194610) (← links)
- The Variance of the Number of 2-Protected Nodes in a Trie (Q5194737) (← links)
- Moments of Select Sets (Q5195233) (← links)
- Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation (Q5233153) (← links)
- Asymptotic Properties of Protected Nodes in Random Recursive Trees (Q5252253) (← links)
- Resolution of T. Ward's Question and the Israel–Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics (Q5364220) (← links)
- (Q5384183) (← links)
- BUILDING RANDOM TREES FROM BLOCKS (Q5413455) (← links)
- (Q5485317) (← links)
- (Q5485324) (← links)
- (Q5485338) (← links)
- Fostering Undergraduate Data Science (Q5869240) (← links)
- Building Bridges: The Role of an Undergraduate Mentor (Q5885428) (← links)
- The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis (Q6507779) (← links)
- The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis (Q6599787) (← links)
- The data mine model for accessible partnerships in data science (Q6604358) (← links)
- A unified treatment of families of partition functions (Q6659501) (← links)
