메뉴 건너뛰기




Volumn , Issue , 1998, Pages 380-384

Efficient counting network

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DIGITAL ARITHMETIC; ELECTRIC NETWORK ANALYSIS;

EID: 0031672633     PISSN: 10637133     EISSN: None     Source Type: None    
DOI: 10.1109/IPPS.1998.669944     Document Type: Conference Paper
Times cited : (9)

References (11)
  • 1
    • 0000172617 scopus 로고
    • Counting Networks with Arbitrary Fan-Out
    • E. Aharonson H. Attiya Counting Networks with Arbitrary Fan-Out Distributed Computing 8 163 169 1995
    • (1995) Distributed Computing , vol.8 , pp. 163-169
    • Aharonson, E.1    Attiya, H.2
  • 2
    • 0010529071 scopus 로고
    • Coins, Weights and Contention in Balancing Networks
    • W. Aiello R. Venkatesan M. Yung Coins, Weights and Contention in Balancing Networks Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing 193 205 Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing 1994-August
    • (1994) , pp. 193-205
    • Aiello, W.1    Venkatesan, R.2    Yung, M.3
  • 4
    • 85154002090 scopus 로고
    • Sorting Networks and their Applications
    • K. E. Batcher Sorting Networks and their Applications Proceedings of AFIPS Spring Joint Computer Conference 307 314 Proceedings of AFIPS Spring Joint Computer Conference 1968
    • (1968) , pp. 307-314
    • Batcher, K.E.1
  • 5
    • 0030230653 scopus 로고    scopus 로고
    • A Combinatorial Treatment of Balancing Networks
    • C. Busch M. Mavronicolas A Combinatorial Treatment of Balancing Networks Journal of the ACM 43 5 749 839 September 1996
    • (1996) Journal of the ACM , vol.43 , Issue.5 , pp. 749-839
    • Busch, C.1    Mavronicolas, M.2
  • 6
    • 0002571460 scopus 로고
    • Contention in Counting Networks
    • C. Busch N. Hardavellas M. Mavronicolas Contention in Counting Networks Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing 404 Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing 1994-August
    • (1994) , pp. 404
    • Busch, C.1    Hardavellas, N.2    Mavronicolas, M.3
  • 7
    • 0027266209 scopus 로고
    • Contention in Shared Memory Algorithms
    • C. Dwork M. Herlihy O. Waarts Contention in Shared Memory Algorithms Proceedings of the 25th Annual ACM Symposium on Theory of Computing 174 183 Proceedings of the 25th Annual ACM Symposium on Theory of Computing 1993-May
    • (1993) , pp. 174-183
    • Dwork, C.1    Herlihy, M.2    Waarts, O.3
  • 8
    • 0003768266 scopus 로고
    • Building Counting Networks from Larger Balancers
    • E. W. Felten A. LaMarca R. Ladner Building Counting Networks from Larger Balancers April 1993 93-04-09 Department of Computer Science and Engineering, University of Washington
    • (1993)
    • Felten, E.W.1    LaMarca, A.2    Ladner, R.3
  • 9
    • 0042056268 scopus 로고
    • Notes on Sorting and Counting Networks
    • N. Hardavellas D. Karakos M. Mavronicolas Notes on Sorting and Counting Networks Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG-93) 725 234 248 Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG-93) Lausanne Switzerland 1993-September
    • (1993) , vol.725 , pp. 234-248
    • Hardavellas, N.1    Karakos, D.2    Mavronicolas, M.3
  • 10
    • 0003657590 scopus 로고
    • Art of Computer Programming
    • Addison-Wesley
    • D. Knuth Art of Computer Programming 3 1973 Addison-Wesley
    • (1973) , vol.3
    • Knuth, D.1
  • 11
    • 85029984014 scopus 로고
    • Diffracting Trees
    • N. Shavit A. Zemach Diffracting Trees Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures 167 176 Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures 1994-June
    • (1994) , pp. 167-176
    • Shavit, N.1    Zemach, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.