The SCEAS System
Navigation Menu

Search the dblp DataBase


Wolfgang Woess: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. Wolfgang Woess
    Topological groups and infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:373-384 [Journal]
  10. 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]

  11. Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions [Citation Graph (, )][DBLP]

  12. Context-free pairs of groups I: Context-free pairs and graphs [Citation Graph (, )][DBLP]

  13. Uniqueness of currents in infinite resistive networks. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002