Open Access
Introduction to Algorithms
About:
The article was published on 2005-01-01 and is currently open access. It has received 19250 citations till now. The article focuses on the topics: Internal sort.read more
Citations
More filters
Proceedings ArticleDOI
Property-aware program sampling
TL;DR: The sampling technique uses program slicing to reduce the scope of instrumentation and slice fragments to decompose large program slices into more manageable, logically related parts for instrumentation, thereby improving the scalability of monitoring and profiling techniques.
Proceedings ArticleDOI
Assigning and scheduling partially overlapping channels in wireless mesh networks
TL;DR: Numerical experiments show that one can gain up to 25% of throughput by appropriately managing overlapping channels and this study investigates how to design a channel assignment and a scheduling algorithm, which both exploit partially overlapping channels in order to maximize the throughput.
Journal ArticleDOI
An algorithmic toolbox for periodic partial words
TL;DR: This work presents efficient solutions to several basic algorithmic problems regarding periodicity of partial words by identifying a way to construct a periodic partial word by substituting the letters on some positions of a full word w with holes in optimal time O ( | w | ) .
Journal ArticleDOI
FPGA realization of high performance large size computational functions: multipliers and applications
TL;DR: Two algorithms, delay table and dynamic programming addition optimizations, are used to efficiently organize the addition of partial products to realize large size signed multipliers based on the use of small-size embedded blocks in FPGAs.
Proceedings ArticleDOI
Analysis of algorithms for shortest path problem in parallel
Bogdan Popa,Dan Popescu +1 more
TL;DR: An innovative and efficient approach of Dijkstra's algorithm, Bellman Ford algorithm, Floyd-Warshall algorithm and Viterbi algorithm through parallel programming and analysis of the results obtained in different tests but also a comparison of those searching strategies on graph systems are offered.