In order to cope with the physical bottleneck of the development of electronic computers, the
development of various new computers has attracted extensive attention. Ternary Optical …

Cauchy–Euler differential equations surfaced naturally in a number of sorting and searching
problems, notably in quicksort and binary search trees and their variations. Asymptotics of …

Divide and Conquer is a well known algorithmic procedure for solving many kinds of
problem. In this procedure, the problem is partitioned into two parts until the problem is …

Reconfiguration is the key to produce an applicable ternary optical computer (TOC). The
method to implement the reconfiguration function determines whether a TOC can step into …

We demonstrate a reconfigurable module of ternary optical computer; the modules are basic
consisted units of the ternary optical processor. The modules can be reconfigured to realized …

In this paper we present a generalized heapsort algorithm and its worst-case complexity
analysis. The weighted sum of the number of comparisons and movements has been …

Probabilistic analysis of algorithms for the Dutch national flag problem Page 1 Theoretical
Computer Science 341 (2005) 398 – 410 www.elsevier.com/locate/tcs Note Probabilistic …

Many new models of computing has evolved in the recent years such as quantum
computing, DNA computing, membrane computing, chemical computing etc. which seems to …

The divide and conquer approach is very useful in computer science applications. With this
approach a large problem is broken down into small and manageable subproblems and …

The divide and conquer approach is very useful in computer science applications. With this
approach a large problem is broken down into small and manageable subproblems and …