default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Daniel Ward
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[e6]Mark Daniel Ward
:
33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2022, June 20-24, 2022, Philadelphia, PA, USA. LIPIcs 225, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-230-3 [contents]- 2021
- [c10]Joseph A. Lyon, Aparajita Jaiswal, Alejandra J. Magana, Ellen Gundlach, Mark Daniel Ward:
Student challenges, strategies, and learning within the Data Mine Learning Community. FIE 2021: 1-7 - 2020
- [j14]James Allen Fill, Mark Daniel Ward:
Special Issue on Analysis of Algorithms. Algorithmica 82(3): 385 (2020) - [j13]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Stephan Wagner, Mark Daniel Ward:
The number of distinct adjacent pairs in geometrically distributed words. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j12]Lida Ahmadi, Mark Daniel Ward:
Asymptotic Analysis of the kth Subword Complexity. Entropy 22(2): 207 (2020) - [j11]Margaret Betz, Ellen Gundlach, Elizabett Hillery, Jenna L. Rickus, Mark Daniel Ward:
The next wave: We will all be data scientists. Stat. Anal. Data Min. 13(6): 544-547 (2020) - [i4]Isha Ghodgaonkar, Abhinav Goel, Fischer Bordwell, Caleb Tung, Sarah Aghajanzadeh, Noah Curran, Ryan Chen, Kaiwen Yu, Sneha Mahapatra, Vishnu Banna, Gore Kao, Kate Lee, Xiao Hu, Nick Eliopolous, Akhil Chinnakotla, Damini Rijhwani, Ashley Kim, Aditya Chakraborty, Mark Daniel Ward, Yung-Hsiang Lu, George K. Thiruvathukal:
Observing Responses to the COVID-19 Pandemic using Worldwide Network Cameras. CoRR abs/2005.09091 (2020) - [i3]Isha Ghodgaonkar, Subhankar Chakraborty, Vishnu Banna, Shane Allcroft, Mohammed Metwaly, Fischer Bordwell, Kohsuke Kimura, Xinxin Zhao, Abhinav Goel, Caleb Tung, Akhil Chinnakotla, Minghao Xue, Yung-Hsiang Lu, Mark Daniel Ward, Wei Zakharov, David S. Ebert, David M. Barbarash, George K. Thiruvathukal:
Analyzing Worldwide Social Distancing through Large-Scale Computer Vision. CoRR abs/2008.12363 (2020)
2010 – 2019
- 2019
- [c9]Simon Langowski, Mark Daniel Ward:
Moments of Select Sets. ANALCO 2019: 67-73 - [c8]William S. Monroe, Michael Witt, Maria Pantoja, Christopher Lupo, Anne C. Elster, Joel C. Adams, Mark C. Wissink, Hang Liu, Chunhua Liao, Raphael B. Yehezkael, Benjamin H. Glick, Ravi Tripathi, Brian Smith, Jens Mache, Trilce Estrada, Debzani Deb, Ujjal Bhowmik, Yuting Chen, Dong San Choi, Zuofu Cheng, Gladys K. Andino, Pete E. Pascuzzi, Mark Daniel Ward:
Lightning Talks of EduHPC 2019. EduHPC@SC 2019: 25-31 - [c7]Elizabett Hillery, Mark Daniel Ward, Jenna L. Rickus, Alex Younts, Preston M. Smith, Eric Adams:
Undergraduate Data Science and Diversity at Purdue University. PEARC 2019: 88:1-88:6 - 2018
- [c6]Bret Benesh, Jamylle Carter, Deidra A. Coleman, Douglas G. Crabill, Jack H. Good, Michael A. Smith, Jennifer Travis, Mark Daniel Ward:
Periods in Subtraction Games (Keynote Speakers). AofA 2018: 8:1-8:3 - [e5]James Allen Fill, Mark Daniel Ward:
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden. LIPIcs 110, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-078-1 [contents] - 2017
- [j10]Guy Louchard, Mark Daniel Ward:
Asymptotic Analysis of Sums of Powers of Multinomial Coefficients: A Saddle Point Approach. Integers 17: A47 (2017) - [e4]Conrado Martínez, Mark Daniel Ward:
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017. SIAM 2017, ISBN 978-1-61197-477-5 [contents] - 2016
- [j9]Mohan Gopaladesikan, Stephan G. Wagner, Mark Daniel Ward:
On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees. Exp. Math. 25(3): 237-245 (2016) - [e3]James Allen Fill, Mark Daniel Ward:
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016. SIAM 2016, ISBN 978-1-61197-432-4 [contents] - [i2]Jeffrey Gaither, Mark Daniel Ward:
Variance of the Internal Profile in Suffix Trees. CoRR abs/1605.03390 (2016) - 2015
- [j8]Jeffrey Gaither, Guy Louchard, Stephan G. Wagner, Mark Daniel Ward:
Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics. Comb. Probab. Comput. 24(1): 195-215 (2015) - [j7]Hosam M. Mahmoud, Mark Daniel Ward:
Asymptotic Properties of Protected Nodes in Random Recursive Trees. J. Appl. Probab. 52(1): 290-297 (2015) - [e2]Robert Sedgewick, Mark Daniel Ward:
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015. SIAM 2015, ISBN 978-1-61197-376-1 [contents] - 2014
- [j6]Xin Lu Tan, Mark Daniel Ward:
On Kotzig's Nim. Integers 14: G6 (2014) - [e1]Michael Drmota, Mark Daniel Ward:
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2014, Portland, Oregon, USA, January 6, 2014. SIAM 2014, ISBN 978-1-61197-320-4 [contents] - 2013
- [c5]Jeffrey Gaither, Mark Daniel Ward:
The Variance of the Number of 2-Protected Nodes in a Trie. ANALCO 2013: 43-51 - 2012
- [j5]Hosam M. Mahmoud, Mark Daniel Ward:
Asymptotic distribution of two-protected nodes in random binary search trees. Appl. Math. Lett. 25(12): 2218-2222 (2012) - [j4]James Allen Fill, Svante Janson, Mark Daniel Ward:
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. Electron. J. Comb. 19(2): 18 (2012) - [j3]Guy Louchard, Helmut Prodinger, Mark Daniel Ward:
Number of survivors in the presence of a demon. Period. Math. Hung. 64(1): 101-117 (2012) - [i1]James Allen Fill, Svante Janson, Mark Daniel Ward:
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. CoRR abs/1203.2670 (2012)
2000 – 2009
- 2009
- [j2]F. Thomas Bruss, Guy Louchard, Mark Daniel Ward:
Inverse auctions: Injecting unique minima into random sets. ACM Trans. Algorithms 6(1): 21:1-21:19 (2009) - 2007
- [j1]Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward:
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments. IEEE Trans. Inf. Theory 53(5): 1799-1813 (2007) - [c4]Mark Daniel Ward:
The Average Profile of Suffix Trees. ANALCO 2007: 183-193 - 2006
- [c3]Robin Pemantle, Mark Daniel Ward:
Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation. ANALCO 2006: 253-262 - 2004
- [c2]Mark Daniel Ward, Wojciech Szpankowski:
Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme. ALENEX/ANALC 2004: 153-160 - [c1]Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward:
Error resilient LZ'77 scheme and its analysis. ISIT 2004: 56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
