在n*n可重构网格上，整数排序在O(1)时间内完成

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200594

S. Olariu, J. L. Schwing, J. Zhang

{"title":"在n*n可重构网格上，整数排序在O(1)时间内完成","authors":"S. Olariu, J. L. Schwing, J. Zhang","doi":"10.1109/PCCC.1992.200594","DOIUrl":null,"url":null,"abstract":"A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can be sorted in O(1) time on a reconfigurable mesh of size n*n. As applications of integer sorting, a constant-time algorithm to convert an edge-list representation of a graph to an adjacency-list representation and a constant-time algorithm to convert a parent-pointer representation of a rooted tree to standard form are described.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Integer sorting in O(1) time on an n*n reconfigurable mesh\",\"authors\":\"S. Olariu, J. L. Schwing, J. Zhang\",\"doi\":\"10.1109/PCCC.1992.200594\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can be sorted in O(1) time on a reconfigurable mesh of size n*n. As applications of integer sorting, a constant-time algorithm to convert an edge-list representation of a graph to an adjacency-list representation and a constant-time algorithm to convert a parent-pointer representation of a rooted tree to standard form are described.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200594\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

提出了一种可重构网格上的常时间整数排序算法。更具体地说，在大小为n*n的可重构网格上，n个整数序列可以在O(1)时间内排序。作为整数排序的应用，描述了将图的边表表示法转换为邻接表表示法的常时间算法和将根树的父指针表示法转换为标准形式的常时间算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Integer sorting in O(1) time on an n*n reconfigurable mesh

A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can be sorted in O(1) time on a reconfigurable mesh of size n*n. As applications of integer sorting, a constant-time algorithm to convert an edge-list representation of a graph to an adjacency-list representation and a constant-time algorithm to convert a parent-pointer representation of a rooted tree to standard form are described.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量