The SCEAS System
| |||||||

## Search the dblp DataBase
Wolfgang Woess:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Laurent Saloff-Coste, Wolfgang Woess
**Computing Norms of group-Invariant Transition Operators.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:161-178 [Journal] - Wolfgang Woess
**Lamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:415-433 [Journal] - Wolfgang Woess
**A Note on the Norms of Transition Operators on Lamplighter Graphs and Groups.**[Citation Graph (0, 0)][DBLP] IJAC, 2005, v:15, n:5-6, pp:1261-1272 [Journal] - Carsten Thomassen, Wolfgang Woess
**Vertex-Transitive Graphs and Accessibility.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1993, v:58, n:2, pp:248-268 [Journal] - Wolfgang Woess
**Graphs and groups with tree-like properties.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1989, v:47, n:3, pp:361-371 [Journal] - Donald I. Cartwright, Wolfgang Woess
**Infinite Graphs with Nonconstant Dirichlet Finite Harmonic Functions.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1992, v:5, n:3, pp:380-385 [Journal] - Tullio Ceccherini-Silberstein, Wolfgang Woess
**Growth-sensitivity of context-free languages.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:307, n:1, pp:103-116 [Journal] - Wolfgang Woess
**Context-free languages and random walks on groups.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1987, v:67, n:1, pp:81-87 [Journal] - Wolfgang Woess
**Topological groups and infinite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:95, n:1-3, pp:373-384 [Journal] - Massimo A. Picardello, Mitchell H. Taibleson, Wolfgang Woess
**Harmonic measure of the planar Cantor set from the viewpoint of graph theory.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:109, n:1-3, pp:193-202 [Journal] **Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions**[Citation Graph (, )][DBLP]**Context-free pairs of groups I: Context-free pairs and graphs**[Citation Graph (, )][DBLP]**Uniqueness of currents in infinite resistive networks.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |