default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Walters
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Maria-Romina Ivan
, Imre Leader, Mark Walters:
Constructible graphs and pursuit. Theor. Comput. Sci. 930: 196-208 (2022)- [i2]Maria-Romina Ivan, Imre Leader, Mark Walters:
Constructible Graphs and Pursuit. CoRR abs/2203.05487 (2022) - 2020
- [j14]Imre Leader, Shoham Letzter, Bhargav P. Narayanan, Mark Walters:
Product-free sets in the free semigroup. Eur. J. Comb. 83 (2020)
2010 – 2019
- 2018
- [c3]Stefano Pedemonte, Bernardo Bizzo, Stuart R. Pomerantz, Neil A. Tenenholtz, Bradley Wright, Mark Walters, Sean Doyle, Adam McCarthy, Renata Rocha De Almeida, Katherine P. Andriole, Mark Michalski, R. Gilberto González:
Detection and Delineation of Acute Cerebral Infarct on DWI Using Weakly Supervised Machine Learning. MICCAI (3) 2018: 81-88 - 2017
- [j13]J. Robert Johnson, Imre Leader, Mark Walters:
Transitive Avoidance Games. Electron. J. Comb. 24(1): 1 (2017) - [j12]Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters:
Sentry selection in sensor networks: theory and algorithms. Int. J. Sens. Networks 24(3): 139-148 (2017) - 2016
- [j11]Joshua Erde, Mark Walters:
An $n$-in-a-row Type Game. Electron. J. Comb. 23(3): 3 (2016) - 2013
- [j10]Paul A. Russell, Mark Walters:
Probably Intersecting Families are Not Nested. Comb. Probab. Comput. 22(1): 146-160 (2013) - 2012
- [j9]Mark Walters:
Small components in k-nearest neighbour graphs. Discret. Appl. Math. 160(13-14): 2037-2047 (2012) - [j8]Imre Leader, Paul A. Russell, Mark Walters:
Transitive sets in Euclidean Ramsey theory. J. Comb. Theory A 119(2): 382-396 (2012) - 2011
- [c2]Mark Walters:
Work in progress - Tools and technology to implement a students personal laboratory. FIE 2011: 1 - [i1]Mark Walters:
Small components in k-nearest neighbour graphs. CoRR abs/1101.2619 (2011) - 2010
- [j7]Joshua N. Cooper, Mark Walters:
Iterated Point-Line Configurations Grow Doubly-Exponentially. Discret. Comput. Geom. 43(3): 554-562 (2010) - [j6]Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters:
Random majority percolation. Random Struct. Algorithms 36(3): 315-340 (2010)
2000 – 2009
- 2009
- [j5]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Highly connected random geometric graphs. Discret. Appl. Math. 157(2): 309-320 (2009) - [j4]Mark Walters:
Rectangles as sums of squares. Discret. Math. 309(9): 2913-2921 (2009) - 2008
- [j3]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. 3(3): 204-213 (2008) - 2007
- [j2]Mark Walters:
Extensions of the Polynomial Hales-Jewett Theorem. Comb. Probab. Comput. 16(5): 789-803 (2007) - 2005
- [j1]Paul N. Balister, Béla Bollobás, Mark Walters:
Continuum percolation with steps in the square or the disc. Random Struct. Algorithms 26(4): 392-403 (2005) - 2004
- [c1]Paul Balister, Béla Bollobás, Martin Haenggi, Mark Walters:
Fast transmission in ad hoc networks. ISIT 2004: 19
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-19 20:45 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:
