skip to main content
Idioma:
Resultados 1 2 3 4 next page
Refinado por: Nome da Publicação: Random Structures & Algorithms remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
On the distribution of binary search trees under the random permutation model
On the distribution of binary search trees under the random permutation model
Material Type:
Artigo 		Adicionar ao Meu Espaço

On the distribution of binary search trees under the random permutation model

Fill, James Allen

Random structures & algorithms, 1996-01, Vol.8 (1), p.1-25 [Periódico revisado por pares]

New York: Wiley Subscription Services, Inc., A Wiley Company

Texto completo disponível

Citações Citado por
2
On the distribution of search cost for the move-to-front rule
On the distribution of search cost for the move-to-front rule
Material Type:
Artigo 		Adicionar ao Meu Espaço

On the distribution of search cost for the move-to-front rule

Fill, James Allen ; Holst, Lars

Random structures & algorithms, 1996-05, Vol.8 (3), p.179-186 [Periódico revisado por pares]

New York: Wiley Subscription Services, Inc., A Wiley Company

Texto completo disponível

Citações Citado por
3
Coloring rules for finite trees, and probabilities of monadic second order sentences
Coloring rules for finite trees, and probabilities of monadic second order sentences
Material Type:
Artigo 		Adicionar ao Meu Espaço

Coloring rules for finite trees, and probabilities of monadic second order sentences

Woods, Alan R.

Random structures & algorithms, 1997-07, Vol.10 (4), p.453-485 [Periódico revisado por pares]

New York: Wiley Subscription Services, Inc., A Wiley Company

Texto completo disponível

Citações Citado por
4
Random intersection graphs when m=ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models
Random intersection graphs when m=ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models
Material Type:
Artigo 		Adicionar ao Meu Espaço

Random intersection graphs when m=ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models

Fill, James Allen ; Scheinerman, Edward R. ; Singer-Cohen, Karen B.

Random structures & algorithms, 2000-03, Vol.16 (2), p.156-176 [Periódico revisado por pares]

New York: John Wiley & Sons, Inc

Texto completo disponível

Citações Citado por
5
Extension of Fill's perfect rejection sampling algorithm to general chains
Extension of Fill's perfect rejection sampling algorithm to general chains
Material Type:
Artigo 		Adicionar ao Meu Espaço

Extension of Fill's perfect rejection sampling algorithm to general chains

Fill, James Allen ; Machida, Motoya ; Murdoch, Duncan J. ; Rosenthal, Jeffrey S.

Random structures & algorithms, 2000-10, Vol.17 (3-4), p.290-316 [Periódico revisado por pares]

New York: John Wiley & Sons, Inc

Texto completo disponível

Citações Citado por
6
Approximating the limiting Quicksort distribution
Approximating the limiting Quicksort distribution
Material Type:
Artigo 		Adicionar ao Meu Espaço

Approximating the limiting Quicksort distribution

Fill, James Allen ; Janson, Svante

Random structures & algorithms, 2001-10, Vol.19 (3-4), p.376-406 [Periódico revisado por pares]

New York: John Wiley & Sons, Inc

Texto completo disponível

Citações Citado por
7
The phase transition in random horn satisfiability and its algorithmic implications
The phase transition in random horn satisfiability and its algorithmic implications
Material Type:
Artigo 		Adicionar ao Meu Espaço

The phase transition in random horn satisfiability and its algorithmic implications

Istrate, Gabriel

Random structures & algorithms, 2002-07, Vol.20 (4), p.483-506 [Periódico revisado por pares]

New York: Wiley Subscription Services, Inc., A Wiley Company

Texto completo disponível

Citações Citado por
8
Speeding up the FMMR perfect sampling algorithm: A case study revisited
Speeding up the FMMR perfect sampling algorithm: A case study revisited
Material Type:
Artigo 		Adicionar ao Meu Espaço

Speeding up the FMMR perfect sampling algorithm: A case study revisited

Dobrow, Robert P. ; Fill, James Allen

Random structures & algorithms, 2003-12, Vol.23 (4), p.434-452 [Periódico revisado por pares]

Hoboken: Wiley Subscription Services, Inc., A Wiley Company

Texto completo disponível

Citações Citado por
9
Transfer theorems and asymptotic distributional results for m-ary search trees
Transfer theorems and asymptotic distributional results for m-ary search trees
Material Type:
Artigo 		Adicionar ao Meu Espaço

Transfer theorems and asymptotic distributional results for m-ary search trees

Fill, James Allen ; Kapur, Nevin

Random structures & algorithms, 2005-07, Vol.26 (4), p.359-391 [Periódico revisado por pares]

Hoboken: Wiley Subscription Services, Inc., A Wiley Company

Texto completo disponível

Citações Citado por
10
A randomized version of Ramsey's theorem
A randomized version of Ramsey's theorem
Material Type:
Artigo 		Adicionar ao Meu Espaço

A randomized version of Ramsey's theorem

Gugelmann, Luca ; Person, Yury ; Steger, Angelika ; Thomas, Henning

Random structures & algorithms, 2012-12, Vol.41 (4), p.488-505 [Periódico revisado por pares]

Hoboken: Wiley Subscription Services, Inc., A Wiley Company

Texto completo disponível

Citações Citado por
Resultados 1 2 3 4 next page

Personalize Seus Resultados

  1. Editar

Refine Search Results

Expandir Meus Resultados

  1.   

Novas Pesquisas Sugeridas

Ignorar minha busca e procurar por tudo

Deste Autor:

  1. Allen, P
  2. Kohayakawa, Y
  3. Griffiths, S
  4. Böttcher, J
  5. Morris, R

Neste Assunto:

  1. Computer Science, Software Engineering
  2. Computer Science
  3. Mathematics
  4. Mathematics, Applied
  5. Physical Sciences

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.