Search
for Topics
All Reviews
Browse All Reviews
>
Data (E)
>
Files (E.5)
> Sorting/Searching (E.5...)
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
110 of 30 Reviews about "
Sorting/Searching (E.5...)
":
Date Reviewed
BlockQuicksort: avoiding branch mispredictions in Quicksort
Edelkamp S., Weiß A. Journal of Experimental Algorithmics 24(1): 122, 2019. Type: Article
Quite often algorithms with bad worstcase complexity perform better on the average. Quicksort falls into this class. However, one of the drawbacks of Quicksort is that it is vulnerable to branch mispredictions, that is, branch misses. Modern proc...
Apr 1 2022
Community search over big graphs
Huang X., Lakshmanan L., Xu J., Morgan&Claypool Publishers, San Rafael, CA, 2019. 208 pp. Type: Book (9781681735955)
Community structures exist normally in numerous realworld networks. Social, biological, and communication networks are some examples of community structures. In the first chapter of the book, the authors discuss some applications for community se...
Dec 19 2019
Centrality and diversity in search: roles in A.I., machine learning, social networks, and pattern recognition
Murty M., Biswas A., Springer International Publishing, New York, NY, 2019. 94 pp. Type: Book (9783030247126)
This book is part of the “SpringerBriefs in Intelligent Systems” series, which covers diverse areas of intelligent systems, including artificial intelligence (AI), multiagent systems, and cognitive robotics. From their web profiles I g...
Dec 10 2019
Finding frequent items over sliding windows with constant update time
Hung R., Lee L., Ting H. Information Processing Letters 110(7): 257260, 2010. Type: Article
The authors present an algorithm for estimating the frequent items that occur in a sliding window of a data stream. If the window size is
N
data stream symbols,
is a userdefined threshold, and
is a relative error b...
Mar 17 2011
Constant time parallel sorting: an empirical view
Gasarch W., Golub E., Kruskal C. Journal of Computer and System Sciences 67(1): 6391, 2003. Type: Article
It is well known that sorting a list of
n
elements is possible with
O(n
log n)
comparisons. If we have several processors working in parallel, then we can sort
n
elements even faster. ...
Nov 21 2003
Incremental computation of nested relational query expressions
Baekgaard L., Mark L. ACM Transactions on Database Systems 20(2): 111148, 1995. Type: Article
This extensive paper addresses the computation of nested relational queries that may contain subqueries as operands of set relations, such as
in
and
contains.
The authors’ solution consists of two steps: transform the query to ...
Jul 1 1996
Data structures and algorithm analysis (2nd ed.)
Weiss M., BenjaminCummings Publ. Co., Inc., Redwood City, CA, 1995.Type: Book (9780805390575)
Weiss has revised his fine book about data structures and algorithm analysis [1]. It is a textbook for an advanced undergraduate class in data structures or a beginning class in algorithm analysis that is conceptual and grounded in theory. This ed...
Jan 1 1996
Approximating shortest superstrings with constraints
Jiang T., Li M. (ed) Theoretical Computer Science 134(2): 473491, 1994. Type: Article
The general problem of finding the shortest superstring to a given number of strings (that is, the shortest string such that all given strings appear as substrings) is NPcomplete. The authors, with Blum, Tromp, and Yannakakis [1], have shown that...
Nov 1 1995
Data structures and algorithm analysis in C++
Weiss M., BenjaminCummings Publ. Co., Inc., Redwood City, CA, 1994.Type: Book (9780805354430)
The purpose of this textbook is threefold. First, a number of data structures are presented, ranging from the simplest ones, such as lists and stacks, to more modern and efficient ones such as Fibonacci heaps, skew heaps, binomial queues, skip lis...
May 1 1995
A survey of adaptive sorting algorithms
EstivillCastro V., Wood D. ACM Computing Surveys 24(4): 441476, 1992. Type: Article
A complete and clear survey of the theory of adaptive sorting algorithms is provided. In the first part, the basic notions and concepts of adaptive sorting are introduced: if the input sequence to be sorted is already partially sorted, then a good...
Oct 1 1994
Display
5
10
15
25
50
100
per page
Reproduction in whole or in part without permission is prohibited. Copyright © 20002022 ThinkLoud, Inc.
Terms of Use

Privacy Policy