Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3122027

All nearest smaller values on the hypercube

Author
KRAVETS, D1 ; PLAXTON, C. G
[1] Department of Computer Science, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, United States
Source

IEEE transactions on parallel and distributed systems. 1996, Vol 7, Num 5, pp 456-462 ; ref : 11 ref

CODEN
ITDSEO
ISSN
1045-9219
Scientific domain
Electronics; Computer science
Publisher
IEEE Computer Society, Los Alamitos, CA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Acheminement Algorithme optimal Borne inférieure Entrée ordinateur Hypercube Implémentation Processeur Temps exécution Triangulation Allnearest smaller values Cartesian tree Monotone polygon triangulation Normal hypercube algorithm
Keyword (en)
Routing Optimal algorithm Lower bound Input Hypercube Implementation Processor Execution time Triangulation
Keyword (es)
Encaminamiento Algoritmo óptimo Cota inferior Entrada ordenador Hipercubo Ejecución Procesador Tiempo ejecución Triangulación
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
3122027

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web