Mark Daniel Ward

From MaRDI portal
Person:426886

Available identifiers

zbMath Open ward.mark-danielMaRDI QIDQ426886

List of research outcomes





PublicationDate of PublicationType
A unified treatment of families of partition functions2025-01-09Paper
The data mine model for accessible partnerships in data science2024-09-12Paper
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis2024-09-06Paper
Building Bridges: The Role of an Undergraduate Mentor2023-04-03Paper
A unified treatment of families of partition functions2023-03-03Paper
Fostering Undergraduate Data Science2022-09-28Paper
Closed-form formulas and properties of coefficients in Maclaurin's series expansion of Wilf's function composited by inverse tangent, square root, and exponential functions2021-10-16Paper
The number of distinct adjacent pairs in geometrically distributed words2021-05-03Paper
Moments of Select Sets2019-09-18Paper
The Variance of the Number of 2-Protected Nodes in a Trie2019-09-17Paper
Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation2019-09-16Paper
The Average Profile of Suffix Trees2019-09-16Paper
https://portal.mardi4nfdi.de/entity/Q53841832019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q46324812019-04-29Paper
On the variety of shapes in digital trees2018-01-26Paper
Resolution of T. Ward's Question and the Israel–Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics2017-10-04Paper
https://portal.mardi4nfdi.de/entity/Q29599342017-02-10Paper
The continuum P\'olya-like random walk2016-08-03Paper
On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees2016-06-29Paper
A Conjecture about Periods in Subtraction Games2016-06-08Paper
The truncated geometric election algorithm: duration of the election2015-11-23Paper
Asymptotic Properties of Protected Nodes in Random Recursive Trees2015-05-29Paper
Asymptotic joint normality of counts of uncorrelated motifs in recursive trees2015-01-28Paper
Inverse auctions2014-11-18Paper
Inverse auctions, injecting unique minima into random sets2014-11-18Paper
On Kotzig's Nim2014-10-23Paper
On the number of 2-protected nodes in tries and suffix trees2014-09-29Paper
On a leader election algorithm: truncated geometric case study2014-06-05Paper
BUILDING RANDOM TREES FROM BLOCKS2014-04-30Paper
Asymptotic analysis of the Nörlund and Stirling polynomials2013-10-18Paper
Asymptotic distribution of two-protected nodes in random binary search trees2012-10-11Paper
Partitions with distinct multiplicities of parts: on an ``unsolved problem posed by Herbert Wilf2012-06-12Paper
Number of survivors in the presence of a demon2012-04-26Paper
Asymptotic properties of a leader election algorithm2011-07-08Paper
On correlation polynomials and subword complexity2010-08-02Paper
On the shape of the fringe of various types of random trees2009-06-25Paper
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments2008-12-21Paper
Average-Case Analysis of Cousins in m-ary Tries2008-11-13Paper
Analysis of the average depth in a suffix tree under a Markov model2006-08-29Paper
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables2006-08-29Paper
https://portal.mardi4nfdi.de/entity/Q54853172006-08-29Paper
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysisN/APaper

Research outcomes over time

This page was built for person: Mark Daniel Ward