#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1990

2018

- This year (3)
- Last 5 years (18)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
- Theor. Comput. Sci.
- 2008

Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisions based on the states ofâ€¦ (More)

- Bernard Beauzamy, Vilmar Trevisan, Paul S. Wang
- J. Symb. Comput.
- 1993

A new coeÃ†cient bound is established for factoring univariate polynomials over the integers. Unlike an overall bound, the new bound limits the size of the coeÃ†cients of at least one irreducibleâ€¦ (More)

- Vilmar Trevisan, JoÃ£o B. Carvalho
- The Journal of Supercomputing
- 1995

A machine computation has been carried out to show that the twenty-second Fermat numberF 22= $$2^{2^{22} } $$ +1 is composite.

In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system (seeing its neighborsâ€™ states), yet in a finite amount of time theâ€¦ (More)

- Domingos M. Cardoso, Enide Andrade Martins, MarÃa Robbiano, Vilmar Trevisan
- Discrete Applied Mathematics
- 2012

In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as the eigenvalues of symmetric tridiagonal matrices. In addition, we apply our result to obtain anâ€¦ (More)

- Kenneth Weber, Vilmar Trevisan, Luiz Felipe Martins
- J. Algorithms
- 2005

This paper describes the first algorithm to compute the greatest common divisor (GCD) n-bit integers using a modular representation for intermediate values U , V and also for the result. I is basedâ€¦ (More)

- David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura
- J. Graph Algorithms Appl.
- 2014

We present an algorithm for constructing the characteristic polynomial of a threshold graphâ€™s adjacency matrix. The algorithm is based on a diagonalization procedure that is easy to describe. It canâ€¦ (More)

- JoÃ£o Carvalho, Bruna S. Souza, Vilmar Trevisan, Fernando Tura
- Discrete Mathematics
- 2017

Wedevelop an algorithm for computing the characteristic polynomial ofmatrices related to threshold graphs. We use this as tool to exhibit, for any natural number n â‰¥ 4, 2nâˆ’4 graphs with n verticesâ€¦ (More)

- David Pokrass Jacobs, Catia M. S. Machado, Vilmar Trevisan
- Electronic Notes in Discrete Mathematics
- 2001

- MarÃa Robbiano, Vilmar Trevisan
- Computers & Mathematics with Applications
- 2010