Publicações

An Exact Algorithm for the Maximal Sharing of Partial Terms in Multiple Constant Multiplications

AuthID
P-000-5VS

Author(s)

Flores, P

Monteiro, J

Costa, E

Tipo de Documento

Proceedings Paper

Year published

2005

Publicado

in ICCAD-2005: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, DIGEST OF TECHNICAL PAPERS in IEEE INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN, ISSN: 1063-6757

Volume: 2005, Páginas: 13-16 (4)

Conference

Ieee/Acm International Conference on Computer Aided Design, Date: NOV 06-10, 2005, Location: San Jose, CA, Patrocinadores: IEEE, ACM, IEEE Circuits & Syst Soc, CANDE, IEEE Comp Soc, SIGDA Elect Serv Soc, SSCS

Indexing

Wos^®

Scopus^®

Crossref^®

Google Scholar^®

Publication Identifiers

DOI: 10.1109/iccad.2005.1560032

SCOPUS: 2-s2.0-33751413785

Wos: WOS:000234559700003

Source Identifiers

ISSN: 1063-6757

Export Publication Metadata

Lista Marked

Adicionar à lista Marked

Citações

Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

CORE Conference

No information about CORE Rank

During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.

TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.

Journal Factors

Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

Full Text

Full Text @ sfx.b-on.pt

An Exact Algorithm for the Maximal Sharing of Partial Terms in Multiple Constant Multiplications

Links Úteis

Ajuda

Autenticação Federada (Clique na imagem)

An Exact Algorithm for the Maximal Sharing of Partial Terms in Multiple Constant Multiplications

Links Úteis

Ajuda