Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
The Art of Computer Programming, Vol. 3: Sorting and Searching
This map shows the geographic impact of Jack Minker's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jack Minker with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jack Minker more than expected).
This network shows the impact of papers produced by Jack Minker. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jack Minker. The network helps show where Jack Minker may publish in the future.
Co-authorship network of co-authors of Jack Minker
This figure shows the co-authorship network connecting the top 25 collaborators of Jack Minker.
A scholar is included among the top collaborators of Jack Minker based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Jack Minker. Jack Minker is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Gaasterland, Terry, et al.. (2007). Cooperative Answers in Database Systems. NASA Technical Reports Server (NASA).
Minker, Jack, et al.. (1991). Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases.. International Conference on Lightning Protection. 660–675.18 indexed citations
6.
Minker, Jack, et al.. (1990). Producing cooperative answers in deductive data bases. Ellis Horwood eBooks. 223–254.2 indexed citations
7.
Lobo, Jorge, Jack Minker, & Arcot Rajasekar. (1989). Extending the Semantics of Logic Programs to Disjunctive Logic Programs.. International Conference on Lightning Protection. 255–267.7 indexed citations
8.
Minker, Jack. (1987). Foundations of deductive databases and logic. Morgan Kaufmann Publishers Inc. eBooks.5 indexed citations
9.
Minker, Jack. (1987). Deductive databases: an overview of some alternative theories. 15(3). 148–158.2 indexed citations
10.
Grant, John & Jack Minker. (1986). Answering Queries in Indefinite Databases and the Null Value Problem.. 3. 247–267.40 indexed citations
11.
Chakravarthy, Upen S. & Jack Minker. (1986). Multiple Query Processing in Deductive Databases using Query Graphs. Very Large Data Bases. 384–391.53 indexed citations
12.
Minker, Jack, et al.. (1985). A Natural Language Database Interface That Provides Cooperative Answers.. 352–357.14 indexed citations
13.
Kasif, Simon & Jack Minker. (1985). The intelligent channel: a scheme for result sharing in logic programs. International Joint Conference on Artificial Intelligence. 29–31.1 indexed citations
14.
Minker, Jack, et al.. (1983). Intelligent control using integrity constraints. National Conference on Artificial Intelligence. 202–205.4 indexed citations
15.
Kasif, Simon, et al.. (1982). Logic Programming: A Parallel Approach.. International Conference on Lightning Protection. 71–77.5 indexed citations
16.
Chakravarthy, Upen S., et al.. (1982). Interfacing Predicate Logic Languages and Relational Databases.. International Conference on Lightning Protection. 91–98.20 indexed citations
17.
Chakravarthy, Upen S., et al.. (1982). Logic Programming on ZMOB: A Highly Parallel Machine.. Proceedings of the International Conference on Parallel Processing. 347–349.3 indexed citations
18.
Chakravarthy, Upen S. & Jack Minker. (1982). Processing Multiple Queries in Database Systems.. IEEE Data(base) Engineering Bulletin. 5. 38–43.19 indexed citations
19.
Minker, Jack, et al.. (1973). The Q* algorithm: a search strategy for a deductive question-answering system. International Joint Conference on Artificial Intelligence. 31–40.3 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.