Mark Daniel Ward

According to our database1, Mark Daniel Ward authored at least 25 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The next wave: We will all be data scientists.
Stat. Anal. Data Min., 2020

Asymptotic Analysis of the kth Subword Complexity.
Entropy, 2020

Analyzing Worldwide Social Distancing through Large-Scale Computer Vision.
CoRR, 2020

Observing Responses to the COVID-19 Pandemic using Worldwide Network Cameras.
CoRR, 2020

Special Issue on Analysis of Algorithms.
Algorithmica, 2020

2019
Undergraduate Data Science and Diversity at Purdue University.
Proceedings of the Practice and Experience in Advanced Research Computing on Rise of the Machines (learning), 2019


Moments of Select Sets.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Periods in Subtraction Games (Keynote Speakers).
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Asymptotic Analysis of Sums of Powers of Multinomial Coefficients: A Saddle Point Approach.
Integers, 2017

2016
On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees.
Exp. Math., 2016

Variance of the Internal Profile in Suffix Trees.
CoRR, 2016

2015
Asymptotic Properties of Protected Nodes in Random Recursive Trees.
J. Appl. Probab., 2015

Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics.
Comb. Probab. Comput., 2015

2014
On Kotzig's Nim.
Integers, 2014

2013
The Variance of the Number of 2-Protected Nodes in a Trie.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2012
Number of survivors in the presence of a demon.
Period. Math. Hung., 2012

Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf.
Electron. J. Comb., 2012

Asymptotic distribution of two-protected nodes in random binary search trees.
Appl. Math. Lett., 2012

2009
Inverse auctions: Injecting unique minima into random sets.
ACM Trans. Algorithms, 2009

2007
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments.
IEEE Trans. Inf. Theory, 2007

The Average Profile of Suffix Trees.
Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006
Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2004
Error resilient LZ'77 scheme and its analysis.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004


  Loading...