Skip to search formSkip to main contentSkip to account menu

Ken Batcher

Known as: Batcher, K. E. Batcher, Kenneth E. Batcher 
Ken Batcher is an emeritus professor of Computer Science at Kent State University. He also worked as a computer architect at Goodyear Aerospace in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1996
1996
Many proposed packet switching systems for high-speed networks have employed the Batcher–banyan fabric due to its modular… 
Highly Cited
1995
1992
1992
A multilink access subsystem based on the Batcher-banyan network architecture is proposed. With this subsystem, multiple physical… 
1992
1992
  • Hyong S. Kim
  • [Conference Record] SUPERCOMM/ICC '92 Discovering…
  • 1992
  • Corpus ID: 61686237
The author introduces a multichannel asynchronous transfer mode (ATM) switch that guarantees the packet sequence throughout the… 
Highly Cited
1990
Highly Cited
1990
Abstract This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n -processor… 
Highly Cited
1983
Highly Cited
1983
We give a sorting network withcn logn comparisons. The algorithm can be performed inc logn parallel steps as well, where in a… 
Highly Cited
1983
Highly Cited
1983
An algorithm is presented to merge two subfiles of size n/2 each, stored in the left and the right halves of a linearly connected… 
Highly Cited
1979
Highly Cited
1979
We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological… 
Highly Cited
1979
Highly Cited
1979
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts… 
Highly Cited
1978
Highly Cited
1978
  • F. Preparata
  • IEEE transactions on computers
  • 1978
  • Corpus ID: 9391881
In this paper, we describe a family of parallel-sorting algorithms for a multiprocessor system. These algorithms are enumeration…