Skip to search formSkip to main contentSkip to account menu

In-place algorithm

Known as: Sort in-place, Inplace, In-place sorting 
In computer science, an in-place algorithm is an algorithm which transforms input using no auxiliary data structure. However a small amount of extra… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Versioning file systems are widely used in modern computer systems as they provide system recovery and old data access functions… 
2010
2010
Ethernet does not scale well to large networks. The flat MAC address space, whilst having obvious benefits for the user and… 
2010
2010
Recently PRAM (Phase-change RAM) is emerging as a promising next generation non-volatile memory device, because it supports fast… 
2009
2009
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially… 
Highly Cited
2009
Highly Cited
2009
The design of a highly configurable continuous flow mixed-radix (CFMR) Fast Fourier Transform (FFT) processor is presented. It… 
Highly Cited
2003
Highly Cited
2003
Recent research has shown that coarse graded Superpave mixes can be excessively permeable to water at air void levels around 6… 
2001
2001
The authors present the proof of robustness of the newly developed Failure Detection and Identification (FDI) and Adaptive… 
1999
1999
We present an area-efficient parallel architecture that implements the constant-geometry, in-place Fast Fourier transform. It… 
1994
1994
Presents a modification of Temperton's (1991) self-sorting, in-place radix-p FFT algorithm. This modification reduces the… 
1988
1988
The burrowing behavior ofStylodrilus heringianus (Lumbriculidae, Oligochaeta) was examined in bioassays, using sediments from…