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.
Citations per year, relative to Paul Tarau Paul Tarau (= 1×)
peers
Thorsten Brants
Countries citing papers authored by Paul Tarau
Since
Specialization
Citations
This map shows the geographic impact of Paul Tarau'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 Paul Tarau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul Tarau more than expected).
This network shows the impact of papers produced by Paul Tarau. 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 Paul Tarau. The network helps show where Paul Tarau may publish in the future.
Co-authorship network of co-authors of Paul Tarau
This figure shows the co-authorship network connecting the top 25 collaborators of Paul Tarau.
A scholar is included among the top collaborators of Paul Tarau 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 Paul Tarau. Paul Tarau is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Mihalcea, Rada & Paul Tarau. (2005). A Language Independent Algorithm for Single and Multiple Document Summarization. University of North Texas Digital Library (University of North Texas).129 indexed citations
8.
Mihalcea, Rada, et al.. (2005). PicNet: Augmenting Semantic Resources with Pictorial Representations. University of North Texas Digital Library (University of North Texas). 1–7.5 indexed citations
Dahl, Verónica, et al.. (1999). A Spanish Interface To LogiMoo: Towards Multilingual Virtual Worlds.. Informatica (slovenia). 23.
11.
Dahl, Verónica, et al.. (1999). A Framework for Virtual Learning Environments. EdMedia: World Conference on Educational Media and Technology. 1999(1). 1538–1539.1 indexed citations
12.
Tarau, Paul & Verónica Dahl. (1998). Code Migration with First Order Continuations.. 215–226.
13.
Tarau, Paul, et al.. (1997). Remote Execution, Mobile Code and Agents in BinProlog. Ghent University Academic Bibliography (Ghent University).
14.
Tarau, Paul & Koen De Bosschere. (1996). Virtual World Brokerage with BinProlog and Netscape. Ghent University Academic Bibliography (Ghent University).8 indexed citations
15.
Bosschere, Koen De, et al.. (1996). LogiMOO: Prolog Technology for Virtual Worlds. Ghent University Academic Bibliography (Ghent University).6 indexed citations
16.
Tarau, Paul, et al.. (1995). BinProlog 4.00 User Guide.1 indexed citations
17.
Tarau, Paul. (1994). Low-level issues in implementing a high-performance continuation passing Binary Prolog engine.. 287.3 indexed citations
18.
Tarau, Paul & Verónica Dahl. (1994). Logic Programming and Logic Grammars with Binarization and First-order Continuations.
19.
Tarau, Paul & Koenraad De Bosschere. (1993). Non-Associative Blackboard Programming.. International Conference on Lightning Protection.1 indexed citations
20.
Bosschere, Koen De & Paul Tarau. (1993). Blackboard-based extensions for parallel programming in BinProlog. International Conference on Logic Programming. 664.
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.