Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

We discuss a mechanized correctness proof in KeY of Counting sort and Radix sort. Counting sort is an unusual sorting algorithm… Expand

Is this relevant?

2015

2015

In order to reduce the complexity of hard-output K-best decoding algorithm in multiple-input multiple-output (MIMO) systems and… Expand

Is this relevant?

2013

2013

This paper investigates two sorting algorithms: counting sort and a variation, occurrence sort, which also removes duplicate… Expand

Is this relevant?

2011

2011

We present a fast radix sorting algorithm that builds upon a microarchitecture-aware variant of counting sort. Taking advantage… Expand

Is this relevant?

2009

2009

Counting sort is a simple, stable and efficient sort algorithm with linear running time, which is a fundamental building block… Expand

Is this relevant?

2005

2005

In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process… Expand

Is this relevant?

2004

2004

Let D be a totally ordered set. Call an n -block, a Cartesian product of n closed and possibly empty intervals of D. Let sort be… Expand

Is this relevant?

2004

2001

2001

Abstract In this article, performance limitations of the particle advance in a particle-in-cell (PIC) simulation are discussed… Expand

Is this relevant?

1985

1985

The paper deals with representations of the safe states set in the Banker's problem. Using a Petri Net model we derive formulas… Expand

Is this relevant?