Wolfgang Woess

Orcid: 0000-0002-7065-7126

According to our database1, Wolfgang Woess authored at least 19 papers between 1986 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
The Language of Self-Avoiding Walks.
Comb., 2020

2018
Comparing Entropy Rates on Finite and Infinite Rooted Trees.
IEEE Trans. Inf. Theory, 2018

2016
Comparing entropy rates on finite and infinite rooted trees with length functions.
CoRR, 2016

2012
Context-free pairs of groups I: Context-free pairs and graphs.
Eur. J. Comb., 2012

Context-free pairs of groups II - Cuts, tree sets, and random walks.
Discret. Math., 2012

2010
Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions.
Theor. Comput. Sci., 2010

2005
A Note on the Norms of Transition Operators on Lamplighter Graphs and Groups.
Int. J. Algebra Comput., 2005

Lamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions.
Comb. Probab. Comput., 2005

2003
Growth-sensitivity of context-free languages.
Theor. Comput. Sci., 2003

1996
Computing Norms of group-Invariant Transition Operators.
Comb. Probab. Comput., 1996

1993
Vertex-Transitive Graphs and Accessibility.
J. Comb. Theory, Ser. B, 1993

1992
Infinite Graphs with Nonconstant Dirichlet Finite Harmonic Functions.
SIAM J. Discret. Math., 1992

Harmonic measure of the planar Cantor set from the viewpoint of graph theory.
Discret. Math., 1992

1991
Topological groups and infinite graphs.
Discret. Math., 1991

Uniqueness of currents in infinite resistive networks.
Discret. Appl. Math., 1991

1989
Graphs and groups with tree-like properties.
J. Comb. Theory, Ser. B, 1989

A note on bounded automorphisms of infinite graphs.
Graphs Comb., 1989

1987
Context-free languages and random walks on groups.
Discret. Math., 1987

1986
Simple Random Walks on Trees.
Eur. J. Comb., 1986


  Loading...