default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRussell Martin
Person information
- affiliation: University of Liverpool
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j22]Ioannis Lamprou, Russell Martin, Sven Schewe
, Ioannis Sigalas, Vassilis Zissimopoulos:
Maximum rooted connected expansion. Theor. Comput. Sci. 873: 25-37 (2021)- 2020
- [j21]Ioannis Lamprou, Russell Martin, Sven Schewe:
Fast two-robot disk evacuation with wireless communication. Theor. Comput. Sci. 846: 38-60 (2020)
2010 – 2019
- 2019
- [j20]Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin, Grzegorz Stachowiak:
Communication and location discovery in geometric ring networks. Inf. Comput. 266: 19-48 (2019) - [j19]Ioannis Lamprou, Russell Martin, Sven Schewe:
Eternally dominating large grids. Theor. Comput. Sci. 794: 27-46 (2019) - 2018
- [j18]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms 11(10): 149 (2018) - [c27]Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos:
Maximum Rooted Connected Expansion. MFCS 2018: 25:1-25:14 - [i12]Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos:
Maximum Rooted Connected Expansion. CoRR abs/1806.09549 (2018) - 2017
- [c26]Ioannis Lamprou, Russell Martin, Sven Schewe:
Perpetually Dominating Large Grids. CIAC 2017: 393-404 - [c25]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. SSS 2017: 441-455 - [i11]Ioannis Lamprou, Russell Martin, Paul G. Spirakis:
Bounding the Cover Time in Edge-Uniform Stochastic Graphs. CoRR abs/1702.05412 (2017) - 2016
- [j17]Fatimah Binta Abdullahi, Frans Coenen, Russell Martin:
Banded Pattern Mining Algorithms in Multi-dimensional Zero-One Data. Trans. Large Scale Data Knowl. Centered Syst. 26: 1-31 (2016) - [c24]Leszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis, Grzegorz Stachowiak:
Deterministic Population Protocols for Exact Majority and Plurality. OPODIS 2016: 14:1-14:14 - [c23]Ioannis Lamprou, Russell Martin, Sven Schewe:
Fast Two-Robot Disk Evacuation with Wireless Communication. DISC 2016: 1-15 - [i10]Ioannis Lamprou, Russell Martin, Sven Schewe:
Fast Two-Robot Disk Evacuation with Wireless Communication. CoRR abs/1604.04217 (2016) - [i9]Ioannis Lamprou, Russell Martin, Sven Schewe:
Perpetually Dominating Large Grids. CoRR abs/1611.08204 (2016) - 2015
- [j16]Leszek Gasieniec, Russell Martin, Frank Wolter, Prudence W. H. Wong:
Fundamentals of Computation Theory. Theor. Comput. Sci. 590: 1 (2015) - [c22]Fatimah Binta Abdullahi, Frans Coenen, Russell Martin:
Finding banded patterns in big data using sampling. IEEE BigData 2015: 2233-2242 - [c21]Fatimah Binta Abdullahi, Frans Coenen, Russell Martin:
Finding Banded Patterns in Data: The Banded Pattern Mining Algorithm. DaWaK 2015: 95-107 - [c20]Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin, Grzegorz Stachowiak:
Deterministic Symmetry Breaking in Ring Networks. ICDCS 2015: 517-526 - [c19]Marek Chrobak, Leszek Gasieniec, Thomas Gorry, Russell Martin:
Group Search on the Line. SOFSEM 2015: 164-176 - [c18]Leszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis:
The Match-Maker: Constant-Space Distributed Majority via Random Walks. SSS 2015: 67-80 - [i8]Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin, Grzegorz Stachowiak:
Deterministic Symmetry Breaking in Ring Networks. CoRR abs/1504.07127 (2015) - 2014
- [c17]Fatimah Binta Abdullahi, Frans Coenen, Russell Martin:
A Scalable Algorithm for Banded Pattern Mining in Multi-dimensional Zero-One Data. DaWaK 2014: 345-356 - [c16]Fatimah Binta Abdullahi, Frans Coenen, Russell Martin:
A Novel Approach for Identifying Banded Patterns in Zero-One Data Using Column and Row Banding Scores. MLDM 2014: 58-72 - [c15]Jurek Czyzowicz, Leszek Gasieniec, Thomas Gorry, Evangelos Kranakis, Russell Martin, Dominik Pajak:
Evacuating Robots via Unknown Exit in a Disk. DISC 2014: 122-136 - 2013
- [c14]Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Russell Martin, Oscar Morales-Ponce:
Optimal patrolling of fragmented boundaries. SPAA 2013: 241-250 - [i7]Prasad Chebolu, Mary Cryan, Russell Martin:
Exact counting of Euler Tours for Graphs of Bounded Treewidth. CoRR abs/1310.0185 (2013) - 2012
- [j15]Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. 78(5): 1579-1605 (2012) - [j14]Prasad Chebolu, Mary Cryan, Russell Martin:
Exact counting of Euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10: 110-122 (2012) - [j13]Russell Martin, Thomas Nickson, Igor Potapov:
Geometric computations by broadcasting automata. Nat. Comput. 11(4): 623-635 (2012) - [j12]Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable matchings. Theor. Comput. Sci. 437: 35-68 (2012) - [j11]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung:
More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444: 60-76 (2012) - [c13]Tom Friedetzky, Leszek Gasieniec, Thomas Gorry, Russell Martin:
Observe and Remain Silent (Communication-Less Agent Location Discovery). MFCS 2012: 407-418 - 2011
- [c12]Russell Martin, Thomas Nickson, Igor Potapov:
Geometric Computations by Broadcasting Automata on the Integer Grid. UC 2011: 138-151 - [c11]Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin:
Synchronous Rendezvous for Location-Aware Agents. DISC 2011: 447-459 - 2010
- [c10]Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Matchings. APPROX-RANDOM 2010: 81-94 - [i6]Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Matchings. CoRR abs/1004.1836 (2010) - [i5]Prasad Chebolu, Mary Cryan, Russell A. Martin:
Exact counting of Euler Tours for generalized series-parallel graphs. CoRR abs/1005.3477 (2010) - [i4]Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Roommate Assignments. CoRR abs/1012.1237 (2010)
2000 – 2009
- 2009
- [c9]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181 - [i3]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More efficient periodic traversal in anonymous undirected graphs. CoRR abs/0905.1737 (2009) - 2008
- [j10]Petra Berenbrink, Tom Friedetzky, Russell A. Martin:
On the Stability of Dynamic Diffusion Load Balancing. Algorithmica 50(3): 329-350 (2008) - [j9]Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang:
Fast periodic graph exploration with constant memory. J. Comput. Syst. Sci. 74(5): 808-822 (2008) - [j8]Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell A. Martin:
On weighted balls-into-bins games. Theor. Comput. Sci. 409(3): 511-520 (2008) - 2007
- [j7]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed Selfish Load Balancing. SIAM J. Comput. 37(4): 1163-1181 (2007) - [c8]Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang:
Fast Periodic Graph Exploration with Constant Memory. SIROCCO 2007: 26-40 - 2006
- [j6]Russell A. Martin, Dana Randall:
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs. Comb. Probab. Comput. 15(3): 411-448 (2006) - [j5]Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin:
Utilitarian resource assignment. J. Discrete Algorithms 4(4): 567-587 (2006) - [j4]Leslie Ann Goldberg, Markus Jalsenius, Russell Martin, Mike Paterson:
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2. LMS J. Comput. Math. 9: 1-20 (2006) - [j3]Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin:
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. 36(1): 247-278 (2006) - [c7]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed selfish load balancing. SODA 2006: 354-363 - 2005
- [j2]Leslie Ann Goldberg, Russell A. Martin, Mike Paterson:
Strong Spatial Mixing with Fewer Colors for Lattice Graphs. SIAM J. Comput. 35(2): 486-517 (2005) - [c6]Petra Berenbrink, Tom Friedetzky, Russell A. Martin:
Dynamic Diffusion Load Balancing. ICALP 2005: 1386-1398 - [c5]Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell A. Martin:
On Weighted Balls-into-Bins Games. STACS 2005: 231-243 - [i2]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed Selfish Load Balancing. CoRR abs/cs/0506098 (2005) - 2004
- [j1]Leslie Ann Goldberg, Russell A. Martin, Mike Paterson:
Random sampling of 3-colorings in Z2. Random Struct. Algorithms 24(3): 279-302 (2004) - [c4]Leslie Ann Goldberg, Russell A. Martin, Mike Paterson:
trong Spatial Mixing for Lattice Graphs with Fewer Colours. FOCS 2004: 562-571 - [i1]Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin:
Utilitarian resource assignment. CoRR cs.GT/0410018 (2004) - 2002
- [c3]Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin:
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. FOCS 2002: 711-720 - 2000
- [c2]Russell A. Martin, Dana Randall:
Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method. FOCS 2000: 492-502
1990 – 1999
- 1999
- [c1]Russell A. Martin, Dana Randall:
Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions. RANDOM-APPROX 1999: 257-268
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-05-08 21:41 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:
