Improved upper bounds for self-avoiding walks in .

Pönitz, André; Tittmann, Peter

Displaying similar documents to “Improved upper bounds for self-avoiding walks in $ℤ^{d}$ .”

A lower bound on the growth exponent for loop-erased random walk in two dimensions

Gregory F. Lawler (1999)

ESAIM: Probability and Statistics

Similarity:

Loop-erased walks intersect infinitely often in four dimensions.

Lawler, Gregory F. (1998)

Electronic Communications in Probability [electronic only]

Similarity:

A probabilistic approach to automaton-environment systems

Ivan Kramosil (1975)

Kybernetika

Similarity:

Dynamic programming for reduced NFAs for approximate string and sequence matching

Jan Holub (2002)

Kybernetika

Similarity:

searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given...

Random generation for finitely ambiguous context-free languages

Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We prove that a word of length $n$ from a finitely ambiguous context-free language can be generated at random under uniform distribution in $O (n^{2} log n)$ time by a probabilistic random access machine assuming a logarithmic cost criterion. We also show that the same problem can be solved in polynomial time for every language accepted by a polynomial time $1$ -NAuxPDA with polynomially bounded ambiguity.

The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.

Zeilberger, Doron (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The number of [old-time] basketball games with final score $n$ : $n$ where the home team was never losing but also never ahead by more than $w$ points.

Ayyer, Arvind, Zeilberger, Doron (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Displaying similar documents to “Improved upper bounds for self-avoiding walks in ℤ d .”

A lower bound on the growth exponent for loop-erased random walk in two dimensions

Loop-erased walks intersect infinitely often in four dimensions.

A probabilistic approach to automaton-environment systems

Dynamic programming for reduced NFAs for approximate string and sequence matching

Random generation for finitely ambiguous context-free languages

The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.

The number of [old-time] basketball games with final score n : n where the home team was never losing but also never ahead by more than w points.

Displaying similar documents to “Improved upper bounds for self-avoiding walks in $ℤ^{d}$ .”

The number of [old-time] basketball games with final score $n$ : $n$ where the home team was never losing but also never ahead by more than $w$ points.