skip to main content
Idioma:
Refinado por: Nome da Publicação: Theoretical Computer Science remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Distributed broadcast in radio networks of unknown topology
Distributed broadcast in radio networks of unknown topology
Material Type:
Artigo 		Adicionar ao Meu Espaço

Distributed broadcast in radio networks of unknown topology

Clementi, Andrea E.F. ; Monti, Angelo ; Silvestri, Riccardo

Theoretical computer science, 2003-06, Vol.302 (1), p.337-364 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

Citações Citado por
2
Minimum-Energy Broadcast and disk cover in grid wireless networks
Minimum-Energy Broadcast and disk cover in grid wireless networks
Material Type:
Artigo 		Adicionar ao Meu Espaço

Minimum-Energy Broadcast and disk cover in grid wireless networks

Calamoneri, Tiziana ; Clementi, Andrea E.F. ; Di Ianni, Miriam ; Lauria, Massimo ; Monti, Angelo ; Silvestri, Riccardo

Theoretical computer science, 2008-06, Vol.399 (1), p.38-53 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

Citações Citado por
3
The minimum broadcast range assignment problem on linear multi-hop wireless networks
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Material Type:
Artigo 		Adicionar ao Meu Espaço

The minimum broadcast range assignment problem on linear multi-hop wireless networks

Clementi, Andrea E.F. ; Ianni, Miriam Di ; Silvestri, Riccardo

Theoretical computer science, 2003-04, Vol.299 (1-3), p.751-761 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

Citações Citado por
4
Improved non-approximability results for minimum vertex cover with density constraints
Improved non-approximability results for minimum vertex cover with density constraints
Material Type:
Artigo 		Adicionar ao Meu Espaço

Improved non-approximability results for minimum vertex cover with density constraints

Clementi, Andrea E.F. ; Trevisan, Luca

Theoretical computer science, 1999-08, Vol.225 (1), p.113-128 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

Citações Citado por
5
On the bounded-hop MST problem on random Euclidean instances
On the bounded-hop MST problem on random Euclidean instances
Material Type:
Artigo 		Adicionar ao Meu Espaço

On the bounded-hop MST problem on random Euclidean instances

Clementi, Andrea E.F. ; Di Ianni, Miriam ; Lauria, Massimo ; Monti, Angelo ; Rossi, Gianluca ; Silvestri, Riccardo

Theoretical computer science, 2007-10, Vol.384 (2), p.161-167 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

Citações Citado por
6
On the approximability of the range assignment problem on radio networks in presence of selfish agents
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Material Type:
Artigo 		Adicionar ao Meu Espaço

On the approximability of the range assignment problem on radio networks in presence of selfish agents

Ambühl, Christoph ; Clementi, Andrea E.F. ; Penna, Paolo ; Rossi, Gianluca ; Silvestri, Riccardo

Theoretical computer science, 2005-10, Vol.343 (1), p.27-41 [Periódico revisado por pares]

Elsevier B.V

Texto completo disponível

Citações Citado por
7
On the approximability of the range assignment problem on radio networks in presence of selfish agents: Game theory meets theoretical computer science
On the approximability of the range assignment problem on radio networks in presence of selfish agents: Game theory meets theoretical computer science
Material Type:
Artigo 		Adicionar ao Meu Espaço

On the approximability of the range assignment problem on radio networks in presence of selfish agents: Game theory meets theoretical computer science

AMBÜHL, Christoph ; CLEMENTI, Andrea E. F ; PENNA, Paolo ; ROSSI, Gianluca ; SILVESTRI, Riccardo

Theoretical computer science, 2005, Vol.343 (1-2), p.27-41 [Periódico revisado por pares]

Amsterdam: Elsevier

Texto completo disponível

Citações Citado por
8
Optimal bounds for the approximation of boolean functions and some applications
Optimal bounds for the approximation of boolean functions and some applications
Material Type:
Artigo 		Adicionar ao Meu Espaço

Optimal bounds for the approximation of boolean functions and some applications

Andreev, Alexander E. ; Clementi, Andrea E.F. ; Rolim, JoséD.P.

Theoretical computer science, 1997-06, Vol.180 (1), p.243-268 [Periódico revisado por pares]

Elsevier B.V

Texto completo disponível

Citações Citado por
9
Constructing the highest degree subgraph for dense graphs is in NCAL
Constructing the highest degree subgraph for dense graphs is in NCAL
Material Type:
Artigo 		Adicionar ao Meu Espaço

Constructing the highest degree subgraph for dense graphs is in NCAL

Andreev, Alexander E ; Clementi, Andrea E F ; Rolim, Jose D P

Theoretical computer science, 1996-01, Vol.161 (1-2), p.307-314 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por
10
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs

Andreev, Alexander E. ; Clementi, Andrea E.F. ; Rolim, JoséD.P.

Theoretical computer science, 1999-06, Vol.221 (1-2), p.3-18 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

Citações Citado por

Personalize Seus Resultados

  1. Editar

Refine Search Results

Expandir Meus Resultados

  1.   

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

Buscando em bases de dados remotas. Favor aguardar.