| Publication | Date of Publication | Type |
|---|
| Distributed Averaging in Opinion Dynamics | 2024-03-26 | Paper |
| Brief Announcement: Discrete Incremental Voting | 2024-03-26 | Paper |
| Hamilton cycles in random digraphs with minimum degree at least one | 2023-12-11 | Paper |
| A simple model of influence | 2023-10-04 | Paper |
| Rainbow Greedy Matching Algorithms | 2023-07-02 | Paper |
| Fast plurality consensus in regular expanders | 2023-02-03 | Paper |
| A triangle process on graphs with given degree sequence | 2023-01-20 | Paper |
| Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs | 2022-09-21 | Paper |
| A triangle process on regular graphs | 2022-03-22 | Paper |
| Rank of the vertex-edge incidence matrix of $r$-out hypergraphs | 2021-07-12 | Paper |
| The cover time of a biased random walk on a random cubic graph | 2021-06-15 | Paper |
| Long Paths in Random Apollonian Networks | 2021-04-26 | Paper |
| Some typical properties of the spatial preferred attachment model | 2021-04-23 | Paper |
| A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence | 2021-04-23 | Paper |
| Fast Low-Cost Estimation of Network Properties Using Random Walks | 2021-03-26 | Paper |
| A triangle process on regular graphs | 2020-12-23 | Paper |
| Minors of a random binary matroid | 2020-02-14 | Paper |
| Constructing Self-stabilizing Oscillators in Population Protocols | 2020-01-14 | Paper |
| A note on the rank of a sparse random matrix | 2019-11-21 | Paper |
| On the rank of a random binary matrix | 2019-10-15 | Paper |
| On the rank of a random binary matrix | 2019-10-14 | Paper |
| The cover time of a biased random walk on \(G_{n,p}\) | 2019-09-18 | Paper |
| On the cover time of dense graphs | 2019-08-29 | Paper |
| Triangle-creation processes on cubic graphs | 2019-05-11 | Paper |
| An efficient sparse regularity concept | 2019-05-06 | Paper |
| The cover time of random geometric graphs | 2019-05-06 | Paper |
| Dispersion processes | 2019-02-20 | Paper |
| The flip Markov chain for connected regular graphs | 2019-02-08 | Paper |
| Threshold behaviour of discordant voting on the complete graph | 2018-12-14 | Paper |
| Discordant Voting Processes on Finite Graphs | 2018-10-18 | Paper |
| Fast consensus for voting on general expander graphs | 2018-08-24 | Paper |
| On the rank of a random binary matrix | 2018-06-13 | Paper |
| The Linear Voting Model | 2017-12-19 | Paper |
| Discordant voting processes on finite graphs | 2017-12-19 | Paper |
| Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time | 2017-10-11 | Paper |
| On the length of a random minimum spanning tree | 2017-10-04 | Paper |
| Component structure of the vacant set induced by a random walk on a random graph | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365053 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365091 | 2017-09-29 | Paper |
| The coalescing-branching random walk on expanders and the dual epidemic process | 2017-09-29 | Paper |
| Constructing self-stabilizing oscillators in population protocols | 2017-08-08 | Paper |
| Cover time of a random graph with given degree sequence | 2017-02-10 | Paper |
| Rainbow arborescence in random digraphs | 2016-11-16 | Paper |
| A note on the vacant set of random walks on the hypercube and other regular graphs of high degree | 2016-04-13 | Paper |
| Speeding up cover time of sparse graphs using local knowledge | 2016-04-04 | Paper |
| Vacant sets and vacant nets: component structures induced by a random walk | 2016-02-05 | Paper |
| Coalescing walks on rotor-router systems | 2016-01-08 | Paper |
| Cover time of a random graph with a degree sequence. II: Allowing vertices of degree two. | 2015-06-22 | Paper |
| The height of random k‐trees and related branching processes | 2015-06-22 | Paper |
| Viral processes by random walks on random regular graphs | 2015-04-27 | Paper |
| Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time | 2015-02-20 | Paper |
| Fast low-cost estimation of network properties using random walks | 2015-01-13 | Paper |
| Coalescing random walks and voting on graphs | 2014-12-05 | Paper |
| Random walks which prefer unvisited edges, exploring high girth even degree expanders in linear time | 2014-12-05 | Paper |
| Sampling regular graphs and a peer-to-peer network | 2014-10-13 | Paper |
| The cover time of two classes of random graphs | 2014-10-13 | Paper |
| Randomized diffusion for indivisible loads | 2014-09-22 | Paper |
| The flip Markov chain and a randomising P2P protocol | 2014-07-23 | Paper |
| The Power of Two Choices in Distributed Voting | 2014-07-01 | Paper |
| Speeding up random walks with neighborhood exploration | 2014-05-22 | Paper |
| Coalescing random walks and voting on connected graphs | 2014-04-10 | Paper |
| The cover times of random walks on random uniform hypergraphs | 2014-01-13 | Paper |
| Component structure of the vacant set induced by a random walk on a random graph | 2013-03-12 | Paper |
| Cover time of a random graph with given degree sequence | 2012-10-16 | Paper |
| Chains-into-bins processes | 2012-09-13 | Paper |
| A fast algorithm to find all high degree vertices in graphs with a power law degree sequence | 2012-07-23 | Paper |
| Some Typical Properties of the Spatial Preferred Attachment Model | 2012-07-23 | Paper |
| Stationary distribution and cover time of random walks on random digraphs | 2012-05-04 | Paper |
| Derandomizing random walks in undirected graphs using locally fair exploration strategies | 2012-02-06 | Paper |
| Viral processes by random walks on random regular graphs | 2011-08-17 | Paper |
| Scale-free graphs of increasing degree | 2011-08-09 | Paper |
| Random walks with look-ahead in scale-free random graphs | 2011-06-17 | Paper |
| Chains-into-Bins Processes | 2011-05-19 | Paper |
| The Cover Time of Cartesian Product Graphs | 2011-05-19 | Paper |
| The cover time of random geometric graphs | 2011-05-11 | Paper |
| Hamilton cycles in random graphs with a fixed degree sequence | 2011-04-15 | Paper |
| A spatial web graph model with local influence regions | 2011-02-28 | Paper |
| Scale free properties of random \(k\)-trees | 2011-02-19 | Paper |
| An efficient sparse regularity concept | 2010-12-03 | Paper |
| Multiple random walks in random regular graphs | 2010-12-03 | Paper |
| Crawling on web graphs | 2010-08-05 | Paper |
| Locating and repairing faults in a network with mobile agents | 2010-04-06 | Paper |
| Martingales on Trees and the Empire Chromatic Number of Random Trees | 2009-10-20 | Paper |
| Multiple Random Walks and Interacting Particle Systems | 2009-07-14 | Paper |
| Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies | 2009-07-14 | Paper |
| Energy efficient randomised communication in unknown AdHoc networks | 2009-07-10 | Paper |
| An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm | 2009-06-24 | Paper |
| Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439 | 2009-04-08 | Paper |
| The Cover Time of Random Digraphs | 2009-02-17 | Paper |
| A randomized algorithm for the joining protocol in dynamic distributed networks | 2008-11-12 | Paper |
| The cover time of the giant component of a random graph | 2008-07-21 | Paper |
| Locating and Repairing Faults in a Network with Mobile Agents | 2008-07-10 | Paper |
| A Spatial Web Graph Model with Local Influence Regions | 2008-04-11 | Paper |
| Sampling Regular Graphs and a Peer-to-Peer Network | 2008-01-18 | Paper |
| Random 2-SAT with prescribed literal degrees | 2007-08-20 | Paper |
| Dominating sets of random recursive trees | 2007-05-29 | Paper |
| The cover time of the preferential attachment graph | 2007-02-13 | Paper |
| The cover time of sparse random graphs | 2007-02-07 | Paper |
| Distribution of Vertex Degree in Web-Graphs | 2006-12-05 | Paper |
| Hamilton cycles in random lifts of graphs | 2006-11-15 | Paper |
| Lower Bounds and Algorithms for Dominating Sets in Web Graphs | 2006-06-26 | Paper |
| The Cover Time of Random Regular Graphs | 2005-09-16 | Paper |
| Algorithms and Models for the Web-Graph | 2005-08-22 | Paper |
| Crawling on Simple Models of Web Graphs | 2005-05-09 | Paper |
| Random Deletion in a Scale-Free Random Graph Process | 2005-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828949 | 2004-11-29 | Paper |
| The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471288 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440443 | 2003-12-17 | Paper |
| On randomly generated intersecting hypergraphs | 2003-09-24 | Paper |
| A general model of web graphs | 2003-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796198 | 2003-03-02 | Paper |
| Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity | 2003-02-11 | Paper |
| Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs | 2003-01-05 | Paper |
| Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number | 2002-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761360 | 2001-09-04 | Paper |
| Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids | 2001-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4521546 | 2001-08-12 | Paper |
| On Markov chains for randomly \(H\)-coloring a graph | 2001-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500692 | 2001-03-07 | Paper |
| Estimation of the number of ``good permutations with applications to cryptography | 2001-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943352 | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4704792 | 2000-10-05 | Paper |
| Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk | 2000-06-21 | Paper |
| min-wise independent linear permutations | 2000-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948022 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242580 | 2000-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347886 | 1997-08-11 | Paper |
| Perfect Matchings in Random r-regular, s-uniform Hypergraphs | 1997-03-06 | Paper |
| Asymptotic Enumeration of Predicate-Junction Flowgraphs | 1997-02-18 | Paper |
| On the Connectivity of Random k-th Nearest Neighbour Graphs | 1996-09-29 | Paper |
| On the 2‐cyclic property in 2‐regular digraphs | 1995-12-10 | Paper |
| The Vapnik-Chervonenkis dimension of a random graph | 1995-10-26 | Paper |
| Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold | 1995-10-19 | Paper |
| Probabilistic analysis of two \(k\)-cluster problems | 1995-01-19 | Paper |
| Hamilton Cycles in Random Regular Digraphs | 1994-10-24 | Paper |
| Hamilton cycles in a class of random directed graphs | 1994-09-13 | Paper |
| A note on the connectivity of 2‐regular digraphs | 1994-07-03 | Paper |
| On the Thickness of Sparse Random Graphs | 1994-05-05 | Paper |
| The threshold for hamilton cycles in the square of a random graph | 1994-04-24 | Paper |
| 1-Pancyclic Hamilton Cycles in Random Graphs | 1992-10-18 | Paper |
| Pancyclic Hamilton cycles in random graphs | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975002 | 1992-06-26 | Paper |
| The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected | 1990-01-01 | Paper |
| On the number of hamilton cycles in a random graph | 1989-01-01 | Paper |
| Diffusion limited aggregation in the layers model | N/A | Paper |
